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.r003-smll-171620116900059.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 greatspnxred
Input is ASLink-PT-04a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r003-smll-171620116900059
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 872K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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.5K Jun 12 13:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 12 13:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 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 436K 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-04a-LTLCardinality-00
FORMULA_NAME ASLink-PT-04a-LTLCardinality-01
FORMULA_NAME ASLink-PT-04a-LTLCardinality-02
FORMULA_NAME ASLink-PT-04a-LTLCardinality-03
FORMULA_NAME ASLink-PT-04a-LTLCardinality-04
FORMULA_NAME ASLink-PT-04a-LTLCardinality-05
FORMULA_NAME ASLink-PT-04a-LTLCardinality-06
FORMULA_NAME ASLink-PT-04a-LTLCardinality-07
FORMULA_NAME ASLink-PT-04a-LTLCardinality-08
FORMULA_NAME ASLink-PT-04a-LTLCardinality-09
FORMULA_NAME ASLink-PT-04a-LTLCardinality-10
FORMULA_NAME ASLink-PT-04a-LTLCardinality-11
FORMULA_NAME ASLink-PT-04a-LTLCardinality-12
FORMULA_NAME ASLink-PT-04a-LTLCardinality-13

=== Now, execution of the tool begins

BK_START 1718215426023

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-04a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-12 18:03:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-12 18:03:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-12 18:03:49] [INFO ] Load time of PNML (sax parser for PT used): 382 ms
[2024-06-12 18:03:49] [INFO ] Transformed 1016 places.
[2024-06-12 18:03:49] [INFO ] Transformed 1554 transitions.
[2024-06-12 18:03:49] [INFO ] Found NUPN structural information;
[2024-06-12 18:03:49] [INFO ] Parsed PT model containing 1016 places and 1554 transitions and 5858 arcs in 670 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 16 transitions
Reduce redundant transitions removed 16 transitions.
FORMULA ASLink-PT-04a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 1016 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1016/1016 places, 1538/1538 transitions.
Ensure Unique test removed 16 places
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 992 transition count 1538
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 33 place count 983 transition count 1501
Ensure Unique test removed 1 places
Iterating global reduction 1 with 10 rules applied. Total rules applied 43 place count 982 transition count 1501
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 45 place count 982 transition count 1499
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 981 transition count 1491
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 981 transition count 1491
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 980 transition count 1483
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 980 transition count 1483
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 979 transition count 1475
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 979 transition count 1475
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 978 transition count 1467
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 978 transition count 1467
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 977 transition count 1459
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 977 transition count 1459
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 976 transition count 1451
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 976 transition count 1451
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 975 transition count 1443
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 975 transition count 1443
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 974 transition count 1435
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 974 transition count 1435
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 973 transition count 1427
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 973 transition count 1427
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 972 transition count 1419
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 972 transition count 1419
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 971 transition count 1411
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 971 transition count 1411
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 970 transition count 1403
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 970 transition count 1403
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 969 transition count 1395
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 969 transition count 1395
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 968 transition count 1387
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 968 transition count 1387
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 967 transition count 1379
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 967 transition count 1379
Applied a total of 75 rules in 1206 ms. Remains 967 /1016 variables (removed 49) and now considering 1379/1538 (removed 159) transitions.
// Phase 1: matrix 1379 rows 967 cols
[2024-06-12 18:03:51] [INFO ] Computed 169 invariants in 134 ms
[2024-06-12 18:03:53] [INFO ] Implicit Places using invariants in 1790 ms returned [1, 19, 20, 23, 33, 51, 69, 198, 214, 219, 220, 221, 239, 257, 386, 402, 407, 408, 409, 445, 574, 590, 595, 596, 597, 615, 633, 762, 767, 779, 784, 785, 786, 805, 807, 810, 828, 829, 830, 831, 848, 856, 864, 870, 876, 882, 888, 896, 902, 908, 916]
Discarding 51 places :
Implicit Place search using SMT only with invariants took 1854 ms to find 51 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 916/1016 places, 1379/1538 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 903 transition count 1366
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 903 transition count 1366
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 894 transition count 1357
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 894 transition count 1357
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 889 transition count 1352
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 889 transition count 1352
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 887 transition count 1350
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 887 transition count 1350
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 885 transition count 1348
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 885 transition count 1348
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 884 transition count 1347
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 884 transition count 1347
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 883 transition count 1346
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 883 transition count 1346
Applied a total of 66 rules in 174 ms. Remains 883 /916 variables (removed 33) and now considering 1346/1379 (removed 33) transitions.
// Phase 1: matrix 1346 rows 883 cols
[2024-06-12 18:03:53] [INFO ] Computed 118 invariants in 53 ms
[2024-06-12 18:03:54] [INFO ] Implicit Places using invariants in 948 ms returned []
[2024-06-12 18:03:54] [INFO ] Invariant cache hit.
[2024-06-12 18:03:57] [INFO ] Implicit Places using invariants and state equation in 2623 ms returned []
Implicit Place search using SMT with State Equation took 3574 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 883/1016 places, 1346/1538 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6844 ms. Remains : 883/1016 places, 1346/1538 transitions.
Support contains 26 out of 883 places after structural reductions.
[2024-06-12 18:03:57] [INFO ] Flatten gal took : 317 ms
[2024-06-12 18:03:57] [INFO ] Flatten gal took : 116 ms
[2024-06-12 18:03:58] [INFO ] Input system was already deterministic with 1346 transitions.
RANDOM walk for 40000 steps (294 resets) in 1967 ms. (20 steps per ms) remains 5/15 properties
BEST_FIRST walk for 40003 steps (53 resets) in 344 ms. (115 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (50 resets) in 325 ms. (122 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (49 resets) in 233 ms. (170 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (51 resets) in 117 ms. (339 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (51 resets) in 109 ms. (363 steps per ms) remains 3/3 properties
[2024-06-12 18:03:59] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 113/118 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 266/384 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 499/883 variables, 92/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/883 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1346/2229 variables, 883/1001 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2229 variables, 0/1001 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/2229 variables, 0/1001 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2229/2229 variables, and 1001 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1741 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 92/92 constraints, State Equation: 883/883 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 113/118 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 266/384 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 499/883 variables, 92/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/883 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1346/2229 variables, 883/1001 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2229 variables, 3/1004 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2229 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/2229 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2229/2229 variables, and 1004 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2249 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 92/92 constraints, State Equation: 883/883 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 4051ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 4539 ms.
Support contains 3 out of 883 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 883/883 places, 1346/1346 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 159 rules applied. Total rules applied 159 place count 883 transition count 1187
Reduce places removed 159 places and 0 transitions.
Iterating post reduction 1 with 159 rules applied. Total rules applied 318 place count 724 transition count 1187
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 115 Pre rules applied. Total rules applied 318 place count 724 transition count 1072
Deduced a syphon composed of 115 places in 1 ms
Ensure Unique test removed 37 places
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 2 with 267 rules applied. Total rules applied 585 place count 572 transition count 1072
Discarding 8 places :
Implicit places reduction removed 8 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 2 with 17 rules applied. Total rules applied 602 place count 564 transition count 1063
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 611 place count 555 transition count 1063
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 611 place count 555 transition count 1047
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 643 place count 539 transition count 1047
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 650 place count 532 transition count 1033
Iterating global reduction 4 with 7 rules applied. Total rules applied 657 place count 532 transition count 1033
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 4 with 4 rules applied. Total rules applied 661 place count 532 transition count 1029
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 662 place count 531 transition count 1029
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 662 place count 531 transition count 1028
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 664 place count 530 transition count 1028
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 3 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 6 with 104 rules applied. Total rules applied 768 place count 478 transition count 976
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 772 place count 478 transition count 972
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 776 place count 474 transition count 972
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 7 with 16 rules applied. Total rules applied 792 place count 474 transition count 956
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 809 place count 457 transition count 956
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 812 place count 457 transition count 953
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 821 place count 457 transition count 953
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 823 place count 457 transition count 953
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 824 place count 456 transition count 952
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 828 place count 452 transition count 952
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 8 Pre rules applied. Total rules applied 828 place count 452 transition count 944
Deduced a syphon composed of 8 places in 3 ms
Ensure Unique test removed 4 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 20 rules applied. Total rules applied 848 place count 440 transition count 944
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 852 place count 436 transition count 940
Iterating global reduction 9 with 4 rules applied. Total rules applied 856 place count 436 transition count 940
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 860 place count 436 transition count 936
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 861 place count 436 transition count 935
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 862 place count 435 transition count 935
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 863 place count 435 transition count 934
Applied a total of 863 rules in 531 ms. Remains 435 /883 variables (removed 448) and now considering 934/1346 (removed 412) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 532 ms. Remains : 435/883 places, 934/1346 transitions.
RANDOM walk for 40000 steps (704 resets) in 239 ms. (166 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (200 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (183 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 4626 steps, run visited all 2 properties in 63 ms. (steps per millisecond=73 )
Probabilistic random walk after 4626 steps, saw 4070 distinct states, run finished after 69 ms. (steps per millisecond=67 ) properties seen :2
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(X((F(p0)&&G(F(p1))))))'
Support contains 4 out of 883 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 883/883 places, 1346/1346 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 881 transition count 1337
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 881 transition count 1337
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 880 transition count 1336
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 880 transition count 1336
Applied a total of 6 rules in 118 ms. Remains 880 /883 variables (removed 3) and now considering 1336/1346 (removed 10) transitions.
// Phase 1: matrix 1336 rows 880 cols
[2024-06-12 18:04:08] [INFO ] Computed 118 invariants in 14 ms
[2024-06-12 18:04:09] [INFO ] Implicit Places using invariants in 957 ms returned [408]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 965 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 879/883 places, 1336/1346 transitions.
Applied a total of 0 rules in 26 ms. Remains 879 /879 variables (removed 0) and now considering 1336/1336 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1110 ms. Remains : 879/883 places, 1336/1346 transitions.
Stuttering acceptance computed with spot in 567 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : ASLink-PT-04a-LTLCardinality-04
Product exploration explored 100000 steps with 799 reset in 503 ms.
Product exploration explored 100000 steps with 814 reset in 426 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 : [(AND p0 p1), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 1077 steps (9 resets) in 17 ms. (59 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 168 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 879 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 879/879 places, 1336/1336 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 167 transitions
Trivial Post-agglo rules discarded 167 transitions
Performed 167 trivial Post agglomeration. Transition count delta: 167
Iterating post reduction 0 with 167 rules applied. Total rules applied 167 place count 878 transition count 1168
Reduce places removed 171 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 175 rules applied. Total rules applied 342 place count 707 transition count 1164
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 347 place count 703 transition count 1163
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 348 place count 702 transition count 1163
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 122 Pre rules applied. Total rules applied 348 place count 702 transition count 1041
Deduced a syphon composed of 122 places in 1 ms
Ensure Unique test removed 36 places
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 4 with 280 rules applied. Total rules applied 628 place count 544 transition count 1041
Discarding 13 places :
Implicit places reduction removed 13 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 4 with 30 rules applied. Total rules applied 658 place count 531 transition count 1024
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 675 place count 514 transition count 1024
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 15 Pre rules applied. Total rules applied 675 place count 514 transition count 1009
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 705 place count 499 transition count 1009
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 714 place count 490 transition count 1000
Iterating global reduction 6 with 9 rules applied. Total rules applied 723 place count 490 transition count 1000
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 8 rules applied. Total rules applied 731 place count 490 transition count 992
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 732 place count 489 transition count 992
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 732 place count 489 transition count 991
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 734 place count 488 transition count 991
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 8 with 96 rules applied. Total rules applied 830 place count 440 transition count 943
Applied a total of 830 rules in 185 ms. Remains 440 /879 variables (removed 439) and now considering 943/1336 (removed 393) transitions.
// Phase 1: matrix 943 rows 440 cols
[2024-06-12 18:04:12] [INFO ] Computed 64 invariants in 18 ms
[2024-06-12 18:04:13] [INFO ] Implicit Places using invariants in 661 ms returned [72, 89, 95, 100, 159, 177, 183, 191, 251, 268, 274, 279, 281, 341, 358, 367, 372, 374, 437]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 664 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 421/879 places, 943/1336 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 421 transition count 942
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 420 transition count 942
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 8 place count 414 transition count 936
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 414 transition count 936
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 20 place count 408 transition count 930
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 408 transition count 930
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 406 transition count 928
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 406 transition count 928
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 46 place count 398 transition count 920
Applied a total of 46 rules in 83 ms. Remains 398 /421 variables (removed 23) and now considering 920/943 (removed 23) transitions.
// Phase 1: matrix 920 rows 398 cols
[2024-06-12 18:04:13] [INFO ] Computed 45 invariants in 13 ms
[2024-06-12 18:04:13] [INFO ] Implicit Places using invariants in 554 ms returned []
[2024-06-12 18:04:13] [INFO ] Invariant cache hit.
[2024-06-12 18:04:14] [INFO ] Implicit Places using invariants and state equation in 1122 ms returned []
Implicit Place search using SMT with State Equation took 1683 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 398/879 places, 920/1336 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2617 ms. Remains : 398/879 places, 920/1336 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 : [p1, (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 154 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 466 steps (6 resets) in 6 ms. (66 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 164 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1826 reset in 280 ms.
Product exploration explored 100000 steps with 1785 reset in 385 ms.
Support contains 2 out of 398 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 398/398 places, 920/920 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 398 transition count 919
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 397 transition count 919
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 397 transition count 918
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 396 transition count 918
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 395 transition count 917
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 395 transition count 917
Applied a total of 6 rules in 38 ms. Remains 395 /398 variables (removed 3) and now considering 917/920 (removed 3) transitions.
// Phase 1: matrix 917 rows 395 cols
[2024-06-12 18:04:16] [INFO ] Computed 45 invariants in 14 ms
[2024-06-12 18:04:16] [INFO ] Implicit Places using invariants in 578 ms returned [168]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 580 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 394/398 places, 917/920 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 393 transition count 916
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 392 transition count 915
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 392 transition count 915
Applied a total of 4 rules in 36 ms. Remains 392 /394 variables (removed 2) and now considering 915/917 (removed 2) transitions.
// Phase 1: matrix 915 rows 392 cols
[2024-06-12 18:04:16] [INFO ] Computed 44 invariants in 14 ms
[2024-06-12 18:04:17] [INFO ] Implicit Places using invariants in 879 ms returned []
[2024-06-12 18:04:17] [INFO ] Invariant cache hit.
[2024-06-12 18:04:18] [INFO ] Implicit Places using invariants and state equation in 1192 ms returned []
Implicit Place search using SMT with State Equation took 2077 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 392/398 places, 915/920 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2731 ms. Remains : 392/398 places, 915/920 transitions.
Treatment of property ASLink-PT-04a-LTLCardinality-04 finished in 10405 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(G(p1))))))'
Support contains 3 out of 883 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 883/883 places, 1346/1346 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 882 transition count 1345
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 882 transition count 1345
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 881 transition count 1344
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 881 transition count 1344
Applied a total of 4 rules in 71 ms. Remains 881 /883 variables (removed 2) and now considering 1344/1346 (removed 2) transitions.
// Phase 1: matrix 1344 rows 881 cols
[2024-06-12 18:04:19] [INFO ] Computed 118 invariants in 21 ms
[2024-06-12 18:04:20] [INFO ] Implicit Places using invariants in 1059 ms returned [408]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1064 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 880/883 places, 1344/1346 transitions.
Applied a total of 0 rules in 33 ms. Remains 880 /880 variables (removed 0) and now considering 1344/1344 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1171 ms. Remains : 880/883 places, 1344/1346 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : ASLink-PT-04a-LTLCardinality-08
Stuttering criterion allowed to conclude after 188 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-04a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-LTLCardinality-08 finished in 1425 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X(G(p1))))))'
Support contains 3 out of 883 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 883/883 places, 1346/1346 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 881 transition count 1337
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 881 transition count 1337
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 880 transition count 1336
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 880 transition count 1336
Applied a total of 6 rules in 112 ms. Remains 880 /883 variables (removed 3) and now considering 1336/1346 (removed 10) transitions.
// Phase 1: matrix 1336 rows 880 cols
[2024-06-12 18:04:20] [INFO ] Computed 118 invariants in 20 ms
[2024-06-12 18:04:21] [INFO ] Implicit Places using invariants in 925 ms returned [408]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 928 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 879/883 places, 1336/1346 transitions.
Applied a total of 0 rules in 26 ms. Remains 879 /879 variables (removed 0) and now considering 1336/1336 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1068 ms. Remains : 879/883 places, 1336/1346 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-04a-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-04a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-LTLCardinality-09 finished in 1232 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||F(p1))))'
Support contains 4 out of 883 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 883/883 places, 1346/1346 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 158 transitions
Trivial Post-agglo rules discarded 158 transitions
Performed 158 trivial Post agglomeration. Transition count delta: 158
Iterating post reduction 0 with 158 rules applied. Total rules applied 158 place count 882 transition count 1187
Reduce places removed 162 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 166 rules applied. Total rules applied 324 place count 720 transition count 1183
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 329 place count 716 transition count 1182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 330 place count 715 transition count 1182
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 123 Pre rules applied. Total rules applied 330 place count 715 transition count 1059
Deduced a syphon composed of 123 places in 1 ms
Ensure Unique test removed 37 places
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 4 with 283 rules applied. Total rules applied 613 place count 555 transition count 1059
Discarding 13 places :
Implicit places reduction removed 13 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 4 with 30 rules applied. Total rules applied 643 place count 542 transition count 1042
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 660 place count 525 transition count 1042
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 17 Pre rules applied. Total rules applied 660 place count 525 transition count 1025
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 694 place count 508 transition count 1025
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 705 place count 497 transition count 1007
Iterating global reduction 6 with 11 rules applied. Total rules applied 716 place count 497 transition count 1007
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 8 rules applied. Total rules applied 724 place count 497 transition count 999
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 725 place count 496 transition count 999
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 725 place count 496 transition count 998
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 727 place count 495 transition count 998
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 2 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 8 with 98 rules applied. Total rules applied 825 place count 446 transition count 949
Applied a total of 825 rules in 117 ms. Remains 446 /883 variables (removed 437) and now considering 949/1346 (removed 397) transitions.
// Phase 1: matrix 949 rows 446 cols
[2024-06-12 18:04:21] [INFO ] Computed 64 invariants in 11 ms
[2024-06-12 18:04:22] [INFO ] Implicit Places using invariants in 478 ms returned [72, 90, 97, 102, 161, 178, 184, 189, 192, 218, 253, 274, 282, 288, 290, 350, 367, 373, 378, 380, 443]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 484 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 425/883 places, 949/1346 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 425 transition count 944
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 420 transition count 944
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 18 place count 412 transition count 936
Iterating global reduction 2 with 8 rules applied. Total rules applied 26 place count 412 transition count 936
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 33 place count 405 transition count 929
Iterating global reduction 2 with 7 rules applied. Total rules applied 40 place count 405 transition count 929
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 43 place count 402 transition count 926
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 402 transition count 926
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 68 place count 391 transition count 915
Applied a total of 68 rules in 57 ms. Remains 391 /425 variables (removed 34) and now considering 915/949 (removed 34) transitions.
// Phase 1: matrix 915 rows 391 cols
[2024-06-12 18:04:22] [INFO ] Computed 43 invariants in 8 ms
[2024-06-12 18:04:22] [INFO ] Implicit Places using invariants in 383 ms returned []
[2024-06-12 18:04:22] [INFO ] Invariant cache hit.
[2024-06-12 18:04:24] [INFO ] Implicit Places using invariants and state equation in 1559 ms returned []
Implicit Place search using SMT with State Equation took 1945 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 391/883 places, 915/1346 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2605 ms. Remains : 391/883 places, 915/1346 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ASLink-PT-04a-LTLCardinality-11
Product exploration explored 100000 steps with 2183 reset in 438 ms.
Product exploration explored 100000 steps with 2231 reset in 589 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 (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (654 resets) in 296 ms. (134 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40001 steps (184 resets) in 187 ms. (212 steps per ms) remains 1/1 properties
[2024-06-12 18:04:25] [INFO ] Invariant cache hit.
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) 96/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/111 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 149/260 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 37/297 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 60/357 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/375 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-12 18:04:26] [INFO ] Deduced a trap composed of 13 places in 359 ms of which 48 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/375 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/375 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 16/391 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/391 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 915/1306 variables, 391/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1306 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1306 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1306/1306 variables, and 435 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1209 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 391/391 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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) 96/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/111 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 149/260 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 37/297 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 60/357 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/375 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/375 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/375 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 16/391 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/391 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 915/1306 variables, 391/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1306 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1306 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1306 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1306/1306 variables, and 436 constraints, problems are : Problem set: 0 solved, 1 unsolved in 576 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 391/391 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1805ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 85 ms.
Support contains 2 out of 391 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 391/391 places, 915/915 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 391 transition count 914
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 390 transition count 914
Free-agglomeration rule applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 18 place count 390 transition count 898
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 38 place count 374 transition count 894
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 49 place count 374 transition count 883
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 60 place count 363 transition count 883
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 61 place count 363 transition count 883
Applied a total of 61 rules in 70 ms. Remains 363 /391 variables (removed 28) and now considering 883/915 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 363/391 places, 883/915 transitions.
RANDOM walk for 40000 steps (809 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (232 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 415948 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :0 out of 1
Probabilistic random walk after 415948 steps, saw 225681 distinct states, run finished after 3006 ms. (steps per millisecond=138 ) properties seen :0
// Phase 1: matrix 883 rows 363 cols
[2024-06-12 18:04:31] [INFO ] Computed 43 invariants in 16 ms
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) 83/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/94 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 155/249 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/275 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 54/329 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/329 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/347 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-12 18:04:31] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/347 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 16/363 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/363 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 883/1246 variables, 363/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1246 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1246 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1246/1246 variables, and 407 constraints, problems are : Problem set: 0 solved, 1 unsolved in 963 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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) 83/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/94 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 155/249 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/275 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 54/329 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/329 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/347 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/347 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 16/363 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/363 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 883/1246 variables, 363/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1246 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1246 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1246 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1246/1246 variables, and 408 constraints, problems are : Problem set: 0 solved, 1 unsolved in 734 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1723ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 86 ms.
Support contains 2 out of 363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 883/883 transitions.
Applied a total of 0 rules in 12 ms. Remains 363 /363 variables (removed 0) and now considering 883/883 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 363/363 places, 883/883 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 883/883 transitions.
Applied a total of 0 rules in 13 ms. Remains 363 /363 variables (removed 0) and now considering 883/883 (removed 0) transitions.
[2024-06-12 18:04:32] [INFO ] Invariant cache hit.
[2024-06-12 18:04:33] [INFO ] Implicit Places using invariants in 706 ms returned [92, 93, 163, 164, 234, 235]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 707 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 357/363 places, 883/883 transitions.
Applied a total of 0 rules in 12 ms. Remains 357 /357 variables (removed 0) and now considering 883/883 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 733 ms. Remains : 357/363 places, 883/883 transitions.
RANDOM walk for 40000 steps (787 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (225 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 385429 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :0 out of 1
Probabilistic random walk after 385429 steps, saw 205064 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
// Phase 1: matrix 883 rows 357 cols
[2024-06-12 18:04:36] [INFO ] Computed 37 invariants in 7 ms
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) 97/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/118 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 156/274 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/308 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-12 18:04:36] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 49/357 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 883/1240 variables, 357/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1240 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1240 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1240/1240 variables, and 395 constraints, problems are : Problem set: 0 solved, 1 unsolved in 805 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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) 97/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/118 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 156/274 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/308 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 49/357 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 883/1240 variables, 357/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1240 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1240 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1240 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1240/1240 variables, and 396 constraints, problems are : Problem set: 0 solved, 1 unsolved in 585 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1416ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 61 ms.
Support contains 2 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 883/883 transitions.
Applied a total of 0 rules in 10 ms. Remains 357 /357 variables (removed 0) and now considering 883/883 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 357/357 places, 883/883 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 883/883 transitions.
Applied a total of 0 rules in 10 ms. Remains 357 /357 variables (removed 0) and now considering 883/883 (removed 0) transitions.
[2024-06-12 18:04:38] [INFO ] Invariant cache hit.
[2024-06-12 18:04:38] [INFO ] Implicit Places using invariants in 426 ms returned []
[2024-06-12 18:04:38] [INFO ] Invariant cache hit.
[2024-06-12 18:04:39] [INFO ] Implicit Places using invariants and state equation in 977 ms returned []
Implicit Place search using SMT with State Equation took 1405 ms to find 0 implicit places.
[2024-06-12 18:04:39] [INFO ] Redundant transitions in 58 ms returned []
Running 861 sub problems to find dead transitions.
[2024-06-12 18:04:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 3 (OVERLAPS) 1/357 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 861 unsolved
SMT process timed out in 30834ms, After SMT, problems are : Problem set: 0 solved, 861 unsolved
Search for dead transitions found 0 dead transitions in 30855ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32343 ms. Remains : 357/357 places, 883/883 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 11 ms. Remains 357 /357 variables (removed 0) and now considering 883/883 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-12 18:05:10] [INFO ] Invariant cache hit.
[2024-06-12 18:05:10] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-06-12 18:05:10] [INFO ] [Real]Absence check using 9 positive and 28 generalized place invariants in 17 ms returned sat
[2024-06-12 18:05:10] [INFO ] After 479ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-12 18:05:11] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-06-12 18:05:11] [INFO ] [Nat]Absence check using 9 positive and 28 generalized place invariants in 17 ms returned sat
[2024-06-12 18:05:11] [INFO ] After 381ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-12 18:05:11] [INFO ] After 545ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-12 18:05:11] [INFO ] After 687ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1200 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 391 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 391/391 places, 915/915 transitions.
Applied a total of 0 rules in 10 ms. Remains 391 /391 variables (removed 0) and now considering 915/915 (removed 0) transitions.
// Phase 1: matrix 915 rows 391 cols
[2024-06-12 18:05:11] [INFO ] Computed 43 invariants in 7 ms
[2024-06-12 18:05:12] [INFO ] Implicit Places using invariants in 432 ms returned []
[2024-06-12 18:05:12] [INFO ] Invariant cache hit.
[2024-06-12 18:05:13] [INFO ] Implicit Places using invariants and state equation in 1260 ms returned []
Implicit Place search using SMT with State Equation took 1694 ms to find 0 implicit places.
[2024-06-12 18:05:13] [INFO ] Redundant transitions in 205 ms returned []
Running 889 sub problems to find dead transitions.
[2024-06-12 18:05:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/390 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/390 variables, 31/38 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 889 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 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 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1/391 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 889 unsolved
SMT process timed out in 30728ms, After SMT, problems are : Problem set: 0 solved, 889 unsolved
Search for dead transitions found 0 dead transitions in 30749ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32668 ms. Remains : 391/391 places, 915/915 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 (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (655 resets) in 191 ms. (208 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (182 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
[2024-06-12 18:05:44] [INFO ] Invariant cache hit.
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) 96/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/111 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 149/260 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 37/297 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 60/357 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/375 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-12 18:05:45] [INFO ] Deduced a trap composed of 13 places in 266 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/375 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/375 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 16/391 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/391 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 915/1306 variables, 391/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1306 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1306 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1306/1306 variables, and 435 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1216 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 391/391 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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) 96/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/111 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 149/260 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 37/297 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 60/357 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/375 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/375 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/375 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 16/391 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/391 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 915/1306 variables, 391/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1306 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1306 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1306 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1306/1306 variables, and 436 constraints, problems are : Problem set: 0 solved, 1 unsolved in 789 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 391/391 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2018ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 119 ms.
Support contains 2 out of 391 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 391/391 places, 915/915 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 391 transition count 914
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 390 transition count 914
Free-agglomeration rule applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 18 place count 390 transition count 898
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 38 place count 374 transition count 894
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 49 place count 374 transition count 883
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 60 place count 363 transition count 883
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 61 place count 363 transition count 883
Applied a total of 61 rules in 83 ms. Remains 363 /391 variables (removed 28) and now considering 883/915 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 363/391 places, 883/915 transitions.
RANDOM walk for 40000 steps (757 resets) in 180 ms. (220 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (238 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 415838 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :0 out of 1
Probabilistic random walk after 415838 steps, saw 225591 distinct states, run finished after 3001 ms. (steps per millisecond=138 ) properties seen :0
// Phase 1: matrix 883 rows 363 cols
[2024-06-12 18:05:50] [INFO ] Computed 43 invariants in 7 ms
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) 83/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/94 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 155/249 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/275 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 54/329 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/329 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/347 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-12 18:05:50] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/347 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 16/363 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/363 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 883/1246 variables, 363/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1246 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1246 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1246/1246 variables, and 407 constraints, problems are : Problem set: 0 solved, 1 unsolved in 642 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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) 83/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/94 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 155/249 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/275 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 54/329 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/329 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/347 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/347 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 16/363 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/363 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 883/1246 variables, 363/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1246 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1246 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1246 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1246/1246 variables, and 408 constraints, problems are : Problem set: 0 solved, 1 unsolved in 563 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1221ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 94 ms.
Support contains 2 out of 363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 883/883 transitions.
Applied a total of 0 rules in 12 ms. Remains 363 /363 variables (removed 0) and now considering 883/883 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 363/363 places, 883/883 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 883/883 transitions.
Applied a total of 0 rules in 12 ms. Remains 363 /363 variables (removed 0) and now considering 883/883 (removed 0) transitions.
[2024-06-12 18:05:51] [INFO ] Invariant cache hit.
[2024-06-12 18:05:52] [INFO ] Implicit Places using invariants in 515 ms returned [92, 93, 163, 164, 234, 235]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 517 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 357/363 places, 883/883 transitions.
Applied a total of 0 rules in 11 ms. Remains 357 /357 variables (removed 0) and now considering 883/883 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 541 ms. Remains : 357/363 places, 883/883 transitions.
RANDOM walk for 40000 steps (775 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (228 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 452594 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :0 out of 1
Probabilistic random walk after 452594 steps, saw 248628 distinct states, run finished after 3005 ms. (steps per millisecond=150 ) properties seen :0
// Phase 1: matrix 883 rows 357 cols
[2024-06-12 18:05:55] [INFO ] Computed 37 invariants in 7 ms
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) 97/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/118 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 156/274 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/308 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-12 18:05:55] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 49/357 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 883/1240 variables, 357/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1240 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1240 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1240/1240 variables, and 395 constraints, problems are : Problem set: 0 solved, 1 unsolved in 516 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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) 97/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/118 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 156/274 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/308 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 49/357 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 883/1240 variables, 357/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1240 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1240 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1240 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1240/1240 variables, and 396 constraints, problems are : Problem set: 0 solved, 1 unsolved in 687 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1218ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 89 ms.
Support contains 2 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 883/883 transitions.
Applied a total of 0 rules in 17 ms. Remains 357 /357 variables (removed 0) and now considering 883/883 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 357/357 places, 883/883 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 883/883 transitions.
Applied a total of 0 rules in 17 ms. Remains 357 /357 variables (removed 0) and now considering 883/883 (removed 0) transitions.
[2024-06-12 18:05:56] [INFO ] Invariant cache hit.
[2024-06-12 18:05:57] [INFO ] Implicit Places using invariants in 644 ms returned []
[2024-06-12 18:05:57] [INFO ] Invariant cache hit.
[2024-06-12 18:05:58] [INFO ] Implicit Places using invariants and state equation in 1575 ms returned []
Implicit Place search using SMT with State Equation took 2222 ms to find 0 implicit places.
[2024-06-12 18:05:58] [INFO ] Redundant transitions in 15 ms returned []
Running 861 sub problems to find dead transitions.
[2024-06-12 18:05:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 3 (OVERLAPS) 1/357 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 861 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 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 357/1240 variables, and 37 constraints, problems are : Problem set: 0 solved, 861 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/357 constraints, PredecessorRefiner: 861/861 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 861 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 3 (OVERLAPS) 1/357 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 861 unsolved
[2024-06-12 18:06:51] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 3 ms to minimize.
[2024-06-12 18:06:56] [INFO ] Deduced a trap composed of 76 places in 533 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 861 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 1)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 357/1240 variables, and 39 constraints, problems are : Problem set: 0 solved, 861 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/357 constraints, PredecessorRefiner: 0/861 constraints, Known Traps: 2/2 constraints]
After SMT, in 60953ms problems are : Problem set: 0 solved, 861 unsolved
Search for dead transitions found 0 dead transitions in 60973ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63239 ms. Remains : 357/357 places, 883/883 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 11 ms. Remains 357 /357 variables (removed 0) and now considering 883/883 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-12 18:06:59] [INFO ] Invariant cache hit.
[2024-06-12 18:06:59] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-06-12 18:06:59] [INFO ] [Real]Absence check using 9 positive and 28 generalized place invariants in 19 ms returned sat
[2024-06-12 18:07:00] [INFO ] After 437ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-12 18:07:00] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-06-12 18:07:00] [INFO ] [Nat]Absence check using 9 positive and 28 generalized place invariants in 17 ms returned sat
[2024-06-12 18:07:00] [INFO ] After 345ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-12 18:07:00] [INFO ] After 412ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-12 18:07:00] [INFO ] After 553ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1011 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 197 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 2247 reset in 368 ms.
Product exploration explored 100000 steps with 2200 reset in 418 ms.
Support contains 4 out of 391 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 391/391 places, 915/915 transitions.
Applied a total of 0 rules in 23 ms. Remains 391 /391 variables (removed 0) and now considering 915/915 (removed 0) transitions.
// Phase 1: matrix 915 rows 391 cols
[2024-06-12 18:07:02] [INFO ] Computed 43 invariants in 12 ms
[2024-06-12 18:07:02] [INFO ] Implicit Places using invariants in 545 ms returned []
[2024-06-12 18:07:02] [INFO ] Invariant cache hit.
[2024-06-12 18:07:04] [INFO ] Implicit Places using invariants and state equation in 1440 ms returned []
Implicit Place search using SMT with State Equation took 1987 ms to find 0 implicit places.
[2024-06-12 18:07:04] [INFO ] Redundant transitions in 12 ms returned []
Running 889 sub problems to find dead transitions.
[2024-06-12 18:07:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/390 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/390 variables, 31/38 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 3 (OVERLAPS) 1/391 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 889 unsolved
SMT process timed out in 30673ms, After SMT, problems are : Problem set: 0 solved, 889 unsolved
Search for dead transitions found 0 dead transitions in 30687ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32719 ms. Remains : 391/391 places, 915/915 transitions.
Treatment of property ASLink-PT-04a-LTLCardinality-11 finished in 193132 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((X(X(X(F(p1))))||p0))))'
Support contains 4 out of 883 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 883/883 places, 1346/1346 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 157 transitions
Trivial Post-agglo rules discarded 157 transitions
Performed 157 trivial Post agglomeration. Transition count delta: 157
Iterating post reduction 0 with 157 rules applied. Total rules applied 157 place count 882 transition count 1188
Reduce places removed 161 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 165 rules applied. Total rules applied 322 place count 721 transition count 1184
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 328 place count 717 transition count 1182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 330 place count 715 transition count 1182
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 122 Pre rules applied. Total rules applied 330 place count 715 transition count 1060
Deduced a syphon composed of 122 places in 1 ms
Ensure Unique test removed 37 places
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 4 with 281 rules applied. Total rules applied 611 place count 556 transition count 1060
Discarding 13 places :
Implicit places reduction removed 13 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 4 with 29 rules applied. Total rules applied 640 place count 543 transition count 1044
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 656 place count 527 transition count 1044
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 17 Pre rules applied. Total rules applied 656 place count 527 transition count 1027
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 690 place count 510 transition count 1027
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 701 place count 499 transition count 1009
Iterating global reduction 6 with 11 rules applied. Total rules applied 712 place count 499 transition count 1009
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 719 place count 499 transition count 1002
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 720 place count 498 transition count 1002
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 720 place count 498 transition count 1001
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 722 place count 497 transition count 1001
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 8 with 96 rules applied. Total rules applied 818 place count 449 transition count 953
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 820 place count 449 transition count 953
Applied a total of 820 rules in 137 ms. Remains 449 /883 variables (removed 434) and now considering 953/1346 (removed 393) transitions.
// Phase 1: matrix 953 rows 449 cols
[2024-06-12 18:07:35] [INFO ] Computed 64 invariants in 13 ms
[2024-06-12 18:07:36] [INFO ] Implicit Places using invariants in 927 ms returned [72, 90, 96, 101, 160, 177, 183, 188, 190, 216, 251, 272, 280, 286, 288, 348, 366, 372, 377, 381, 445]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 929 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 428/883 places, 953/1346 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 428 transition count 948
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 423 transition count 948
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 18 place count 415 transition count 940
Iterating global reduction 2 with 8 rules applied. Total rules applied 26 place count 415 transition count 940
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 34 place count 407 transition count 932
Iterating global reduction 2 with 8 rules applied. Total rules applied 42 place count 407 transition count 932
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 46 place count 403 transition count 928
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 403 transition count 928
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 72 place count 392 transition count 917
Applied a total of 72 rules in 73 ms. Remains 392 /428 variables (removed 36) and now considering 917/953 (removed 36) transitions.
// Phase 1: matrix 917 rows 392 cols
[2024-06-12 18:07:36] [INFO ] Computed 43 invariants in 12 ms
[2024-06-12 18:07:36] [INFO ] Implicit Places using invariants in 629 ms returned []
[2024-06-12 18:07:36] [INFO ] Invariant cache hit.
[2024-06-12 18:07:38] [INFO ] Implicit Places using invariants and state equation in 1571 ms returned []
Implicit Place search using SMT with State Equation took 2209 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 392/883 places, 917/1346 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3351 ms. Remains : 392/883 places, 917/1346 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-04a-LTLCardinality-12
Product exploration explored 100000 steps with 1601 reset in 352 ms.
Product exploration explored 100000 steps with 1608 reset in 404 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 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 339 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 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1950 steps (25 resets) in 39 ms. (48 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 498 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 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 392 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 392/392 places, 917/917 transitions.
Applied a total of 0 rules in 18 ms. Remains 392 /392 variables (removed 0) and now considering 917/917 (removed 0) transitions.
[2024-06-12 18:07:40] [INFO ] Invariant cache hit.
[2024-06-12 18:07:41] [INFO ] Implicit Places using invariants in 719 ms returned []
[2024-06-12 18:07:41] [INFO ] Invariant cache hit.
[2024-06-12 18:07:42] [INFO ] Implicit Places using invariants and state equation in 1723 ms returned []
Implicit Place search using SMT with State Equation took 2444 ms to find 0 implicit places.
[2024-06-12 18:07:42] [INFO ] Redundant transitions in 28 ms returned []
Running 890 sub problems to find dead transitions.
[2024-06-12 18:07:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/391 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/391 variables, 31/37 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 890 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 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 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1/392 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 890 unsolved
SMT process timed out in 30855ms, After SMT, problems are : Problem set: 0 solved, 890 unsolved
Search for dead transitions found 0 dead transitions in 30875ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33378 ms. Remains : 392/392 places, 917/917 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 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 403 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 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 3372 steps (46 resets) in 80 ms. (41 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 485 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 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1655 reset in 342 ms.
Product exploration explored 100000 steps with 1598 reset in 301 ms.
Support contains 4 out of 392 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 392/392 places, 917/917 transitions.
Applied a total of 0 rules in 11 ms. Remains 392 /392 variables (removed 0) and now considering 917/917 (removed 0) transitions.
[2024-06-12 18:08:15] [INFO ] Invariant cache hit.
[2024-06-12 18:08:16] [INFO ] Implicit Places using invariants in 518 ms returned []
[2024-06-12 18:08:16] [INFO ] Invariant cache hit.
[2024-06-12 18:08:18] [INFO ] Implicit Places using invariants and state equation in 1720 ms returned []
Implicit Place search using SMT with State Equation took 2241 ms to find 0 implicit places.
[2024-06-12 18:08:18] [INFO ] Redundant transitions in 28 ms returned []
Running 890 sub problems to find dead transitions.
[2024-06-12 18:08:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/391 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/391 variables, 31/37 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 3 (OVERLAPS) 1/392 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 890 unsolved
SMT process timed out in 30957ms, After SMT, problems are : Problem set: 0 solved, 890 unsolved
Search for dead transitions found 0 dead transitions in 30977ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33267 ms. Remains : 392/392 places, 917/917 transitions.
Treatment of property ASLink-PT-04a-LTLCardinality-12 finished in 74203 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1)&&X(X(G(p2))))))'
Support contains 6 out of 883 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 883/883 places, 1346/1346 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 882 transition count 1338
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 882 transition count 1338
Applied a total of 2 rules in 64 ms. Remains 882 /883 variables (removed 1) and now considering 1338/1346 (removed 8) transitions.
// Phase 1: matrix 1338 rows 882 cols
[2024-06-12 18:08:49] [INFO ] Computed 118 invariants in 17 ms
[2024-06-12 18:08:50] [INFO ] Implicit Places using invariants in 1175 ms returned []
[2024-06-12 18:08:50] [INFO ] Invariant cache hit.
[2024-06-12 18:08:53] [INFO ] Implicit Places using invariants and state equation in 3530 ms returned []
Implicit Place search using SMT with State Equation took 4709 ms to find 0 implicit places.
Running 1337 sub problems to find dead transitions.
[2024-06-12 18:08:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/881 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 1337 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 881/2220 variables, and 85 constraints, problems are : Problem set: 0 solved, 1337 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/27 constraints, Generalized P Invariants (flows): 85/91 constraints, State Equation: 0/882 constraints, PredecessorRefiner: 1337/1337 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1337 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/881 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 1337 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 881/2220 variables, and 85 constraints, problems are : Problem set: 0 solved, 1337 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/27 constraints, Generalized P Invariants (flows): 85/91 constraints, State Equation: 0/882 constraints, PredecessorRefiner: 0/1337 constraints, Known Traps: 0/0 constraints]
After SMT, in 60781ms problems are : Problem set: 0 solved, 1337 unsolved
Search for dead transitions found 0 dead transitions in 60799ms
Starting structural reductions in LTL mode, iteration 1 : 882/883 places, 1338/1346 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65577 ms. Remains : 882/883 places, 1338/1346 transitions.
Stuttering acceptance computed with spot in 210 ms :[true, (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : ASLink-PT-04a-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-04a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-LTLCardinality-13 finished in 65821 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G(p1)))))'
Support contains 3 out of 883 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 883/883 places, 1346/1346 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 881 transition count 1337
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 881 transition count 1337
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 880 transition count 1336
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 880 transition count 1336
Applied a total of 6 rules in 82 ms. Remains 880 /883 variables (removed 3) and now considering 1336/1346 (removed 10) transitions.
// Phase 1: matrix 1336 rows 880 cols
[2024-06-12 18:09:55] [INFO ] Computed 118 invariants in 14 ms
[2024-06-12 18:09:56] [INFO ] Implicit Places using invariants in 1167 ms returned [408]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1170 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 879/883 places, 1336/1346 transitions.
Applied a total of 0 rules in 21 ms. Remains 879 /879 variables (removed 0) and now considering 1336/1336 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1274 ms. Remains : 879/883 places, 1336/1346 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ASLink-PT-04a-LTLCardinality-15
Stuttering criterion allowed to conclude after 709 steps with 2 reset in 3 ms.
FORMULA ASLink-PT-04a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-LTLCardinality-15 finished in 1421 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((F(p0)&&G(F(p1))))))'
Found a Shortening insensitive property : ASLink-PT-04a-LTLCardinality-04
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 4 out of 883 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 883/883 places, 1346/1346 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 159 rules applied. Total rules applied 159 place count 882 transition count 1186
Reduce places removed 163 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 167 rules applied. Total rules applied 326 place count 719 transition count 1182
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 331 place count 715 transition count 1181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 332 place count 714 transition count 1181
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 122 Pre rules applied. Total rules applied 332 place count 714 transition count 1059
Deduced a syphon composed of 122 places in 1 ms
Ensure Unique test removed 36 places
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 4 with 280 rules applied. Total rules applied 612 place count 556 transition count 1059
Discarding 13 places :
Implicit places reduction removed 13 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 4 with 30 rules applied. Total rules applied 642 place count 543 transition count 1042
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 659 place count 526 transition count 1042
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 15 Pre rules applied. Total rules applied 659 place count 526 transition count 1027
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 689 place count 511 transition count 1027
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 700 place count 500 transition count 1009
Iterating global reduction 6 with 11 rules applied. Total rules applied 711 place count 500 transition count 1009
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 8 rules applied. Total rules applied 719 place count 500 transition count 1001
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 720 place count 499 transition count 1001
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 720 place count 499 transition count 1000
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 722 place count 498 transition count 1000
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 8 with 100 rules applied. Total rules applied 822 place count 448 transition count 950
Applied a total of 822 rules in 91 ms. Remains 448 /883 variables (removed 435) and now considering 950/1346 (removed 396) transitions.
// Phase 1: matrix 950 rows 448 cols
[2024-06-12 18:09:57] [INFO ] Computed 65 invariants in 15 ms
[2024-06-12 18:09:57] [INFO ] Implicit Places using invariants in 629 ms returned [72, 89, 95, 100, 159, 177, 183, 191, 217, 252, 273, 281, 287, 289, 349, 366, 375, 380, 382, 445]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 634 ms to find 20 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 428/883 places, 950/1346 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 428 transition count 945
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 423 transition count 945
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 16 place count 417 transition count 939
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 417 transition count 939
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 28 place count 411 transition count 933
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 411 transition count 933
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 409 transition count 931
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 409 transition count 931
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 60 place count 398 transition count 920
Applied a total of 60 rules in 71 ms. Remains 398 /428 variables (removed 30) and now considering 920/950 (removed 30) transitions.
// Phase 1: matrix 920 rows 398 cols
[2024-06-12 18:09:57] [INFO ] Computed 45 invariants in 25 ms
[2024-06-12 18:09:58] [INFO ] Implicit Places using invariants in 1041 ms returned []
[2024-06-12 18:09:58] [INFO ] Invariant cache hit.
[2024-06-12 18:10:00] [INFO ] Implicit Places using invariants and state equation in 1936 ms returned []
Implicit Place search using SMT with State Equation took 2989 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 398/883 places, 920/1346 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 3786 ms. Remains : 398/883 places, 920/1346 transitions.
Running random walk in product with property : ASLink-PT-04a-LTLCardinality-04
Product exploration explored 100000 steps with 1793 reset in 259 ms.
Product exploration explored 100000 steps with 1797 reset in 247 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 (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 169 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 782 steps (9 resets) in 7 ms. (97 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 203 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 398 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 398/398 places, 920/920 transitions.
Applied a total of 0 rules in 19 ms. Remains 398 /398 variables (removed 0) and now considering 920/920 (removed 0) transitions.
[2024-06-12 18:10:02] [INFO ] Invariant cache hit.
[2024-06-12 18:10:02] [INFO ] Implicit Places using invariants in 582 ms returned []
[2024-06-12 18:10:02] [INFO ] Invariant cache hit.
[2024-06-12 18:10:04] [INFO ] Implicit Places using invariants and state equation in 1507 ms returned []
Implicit Place search using SMT with State Equation took 2105 ms to find 0 implicit places.
[2024-06-12 18:10:04] [INFO ] Redundant transitions in 28 ms returned []
Running 894 sub problems to find dead transitions.
[2024-06-12 18:10:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/397 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/397 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 894 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1/398 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 894 unsolved
SMT process timed out in 30748ms, After SMT, problems are : Problem set: 0 solved, 894 unsolved
Search for dead transitions found 0 dead transitions in 30766ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32927 ms. Remains : 398/398 places, 920/920 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 : [p1, (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 185 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 466 steps (5 resets) in 8 ms. (51 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 189 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1751 reset in 345 ms.
Product exploration explored 100000 steps with 1840 reset in 377 ms.
Support contains 2 out of 398 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 398/398 places, 920/920 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 398 transition count 919
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 397 transition count 919
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 397 transition count 918
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 396 transition count 918
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 395 transition count 917
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 395 transition count 917
Applied a total of 6 rules in 38 ms. Remains 395 /398 variables (removed 3) and now considering 917/920 (removed 3) transitions.
// Phase 1: matrix 917 rows 395 cols
[2024-06-12 18:10:36] [INFO ] Computed 45 invariants in 12 ms
[2024-06-12 18:10:37] [INFO ] Implicit Places using invariants in 773 ms returned [168]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 776 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 394/398 places, 917/920 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 393 transition count 916
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 392 transition count 915
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 392 transition count 915
Applied a total of 4 rules in 45 ms. Remains 392 /394 variables (removed 2) and now considering 915/917 (removed 2) transitions.
// Phase 1: matrix 915 rows 392 cols
[2024-06-12 18:10:37] [INFO ] Computed 44 invariants in 11 ms
[2024-06-12 18:10:38] [INFO ] Implicit Places using invariants in 822 ms returned []
[2024-06-12 18:10:38] [INFO ] Invariant cache hit.
[2024-06-12 18:10:39] [INFO ] Implicit Places using invariants and state equation in 1707 ms returned []
Implicit Place search using SMT with State Equation took 2531 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 392/398 places, 915/920 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3394 ms. Remains : 392/398 places, 915/920 transitions.
Treatment of property ASLink-PT-04a-LTLCardinality-04 finished in 43522 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||F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(X(X(F(p1))))||p0))))'
[2024-06-12 18:10:40] [INFO ] Flatten gal took : 110 ms
[2024-06-12 18:10:40] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-06-12 18:10:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 883 places, 1346 transitions and 4699 arcs took 26 ms.
Total runtime 411331 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ASLink-PT-04a

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/416/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 883
TRANSITIONS: 1346
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.062s, Sys 0.000s]


SAVING FILE /home/mcc/execution/416/model (.net / .def) ...
EXPORT TIME: [User 0.011s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1477
MODEL NAME: /home/mcc/execution/416/model
883 places, 1346 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ASLink-PT-04a-LTLCardinality-04 CANNOT_COMPUTE
FORMULA ASLink-PT-04a-LTLCardinality-11 CANNOT_COMPUTE
FORMULA ASLink-PT-04a-LTLCardinality-12 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1718217279076

--------------------
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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-04a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is ASLink-PT-04a, 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 r003-smll-171620116900059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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