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.r179-tall-171640600900139.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 FlexibleBarrier-PT-20b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640600900139
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 08:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 13 08:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 08:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 13 08:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:45 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 1.5M 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 FlexibleBarrier-PT-20b-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-20b-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-20b-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-20b-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-20b-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-20b-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-20b-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-20b-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-20b-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-20b-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-20b-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-20b-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-20b-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-20b-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-20b-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-20b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716427202106

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-20b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 01:20:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 01:20:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 01:20:03] [INFO ] Load time of PNML (sax parser for PT used): 286 ms
[2024-05-23 01:20:03] [INFO ] Transformed 5372 places.
[2024-05-23 01:20:03] [INFO ] Transformed 6193 transitions.
[2024-05-23 01:20:03] [INFO ] Found NUPN structural information;
[2024-05-23 01:20:03] [INFO ] Parsed PT model containing 5372 places and 6193 transitions and 15575 arcs in 461 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA FlexibleBarrier-PT-20b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 13 out of 5372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5372/5372 places, 6193/6193 transitions.
Discarding 2269 places :
Symmetric choice reduction at 0 with 2269 rule applications. Total rules 2269 place count 3103 transition count 3924
Iterating global reduction 0 with 2269 rules applied. Total rules applied 4538 place count 3103 transition count 3924
Discarding 1083 places :
Symmetric choice reduction at 0 with 1083 rule applications. Total rules 5621 place count 2020 transition count 2841
Iterating global reduction 0 with 1083 rules applied. Total rules applied 6704 place count 2020 transition count 2841
Discarding 712 places :
Symmetric choice reduction at 0 with 712 rule applications. Total rules 7416 place count 1308 transition count 2129
Iterating global reduction 0 with 712 rules applied. Total rules applied 8128 place count 1308 transition count 2129
Ensure Unique test removed 352 transitions
Reduce isomorphic transitions removed 352 transitions.
Iterating post reduction 0 with 352 rules applied. Total rules applied 8480 place count 1308 transition count 1777
Applied a total of 8480 rules in 1294 ms. Remains 1308 /5372 variables (removed 4064) and now considering 1777/6193 (removed 4416) transitions.
// Phase 1: matrix 1777 rows 1308 cols
[2024-05-23 01:20:05] [INFO ] Computed 22 invariants in 61 ms
[2024-05-23 01:20:06] [INFO ] Implicit Places using invariants in 1004 ms returned []
[2024-05-23 01:20:06] [INFO ] Invariant cache hit.
[2024-05-23 01:20:07] [INFO ] Implicit Places using invariants and state equation in 1394 ms returned []
Implicit Place search using SMT with State Equation took 2573 ms to find 0 implicit places.
Running 1776 sub problems to find dead transitions.
[2024-05-23 01:20:07] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1307/3085 variables, and 0 constraints, problems are : Problem set: 0 solved, 1776 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1308 constraints, PredecessorRefiner: 1776/1776 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1776 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1307/3085 variables, and 0 constraints, problems are : Problem set: 0 solved, 1776 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1308 constraints, PredecessorRefiner: 0/1776 constraints, Known Traps: 0/0 constraints]
After SMT, in 63147ms problems are : Problem set: 0 solved, 1776 unsolved
Search for dead transitions found 0 dead transitions in 63182ms
Starting structural reductions in LTL mode, iteration 1 : 1308/5372 places, 1777/6193 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67080 ms. Remains : 1308/5372 places, 1777/6193 transitions.
Support contains 13 out of 1308 places after structural reductions.
[2024-05-23 01:21:11] [INFO ] Flatten gal took : 138 ms
[2024-05-23 01:21:11] [INFO ] Flatten gal took : 79 ms
[2024-05-23 01:21:11] [INFO ] Input system was already deterministic with 1777 transitions.
Support contains 11 out of 1308 places (down from 13) after GAL structural reductions.
RANDOM walk for 40000 steps (290 resets) in 1525 ms. (26 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40004 steps (24 resets) in 119 ms. (333 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (24 resets) in 122 ms. (325 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (22 resets) in 164 ms. (242 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (24 resets) in 152 ms. (261 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (24 resets) in 118 ms. (336 steps per ms) remains 5/5 properties
[2024-05-23 01:21:12] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 663/671 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 637/1308 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1308 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1777/3085 variables, 1308/1330 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3085 variables, 0/1330 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/3085 variables, 0/1330 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3085/3085 variables, and 1330 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1123 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 1308/1308 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 663/671 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-23 01:21:13] [INFO ] Deduced a trap composed of 408 places in 289 ms of which 41 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 637/1308 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1308 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1777/3085 variables, 1308/1331 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3085 variables, 5/1336 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3085 variables, 0/1336 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/3085 variables, 0/1336 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3085/3085 variables, and 1336 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1930 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 1308/1308 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 3079ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 3 properties in 968 ms.
Support contains 3 out of 1308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1308/1308 places, 1777/1777 transitions.
Graph (trivial) has 1241 edges and 1308 vertex of which 121 / 1308 are part of one of the 20 SCC in 5 ms
Free SCC test removed 101 places
Drop transitions (Empty/Sink Transition effects.) removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 1207 transition count 1558
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 1110 transition count 1558
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 195 place count 1110 transition count 1514
Deduced a syphon composed of 44 places in 2 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 283 place count 1066 transition count 1514
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 330 place count 1019 transition count 1467
Iterating global reduction 2 with 47 rules applied. Total rules applied 377 place count 1019 transition count 1467
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 381 place count 1019 transition count 1463
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 384 place count 1016 transition count 1460
Iterating global reduction 3 with 3 rules applied. Total rules applied 387 place count 1016 transition count 1460
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 389 place count 1016 transition count 1458
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 4 with 246 rules applied. Total rules applied 635 place count 893 transition count 1335
Drop transitions (Empty/Sink Transition effects.) removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 4 with 40 rules applied. Total rules applied 675 place count 893 transition count 1295
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 696 place count 872 transition count 1274
Iterating global reduction 5 with 21 rules applied. Total rules applied 717 place count 872 transition count 1274
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 719 place count 872 transition count 1272
Free-agglomeration rule applied 763 times.
Iterating global reduction 6 with 763 rules applied. Total rules applied 1482 place count 872 transition count 509
Reduce places removed 763 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 360 transitions
Reduce isomorphic transitions removed 360 transitions.
Graph (complete) has 296 edges and 109 vertex of which 24 are kept as prefixes of interest. Removing 85 places using SCC suffix rule.1 ms
Discarding 85 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 1124 rules applied. Total rules applied 2606 place count 24 transition count 149
Drop transitions (Empty/Sink Transition effects.) removed 119 transitions
Reduce isomorphic transitions removed 119 transitions.
Iterating post reduction 7 with 119 rules applied. Total rules applied 2725 place count 24 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 2726 place count 23 transition count 29
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t5.t522.t1325.t519.t520.t506 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 13 edges and 21 vertex of which 4 / 21 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 8 with 3 rules applied. Total rules applied 2729 place count 19 transition count 27
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 2733 place count 19 transition count 23
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 4 Pre rules applied. Total rules applied 2733 place count 19 transition count 19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 2741 place count 15 transition count 19
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 2744 place count 15 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 2748 place count 13 transition count 14
Free-agglomeration rule applied 3 times.
Iterating global reduction 11 with 3 rules applied. Total rules applied 2751 place count 13 transition count 11
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 2757 place count 9 transition count 9
Applied a total of 2757 rules in 652 ms. Remains 9 /1308 variables (removed 1299) and now considering 9/1777 (removed 1768) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 653 ms. Remains : 9/1308 places, 9/1777 transitions.
RANDOM walk for 31 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/2 properties
Computed a total of 22 stabilizing places and 22 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X(G((p0||G(p1))))))))'
Support contains 1 out of 1308 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1308/1308 places, 1777/1777 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1299 transition count 1768
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1299 transition count 1768
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 1299 transition count 1765
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 26 place count 1294 transition count 1760
Iterating global reduction 1 with 5 rules applied. Total rules applied 31 place count 1294 transition count 1760
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 34 place count 1294 transition count 1757
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 1292 transition count 1755
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 1292 transition count 1755
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 40 place count 1292 transition count 1753
Applied a total of 40 rules in 131 ms. Remains 1292 /1308 variables (removed 16) and now considering 1753/1777 (removed 24) transitions.
// Phase 1: matrix 1753 rows 1292 cols
[2024-05-23 01:21:17] [INFO ] Computed 22 invariants in 44 ms
[2024-05-23 01:21:17] [INFO ] Implicit Places using invariants in 517 ms returned []
[2024-05-23 01:21:17] [INFO ] Invariant cache hit.
[2024-05-23 01:21:19] [INFO ] Implicit Places using invariants and state equation in 1406 ms returned []
Implicit Place search using SMT with State Equation took 1931 ms to find 0 implicit places.
Running 1752 sub problems to find dead transitions.
[2024-05-23 01:21:19] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1291/3045 variables, and 0 constraints, problems are : Problem set: 0 solved, 1752 unsolved in 30078 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1292 constraints, PredecessorRefiner: 1752/1752 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1752 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1291/3045 variables, and 0 constraints, problems are : Problem set: 0 solved, 1752 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1292 constraints, PredecessorRefiner: 0/1752 constraints, Known Traps: 0/0 constraints]
After SMT, in 63014ms problems are : Problem set: 0 solved, 1752 unsolved
Search for dead transitions found 0 dead transitions in 63032ms
Starting structural reductions in LTL mode, iteration 1 : 1292/1308 places, 1753/1777 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65104 ms. Remains : 1292/1308 places, 1753/1777 transitions.
Stuttering acceptance computed with spot in 216 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 3445 steps with 24 reset in 34 ms.
FORMULA FlexibleBarrier-PT-20b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLCardinality-06 finished in 65425 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 1308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1308/1308 places, 1777/1777 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1298 transition count 1767
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1298 transition count 1767
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 1298 transition count 1763
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 1293 transition count 1758
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 1293 transition count 1758
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 36 place count 1293 transition count 1756
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 1291 transition count 1754
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 1291 transition count 1754
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 42 place count 1291 transition count 1752
Applied a total of 42 rules in 124 ms. Remains 1291 /1308 variables (removed 17) and now considering 1752/1777 (removed 25) transitions.
// Phase 1: matrix 1752 rows 1291 cols
[2024-05-23 01:22:22] [INFO ] Computed 22 invariants in 36 ms
[2024-05-23 01:22:23] [INFO ] Implicit Places using invariants in 531 ms returned []
[2024-05-23 01:22:23] [INFO ] Invariant cache hit.
[2024-05-23 01:22:24] [INFO ] Implicit Places using invariants and state equation in 1308 ms returned []
Implicit Place search using SMT with State Equation took 1842 ms to find 0 implicit places.
Running 1751 sub problems to find dead transitions.
[2024-05-23 01:22:24] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1290/3043 variables, and 0 constraints, problems are : Problem set: 0 solved, 1751 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1291 constraints, PredecessorRefiner: 1751/1751 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1751 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1290/3043 variables, and 0 constraints, problems are : Problem set: 0 solved, 1751 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1291 constraints, PredecessorRefiner: 0/1751 constraints, Known Traps: 0/0 constraints]
After SMT, in 63031ms problems are : Problem set: 0 solved, 1751 unsolved
Search for dead transitions found 0 dead transitions in 63051ms
Starting structural reductions in LTL mode, iteration 1 : 1291/1308 places, 1752/1777 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65022 ms. Remains : 1291/1308 places, 1752/1777 transitions.
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLCardinality-08
Product exploration explored 100000 steps with 729 reset in 329 ms.
Product exploration explored 100000 steps with 733 reset in 380 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 166 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (291 resets) in 173 ms. (229 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (23 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 370872 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 1
Probabilistic random walk after 370872 steps, saw 134275 distinct states, run finished after 3004 ms. (steps per millisecond=123 ) properties seen :0
[2024-05-23 01:23:32] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 66/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1224/1291 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1291 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1752/3043 variables, 1291/1313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3043 variables, 0/1313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3043 variables, 0/1313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3043/3043 variables, and 1313 constraints, problems are : Problem set: 0 solved, 1 unsolved in 561 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 1291/1291 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 66/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1224/1291 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1291 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1752/3043 variables, 1291/1313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3043 variables, 1/1314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3043 variables, 0/1314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/3043 variables, 0/1314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3043/3043 variables, and 1314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 608 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 1291/1291 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1195ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 146 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=146 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1291/1291 places, 1752/1752 transitions.
Applied a total of 0 rules in 30 ms. Remains 1291 /1291 variables (removed 0) and now considering 1752/1752 (removed 0) transitions.
[2024-05-23 01:23:33] [INFO ] Invariant cache hit.
[2024-05-23 01:23:34] [INFO ] Implicit Places using invariants in 512 ms returned []
[2024-05-23 01:23:34] [INFO ] Invariant cache hit.
[2024-05-23 01:23:35] [INFO ] Implicit Places using invariants and state equation in 1407 ms returned []
Implicit Place search using SMT with State Equation took 1935 ms to find 0 implicit places.
Running 1751 sub problems to find dead transitions.
[2024-05-23 01:23:35] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1290/3043 variables, and 0 constraints, problems are : Problem set: 0 solved, 1751 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1291 constraints, PredecessorRefiner: 1751/1751 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1751 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 1290/3043 variables, and 0 constraints, problems are : Problem set: 0 solved, 1751 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1291 constraints, PredecessorRefiner: 0/1751 constraints, Known Traps: 0/0 constraints]
After SMT, in 63135ms problems are : Problem set: 0 solved, 1751 unsolved
Search for dead transitions found 0 dead transitions in 63152ms
Finished structural reductions in LTL mode , in 1 iterations and 65122 ms. Remains : 1291/1291 places, 1752/1752 transitions.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (292 resets) in 244 ms. (163 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (23 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 380162 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :0 out of 1
Probabilistic random walk after 380162 steps, saw 136256 distinct states, run finished after 3003 ms. (steps per millisecond=126 ) properties seen :0
[2024-05-23 01:24:42] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 66/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1224/1291 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1291 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1752/3043 variables, 1291/1313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3043 variables, 0/1313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3043 variables, 0/1313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3043/3043 variables, and 1313 constraints, problems are : Problem set: 0 solved, 1 unsolved in 681 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 1291/1291 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 66/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1224/1291 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1291 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1752/3043 variables, 1291/1313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3043 variables, 1/1314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3043 variables, 0/1314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/3043 variables, 0/1314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3043/3043 variables, and 1314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 734 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 1291/1291 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1447ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 152 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=76 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 737 reset in 254 ms.
Product exploration explored 100000 steps with 732 reset in 278 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1291 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1291/1291 places, 1752/1752 transitions.
Graph (trivial) has 1228 edges and 1291 vertex of which 121 / 1291 are part of one of the 20 SCC in 4 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 1190 transition count 1650
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 59 Pre rules applied. Total rules applied 80 place count 1190 transition count 1650
Deduced a syphon composed of 138 places in 1 ms
Iterating global reduction 1 with 59 rules applied. Total rules applied 139 place count 1190 transition count 1650
Discarding 97 places :
Symmetric choice reduction at 1 with 97 rule applications. Total rules 236 place count 1093 transition count 1553
Deduced a syphon composed of 80 places in 1 ms
Iterating global reduction 1 with 97 rules applied. Total rules applied 333 place count 1093 transition count 1553
Performed 106 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 186 places in 1 ms
Iterating global reduction 1 with 106 rules applied. Total rules applied 439 place count 1093 transition count 1593
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 483 place count 1049 transition count 1549
Deduced a syphon composed of 142 places in 0 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 527 place count 1049 transition count 1549
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 162 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 547 place count 1049 transition count 1589
Deduced a syphon composed of 162 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 1 with 40 rules applied. Total rules applied 587 place count 1049 transition count 1549
Deduced a syphon composed of 162 places in 1 ms
Applied a total of 587 rules in 1245 ms. Remains 1049 /1291 variables (removed 242) and now considering 1549/1752 (removed 203) transitions.
[2024-05-23 01:24:46] [INFO ] Redundant transitions in 111 ms returned []
Running 1548 sub problems to find dead transitions.
[2024-05-23 01:24:46] [INFO ] Flow matrix only has 1510 transitions (discarded 39 similar events)
// Phase 1: matrix 1510 rows 1049 cols
[2024-05-23 01:24:46] [INFO ] Computed 22 invariants in 35 ms
[2024-05-23 01:24:46] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1048 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
SMT process timed out in 35621ms, After SMT, problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 35638ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1049/1291 places, 1549/1752 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37013 ms. Remains : 1049/1291 places, 1549/1752 transitions.
Support contains 1 out of 1291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1291/1291 places, 1752/1752 transitions.
Applied a total of 0 rules in 42 ms. Remains 1291 /1291 variables (removed 0) and now considering 1752/1752 (removed 0) transitions.
// Phase 1: matrix 1752 rows 1291 cols
[2024-05-23 01:25:22] [INFO ] Computed 22 invariants in 36 ms
[2024-05-23 01:25:22] [INFO ] Implicit Places using invariants in 499 ms returned []
[2024-05-23 01:25:22] [INFO ] Invariant cache hit.
[2024-05-23 01:25:23] [INFO ] Implicit Places using invariants and state equation in 1338 ms returned []
Implicit Place search using SMT with State Equation took 1840 ms to find 0 implicit places.
Running 1751 sub problems to find dead transitions.
[2024-05-23 01:25:23] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1290/3043 variables, and 0 constraints, problems are : Problem set: 0 solved, 1751 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1291 constraints, PredecessorRefiner: 1751/1751 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1751 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 1290/3043 variables, and 0 constraints, problems are : Problem set: 0 solved, 1751 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1291 constraints, PredecessorRefiner: 0/1751 constraints, Known Traps: 0/0 constraints]
After SMT, in 62749ms problems are : Problem set: 0 solved, 1751 unsolved
Search for dead transitions found 0 dead transitions in 62770ms
Finished structural reductions in LTL mode , in 1 iterations and 64657 ms. Remains : 1291/1291 places, 1752/1752 transitions.
Treatment of property FlexibleBarrier-PT-20b-LTLCardinality-08 finished in 244118 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1308 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1308/1308 places, 1777/1777 transitions.
Graph (trivial) has 1243 edges and 1308 vertex of which 121 / 1308 are part of one of the 20 SCC in 2 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 1206 transition count 1576
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 1108 transition count 1576
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 197 place count 1108 transition count 1532
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 285 place count 1064 transition count 1532
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 333 place count 1016 transition count 1484
Iterating global reduction 2 with 48 rules applied. Total rules applied 381 place count 1016 transition count 1484
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 385 place count 1016 transition count 1480
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 388 place count 1013 transition count 1477
Iterating global reduction 3 with 3 rules applied. Total rules applied 391 place count 1013 transition count 1477
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 393 place count 1013 transition count 1475
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 0 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 4 with 242 rules applied. Total rules applied 635 place count 892 transition count 1354
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 637 place count 890 transition count 1352
Iterating global reduction 4 with 2 rules applied. Total rules applied 639 place count 890 transition count 1352
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 641 place count 890 transition count 1350
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 661 place count 890 transition count 1330
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 663 place count 888 transition count 1328
Applied a total of 663 rules in 552 ms. Remains 888 /1308 variables (removed 420) and now considering 1328/1777 (removed 449) transitions.
[2024-05-23 01:26:27] [INFO ] Flow matrix only has 1289 transitions (discarded 39 similar events)
// Phase 1: matrix 1289 rows 888 cols
[2024-05-23 01:26:27] [INFO ] Computed 22 invariants in 28 ms
[2024-05-23 01:26:27] [INFO ] Implicit Places using invariants in 445 ms returned []
[2024-05-23 01:26:27] [INFO ] Flow matrix only has 1289 transitions (discarded 39 similar events)
[2024-05-23 01:26:27] [INFO ] Invariant cache hit.
[2024-05-23 01:26:28] [INFO ] Implicit Places using invariants and state equation in 942 ms returned []
Implicit Place search using SMT with State Equation took 1395 ms to find 0 implicit places.
[2024-05-23 01:26:28] [INFO ] Redundant transitions in 21 ms returned []
Running 545 sub problems to find dead transitions.
[2024-05-23 01:26:28] [INFO ] Flow matrix only has 1289 transitions (discarded 39 similar events)
[2024-05-23 01:26:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 2 (OVERLAPS) 20/888 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/888 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 4 (OVERLAPS) 1288/2176 variables, 888/910 constraints. Problems are: Problem set: 0 solved, 545 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2176/2177 variables, and 910 constraints, problems are : Problem set: 0 solved, 545 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 888/888 constraints, PredecessorRefiner: 545/545 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 545 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 2 (OVERLAPS) 20/888 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/888 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 4 (OVERLAPS) 1288/2176 variables, 888/910 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2176 variables, 545/1455 constraints. Problems are: Problem set: 0 solved, 545 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 2176/2177 variables, and 1455 constraints, problems are : Problem set: 0 solved, 545 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 888/888 constraints, PredecessorRefiner: 545/545 constraints, Known Traps: 0/0 constraints]
After SMT, in 60690ms problems are : Problem set: 0 solved, 545 unsolved
Search for dead transitions found 0 dead transitions in 60696ms
Starting structural reductions in SI_LTL mode, iteration 1 : 888/1308 places, 1328/1777 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62675 ms. Remains : 888/1308 places, 1328/1777 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLCardinality-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-20b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLCardinality-09 finished in 62744 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p1))))'
Support contains 4 out of 1308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1308/1308 places, 1777/1777 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1300 transition count 1769
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1300 transition count 1769
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 1300 transition count 1766
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 1296 transition count 1762
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 1296 transition count 1762
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 1296 transition count 1761
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 1294 transition count 1759
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 1294 transition count 1759
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 1294 transition count 1757
Applied a total of 34 rules in 132 ms. Remains 1294 /1308 variables (removed 14) and now considering 1757/1777 (removed 20) transitions.
// Phase 1: matrix 1757 rows 1294 cols
[2024-05-23 01:27:29] [INFO ] Computed 22 invariants in 32 ms
[2024-05-23 01:27:30] [INFO ] Implicit Places using invariants in 481 ms returned []
[2024-05-23 01:27:30] [INFO ] Invariant cache hit.
[2024-05-23 01:27:31] [INFO ] Implicit Places using invariants and state equation in 1257 ms returned []
Implicit Place search using SMT with State Equation took 1740 ms to find 0 implicit places.
Running 1756 sub problems to find dead transitions.
[2024-05-23 01:27:31] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1293/3051 variables, and 0 constraints, problems are : Problem set: 0 solved, 1756 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1294 constraints, PredecessorRefiner: 1756/1756 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1756 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1293 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1756 unsolved
At refinement iteration 1 (OVERLAPS) 1/1294 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 1756 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 1294/3051 variables, and 22 constraints, problems are : Problem set: 0 solved, 1756 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/1294 constraints, PredecessorRefiner: 0/1756 constraints, Known Traps: 0/0 constraints]
After SMT, in 62828ms problems are : Problem set: 0 solved, 1756 unsolved
Search for dead transitions found 0 dead transitions in 62849ms
Starting structural reductions in LTL mode, iteration 1 : 1294/1308 places, 1757/1777 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64726 ms. Remains : 1294/1308 places, 1757/1777 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLCardinality-11
Stuttering criterion allowed to conclude after 137 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-20b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLCardinality-11 finished in 64857 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1308 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1308/1308 places, 1777/1777 transitions.
Graph (trivial) has 1243 edges and 1308 vertex of which 121 / 1308 are part of one of the 20 SCC in 1 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 1206 transition count 1576
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 1108 transition count 1576
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 197 place count 1108 transition count 1532
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 285 place count 1064 transition count 1532
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 332 place count 1017 transition count 1485
Iterating global reduction 2 with 47 rules applied. Total rules applied 379 place count 1017 transition count 1485
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 382 place count 1017 transition count 1482
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 385 place count 1014 transition count 1479
Iterating global reduction 3 with 3 rules applied. Total rules applied 388 place count 1014 transition count 1479
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 390 place count 1014 transition count 1477
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 4 with 244 rules applied. Total rules applied 634 place count 892 transition count 1355
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 636 place count 890 transition count 1353
Iterating global reduction 4 with 2 rules applied. Total rules applied 638 place count 890 transition count 1353
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 640 place count 890 transition count 1351
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 660 place count 890 transition count 1331
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 662 place count 888 transition count 1329
Applied a total of 662 rules in 389 ms. Remains 888 /1308 variables (removed 420) and now considering 1329/1777 (removed 448) transitions.
[2024-05-23 01:28:34] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
// Phase 1: matrix 1290 rows 888 cols
[2024-05-23 01:28:34] [INFO ] Computed 22 invariants in 37 ms
[2024-05-23 01:28:35] [INFO ] Implicit Places using invariants in 462 ms returned []
[2024-05-23 01:28:35] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2024-05-23 01:28:35] [INFO ] Invariant cache hit.
[2024-05-23 01:28:36] [INFO ] Implicit Places using invariants and state equation in 916 ms returned []
Implicit Place search using SMT with State Equation took 1381 ms to find 0 implicit places.
[2024-05-23 01:28:36] [INFO ] Redundant transitions in 13 ms returned []
Running 545 sub problems to find dead transitions.
[2024-05-23 01:28:36] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2024-05-23 01:28:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 2 (OVERLAPS) 20/888 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/888 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 4 (OVERLAPS) 1289/2177 variables, 888/910 constraints. Problems are: Problem set: 0 solved, 545 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2177/2178 variables, and 910 constraints, problems are : Problem set: 0 solved, 545 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 888/888 constraints, PredecessorRefiner: 545/545 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 545 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 2 (OVERLAPS) 20/888 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/888 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 4 (OVERLAPS) 1289/2177 variables, 888/910 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2177 variables, 545/1455 constraints. Problems are: Problem set: 0 solved, 545 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2177/2178 variables, and 1455 constraints, problems are : Problem set: 0 solved, 545 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 888/888 constraints, PredecessorRefiner: 545/545 constraints, Known Traps: 0/0 constraints]
After SMT, in 60773ms problems are : Problem set: 0 solved, 545 unsolved
Search for dead transitions found 0 dead transitions in 60781ms
Starting structural reductions in SI_LTL mode, iteration 1 : 888/1308 places, 1329/1777 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62572 ms. Remains : 888/1308 places, 1329/1777 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLCardinality-12
Product exploration explored 100000 steps with 3789 reset in 1345 ms.
Product exploration explored 100000 steps with 3785 reset in 1207 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 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 p0), (NOT p0)]
RANDOM walk for 40000 steps (1541 resets) in 974 ms. (41 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 488717 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :0 out of 1
Probabilistic random walk after 488717 steps, saw 122272 distinct states, run finished after 3001 ms. (steps per millisecond=162 ) properties seen :0
[2024-05-23 01:29:43] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2024-05-23 01:29:43] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 133/188 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1231/1419 variables, 147/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1419 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1419 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 686/2105 variables, 19/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2105 variables, 614/838 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2105 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 72/2177 variables, 72/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2177 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2177 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2177/2178 variables, and 910 constraints, problems are : Problem set: 0 solved, 1 unsolved in 418 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 888/888 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 133/188 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1231/1419 variables, 147/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1419 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1419 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1419 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 686/2105 variables, 19/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2105 variables, 614/839 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2105 variables, 0/839 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 72/2177 variables, 72/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2177 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2177 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2177/2178 variables, and 911 constraints, problems are : Problem set: 0 solved, 1 unsolved in 452 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 888/888 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 896ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 29 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=14 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 109 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 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 888 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 888/888 places, 1329/1329 transitions.
Applied a total of 0 rules in 80 ms. Remains 888 /888 variables (removed 0) and now considering 1329/1329 (removed 0) transitions.
[2024-05-23 01:29:44] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2024-05-23 01:29:44] [INFO ] Invariant cache hit.
[2024-05-23 01:29:45] [INFO ] Implicit Places using invariants in 398 ms returned []
[2024-05-23 01:29:45] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2024-05-23 01:29:45] [INFO ] Invariant cache hit.
[2024-05-23 01:29:45] [INFO ] Implicit Places using invariants and state equation in 864 ms returned []
Implicit Place search using SMT with State Equation took 1265 ms to find 0 implicit places.
[2024-05-23 01:29:45] [INFO ] Redundant transitions in 13 ms returned []
Running 545 sub problems to find dead transitions.
[2024-05-23 01:29:45] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2024-05-23 01:29:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 2 (OVERLAPS) 20/888 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/888 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 4 (OVERLAPS) 1289/2177 variables, 888/910 constraints. Problems are: Problem set: 0 solved, 545 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2177/2178 variables, and 910 constraints, problems are : Problem set: 0 solved, 545 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 888/888 constraints, PredecessorRefiner: 545/545 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 545 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 2 (OVERLAPS) 20/888 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/888 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 4 (OVERLAPS) 1289/2177 variables, 888/910 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2177 variables, 545/1455 constraints. Problems are: Problem set: 0 solved, 545 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2177/2178 variables, and 1455 constraints, problems are : Problem set: 0 solved, 545 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 888/888 constraints, PredecessorRefiner: 545/545 constraints, Known Traps: 0/0 constraints]
After SMT, in 60821ms problems are : Problem set: 0 solved, 545 unsolved
Search for dead transitions found 0 dead transitions in 60828ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62194 ms. Remains : 888/888 places, 1329/1329 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 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 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1539 resets) in 965 ms. (41 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 502200 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :0 out of 1
Probabilistic random walk after 502200 steps, saw 124342 distinct states, run finished after 3001 ms. (steps per millisecond=167 ) properties seen :0
[2024-05-23 01:30:50] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2024-05-23 01:30:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 133/188 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1231/1419 variables, 147/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1419 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1419 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 686/2105 variables, 19/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2105 variables, 614/838 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2105 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 72/2177 variables, 72/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2177 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2177 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2177/2178 variables, and 910 constraints, problems are : Problem set: 0 solved, 1 unsolved in 466 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 888/888 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 133/188 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1231/1419 variables, 147/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1419 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1419 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1419 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 686/2105 variables, 19/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2105 variables, 614/839 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2105 variables, 0/839 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 72/2177 variables, 72/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2177 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2177 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2177/2178 variables, and 911 constraints, problems are : Problem set: 0 solved, 1 unsolved in 437 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 888/888 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 936ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 32 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 91 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 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3792 reset in 1242 ms.
Product exploration explored 100000 steps with 3785 reset in 1291 ms.
Support contains 2 out of 888 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 888/888 places, 1329/1329 transitions.
Applied a total of 0 rules in 77 ms. Remains 888 /888 variables (removed 0) and now considering 1329/1329 (removed 0) transitions.
[2024-05-23 01:30:54] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2024-05-23 01:30:54] [INFO ] Invariant cache hit.
[2024-05-23 01:30:54] [INFO ] Implicit Places using invariants in 499 ms returned []
[2024-05-23 01:30:54] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2024-05-23 01:30:54] [INFO ] Invariant cache hit.
[2024-05-23 01:30:55] [INFO ] Implicit Places using invariants and state equation in 894 ms returned []
Implicit Place search using SMT with State Equation took 1412 ms to find 0 implicit places.
[2024-05-23 01:30:55] [INFO ] Redundant transitions in 12 ms returned []
Running 545 sub problems to find dead transitions.
[2024-05-23 01:30:55] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2024-05-23 01:30:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 2 (OVERLAPS) 20/888 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/888 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 4 (OVERLAPS) 1289/2177 variables, 888/910 constraints. Problems are: Problem set: 0 solved, 545 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2177/2178 variables, and 910 constraints, problems are : Problem set: 0 solved, 545 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 888/888 constraints, PredecessorRefiner: 545/545 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 545 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 2 (OVERLAPS) 20/888 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/888 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 4 (OVERLAPS) 1289/2177 variables, 888/910 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2177 variables, 545/1455 constraints. Problems are: Problem set: 0 solved, 545 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2177/2178 variables, and 1455 constraints, problems are : Problem set: 0 solved, 545 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 888/888 constraints, PredecessorRefiner: 545/545 constraints, Known Traps: 0/0 constraints]
After SMT, in 60685ms problems are : Problem set: 0 solved, 545 unsolved
Search for dead transitions found 0 dead transitions in 60691ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62201 ms. Remains : 888/888 places, 1329/1329 transitions.
Treatment of property FlexibleBarrier-PT-20b-LTLCardinality-12 finished in 202048 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : FlexibleBarrier-PT-20b-LTLCardinality-08
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1308 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1308/1308 places, 1777/1777 transitions.
Graph (trivial) has 1245 edges and 1308 vertex of which 121 / 1308 are part of one of the 20 SCC in 1 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 100 place count 1206 transition count 1575
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 199 place count 1107 transition count 1575
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 199 place count 1107 transition count 1530
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 289 place count 1062 transition count 1530
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 337 place count 1014 transition count 1482
Iterating global reduction 2 with 48 rules applied. Total rules applied 385 place count 1014 transition count 1482
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 389 place count 1014 transition count 1478
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 392 place count 1011 transition count 1475
Iterating global reduction 3 with 3 rules applied. Total rules applied 395 place count 1011 transition count 1475
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 398 place count 1011 transition count 1472
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 4 with 244 rules applied. Total rules applied 642 place count 889 transition count 1350
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 643 place count 888 transition count 1349
Iterating global reduction 4 with 1 rules applied. Total rules applied 644 place count 888 transition count 1349
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 645 place count 888 transition count 1348
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 665 place count 888 transition count 1328
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 667 place count 886 transition count 1326
Applied a total of 667 rules in 306 ms. Remains 886 /1308 variables (removed 422) and now considering 1326/1777 (removed 451) transitions.
[2024-05-23 01:31:57] [INFO ] Flow matrix only has 1287 transitions (discarded 39 similar events)
// Phase 1: matrix 1287 rows 886 cols
[2024-05-23 01:31:57] [INFO ] Computed 22 invariants in 25 ms
[2024-05-23 01:31:57] [INFO ] Implicit Places using invariants in 516 ms returned []
[2024-05-23 01:31:57] [INFO ] Flow matrix only has 1287 transitions (discarded 39 similar events)
[2024-05-23 01:31:57] [INFO ] Invariant cache hit.
[2024-05-23 01:31:58] [INFO ] Implicit Places using invariants and state equation in 871 ms returned []
Implicit Place search using SMT with State Equation took 1410 ms to find 0 implicit places.
Running 543 sub problems to find dead transitions.
[2024-05-23 01:31:58] [INFO ] Flow matrix only has 1287 transitions (discarded 39 similar events)
[2024-05-23 01:31:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/866 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/866 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 2 (OVERLAPS) 20/886 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/886 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 4 (OVERLAPS) 1286/2172 variables, 886/908 constraints. Problems are: Problem set: 0 solved, 543 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2172/2173 variables, and 908 constraints, problems are : Problem set: 0 solved, 543 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 886/886 constraints, PredecessorRefiner: 543/543 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 543 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/866 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/866 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 2 (OVERLAPS) 20/886 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/886 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 4 (OVERLAPS) 1286/2172 variables, 886/908 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2172 variables, 543/1451 constraints. Problems are: Problem set: 0 solved, 543 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2172/2173 variables, and 1451 constraints, problems are : Problem set: 0 solved, 543 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 886/886 constraints, PredecessorRefiner: 543/543 constraints, Known Traps: 0/0 constraints]
After SMT, in 60700ms problems are : Problem set: 0 solved, 543 unsolved
Search for dead transitions found 0 dead transitions in 60706ms
Starting structural reductions in LI_LTL mode, iteration 1 : 886/1308 places, 1326/1777 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 62440 ms. Remains : 886/1308 places, 1326/1777 transitions.
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLCardinality-08
Product exploration explored 100000 steps with 3785 reset in 1339 ms.
Product exploration explored 100000 steps with 3773 reset in 1261 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1547 resets) in 871 ms. (45 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 518129 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :0 out of 1
Probabilistic random walk after 518129 steps, saw 126575 distinct states, run finished after 3001 ms. (steps per millisecond=172 ) properties seen :0
[2024-05-23 01:33:05] [INFO ] Flow matrix only has 1287 transitions (discarded 39 similar events)
[2024-05-23 01:33:05] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 68/96 variables, 28/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1238/1334 variables, 96/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1334 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1334 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 762/2096 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2096 variables, 686/832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2096 variables, 0/832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 76/2172 variables, 76/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2172 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2172 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2172/2173 variables, and 908 constraints, problems are : Problem set: 0 solved, 1 unsolved in 378 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 886/886 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 68/96 variables, 28/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1238/1334 variables, 96/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1334 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1334 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1334 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 762/2096 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2096 variables, 686/833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2096 variables, 0/833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 76/2172 variables, 76/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2172 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2172 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2172/2173 variables, and 909 constraints, problems are : Problem set: 0 solved, 1 unsolved in 429 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 886/886 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 842ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 15 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 886 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 886/886 places, 1326/1326 transitions.
Applied a total of 0 rules in 18 ms. Remains 886 /886 variables (removed 0) and now considering 1326/1326 (removed 0) transitions.
[2024-05-23 01:33:06] [INFO ] Flow matrix only has 1287 transitions (discarded 39 similar events)
[2024-05-23 01:33:06] [INFO ] Invariant cache hit.
[2024-05-23 01:33:07] [INFO ] Implicit Places using invariants in 451 ms returned []
[2024-05-23 01:33:07] [INFO ] Flow matrix only has 1287 transitions (discarded 39 similar events)
[2024-05-23 01:33:07] [INFO ] Invariant cache hit.
[2024-05-23 01:33:07] [INFO ] Implicit Places using invariants and state equation in 881 ms returned []
Implicit Place search using SMT with State Equation took 1362 ms to find 0 implicit places.
Running 543 sub problems to find dead transitions.
[2024-05-23 01:33:07] [INFO ] Flow matrix only has 1287 transitions (discarded 39 similar events)
[2024-05-23 01:33:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/866 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/866 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 2 (OVERLAPS) 20/886 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/886 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 4 (OVERLAPS) 1286/2172 variables, 886/908 constraints. Problems are: Problem set: 0 solved, 543 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2172/2173 variables, and 908 constraints, problems are : Problem set: 0 solved, 543 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 886/886 constraints, PredecessorRefiner: 543/543 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 543 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/866 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/866 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 2 (OVERLAPS) 20/886 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/886 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 4 (OVERLAPS) 1286/2172 variables, 886/908 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2172 variables, 543/1451 constraints. Problems are: Problem set: 0 solved, 543 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2172/2173 variables, and 1451 constraints, problems are : Problem set: 0 solved, 543 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 886/886 constraints, PredecessorRefiner: 543/543 constraints, Known Traps: 0/0 constraints]
After SMT, in 60817ms problems are : Problem set: 0 solved, 543 unsolved
Search for dead transitions found 0 dead transitions in 60825ms
Finished structural reductions in LTL mode , in 1 iterations and 62207 ms. Remains : 886/886 places, 1326/1326 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1527 resets) in 920 ms. (43 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 511182 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :0 out of 1
Probabilistic random walk after 511182 steps, saw 124672 distinct states, run finished after 3001 ms. (steps per millisecond=170 ) properties seen :0
[2024-05-23 01:34:12] [INFO ] Flow matrix only has 1287 transitions (discarded 39 similar events)
[2024-05-23 01:34:12] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 68/96 variables, 28/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1238/1334 variables, 96/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1334 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1334 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 762/2096 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2096 variables, 686/832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2096 variables, 0/832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 76/2172 variables, 76/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2172 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2172 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2172/2173 variables, and 908 constraints, problems are : Problem set: 0 solved, 1 unsolved in 398 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 886/886 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 68/96 variables, 28/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1238/1334 variables, 96/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1334 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1334 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1334 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 762/2096 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2096 variables, 686/833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2096 variables, 0/833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 76/2172 variables, 76/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2172 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2172 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2172/2173 variables, and 909 constraints, problems are : Problem set: 0 solved, 1 unsolved in 418 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 886/886 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 840ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 22 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3777 reset in 1233 ms.
Product exploration explored 100000 steps with 3776 reset in 1247 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 886 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 886/886 places, 1326/1326 transitions.
Applied a total of 0 rules in 72 ms. Remains 886 /886 variables (removed 0) and now considering 1326/1326 (removed 0) transitions.
[2024-05-23 01:34:16] [INFO ] Redundant transitions in 19 ms returned []
Running 543 sub problems to find dead transitions.
[2024-05-23 01:34:16] [INFO ] Flow matrix only has 1287 transitions (discarded 39 similar events)
[2024-05-23 01:34:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/866 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/866 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 2 (OVERLAPS) 20/886 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/886 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 4 (OVERLAPS) 1286/2172 variables, 886/908 constraints. Problems are: Problem set: 0 solved, 543 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2172/2173 variables, and 908 constraints, problems are : Problem set: 0 solved, 543 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 886/886 constraints, PredecessorRefiner: 543/543 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 543 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/866 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/866 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 2 (OVERLAPS) 20/886 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/886 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 4 (OVERLAPS) 1286/2172 variables, 886/908 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2172 variables, 543/1451 constraints. Problems are: Problem set: 0 solved, 543 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2172/2173 variables, and 1451 constraints, problems are : Problem set: 0 solved, 543 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 886/886 constraints, PredecessorRefiner: 543/543 constraints, Known Traps: 0/0 constraints]
After SMT, in 60747ms problems are : Problem set: 0 solved, 543 unsolved
Search for dead transitions found 0 dead transitions in 60752ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60850 ms. Remains : 886/886 places, 1326/1326 transitions.
Support contains 1 out of 886 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 886/886 places, 1326/1326 transitions.
Applied a total of 0 rules in 15 ms. Remains 886 /886 variables (removed 0) and now considering 1326/1326 (removed 0) transitions.
[2024-05-23 01:35:17] [INFO ] Flow matrix only has 1287 transitions (discarded 39 similar events)
[2024-05-23 01:35:17] [INFO ] Invariant cache hit.
[2024-05-23 01:35:17] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-05-23 01:35:17] [INFO ] Flow matrix only has 1287 transitions (discarded 39 similar events)
[2024-05-23 01:35:17] [INFO ] Invariant cache hit.
[2024-05-23 01:35:18] [INFO ] Implicit Places using invariants and state equation in 875 ms returned []
Implicit Place search using SMT with State Equation took 1315 ms to find 0 implicit places.
Running 543 sub problems to find dead transitions.
[2024-05-23 01:35:18] [INFO ] Flow matrix only has 1287 transitions (discarded 39 similar events)
[2024-05-23 01:35:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/866 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/866 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 2 (OVERLAPS) 20/886 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/886 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 4 (OVERLAPS) 1286/2172 variables, 886/908 constraints. Problems are: Problem set: 0 solved, 543 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2172/2173 variables, and 908 constraints, problems are : Problem set: 0 solved, 543 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 886/886 constraints, PredecessorRefiner: 543/543 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 543 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/866 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/866 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 2 (OVERLAPS) 20/886 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/886 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 4 (OVERLAPS) 1286/2172 variables, 886/908 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2172 variables, 543/1451 constraints. Problems are: Problem set: 0 solved, 543 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2172/2173 variables, and 1451 constraints, problems are : Problem set: 0 solved, 543 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 886/886 constraints, PredecessorRefiner: 543/543 constraints, Known Traps: 0/0 constraints]
After SMT, in 60702ms problems are : Problem set: 0 solved, 543 unsolved
Search for dead transitions found 0 dead transitions in 60707ms
Finished structural reductions in LTL mode , in 1 iterations and 62040 ms. Remains : 886/886 places, 1326/1326 transitions.
Treatment of property FlexibleBarrier-PT-20b-LTLCardinality-08 finished in 262886 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-23 01:36:19] [INFO ] Flatten gal took : 58 ms
[2024-05-23 01:36:19] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-23 01:36:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1308 places, 1777 transitions and 5335 arcs took 11 ms.
Total runtime 976269 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FlexibleBarrier-PT-20b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1308
TRANSITIONS: 1777
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.030s, Sys 0.003s]


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.004s]


----------------------------------------------------------------------
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: 1285
MODEL NAME: /home/mcc/execution/414/model
1308 places, 1777 transitions.

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.

BK_TIME_CONFINEMENT_REACHED

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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

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="FlexibleBarrier-PT-20b"
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 FlexibleBarrier-PT-20b, 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 r179-tall-171640600900139"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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