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.r464-smll-171620117700043.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 ASLink-PT-03a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620117700043
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 11 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 357K May 18 16:42 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 ASLink-PT-03a-LTLCardinality-00
FORMULA_NAME ASLink-PT-03a-LTLCardinality-01
FORMULA_NAME ASLink-PT-03a-LTLCardinality-02
FORMULA_NAME ASLink-PT-03a-LTLCardinality-03
FORMULA_NAME ASLink-PT-03a-LTLCardinality-04
FORMULA_NAME ASLink-PT-03a-LTLCardinality-05
FORMULA_NAME ASLink-PT-03a-LTLCardinality-06
FORMULA_NAME ASLink-PT-03a-LTLCardinality-07
FORMULA_NAME ASLink-PT-03a-LTLCardinality-08
FORMULA_NAME ASLink-PT-03a-LTLCardinality-09
FORMULA_NAME ASLink-PT-03a-LTLCardinality-10
FORMULA_NAME ASLink-PT-03a-LTLCardinality-11
FORMULA_NAME ASLink-PT-03a-LTLCardinality-12
FORMULA_NAME ASLink-PT-03a-LTLCardinality-13
FORMULA_NAME ASLink-PT-03a-LTLCardinality-14
FORMULA_NAME ASLink-PT-03a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717188389468

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-03a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:46:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 20:46:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:46:32] [INFO ] Load time of PNML (sax parser for PT used): 350 ms
[2024-05-31 20:46:32] [INFO ] Transformed 821 places.
[2024-05-31 20:46:32] [INFO ] Transformed 1281 transitions.
[2024-05-31 20:46:32] [INFO ] Found NUPN structural information;
[2024-05-31 20:46:32] [INFO ] Parsed PT model containing 821 places and 1281 transitions and 4839 arcs in 626 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 13 transitions
Reduce redundant transitions removed 13 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA ASLink-PT-03a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03a-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 821 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 821/821 places, 1268/1268 transitions.
Ensure Unique test removed 12 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 803 transition count 1268
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 795 transition count 1237
Ensure Unique test removed 1 places
Iterating global reduction 1 with 9 rules applied. Total rules applied 35 place count 794 transition count 1237
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 37 place count 794 transition count 1235
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 793 transition count 1227
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 793 transition count 1227
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 792 transition count 1219
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 792 transition count 1219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 791 transition count 1211
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 791 transition count 1211
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 790 transition count 1203
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 790 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 789 transition count 1195
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 789 transition count 1195
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 788 transition count 1187
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 788 transition count 1187
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 787 transition count 1179
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 787 transition count 1179
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 786 transition count 1171
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 786 transition count 1171
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 785 transition count 1163
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 785 transition count 1163
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 784 transition count 1155
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 784 transition count 1155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 783 transition count 1147
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 783 transition count 1147
Applied a total of 59 rules in 879 ms. Remains 783 /821 variables (removed 38) and now considering 1147/1268 (removed 121) transitions.
// Phase 1: matrix 1147 rows 783 cols
[2024-05-31 20:46:33] [INFO ] Computed 137 invariants in 83 ms
[2024-05-31 20:46:35] [INFO ] Implicit Places using invariants in 1789 ms returned [1, 20, 21, 23, 33, 51, 69, 198, 214, 219, 220, 221, 239, 257, 386, 402, 407, 408, 409, 427, 445, 574, 579, 591, 596, 597, 598, 621, 626, 644, 645, 646, 647, 664, 672, 680, 686, 692, 698, 704, 712, 718, 724, 732]
Discarding 44 places :
Implicit Place search using SMT only with invariants took 1845 ms to find 44 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 739/821 places, 1147/1268 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 726 transition count 1134
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 726 transition count 1134
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 716 transition count 1124
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 716 transition count 1124
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 711 transition count 1119
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 711 transition count 1119
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 709 transition count 1117
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 709 transition count 1117
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 707 transition count 1115
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 707 transition count 1115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 706 transition count 1114
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 706 transition count 1114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 705 transition count 1113
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 705 transition count 1113
Applied a total of 68 rules in 240 ms. Remains 705 /739 variables (removed 34) and now considering 1113/1147 (removed 34) transitions.
// Phase 1: matrix 1113 rows 705 cols
[2024-05-31 20:46:36] [INFO ] Computed 93 invariants in 42 ms
[2024-05-31 20:46:36] [INFO ] Implicit Places using invariants in 967 ms returned []
[2024-05-31 20:46:36] [INFO ] Invariant cache hit.
[2024-05-31 20:46:40] [INFO ] Implicit Places using invariants and state equation in 3286 ms returned []
Implicit Place search using SMT with State Equation took 4257 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 705/821 places, 1113/1268 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7270 ms. Remains : 705/821 places, 1113/1268 transitions.
Support contains 21 out of 705 places after structural reductions.
[2024-05-31 20:46:40] [INFO ] Flatten gal took : 267 ms
[2024-05-31 20:46:41] [INFO ] Flatten gal took : 165 ms
[2024-05-31 20:46:41] [INFO ] Input system was already deterministic with 1113 transitions.
Support contains 19 out of 705 places (down from 21) after GAL structural reductions.
RANDOM walk for 40000 steps (335 resets) in 2322 ms. (17 steps per ms) remains 6/12 properties
BEST_FIRST walk for 40004 steps (64 resets) in 410 ms. (97 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (84 resets) in 150 ms. (264 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (68 resets) in 184 ms. (216 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (74 resets) in 141 ms. (281 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (71 resets) in 170 ms. (233 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (76 resets) in 145 ms. (273 steps per ms) remains 4/5 properties
[2024-05-31 20:46:42] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 139/146 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 212/358 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 347/705 variables, 70/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/705 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1113/1818 variables, 705/798 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1818 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/1818 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1818/1818 variables, and 798 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1641 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 70/70 constraints, State Equation: 705/705 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 139/146 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 212/358 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 347/705 variables, 70/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/705 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1113/1818 variables, 705/798 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1818 variables, 4/802 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1818 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1818 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1818/1818 variables, and 802 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4873 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 70/70 constraints, State Equation: 705/705 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 6562ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 2765 ms.
Support contains 5 out of 705 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 705/705 places, 1113/1113 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 705 transition count 982
Reduce places removed 131 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 132 rules applied. Total rules applied 263 place count 574 transition count 981
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 264 place count 573 transition count 981
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 89 Pre rules applied. Total rules applied 264 place count 573 transition count 892
Deduced a syphon composed of 89 places in 1 ms
Ensure Unique test removed 28 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 206 rules applied. Total rules applied 470 place count 456 transition count 892
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 16 rules applied. Total rules applied 486 place count 449 transition count 883
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 495 place count 440 transition count 883
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 495 place count 440 transition count 872
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 517 place count 429 transition count 872
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 522 place count 424 transition count 860
Iterating global reduction 5 with 5 rules applied. Total rules applied 527 place count 424 transition count 860
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 531 place count 424 transition count 856
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 532 place count 423 transition count 856
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 533 place count 422 transition count 848
Iterating global reduction 7 with 1 rules applied. Total rules applied 534 place count 422 transition count 848
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 535 place count 421 transition count 840
Iterating global reduction 7 with 1 rules applied. Total rules applied 536 place count 421 transition count 840
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 537 place count 420 transition count 832
Iterating global reduction 7 with 1 rules applied. Total rules applied 538 place count 420 transition count 832
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 539 place count 419 transition count 824
Iterating global reduction 7 with 1 rules applied. Total rules applied 540 place count 419 transition count 824
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 7 with 87 rules applied. Total rules applied 627 place count 375 transition count 781
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 628 place count 374 transition count 780
Iterating global reduction 7 with 1 rules applied. Total rules applied 629 place count 374 transition count 780
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 629 place count 374 transition count 779
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 631 place count 373 transition count 779
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 634 place count 373 transition count 776
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 637 place count 370 transition count 776
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 8 with 12 rules applied. Total rules applied 649 place count 370 transition count 764
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 662 place count 357 transition count 764
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 665 place count 357 transition count 761
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 674 place count 357 transition count 761
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 675 place count 356 transition count 760
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 678 place count 353 transition count 760
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 6 Pre rules applied. Total rules applied 678 place count 353 transition count 754
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 10 with 15 rules applied. Total rules applied 693 place count 344 transition count 754
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 696 place count 341 transition count 751
Iterating global reduction 10 with 3 rules applied. Total rules applied 699 place count 341 transition count 751
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 702 place count 341 transition count 748
Applied a total of 702 rules in 439 ms. Remains 341 /705 variables (removed 364) and now considering 748/1113 (removed 365) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 439 ms. Remains : 341/705 places, 748/1113 transitions.
RANDOM walk for 40000 steps (834 resets) in 256 ms. (155 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (234 resets) in 121 ms. (327 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (231 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (229 resets) in 98 ms. (404 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 1782 steps, run visited all 3 properties in 63 ms. (steps per millisecond=28 )
Probabilistic random walk after 1782 steps, saw 1354 distinct states, run finished after 69 ms. (steps per millisecond=25 ) properties seen :3
FORMULA ASLink-PT-03a-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 705 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 705/705 places, 1113/1113 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 703 transition count 1104
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 703 transition count 1104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 702 transition count 1096
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 702 transition count 1096
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 701 transition count 1088
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 701 transition count 1088
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 700 transition count 1080
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 700 transition count 1080
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 699 transition count 1072
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 699 transition count 1072
Applied a total of 12 rules in 128 ms. Remains 699 /705 variables (removed 6) and now considering 1072/1113 (removed 41) transitions.
// Phase 1: matrix 1072 rows 699 cols
[2024-05-31 20:46:52] [INFO ] Computed 93 invariants in 23 ms
[2024-05-31 20:46:53] [INFO ] Implicit Places using invariants in 789 ms returned [590]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 792 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 698/705 places, 1072/1113 transitions.
Applied a total of 0 rules in 14 ms. Remains 698 /698 variables (removed 0) and now considering 1072/1072 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 935 ms. Remains : 698/705 places, 1072/1113 transitions.
Stuttering acceptance computed with spot in 380 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-03a-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 2544 steps with 22 reset in 35 ms.
FORMULA ASLink-PT-03a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-03a-LTLCardinality-01 finished in 1448 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 705 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 705/705 places, 1113/1113 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 134 transitions
Trivial Post-agglo rules discarded 134 transitions
Performed 134 trivial Post agglomeration. Transition count delta: 134
Iterating post reduction 0 with 134 rules applied. Total rules applied 134 place count 704 transition count 978
Reduce places removed 137 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 140 rules applied. Total rules applied 274 place count 567 transition count 975
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 277 place count 564 transition count 975
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 277 place count 564 transition count 879
Deduced a syphon composed of 96 places in 1 ms
Ensure Unique test removed 29 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 3 with 221 rules applied. Total rules applied 498 place count 439 transition count 879
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 3 with 26 rules applied. Total rules applied 524 place count 428 transition count 864
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 539 place count 413 transition count 864
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 539 place count 413 transition count 851
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 565 place count 400 transition count 851
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 572 place count 393 transition count 844
Iterating global reduction 5 with 7 rules applied. Total rules applied 579 place count 393 transition count 844
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 7 rules applied. Total rules applied 586 place count 393 transition count 837
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 587 place count 392 transition count 837
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 7 with 79 rules applied. Total rules applied 666 place count 352 transition count 798
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 667 place count 351 transition count 797
Iterating global reduction 7 with 1 rules applied. Total rules applied 668 place count 351 transition count 797
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 668 place count 351 transition count 796
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 670 place count 350 transition count 796
Applied a total of 670 rules in 105 ms. Remains 350 /705 variables (removed 355) and now considering 796/1113 (removed 317) transitions.
// Phase 1: matrix 796 rows 350 cols
[2024-05-31 20:46:54] [INFO ] Computed 49 invariants in 7 ms
[2024-05-31 20:46:54] [INFO ] Implicit Places using invariants in 423 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 249, 266, 272, 277, 279, 347]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 426 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 335/705 places, 796/1113 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 335 transition count 795
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 334 transition count 795
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 8 place count 328 transition count 789
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 328 transition count 789
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 20 place count 322 transition count 783
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 322 transition count 783
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 29 place count 319 transition count 780
Iterating global reduction 2 with 3 rules applied. Total rules applied 32 place count 319 transition count 780
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 44 place count 313 transition count 774
Applied a total of 44 rules in 70 ms. Remains 313 /335 variables (removed 22) and now considering 774/796 (removed 22) transitions.
// Phase 1: matrix 774 rows 313 cols
[2024-05-31 20:46:54] [INFO ] Computed 34 invariants in 10 ms
[2024-05-31 20:46:55] [INFO ] Implicit Places using invariants in 456 ms returned []
[2024-05-31 20:46:55] [INFO ] Invariant cache hit.
[2024-05-31 20:46:56] [INFO ] Implicit Places using invariants and state equation in 1316 ms returned []
Implicit Place search using SMT with State Equation took 1778 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 313/705 places, 774/1113 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2379 ms. Remains : 313/705 places, 774/1113 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-03a-LTLCardinality-04
Product exploration explored 100000 steps with 1793 reset in 622 ms.
Stack based approach found an accepted trace after 10228 steps with 175 reset with depth 29 and stack size 29 in 56 ms.
FORMULA ASLink-PT-03a-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ASLink-PT-03a-LTLCardinality-04 finished in 3177 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' '!(G(F(p0)))'
Support contains 1 out of 705 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 705/705 places, 1113/1113 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 133 place count 704 transition count 979
Reduce places removed 136 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 139 rules applied. Total rules applied 272 place count 568 transition count 976
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 275 place count 565 transition count 976
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 275 place count 565 transition count 880
Deduced a syphon composed of 96 places in 1 ms
Ensure Unique test removed 29 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 3 with 221 rules applied. Total rules applied 496 place count 440 transition count 880
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 3 with 26 rules applied. Total rules applied 522 place count 429 transition count 865
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 537 place count 414 transition count 865
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 537 place count 414 transition count 852
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 563 place count 401 transition count 852
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 571 place count 393 transition count 837
Iterating global reduction 5 with 8 rules applied. Total rules applied 579 place count 393 transition count 837
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 7 rules applied. Total rules applied 586 place count 393 transition count 830
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 587 place count 392 transition count 830
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 588 place count 391 transition count 822
Iterating global reduction 7 with 1 rules applied. Total rules applied 589 place count 391 transition count 822
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 590 place count 390 transition count 814
Iterating global reduction 7 with 1 rules applied. Total rules applied 591 place count 390 transition count 814
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 592 place count 389 transition count 806
Iterating global reduction 7 with 1 rules applied. Total rules applied 593 place count 389 transition count 806
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 594 place count 388 transition count 798
Iterating global reduction 7 with 1 rules applied. Total rules applied 595 place count 388 transition count 798
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 7 with 77 rules applied. Total rules applied 672 place count 349 transition count 760
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 673 place count 348 transition count 759
Iterating global reduction 7 with 1 rules applied. Total rules applied 674 place count 348 transition count 759
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 674 place count 348 transition count 758
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 676 place count 347 transition count 758
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 677 place count 347 transition count 758
Applied a total of 677 rules in 215 ms. Remains 347 /705 variables (removed 358) and now considering 758/1113 (removed 355) transitions.
// Phase 1: matrix 758 rows 347 cols
[2024-05-31 20:46:57] [INFO ] Computed 49 invariants in 11 ms
[2024-05-31 20:46:58] [INFO ] Implicit Places using invariants in 578 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 249, 267, 273, 278, 280, 344]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 587 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 332/705 places, 758/1113 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 332 transition count 757
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 331 transition count 757
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 8 place count 325 transition count 751
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 325 transition count 751
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 20 place count 319 transition count 745
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 319 transition count 745
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 29 place count 316 transition count 742
Iterating global reduction 2 with 3 rules applied. Total rules applied 32 place count 316 transition count 742
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 44 place count 310 transition count 736
Applied a total of 44 rules in 78 ms. Remains 310 /332 variables (removed 22) and now considering 736/758 (removed 22) transitions.
// Phase 1: matrix 736 rows 310 cols
[2024-05-31 20:46:58] [INFO ] Computed 34 invariants in 17 ms
[2024-05-31 20:46:58] [INFO ] Implicit Places using invariants in 600 ms returned []
[2024-05-31 20:46:58] [INFO ] Invariant cache hit.
[2024-05-31 20:46:59] [INFO ] Implicit Places using invariants and state equation in 1050 ms returned []
Implicit Place search using SMT with State Equation took 1656 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 310/705 places, 736/1113 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2537 ms. Remains : 310/705 places, 736/1113 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-03a-LTLCardinality-05
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-03a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-03a-LTLCardinality-05 finished in 2702 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' '!((G(p0) U p1))'
Support contains 3 out of 705 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 705/705 places, 1113/1113 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 704 transition count 981
Reduce places removed 134 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 137 rules applied. Total rules applied 268 place count 570 transition count 978
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 272 place count 567 transition count 977
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 273 place count 566 transition count 977
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 95 Pre rules applied. Total rules applied 273 place count 566 transition count 882
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 28 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 4 with 218 rules applied. Total rules applied 491 place count 443 transition count 882
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 4 with 26 rules applied. Total rules applied 517 place count 432 transition count 867
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 532 place count 417 transition count 867
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 532 place count 417 transition count 855
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 556 place count 405 transition count 855
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 564 place count 397 transition count 840
Iterating global reduction 6 with 8 rules applied. Total rules applied 572 place count 397 transition count 840
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 7 rules applied. Total rules applied 579 place count 397 transition count 833
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 580 place count 396 transition count 833
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 581 place count 395 transition count 825
Iterating global reduction 8 with 1 rules applied. Total rules applied 582 place count 395 transition count 825
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 583 place count 394 transition count 817
Iterating global reduction 8 with 1 rules applied. Total rules applied 584 place count 394 transition count 817
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 585 place count 393 transition count 809
Iterating global reduction 8 with 1 rules applied. Total rules applied 586 place count 393 transition count 809
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 587 place count 392 transition count 801
Iterating global reduction 8 with 1 rules applied. Total rules applied 588 place count 392 transition count 801
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 8 with 79 rules applied. Total rules applied 667 place count 352 transition count 762
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 668 place count 351 transition count 761
Iterating global reduction 8 with 1 rules applied. Total rules applied 669 place count 351 transition count 761
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 669 place count 351 transition count 760
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 671 place count 350 transition count 760
Applied a total of 671 rules in 233 ms. Remains 350 /705 variables (removed 355) and now considering 760/1113 (removed 353) transitions.
// Phase 1: matrix 760 rows 350 cols
[2024-05-31 20:47:00] [INFO ] Computed 50 invariants in 12 ms
[2024-05-31 20:47:00] [INFO ] Implicit Places using invariants in 444 ms returned [72, 89, 95, 100, 159, 177, 183, 188, 190, 250, 267, 274, 282, 284, 347]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 448 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 335/705 places, 760/1113 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 335 transition count 759
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 334 transition count 759
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 7 place count 329 transition count 754
Iterating global reduction 2 with 5 rules applied. Total rules applied 12 place count 329 transition count 754
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 17 place count 324 transition count 749
Iterating global reduction 2 with 5 rules applied. Total rules applied 22 place count 324 transition count 749
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 25 place count 321 transition count 746
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 321 transition count 746
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 40 place count 315 transition count 740
Applied a total of 40 rules in 35 ms. Remains 315 /335 variables (removed 20) and now considering 740/760 (removed 20) transitions.
// Phase 1: matrix 740 rows 315 cols
[2024-05-31 20:47:00] [INFO ] Computed 35 invariants in 7 ms
[2024-05-31 20:47:01] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-31 20:47:01] [INFO ] Invariant cache hit.
[2024-05-31 20:47:02] [INFO ] Implicit Places using invariants and state equation in 1306 ms returned []
Implicit Place search using SMT with State Equation took 1647 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 315/705 places, 740/1113 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2364 ms. Remains : 315/705 places, 740/1113 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : ASLink-PT-03a-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1988 steps with 36 reset in 9 ms.
FORMULA ASLink-PT-03a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-03a-LTLCardinality-06 finished in 2538 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(F(p0)))))'
Support contains 2 out of 705 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 705/705 places, 1113/1113 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 703 transition count 1104
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 703 transition count 1104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 702 transition count 1096
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 702 transition count 1096
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 701 transition count 1088
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 701 transition count 1088
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 700 transition count 1080
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 700 transition count 1080
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 699 transition count 1072
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 699 transition count 1072
Applied a total of 12 rules in 130 ms. Remains 699 /705 variables (removed 6) and now considering 1072/1113 (removed 41) transitions.
// Phase 1: matrix 1072 rows 699 cols
[2024-05-31 20:47:02] [INFO ] Computed 93 invariants in 16 ms
[2024-05-31 20:47:03] [INFO ] Implicit Places using invariants in 995 ms returned [590]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 998 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 698/705 places, 1072/1113 transitions.
Applied a total of 0 rules in 21 ms. Remains 698 /698 variables (removed 0) and now considering 1072/1072 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1149 ms. Remains : 698/705 places, 1072/1113 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-03a-LTLCardinality-08
Stuttering criterion allowed to conclude after 200 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-03a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-03a-LTLCardinality-08 finished in 1370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F(p1))))'
Support contains 3 out of 705 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 705/705 places, 1113/1113 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 703 transition count 1104
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 703 transition count 1104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 702 transition count 1096
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 702 transition count 1096
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 701 transition count 1088
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 701 transition count 1088
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 700 transition count 1080
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 700 transition count 1080
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 699 transition count 1072
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 699 transition count 1072
Applied a total of 12 rules in 126 ms. Remains 699 /705 variables (removed 6) and now considering 1072/1113 (removed 41) transitions.
[2024-05-31 20:47:04] [INFO ] Invariant cache hit.
[2024-05-31 20:47:05] [INFO ] Implicit Places using invariants in 987 ms returned []
[2024-05-31 20:47:05] [INFO ] Invariant cache hit.
[2024-05-31 20:47:08] [INFO ] Implicit Places using invariants and state equation in 3115 ms returned []
Implicit Place search using SMT with State Equation took 4117 ms to find 0 implicit places.
Running 1071 sub problems to find dead transitions.
[2024-05-31 20:47:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/698 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1071 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 0.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 16.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 6.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 16.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 7.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 5.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 2.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 3.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 2.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 0.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 16.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 11.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 7.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 6.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 10.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 2.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 2.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 3.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 16.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 9.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 11.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 7.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 698/1771 variables, and 65 constraints, problems are : Problem set: 0 solved, 1071 unsolved in 30119 ms.
Refiners :[Positive P Invariants (semi-flows): 0/24 constraints, Generalized P Invariants (flows): 65/69 constraints, State Equation: 0/699 constraints, PredecessorRefiner: 1071/1071 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1071 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/698 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1071 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/698 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1071 unsolved
At refinement iteration 2 (OVERLAPS) 1/699 variables, 24/89 constraints. Problems are: Problem set: 0 solved, 1071 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/699 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 1071 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 699/1771 variables, and 93 constraints, problems are : Problem set: 0 solved, 1071 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 69/69 constraints, State Equation: 0/699 constraints, PredecessorRefiner: 0/1071 constraints, Known Traps: 0/0 constraints]
After SMT, in 61215ms problems are : Problem set: 0 solved, 1071 unsolved
Search for dead transitions found 0 dead transitions in 61274ms
Starting structural reductions in LTL mode, iteration 1 : 699/705 places, 1072/1113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65533 ms. Remains : 699/705 places, 1072/1113 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-03a-LTLCardinality-09
Stuttering criterion allowed to conclude after 141 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-03a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-03a-LTLCardinality-09 finished in 65753 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(p1)||p0))))'
Support contains 4 out of 705 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 705/705 places, 1113/1113 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 132 place count 704 transition count 980
Reduce places removed 134 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 136 rules applied. Total rules applied 268 place count 570 transition count 978
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 270 place count 568 transition count 978
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 93 Pre rules applied. Total rules applied 270 place count 568 transition count 885
Deduced a syphon composed of 93 places in 1 ms
Ensure Unique test removed 28 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 214 rules applied. Total rules applied 484 place count 447 transition count 885
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 3 with 21 rules applied. Total rules applied 505 place count 437 transition count 874
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 12 rules applied. Total rules applied 517 place count 426 transition count 873
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 518 place count 425 transition count 873
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 518 place count 425 transition count 861
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 542 place count 413 transition count 861
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 548 place count 407 transition count 848
Iterating global reduction 6 with 6 rules applied. Total rules applied 554 place count 407 transition count 848
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 5 rules applied. Total rules applied 559 place count 407 transition count 843
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 560 place count 406 transition count 843
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 561 place count 405 transition count 835
Iterating global reduction 8 with 1 rules applied. Total rules applied 562 place count 405 transition count 835
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 563 place count 404 transition count 827
Iterating global reduction 8 with 1 rules applied. Total rules applied 564 place count 404 transition count 827
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 565 place count 403 transition count 819
Iterating global reduction 8 with 1 rules applied. Total rules applied 566 place count 403 transition count 819
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 567 place count 402 transition count 811
Iterating global reduction 8 with 1 rules applied. Total rules applied 568 place count 402 transition count 811
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 8 with 83 rules applied. Total rules applied 651 place count 360 transition count 770
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 652 place count 359 transition count 769
Iterating global reduction 8 with 1 rules applied. Total rules applied 653 place count 359 transition count 769
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 653 place count 359 transition count 768
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 655 place count 358 transition count 768
Applied a total of 655 rules in 161 ms. Remains 358 /705 variables (removed 347) and now considering 768/1113 (removed 345) transitions.
// Phase 1: matrix 768 rows 358 cols
[2024-05-31 20:48:09] [INFO ] Computed 52 invariants in 11 ms
[2024-05-31 20:48:10] [INFO ] Implicit Places using invariants in 766 ms returned [72, 89, 95, 100, 159, 176, 182, 190, 192, 270, 276, 281, 355]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 777 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 345/705 places, 768/1113 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 345 transition count 767
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 344 transition count 767
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 7 place count 339 transition count 762
Iterating global reduction 2 with 5 rules applied. Total rules applied 12 place count 339 transition count 762
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 17 place count 334 transition count 757
Iterating global reduction 2 with 5 rules applied. Total rules applied 22 place count 334 transition count 757
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 332 transition count 755
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 332 transition count 755
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 36 place count 327 transition count 750
Applied a total of 36 rules in 58 ms. Remains 327 /345 variables (removed 18) and now considering 750/768 (removed 18) transitions.
// Phase 1: matrix 750 rows 327 cols
[2024-05-31 20:48:10] [INFO ] Computed 39 invariants in 10 ms
[2024-05-31 20:48:11] [INFO ] Implicit Places using invariants in 551 ms returned []
[2024-05-31 20:48:11] [INFO ] Invariant cache hit.
[2024-05-31 20:48:12] [INFO ] Implicit Places using invariants and state equation in 1401 ms returned []
Implicit Place search using SMT with State Equation took 1954 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 327/705 places, 750/1113 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2957 ms. Remains : 327/705 places, 750/1113 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-03a-LTLCardinality-12
Product exploration explored 100000 steps with 1672 reset in 573 ms.
Product exploration explored 100000 steps with 1671 reset in 412 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 259 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (652 resets) in 552 ms. (72 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (163 resets) in 131 ms. (303 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (190 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
[2024-05-31 20:48:14] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/46 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 188/234 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 29/263 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 64/327 variables, 14/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 750/1077 variables, 327/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1077 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1077 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1077/1077 variables, and 366 constraints, problems are : Problem set: 0 solved, 2 unsolved in 542 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 327/327 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/46 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 188/234 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 29/263 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 64/327 variables, 14/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 750/1077 variables, 327/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1077/1077 variables, and 368 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2515 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 327/327 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 3068ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 327 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 327/327 places, 750/750 transitions.
Free-agglomeration rule applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 327 transition count 738
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 26 place count 315 transition count 736
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 35 place count 315 transition count 727
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 44 place count 306 transition count 727
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 306 transition count 726
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 306 transition count 726
Applied a total of 47 rules in 98 ms. Remains 306 /327 variables (removed 21) and now considering 726/750 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 306/327 places, 726/750 transitions.
RANDOM walk for 40000 steps (744 resets) in 406 ms. (98 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (244 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (216 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 13838 steps, run visited all 2 properties in 232 ms. (steps per millisecond=59 )
Probabilistic random walk after 13838 steps, saw 4399 distinct states, run finished after 232 ms. (steps per millisecond=59 ) properties seen :2
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 362 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 750/750 transitions.
Applied a total of 0 rules in 17 ms. Remains 327 /327 variables (removed 0) and now considering 750/750 (removed 0) transitions.
[2024-05-31 20:48:18] [INFO ] Invariant cache hit.
[2024-05-31 20:48:19] [INFO ] Implicit Places using invariants in 636 ms returned []
[2024-05-31 20:48:19] [INFO ] Invariant cache hit.
[2024-05-31 20:48:20] [INFO ] Implicit Places using invariants and state equation in 1274 ms returned []
Implicit Place search using SMT with State Equation took 1918 ms to find 0 implicit places.
[2024-05-31 20:48:20] [INFO ] Redundant transitions in 73 ms returned []
Running 728 sub problems to find dead transitions.
[2024-05-31 20:48:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/326 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/326 variables, 27/33 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 3 (OVERLAPS) 1/327 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 728 unsolved
[2024-05-31 20:48:49] [INFO ] Deduced a trap composed of 95 places in 394 ms of which 46 ms to minimize.
[2024-05-31 20:48:49] [INFO ] Deduced a trap composed of 79 places in 274 ms of which 4 ms to minimize.
[2024-05-31 20:48:50] [INFO ] Deduced a trap composed of 89 places in 472 ms of which 7 ms to minimize.
[2024-05-31 20:48:51] [INFO ] Deduced a trap composed of 88 places in 332 ms of which 4 ms to minimize.
SMT process timed out in 30726ms, After SMT, problems are : Problem set: 0 solved, 728 unsolved
Search for dead transitions found 0 dead transitions in 30739ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32759 ms. Remains : 327/327 places, 750/750 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 230 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (671 resets) in 235 ms. (169 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (169 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (188 resets) in 138 ms. (287 steps per ms) remains 2/2 properties
[2024-05-31 20:48:51] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/46 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 188/234 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 29/263 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 64/327 variables, 14/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 750/1077 variables, 327/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1077 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1077 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1077/1077 variables, and 366 constraints, problems are : Problem set: 0 solved, 2 unsolved in 653 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 327/327 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/46 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 188/234 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 29/263 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 64/327 variables, 14/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 750/1077 variables, 327/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1077/1077 variables, and 368 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1890 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 327/327 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2555ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 280 ms.
Support contains 4 out of 327 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 327/327 places, 750/750 transitions.
Free-agglomeration rule applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 327 transition count 738
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 26 place count 315 transition count 736
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 35 place count 315 transition count 727
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 44 place count 306 transition count 727
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 306 transition count 726
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 306 transition count 726
Applied a total of 47 rules in 50 ms. Remains 306 /327 variables (removed 21) and now considering 726/750 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 306/327 places, 726/750 transitions.
RANDOM walk for 40000 steps (742 resets) in 359 ms. (111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (256 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (222 resets) in 163 ms. (243 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 13838 steps, run visited all 2 properties in 229 ms. (steps per millisecond=60 )
Probabilistic random walk after 13838 steps, saw 4399 distinct states, run finished after 229 ms. (steps per millisecond=60 ) properties seen :2
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 379 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1615 reset in 197 ms.
Product exploration explored 100000 steps with 1652 reset in 221 ms.
Support contains 4 out of 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 750/750 transitions.
Applied a total of 0 rules in 10 ms. Remains 327 /327 variables (removed 0) and now considering 750/750 (removed 0) transitions.
[2024-05-31 20:48:56] [INFO ] Invariant cache hit.
[2024-05-31 20:48:57] [INFO ] Implicit Places using invariants in 657 ms returned []
[2024-05-31 20:48:57] [INFO ] Invariant cache hit.
[2024-05-31 20:48:58] [INFO ] Implicit Places using invariants and state equation in 1101 ms returned []
Implicit Place search using SMT with State Equation took 1766 ms to find 0 implicit places.
[2024-05-31 20:48:58] [INFO ] Redundant transitions in 205 ms returned []
Running 728 sub problems to find dead transitions.
[2024-05-31 20:48:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/326 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/326 variables, 27/33 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 3 (OVERLAPS) 1/327 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 728 unsolved
[2024-05-31 20:49:21] [INFO ] Deduced a trap composed of 95 places in 271 ms of which 5 ms to minimize.
[2024-05-31 20:49:21] [INFO ] Deduced a trap composed of 79 places in 263 ms of which 5 ms to minimize.
[2024-05-31 20:49:21] [INFO ] Deduced a trap composed of 89 places in 292 ms of which 4 ms to minimize.
[2024-05-31 20:49:22] [INFO ] Deduced a trap composed of 88 places in 285 ms of which 3 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 327/1077 variables, and 43 constraints, problems are : Problem set: 0 solved, 728 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/327 constraints, PredecessorRefiner: 728/728 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 728 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/326 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/326 variables, 27/33 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 3 (OVERLAPS) 1/327 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 728 unsolved
[2024-05-31 20:49:42] [INFO ] Deduced a trap composed of 81 places in 458 ms of which 6 ms to minimize.
[2024-05-31 20:49:43] [INFO ] Deduced a trap composed of 86 places in 475 ms of which 5 ms to minimize.
[2024-05-31 20:49:50] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 728 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 327/1077 variables, and 46 constraints, problems are : Problem set: 0 solved, 728 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/327 constraints, PredecessorRefiner: 0/728 constraints, Known Traps: 7/7 constraints]
After SMT, in 60704ms problems are : Problem set: 0 solved, 728 unsolved
Search for dead transitions found 0 dead transitions in 60719ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62711 ms. Remains : 327/327 places, 750/750 transitions.
Treatment of property ASLink-PT-03a-LTLCardinality-12 finished in 109792 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(G(p0))))'
Support contains 2 out of 705 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 705/705 places, 1113/1113 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 703 transition count 1104
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 703 transition count 1104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 702 transition count 1096
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 702 transition count 1096
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 701 transition count 1088
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 701 transition count 1088
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 700 transition count 1080
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 700 transition count 1080
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 699 transition count 1072
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 699 transition count 1072
Applied a total of 12 rules in 147 ms. Remains 699 /705 variables (removed 6) and now considering 1072/1113 (removed 41) transitions.
// Phase 1: matrix 1072 rows 699 cols
[2024-05-31 20:49:59] [INFO ] Computed 93 invariants in 20 ms
[2024-05-31 20:50:00] [INFO ] Implicit Places using invariants in 661 ms returned [590]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 664 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 698/705 places, 1072/1113 transitions.
Applied a total of 0 rules in 13 ms. Remains 698 /698 variables (removed 0) and now considering 1072/1072 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 826 ms. Remains : 698/705 places, 1072/1113 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-03a-LTLCardinality-13
Product exploration explored 100000 steps with 837 reset in 283 ms.
Product exploration explored 100000 steps with 892 reset in 366 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (358 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (81 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 333757 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :0 out of 1
Probabilistic random walk after 333757 steps, saw 118971 distinct states, run finished after 3006 ms. (steps per millisecond=111 ) properties seen :0
// Phase 1: matrix 1072 rows 698 cols
[2024-05-31 20:50:04] [INFO ] Computed 92 invariants in 13 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 316/351 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 347/698 variables, 68/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/698 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1072/1770 variables, 698/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1770 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1770 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1770/1770 variables, and 790 constraints, problems are : Problem set: 0 solved, 1 unsolved in 904 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 68/68 constraints, State Equation: 698/698 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 316/351 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 347/698 variables, 68/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:50:06] [INFO ] Deduced a trap composed of 107 places in 689 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/698 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/698 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1072/1770 variables, 698/791 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1770/1770 variables, and 792 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2745 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 68/68 constraints, State Equation: 698/698 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 3674ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 698 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 698/698 places, 1072/1072 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 698 transition count 941
Reduce places removed 131 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 132 rules applied. Total rules applied 263 place count 567 transition count 940
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 264 place count 566 transition count 940
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 264 place count 566 transition count 850
Deduced a syphon composed of 90 places in 1 ms
Ensure Unique test removed 29 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 209 rules applied. Total rules applied 473 place count 447 transition count 850
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 16 rules applied. Total rules applied 489 place count 440 transition count 841
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 498 place count 431 transition count 841
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 498 place count 431 transition count 829
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 522 place count 419 transition count 829
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 527 place count 414 transition count 824
Iterating global reduction 5 with 5 rules applied. Total rules applied 532 place count 414 transition count 824
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 536 place count 414 transition count 820
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 537 place count 413 transition count 820
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 537 place count 413 transition count 819
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 539 place count 412 transition count 819
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 7 with 84 rules applied. Total rules applied 623 place count 370 transition count 777
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 626 place count 370 transition count 774
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 629 place count 367 transition count 774
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 8 with 12 rules applied. Total rules applied 641 place count 367 transition count 762
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 654 place count 354 transition count 762
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 657 place count 354 transition count 759
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 666 place count 354 transition count 759
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 667 place count 353 transition count 758
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 670 place count 350 transition count 758
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 6 Pre rules applied. Total rules applied 670 place count 350 transition count 752
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 10 with 15 rules applied. Total rules applied 685 place count 341 transition count 752
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 688 place count 338 transition count 749
Iterating global reduction 10 with 3 rules applied. Total rules applied 691 place count 338 transition count 749
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 694 place count 338 transition count 746
Applied a total of 694 rules in 204 ms. Remains 338 /698 variables (removed 360) and now considering 746/1072 (removed 326) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 338/698 places, 746/1072 transitions.
RANDOM walk for 40000 steps (772 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (239 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 716 steps, run visited all 1 properties in 6 ms. (steps per millisecond=119 )
Probabilistic random walk after 716 steps, saw 657 distinct states, run finished after 7 ms. (steps per millisecond=102 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 698 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 698/698 places, 1072/1072 transitions.
Applied a total of 0 rules in 22 ms. Remains 698 /698 variables (removed 0) and now considering 1072/1072 (removed 0) transitions.
[2024-05-31 20:50:08] [INFO ] Invariant cache hit.
[2024-05-31 20:50:09] [INFO ] Implicit Places using invariants in 885 ms returned []
[2024-05-31 20:50:09] [INFO ] Invariant cache hit.
[2024-05-31 20:50:12] [INFO ] Implicit Places using invariants and state equation in 2312 ms returned []
Implicit Place search using SMT with State Equation took 3217 ms to find 0 implicit places.
Running 1071 sub problems to find dead transitions.
[2024-05-31 20:50:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/697 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 1071 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 697/1770 variables, and 64 constraints, problems are : Problem set: 0 solved, 1071 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/24 constraints, Generalized P Invariants (flows): 64/68 constraints, State Equation: 0/698 constraints, PredecessorRefiner: 1071/1071 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1071 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/697 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 1071 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/697 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1071 unsolved
At refinement iteration 2 (OVERLAPS) 1/698 variables, 24/88 constraints. Problems are: Problem set: 0 solved, 1071 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/698 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 1071 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 698/1770 variables, and 92 constraints, problems are : Problem set: 0 solved, 1071 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 68/68 constraints, State Equation: 0/698 constraints, PredecessorRefiner: 0/1071 constraints, Known Traps: 0/0 constraints]
After SMT, in 60814ms problems are : Problem set: 0 solved, 1071 unsolved
Search for dead transitions found 0 dead transitions in 60834ms
Finished structural reductions in LTL mode , in 1 iterations and 64078 ms. Remains : 698/698 places, 1072/1072 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 156 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (339 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (77 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 330040 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :0 out of 1
Probabilistic random walk after 330040 steps, saw 117658 distinct states, run finished after 3002 ms. (steps per millisecond=109 ) properties seen :0
[2024-05-31 20:51:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 316/351 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 347/698 variables, 68/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/698 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1072/1770 variables, 698/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1770 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1770 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1770/1770 variables, and 790 constraints, problems are : Problem set: 0 solved, 1 unsolved in 970 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 68/68 constraints, State Equation: 698/698 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 316/351 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 347/698 variables, 68/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/698 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1072/1770 variables, 698/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1770/1770 variables, and 791 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1814 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 68/68 constraints, State Equation: 698/698 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2802ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 698 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 698/698 places, 1072/1072 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 698 transition count 941
Reduce places removed 131 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 132 rules applied. Total rules applied 263 place count 567 transition count 940
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 264 place count 566 transition count 940
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 264 place count 566 transition count 850
Deduced a syphon composed of 90 places in 0 ms
Ensure Unique test removed 29 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 209 rules applied. Total rules applied 473 place count 447 transition count 850
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 16 rules applied. Total rules applied 489 place count 440 transition count 841
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 498 place count 431 transition count 841
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 498 place count 431 transition count 829
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 522 place count 419 transition count 829
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 527 place count 414 transition count 824
Iterating global reduction 5 with 5 rules applied. Total rules applied 532 place count 414 transition count 824
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 536 place count 414 transition count 820
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 537 place count 413 transition count 820
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 537 place count 413 transition count 819
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 539 place count 412 transition count 819
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 7 with 84 rules applied. Total rules applied 623 place count 370 transition count 777
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 626 place count 370 transition count 774
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 629 place count 367 transition count 774
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 8 with 12 rules applied. Total rules applied 641 place count 367 transition count 762
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 654 place count 354 transition count 762
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 657 place count 354 transition count 759
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 666 place count 354 transition count 759
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 667 place count 353 transition count 758
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 670 place count 350 transition count 758
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 6 Pre rules applied. Total rules applied 670 place count 350 transition count 752
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 10 with 15 rules applied. Total rules applied 685 place count 341 transition count 752
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 688 place count 338 transition count 749
Iterating global reduction 10 with 3 rules applied. Total rules applied 691 place count 338 transition count 749
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 694 place count 338 transition count 746
Applied a total of 694 rules in 154 ms. Remains 338 /698 variables (removed 360) and now considering 746/1072 (removed 326) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 338/698 places, 746/1072 transitions.
RANDOM walk for 40000 steps (765 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (241 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 716 steps, run visited all 1 properties in 6 ms. (steps per millisecond=119 )
Probabilistic random walk after 716 steps, saw 657 distinct states, run finished after 7 ms. (steps per millisecond=102 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 882 reset in 400 ms.
Product exploration explored 100000 steps with 878 reset in 358 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 698 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 698/698 places, 1072/1072 transitions.
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 698 transition count 1072
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 50 Pre rules applied. Total rules applied 131 place count 698 transition count 1089
Deduced a syphon composed of 181 places in 1 ms
Iterating global reduction 1 with 50 rules applied. Total rules applied 181 place count 698 transition count 1089
Discarding 3 places :
Implicit places reduction removed 3 places
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 6 rules applied. Total rules applied 187 place count 695 transition count 1089
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 210 place count 672 transition count 1066
Deduced a syphon composed of 163 places in 2 ms
Iterating global reduction 2 with 23 rules applied. Total rules applied 233 place count 672 transition count 1066
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 233 place count 672 transition count 1066
Deduced a syphon composed of 164 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 234 place count 672 transition count 1066
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 235 place count 671 transition count 1065
Deduced a syphon composed of 163 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 236 place count 671 transition count 1065
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 251 places in 1 ms
Iterating global reduction 2 with 88 rules applied. Total rules applied 324 place count 671 transition count 1077
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 366 place count 629 transition count 1035
Deduced a syphon composed of 209 places in 1 ms
Iterating global reduction 2 with 42 rules applied. Total rules applied 408 place count 629 transition count 1035
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 213 places in 1 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 412 place count 629 transition count 1063
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 214 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 413 place count 629 transition count 1067
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 415 place count 627 transition count 1061
Deduced a syphon composed of 212 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 417 place count 627 transition count 1061
Deduced a syphon composed of 212 places in 2 ms
Applied a total of 417 rules in 382 ms. Remains 627 /698 variables (removed 71) and now considering 1061/1072 (removed 11) transitions.
[2024-05-31 20:51:21] [INFO ] Redundant transitions in 38 ms returned []
Running 1060 sub problems to find dead transitions.
// Phase 1: matrix 1061 rows 627 cols
[2024-05-31 20:51:21] [INFO ] Computed 89 invariants in 15 ms
[2024-05-31 20:51:21] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 1060 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/1688 variables, and 61 constraints, problems are : Problem set: 0 solved, 1060 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/24 constraints, Generalized P Invariants (flows): 61/65 constraints, State Equation: 0/627 constraints, ReadFeed: 0/15 constraints, PredecessorRefiner: 1060/1060 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1060 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 1060 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/626 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1060 unsolved
At refinement iteration 2 (OVERLAPS) 1/627 variables, 24/85 constraints. Problems are: Problem set: 0 solved, 1060 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/627 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 1060 unsolved
[2024-05-31 20:52:14] [INFO ] Deduced a trap composed of 13 places in 317 ms of which 4 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
[2024-05-31 20:52:14] [INFO ] Deduced a trap composed of 16 places in 410 ms of which 7 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
[2024-05-31 20:52:15] [INFO ] Deduced a trap composed of 13 places in 385 ms of which 5 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-31 20:52:15] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 3 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
[2024-05-31 20:52:16] [INFO ] Deduced a trap composed of 13 places in 471 ms of which 7 ms to minimize.
[2024-05-31 20:52:16] [INFO ] Deduced a trap composed of 19 places in 422 ms of which 6 ms to minimize.
[2024-05-31 20:52:16] [INFO ] Deduced a trap composed of 16 places in 303 ms of which 4 ms to minimize.
[2024-05-31 20:52:17] [INFO ] Deduced a trap composed of 23 places in 358 ms of which 6 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-31 20:52:17] [INFO ] Deduced a trap composed of 19 places in 331 ms of which 5 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-31 20:52:17] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 3 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
[2024-05-31 20:52:18] [INFO ] Deduced a trap composed of 18 places in 418 ms of which 6 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-05-31 20:52:18] [INFO ] Deduced a trap composed of 18 places in 379 ms of which 6 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-31 20:52:19] [INFO ] Deduced a trap composed of 20 places in 443 ms of which 5 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-05-31 20:52:19] [INFO ] Deduced a trap composed of 16 places in 195 ms of which 3 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-31 20:52:19] [INFO ] Deduced a trap composed of 17 places in 197 ms of which 4 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-05-31 20:52:19] [INFO ] Deduced a trap composed of 28 places in 202 ms of which 4 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
[2024-05-31 20:52:20] [INFO ] Deduced a trap composed of 20 places in 297 ms of which 4 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
[2024-05-31 20:52:20] [INFO ] Deduced a trap composed of 6 places in 603 ms of which 8 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
[2024-05-31 20:52:21] [INFO ] Deduced a trap composed of 70 places in 577 ms of which 8 ms to minimize.
[2024-05-31 20:52:22] [INFO ] Deduced a trap composed of 73 places in 654 ms of which 7 ms to minimize.
SMT process timed out in 61338ms, After SMT, problems are : Problem set: 0 solved, 1060 unsolved
Search for dead transitions found 0 dead transitions in 61360ms
Starting structural reductions in SI_LTL mode, iteration 1 : 627/698 places, 1061/1072 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61793 ms. Remains : 627/698 places, 1061/1072 transitions.
Support contains 2 out of 698 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 698/698 places, 1072/1072 transitions.
Applied a total of 0 rules in 25 ms. Remains 698 /698 variables (removed 0) and now considering 1072/1072 (removed 0) transitions.
// Phase 1: matrix 1072 rows 698 cols
[2024-05-31 20:52:22] [INFO ] Computed 92 invariants in 13 ms
[2024-05-31 20:52:23] [INFO ] Implicit Places using invariants in 908 ms returned []
[2024-05-31 20:52:23] [INFO ] Invariant cache hit.
[2024-05-31 20:52:26] [INFO ] Implicit Places using invariants and state equation in 2598 ms returned []
Implicit Place search using SMT with State Equation took 3524 ms to find 0 implicit places.
Running 1071 sub problems to find dead transitions.
[2024-05-31 20:52:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/697 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 1071 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 697/1770 variables, and 64 constraints, problems are : Problem set: 0 solved, 1071 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/24 constraints, Generalized P Invariants (flows): 64/68 constraints, State Equation: 0/698 constraints, PredecessorRefiner: 1071/1071 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1071 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/697 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 1071 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/697 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1071 unsolved
At refinement iteration 2 (OVERLAPS) 1/698 variables, 24/88 constraints. Problems are: Problem set: 0 solved, 1071 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/698 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 1071 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 698/1770 variables, and 92 constraints, problems are : Problem set: 0 solved, 1071 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 68/68 constraints, State Equation: 0/698 constraints, PredecessorRefiner: 0/1071 constraints, Known Traps: 0/0 constraints]
After SMT, in 60758ms problems are : Problem set: 0 solved, 1071 unsolved
Search for dead transitions found 0 dead transitions in 60780ms
Finished structural reductions in LTL mode , in 1 iterations and 64334 ms. Remains : 698/698 places, 1072/1072 transitions.
Treatment of property ASLink-PT-03a-LTLCardinality-13 finished in 207817 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(p1)||p0))))'
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(G(p0))))'
Found a Lengthening insensitive property : ASLink-PT-03a-LTLCardinality-13
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 705 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 705/705 places, 1113/1113 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 132 place count 704 transition count 980
Reduce places removed 135 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 138 rules applied. Total rules applied 270 place count 569 transition count 977
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 274 place count 566 transition count 976
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 275 place count 565 transition count 976
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 96 Pre rules applied. Total rules applied 275 place count 565 transition count 880
Deduced a syphon composed of 96 places in 1 ms
Ensure Unique test removed 29 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 4 with 221 rules applied. Total rules applied 496 place count 440 transition count 880
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 4 with 26 rules applied. Total rules applied 522 place count 429 transition count 865
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 537 place count 414 transition count 865
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 13 Pre rules applied. Total rules applied 537 place count 414 transition count 852
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 563 place count 401 transition count 852
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 571 place count 393 transition count 837
Iterating global reduction 6 with 8 rules applied. Total rules applied 579 place count 393 transition count 837
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 7 rules applied. Total rules applied 586 place count 393 transition count 830
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 587 place count 392 transition count 830
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 588 place count 391 transition count 822
Iterating global reduction 8 with 1 rules applied. Total rules applied 589 place count 391 transition count 822
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 590 place count 390 transition count 814
Iterating global reduction 8 with 1 rules applied. Total rules applied 591 place count 390 transition count 814
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 592 place count 389 transition count 806
Iterating global reduction 8 with 1 rules applied. Total rules applied 593 place count 389 transition count 806
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 594 place count 388 transition count 798
Iterating global reduction 8 with 1 rules applied. Total rules applied 595 place count 388 transition count 798
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 8 with 79 rules applied. Total rules applied 674 place count 348 transition count 759
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 675 place count 347 transition count 758
Iterating global reduction 8 with 1 rules applied. Total rules applied 676 place count 347 transition count 758
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 676 place count 347 transition count 757
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 678 place count 346 transition count 757
Applied a total of 678 rules in 203 ms. Remains 346 /705 variables (removed 359) and now considering 757/1113 (removed 356) transitions.
// Phase 1: matrix 757 rows 346 cols
[2024-05-31 20:53:28] [INFO ] Computed 49 invariants in 10 ms
[2024-05-31 20:53:28] [INFO ] Implicit Places using invariants in 560 ms returned [72, 89, 95, 100, 159, 176, 182, 188, 190, 250, 267, 273, 278, 280, 343]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 564 ms to find 15 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 331/705 places, 757/1113 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 331 transition count 756
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 330 transition count 756
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 8 place count 324 transition count 750
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 324 transition count 750
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 19 place count 319 transition count 745
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 319 transition count 745
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 27 place count 316 transition count 742
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 316 transition count 742
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 42 place count 310 transition count 736
Applied a total of 42 rules in 82 ms. Remains 310 /331 variables (removed 21) and now considering 736/757 (removed 21) transitions.
// Phase 1: matrix 736 rows 310 cols
[2024-05-31 20:53:28] [INFO ] Computed 34 invariants in 6 ms
[2024-05-31 20:53:29] [INFO ] Implicit Places using invariants in 610 ms returned []
[2024-05-31 20:53:29] [INFO ] Invariant cache hit.
[2024-05-31 20:53:30] [INFO ] Implicit Places using invariants and state equation in 1296 ms returned []
Implicit Place search using SMT with State Equation took 1909 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 310/705 places, 736/1113 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2761 ms. Remains : 310/705 places, 736/1113 transitions.
Running random walk in product with property : ASLink-PT-03a-LTLCardinality-13
Product exploration explored 100000 steps with 1848 reset in 290 ms.
Product exploration explored 100000 steps with 1793 reset in 349 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 32477 steps (569 resets) in 117 ms. (275 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 736/736 transitions.
Applied a total of 0 rules in 7 ms. Remains 310 /310 variables (removed 0) and now considering 736/736 (removed 0) transitions.
[2024-05-31 20:53:32] [INFO ] Invariant cache hit.
[2024-05-31 20:53:32] [INFO ] Implicit Places using invariants in 625 ms returned []
[2024-05-31 20:53:32] [INFO ] Invariant cache hit.
[2024-05-31 20:53:34] [INFO ] Implicit Places using invariants and state equation in 1329 ms returned []
Implicit Place search using SMT with State Equation took 1961 ms to find 0 implicit places.
Running 715 sub problems to find dead transitions.
[2024-05-31 20:53:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 3 (OVERLAPS) 1/310 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 715 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 310/1046 variables, and 34 constraints, problems are : Problem set: 0 solved, 715 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/310 constraints, PredecessorRefiner: 715/715 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 715 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 3 (OVERLAPS) 1/310 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 715 unsolved
[2024-05-31 20:54:26] [INFO ] Deduced a trap composed of 27 places in 257 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 715 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/1046 variables, and 35 constraints, problems are : Problem set: 0 solved, 715 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/310 constraints, PredecessorRefiner: 0/715 constraints, Known Traps: 1/1 constraints]
After SMT, in 60639ms problems are : Problem set: 0 solved, 715 unsolved
Search for dead transitions found 0 dead transitions in 60652ms
Finished structural reductions in LTL mode , in 1 iterations and 62623 ms. Remains : 310/310 places, 736/736 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (698 resets) in 179 ms. (222 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (241 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1063 steps, run visited all 1 properties in 10 ms. (steps per millisecond=106 )
Probabilistic random walk after 1063 steps, saw 959 distinct states, run finished after 11 ms. (steps per millisecond=96 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 137 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1870 reset in 295 ms.
Product exploration explored 100000 steps with 1848 reset in 321 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 310 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 310/310 places, 736/736 transitions.
Applied a total of 0 rules in 15 ms. Remains 310 /310 variables (removed 0) and now considering 736/736 (removed 0) transitions.
[2024-05-31 20:54:36] [INFO ] Redundant transitions in 16 ms returned []
Running 715 sub problems to find dead transitions.
[2024-05-31 20:54:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 3 (OVERLAPS) 1/310 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 715 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 1.0)
(s17 0.0)
(s18 1.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 1.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 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 310/1046 variables, and 34 constraints, problems are : Problem set: 0 solved, 715 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/310 constraints, PredecessorRefiner: 715/715 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 715 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 3 (OVERLAPS) 1/310 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 715 unsolved
[2024-05-31 20:55:21] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 715 unsolved
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
At refinement iteration 7 (OVERLAPS) 736/1046 variables, 310/345 constraints. Problems are: Problem set: 115 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1046/1046 variables, and 945 constraints, problems are : Problem set: 115 solved, 600 unsolved in 30097 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 600/715 constraints, Known Traps: 1/1 constraints]
After SMT, in 60812ms problems are : Problem set: 115 solved, 600 unsolved
Search for dead transitions found 115 dead transitions in 60826ms
Found 115 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 115 transitions
Dead transitions reduction (with SMT) removed 115 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 310/310 places, 621/736 transitions.
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 302 transition count 621
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 8 place count 302 transition count 628
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 302 transition count 628
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 15 rules in 13 ms. Remains 302 /310 variables (removed 8) and now considering 628/621 (removed -7) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 302/310 places, 628/736 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60886 ms. Remains : 302/310 places, 628/736 transitions.
Support contains 2 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 736/736 transitions.
Applied a total of 0 rules in 4 ms. Remains 310 /310 variables (removed 0) and now considering 736/736 (removed 0) transitions.
[2024-05-31 20:55:37] [INFO ] Invariant cache hit.
[2024-05-31 20:55:37] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-05-31 20:55:37] [INFO ] Invariant cache hit.
[2024-05-31 20:55:38] [INFO ] Implicit Places using invariants and state equation in 857 ms returned []
Implicit Place search using SMT with State Equation took 1208 ms to find 0 implicit places.
Running 715 sub problems to find dead transitions.
[2024-05-31 20:55:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 3 (OVERLAPS) 1/310 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 715 unsolved
[2024-05-31 20:56:01] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 715 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 310/1046 variables, and 35 constraints, problems are : Problem set: 0 solved, 715 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/310 constraints, PredecessorRefiner: 715/715 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 715 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 3 (OVERLAPS) 1/310 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 715 unsolved
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD211 is UNSAT
At refinement iteration 7 (OVERLAPS) 736/1046 variables, 310/345 constraints. Problems are: Problem set: 172 solved, 543 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1046/1046 variables, and 888 constraints, problems are : Problem set: 172 solved, 543 unsolved in 30089 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 543/715 constraints, Known Traps: 1/1 constraints]
After SMT, in 60468ms problems are : Problem set: 172 solved, 543 unsolved
Search for dead transitions found 172 dead transitions in 60477ms
Found 172 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 172 transitions
Dead transitions reduction (with SMT) removed 172 transitions
Starting structural reductions in LTL mode, iteration 1 : 310/310 places, 564/736 transitions.
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 302 transition count 564
Applied a total of 8 rules in 5 ms. Remains 302 /310 variables (removed 8) and now considering 564/564 (removed 0) transitions.
// Phase 1: matrix 564 rows 302 cols
[2024-05-31 20:56:39] [INFO ] Computed 33 invariants in 5 ms
[2024-05-31 20:56:39] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-05-31 20:56:39] [INFO ] Invariant cache hit.
[2024-05-31 20:56:40] [INFO ] Implicit Places using invariants and state equation in 742 ms returned [62, 63, 64, 65, 66, 67, 68, 69, 98, 100, 102, 104, 106, 108, 110, 211, 212, 213, 214, 215, 216, 217]
[2024-05-31 20:56:40] [INFO ] Actually due to overlaps returned [62, 63, 64, 65, 66, 67, 68, 69, 98, 100, 102, 104, 106, 108, 110]
Discarding 15 places :
Implicit Place search using SMT with State Equation took 1088 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 287/310 places, 564/736 transitions.
Applied a total of 0 rules in 3 ms. Remains 287 /287 variables (removed 0) and now considering 564/564 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 62788 ms. Remains : 287/310 places, 564/736 transitions.
Treatment of property ASLink-PT-03a-LTLCardinality-13 finished in 192930 ms.
[2024-05-31 20:56:40] [INFO ] Flatten gal took : 129 ms
[2024-05-31 20:56:40] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-05-31 20:56:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 705 places, 1113 transitions and 3898 arcs took 34 ms.
Total runtime 608755 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : ASLink-PT-03a-LTLCardinality-12
Could not compute solution for formula : ASLink-PT-03a-LTLCardinality-13

BK_STOP 1717190395568

--------------------
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 ASLink-PT-03a-LTLCardinality-12
ltl formula formula --ltl=/tmp/1471/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 705 places, 1113 transitions and 3898 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1471/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1471/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.300 real 0.050 user 0.040 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1471/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1471/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 706 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 706, there are 1178 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~184 levels ~10000 states ~38136 transitions
pnml2lts-mc( 0/ 4): ~184 levels ~20000 states ~85324 transitions
pnml2lts-mc( 0/ 4): ~184 levels ~40000 states ~180644 transitions
pnml2lts-mc( 3/ 4): ~8496 levels ~80000 states ~223552 transitions
pnml2lts-mc( 3/ 4): ~8496 levels ~160000 states ~584440 transitions
pnml2lts-mc( 3/ 4): ~8496 levels ~320000 states ~1307164 transitions
pnml2lts-mc( 3/ 4): ~44767 levels ~640000 states ~2195148 transitions
pnml2lts-mc( 3/ 4): ~73052 levels ~1280000 states ~4257228 transitions
pnml2lts-mc( 3/ 4): ~73052 levels ~2560000 states ~11090456 transitions
pnml2lts-mc( 2/ 4): ~6971 levels ~5120000 states ~23029644 transitions
pnml2lts-mc( 2/ 4): ~9551 levels ~10240000 states ~49690404 transitions
pnml2lts-mc( 2/ 4): ~9552 levels ~20480000 states ~113220988 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 20325394
pnml2lts-mc( 0/ 4): unique states count: 20421305
pnml2lts-mc( 0/ 4): unique transitions count: 116058816
pnml2lts-mc( 0/ 4): - self-loop count: 1396
pnml2lts-mc( 0/ 4): - claim dead count: 95514813
pnml2lts-mc( 0/ 4): - claim found count: 30708
pnml2lts-mc( 0/ 4): - claim success count: 20421311
pnml2lts-mc( 0/ 4): - cum. max stack depth: 93589
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 20421311 states 116058882 transitions, fanout: 5.683
pnml2lts-mc( 0/ 4): Total exploration time 1012.180 sec (1012.170 sec minimum, 1012.172 sec on average)
pnml2lts-mc( 0/ 4): States per second: 20176, Transitions per second: 114662
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 220.5MB, 11.3 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 61.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1143 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 220.5MB (~256.0MB paged-in)
ltl formula name ASLink-PT-03a-LTLCardinality-13
ltl formula formula --ltl=/tmp/1471/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 705 places, 1113 transitions and 3898 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.140 real 0.060 user 0.030 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1471/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1471/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1471/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1471/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 707 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 706, there are 1122 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~51 levels ~10000 states ~38544 transitions
pnml2lts-mc( 2/ 4): ~51 levels ~20000 states ~82752 transitions
pnml2lts-mc( 2/ 4): ~51 levels ~40000 states ~184196 transitions
pnml2lts-mc( 2/ 4): ~51 levels ~80000 states ~401484 transitions
pnml2lts-mc( 2/ 4): ~175 levels ~160000 states ~768392 transitions
pnml2lts-mc( 2/ 4): ~175 levels ~320000 states ~1544396 transitions
pnml2lts-mc( 0/ 4): ~315 levels ~640000 states ~2781860 transitions
pnml2lts-mc( 0/ 4): ~315 levels ~1280000 states ~5674936 transitions
pnml2lts-mc( 0/ 4): ~315 levels ~2560000 states ~11553860 transitions
pnml2lts-mc( 0/ 4): ~321 levels ~5120000 states ~23712100 transitions
pnml2lts-mc( 0/ 4): ~359 levels ~10240000 states ~49864736 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 10148110
pnml2lts-mc( 0/ 4): unique states count: 10151659
pnml2lts-mc( 0/ 4): unique transitions count: 57129674
pnml2lts-mc( 0/ 4): - self-loop count: 1160
pnml2lts-mc( 0/ 4): - claim dead count: 46974007
pnml2lts-mc( 0/ 4): - claim found count: 413
pnml2lts-mc( 0/ 4): - claim success count: 10152977
pnml2lts-mc( 0/ 4): - cum. max stack depth: 3648
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 10153087 states 57140302 transitions, fanout: 5.628
pnml2lts-mc( 0/ 4): Total exploration time 380.510 sec (380.470 sec minimum, 380.490 sec on average)
pnml2lts-mc( 0/ 4): States per second: 26683, Transitions per second: 150168
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 141.5MB, 14.6 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 30.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1143 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 141.5MB (~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="ASLink-PT-03a"
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 ASLink-PT-03a, 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 r464-smll-171620117700043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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