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.r399-tall-171690529600115.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 StigmergyCommit-PT-03b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690529600115
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 17:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 11 17:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 17:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 11 17:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 359K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME StigmergyCommit-PT-03b-LTLCardinality-00
FORMULA_NAME StigmergyCommit-PT-03b-LTLCardinality-01
FORMULA_NAME StigmergyCommit-PT-03b-LTLCardinality-02
FORMULA_NAME StigmergyCommit-PT-03b-LTLCardinality-03
FORMULA_NAME StigmergyCommit-PT-03b-LTLCardinality-04
FORMULA_NAME StigmergyCommit-PT-03b-LTLCardinality-05
FORMULA_NAME StigmergyCommit-PT-03b-LTLCardinality-06
FORMULA_NAME StigmergyCommit-PT-03b-LTLCardinality-07
FORMULA_NAME StigmergyCommit-PT-03b-LTLCardinality-08
FORMULA_NAME StigmergyCommit-PT-03b-LTLCardinality-09
FORMULA_NAME StigmergyCommit-PT-03b-LTLCardinality-10
FORMULA_NAME StigmergyCommit-PT-03b-LTLCardinality-11
FORMULA_NAME StigmergyCommit-PT-03b-LTLCardinality-12
FORMULA_NAME StigmergyCommit-PT-03b-LTLCardinality-13
FORMULA_NAME StigmergyCommit-PT-03b-LTLCardinality-14
FORMULA_NAME StigmergyCommit-PT-03b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716986625182

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-03b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 12:43:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 12:43:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 12:43:46] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2024-05-29 12:43:46] [INFO ] Transformed 1231 places.
[2024-05-29 12:43:46] [INFO ] Transformed 1476 transitions.
[2024-05-29 12:43:46] [INFO ] Found NUPN structural information;
[2024-05-29 12:43:46] [INFO ] Parsed PT model containing 1231 places and 1476 transitions and 4168 arcs in 235 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA StigmergyCommit-PT-03b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03b-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 1231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1231/1231 places, 1476/1476 transitions.
Discarding 97 places :
Symmetric choice reduction at 0 with 97 rule applications. Total rules 97 place count 1134 transition count 1379
Iterating global reduction 0 with 97 rules applied. Total rules applied 194 place count 1134 transition count 1379
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 253 place count 1075 transition count 1320
Iterating global reduction 0 with 59 rules applied. Total rules applied 312 place count 1075 transition count 1320
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 346 place count 1041 transition count 1286
Iterating global reduction 0 with 34 rules applied. Total rules applied 380 place count 1041 transition count 1286
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 411 place count 1010 transition count 1255
Iterating global reduction 0 with 31 rules applied. Total rules applied 442 place count 1010 transition count 1255
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 469 place count 983 transition count 1228
Iterating global reduction 0 with 27 rules applied. Total rules applied 496 place count 983 transition count 1228
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 523 place count 956 transition count 1201
Iterating global reduction 0 with 27 rules applied. Total rules applied 550 place count 956 transition count 1201
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 577 place count 929 transition count 1174
Iterating global reduction 0 with 27 rules applied. Total rules applied 604 place count 929 transition count 1174
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 631 place count 902 transition count 1147
Iterating global reduction 0 with 27 rules applied. Total rules applied 658 place count 902 transition count 1147
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 680 place count 880 transition count 1125
Iterating global reduction 0 with 22 rules applied. Total rules applied 702 place count 880 transition count 1125
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 720 place count 862 transition count 1107
Iterating global reduction 0 with 18 rules applied. Total rules applied 738 place count 862 transition count 1107
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 742 place count 862 transition count 1103
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 750 place count 854 transition count 1095
Iterating global reduction 1 with 8 rules applied. Total rules applied 758 place count 854 transition count 1095
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 766 place count 846 transition count 1087
Iterating global reduction 1 with 8 rules applied. Total rules applied 774 place count 846 transition count 1087
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 778 place count 842 transition count 1083
Iterating global reduction 1 with 4 rules applied. Total rules applied 782 place count 842 transition count 1083
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 786 place count 838 transition count 1079
Iterating global reduction 1 with 4 rules applied. Total rules applied 790 place count 838 transition count 1079
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 794 place count 834 transition count 1075
Iterating global reduction 1 with 4 rules applied. Total rules applied 798 place count 834 transition count 1075
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 802 place count 830 transition count 1071
Iterating global reduction 1 with 4 rules applied. Total rules applied 806 place count 830 transition count 1071
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 810 place count 826 transition count 1067
Iterating global reduction 1 with 4 rules applied. Total rules applied 814 place count 826 transition count 1067
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 818 place count 822 transition count 1063
Iterating global reduction 1 with 4 rules applied. Total rules applied 822 place count 822 transition count 1063
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 826 place count 818 transition count 1059
Iterating global reduction 1 with 4 rules applied. Total rules applied 830 place count 818 transition count 1059
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 834 place count 814 transition count 1055
Iterating global reduction 1 with 4 rules applied. Total rules applied 838 place count 814 transition count 1055
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 842 place count 810 transition count 1051
Iterating global reduction 1 with 4 rules applied. Total rules applied 846 place count 810 transition count 1051
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 850 place count 806 transition count 1047
Iterating global reduction 1 with 4 rules applied. Total rules applied 854 place count 806 transition count 1047
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 858 place count 806 transition count 1043
Applied a total of 858 rules in 1137 ms. Remains 806 /1231 variables (removed 425) and now considering 1043/1476 (removed 433) transitions.
// Phase 1: matrix 1043 rows 806 cols
[2024-05-29 12:43:47] [INFO ] Computed 5 invariants in 27 ms
[2024-05-29 12:43:48] [INFO ] Implicit Places using invariants in 649 ms returned []
[2024-05-29 12:43:48] [INFO ] Invariant cache hit.
[2024-05-29 12:43:49] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 1212 ms to find 0 implicit places.
Running 1042 sub problems to find dead transitions.
[2024-05-29 12:43:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/805 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
At refinement iteration 1 (OVERLAPS) 1/806 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
[2024-05-29 12:44:13] [INFO ] Deduced a trap composed of 292 places in 332 ms of which 41 ms to minimize.
[2024-05-29 12:44:13] [INFO ] Deduced a trap composed of 299 places in 289 ms of which 5 ms to minimize.
[2024-05-29 12:44:14] [INFO ] Deduced a trap composed of 300 places in 218 ms of which 5 ms to minimize.
[2024-05-29 12:44:14] [INFO ] Deduced a trap composed of 301 places in 181 ms of which 4 ms to minimize.
[2024-05-29 12:44:14] [INFO ] Deduced a trap composed of 299 places in 220 ms of which 4 ms to minimize.
[2024-05-29 12:44:14] [INFO ] Deduced a trap composed of 294 places in 221 ms of which 4 ms to minimize.
[2024-05-29 12:44:15] [INFO ] Deduced a trap composed of 300 places in 160 ms of which 4 ms to minimize.
[2024-05-29 12:44:16] [INFO ] Deduced a trap composed of 293 places in 246 ms of which 5 ms to minimize.
[2024-05-29 12:44:16] [INFO ] Deduced a trap composed of 297 places in 220 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/1849 variables, and 14 constraints, problems are : Problem set: 0 solved, 1042 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/806 constraints, PredecessorRefiner: 1042/1042 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1042 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/805 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
At refinement iteration 1 (OVERLAPS) 1/806 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/806 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
[2024-05-29 12:44:34] [INFO ] Deduced a trap composed of 305 places in 180 ms of which 4 ms to minimize.
[2024-05-29 12:44:34] [INFO ] Deduced a trap composed of 303 places in 166 ms of which 3 ms to minimize.
[2024-05-29 12:44:35] [INFO ] Deduced a trap composed of 297 places in 228 ms of which 4 ms to minimize.
[2024-05-29 12:44:36] [INFO ] Deduced a trap composed of 291 places in 213 ms of which 4 ms to minimize.
[2024-05-29 12:44:36] [INFO ] Deduced a trap composed of 292 places in 173 ms of which 3 ms to minimize.
[2024-05-29 12:44:37] [INFO ] Deduced a trap composed of 293 places in 222 ms of which 4 ms to minimize.
[2024-05-29 12:44:38] [INFO ] Deduced a trap composed of 299 places in 190 ms of which 4 ms to minimize.
[2024-05-29 12:44:38] [INFO ] Deduced a trap composed of 305 places in 231 ms of which 5 ms to minimize.
[2024-05-29 12:44:39] [INFO ] Deduced a trap composed of 300 places in 196 ms of which 3 ms to minimize.
[2024-05-29 12:44:40] [INFO ] Deduced a trap composed of 293 places in 195 ms of which 3 ms to minimize.
[2024-05-29 12:44:41] [INFO ] Deduced a trap composed of 293 places in 178 ms of which 6 ms to minimize.
[2024-05-29 12:44:42] [INFO ] Deduced a trap composed of 299 places in 196 ms of which 4 ms to minimize.
[2024-05-29 12:44:43] [INFO ] Deduced a trap composed of 305 places in 183 ms of which 3 ms to minimize.
[2024-05-29 12:44:49] [INFO ] Deduced a trap composed of 300 places in 195 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/1849 variables, and 28 constraints, problems are : Problem set: 0 solved, 1042 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/806 constraints, PredecessorRefiner: 0/1042 constraints, Known Traps: 23/23 constraints]
After SMT, in 60582ms problems are : Problem set: 0 solved, 1042 unsolved
Search for dead transitions found 0 dead transitions in 60611ms
Starting structural reductions in LTL mode, iteration 1 : 806/1231 places, 1043/1476 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62989 ms. Remains : 806/1231 places, 1043/1476 transitions.
Support contains 21 out of 806 places after structural reductions.
[2024-05-29 12:44:50] [INFO ] Flatten gal took : 104 ms
[2024-05-29 12:44:50] [INFO ] Flatten gal took : 52 ms
[2024-05-29 12:44:50] [INFO ] Input system was already deterministic with 1043 transitions.
RANDOM walk for 40000 steps (506 resets) in 1737 ms. (23 steps per ms) remains 8/13 properties
BEST_FIRST walk for 40003 steps (109 resets) in 180 ms. (221 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (107 resets) in 203 ms. (196 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (109 resets) in 113 ms. (350 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (111 resets) in 115 ms. (344 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (108 resets) in 74 ms. (533 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (106 resets) in 105 ms. (377 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (109 resets) in 92 ms. (430 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (105 resets) in 79 ms. (500 steps per ms) remains 8/8 properties
[2024-05-29 12:44:51] [INFO ] Invariant cache hit.
Problem AtomicPropp7 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 586/598 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 208/806 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/806 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1043/1849 variables, 806/811 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1849 variables, 0/811 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/1849 variables, 0/811 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1849/1849 variables, and 811 constraints, problems are : Problem set: 1 solved, 7 unsolved in 997 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 806/806 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 588/598 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-29 12:44:52] [INFO ] Deduced a trap composed of 300 places in 192 ms of which 3 ms to minimize.
[2024-05-29 12:44:52] [INFO ] Deduced a trap composed of 292 places in 157 ms of which 3 ms to minimize.
[2024-05-29 12:44:52] [INFO ] Deduced a trap composed of 305 places in 183 ms of which 3 ms to minimize.
[2024-05-29 12:44:53] [INFO ] Deduced a trap composed of 297 places in 189 ms of which 3 ms to minimize.
[2024-05-29 12:44:53] [INFO ] Deduced a trap composed of 305 places in 157 ms of which 3 ms to minimize.
[2024-05-29 12:44:53] [INFO ] Deduced a trap composed of 293 places in 164 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 6/9 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-29 12:44:53] [INFO ] Deduced a trap composed of 293 places in 182 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/598 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/598 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 208/806 variables, 2/12 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-29 12:44:54] [INFO ] Deduced a trap composed of 303 places in 222 ms of which 4 ms to minimize.
[2024-05-29 12:44:54] [INFO ] Deduced a trap composed of 303 places in 191 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 2/14 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/806 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1043/1849 variables, 806/820 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1849 variables, 7/827 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-29 12:44:55] [INFO ] Deduced a trap composed of 292 places in 226 ms of which 4 ms to minimize.
[2024-05-29 12:44:55] [INFO ] Deduced a trap composed of 293 places in 185 ms of which 5 ms to minimize.
[2024-05-29 12:44:55] [INFO ] Deduced a trap composed of 292 places in 182 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1849 variables, 3/830 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1849 variables, 0/830 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/1849 variables, 0/830 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1849/1849 variables, and 830 constraints, problems are : Problem set: 1 solved, 7 unsolved in 4696 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 806/806 constraints, PredecessorRefiner: 7/8 constraints, Known Traps: 12/12 constraints]
After SMT, in 5707ms problems are : Problem set: 1 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 1 properties in 1902 ms.
Support contains 8 out of 806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 806/806 places, 1043/1043 transitions.
Graph (trivial) has 790 edges and 806 vertex of which 61 / 806 are part of one of the 11 SCC in 5 ms
Free SCC test removed 50 places
Drop transitions (Empty/Sink Transition effects.) removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Graph (complete) has 1204 edges and 756 vertex of which 752 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 556 transitions
Trivial Post-agglo rules discarded 556 transitions
Performed 556 trivial Post agglomeration. Transition count delta: 556
Iterating post reduction 0 with 560 rules applied. Total rules applied 562 place count 752 transition count 415
Reduce places removed 556 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 572 rules applied. Total rules applied 1134 place count 196 transition count 399
Reduce places removed 7 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 11 rules applied. Total rules applied 1145 place count 189 transition count 395
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1149 place count 185 transition count 395
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 42 Pre rules applied. Total rules applied 1149 place count 185 transition count 353
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 1233 place count 143 transition count 353
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1235 place count 141 transition count 351
Iterating global reduction 4 with 2 rules applied. Total rules applied 1237 place count 141 transition count 351
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1237 place count 141 transition count 350
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1239 place count 140 transition count 350
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1240 place count 140 transition count 349
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1241 place count 139 transition count 348
Iterating global reduction 5 with 1 rules applied. Total rules applied 1242 place count 139 transition count 348
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 1296 place count 112 transition count 321
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1302 place count 112 transition count 315
Discarding 22 places :
Symmetric choice reduction at 6 with 22 rule applications. Total rules 1324 place count 90 transition count 164
Iterating global reduction 6 with 22 rules applied. Total rules applied 1346 place count 90 transition count 164
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 1358 place count 90 transition count 152
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1367 place count 81 transition count 143
Iterating global reduction 7 with 9 rules applied. Total rules applied 1376 place count 81 transition count 143
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1382 place count 75 transition count 137
Iterating global reduction 7 with 6 rules applied. Total rules applied 1388 place count 75 transition count 137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1390 place count 75 transition count 135
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 1400 place count 70 transition count 130
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1401 place count 69 transition count 129
Iterating global reduction 8 with 1 rules applied. Total rules applied 1402 place count 69 transition count 129
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1408 place count 66 transition count 152
Free-agglomeration rule applied 24 times with reduction of 6 identical transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 1432 place count 66 transition count 122
Reduce places removed 24 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 31 rules applied. Total rules applied 1463 place count 42 transition count 115
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1467 place count 38 transition count 111
Iterating global reduction 9 with 4 rules applied. Total rules applied 1471 place count 38 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1472 place count 38 transition count 110
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 10 with 25 rules applied. Total rules applied 1497 place count 38 transition count 85
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1499 place count 37 transition count 88
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1500 place count 37 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1501 place count 36 transition count 87
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1503 place count 36 transition count 87
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1504 place count 36 transition count 86
Applied a total of 1504 rules in 116 ms. Remains 36 /806 variables (removed 770) and now considering 86/1043 (removed 957) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 36/806 places, 86/1043 transitions.
RANDOM walk for 23362 steps (6 resets) in 373 ms. (62 steps per ms) remains 0/6 properties
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 174 stabilizing places and 182 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' '!(G(((p0 U G(p1))&&(X(p0)||F(p3)||p2))))'
Support contains 8 out of 806 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 806/806 places, 1043/1043 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 805 transition count 1042
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 805 transition count 1042
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 804 transition count 1041
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 804 transition count 1041
Applied a total of 4 rules in 51 ms. Remains 804 /806 variables (removed 2) and now considering 1041/1043 (removed 2) transitions.
// Phase 1: matrix 1041 rows 804 cols
[2024-05-29 12:44:59] [INFO ] Computed 5 invariants in 11 ms
[2024-05-29 12:44:59] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-29 12:44:59] [INFO ] Invariant cache hit.
[2024-05-29 12:45:00] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 726 ms to find 0 implicit places.
Running 1040 sub problems to find dead transitions.
[2024-05-29 12:45:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/803 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
At refinement iteration 1 (OVERLAPS) 1/804 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
[2024-05-29 12:45:24] [INFO ] Deduced a trap composed of 292 places in 261 ms of which 5 ms to minimize.
[2024-05-29 12:45:24] [INFO ] Deduced a trap composed of 297 places in 219 ms of which 4 ms to minimize.
[2024-05-29 12:45:24] [INFO ] Deduced a trap composed of 299 places in 180 ms of which 4 ms to minimize.
[2024-05-29 12:45:24] [INFO ] Deduced a trap composed of 300 places in 198 ms of which 3 ms to minimize.
[2024-05-29 12:45:26] [INFO ] Deduced a trap composed of 294 places in 232 ms of which 5 ms to minimize.
[2024-05-29 12:45:27] [INFO ] Deduced a trap composed of 294 places in 199 ms of which 4 ms to minimize.
[2024-05-29 12:45:27] [INFO ] Deduced a trap composed of 300 places in 201 ms of which 3 ms to minimize.
[2024-05-29 12:45:30] [INFO ] Deduced a trap composed of 294 places in 232 ms of which 5 ms to minimize.
[2024-05-29 12:45:30] [INFO ] Deduced a trap composed of 293 places in 227 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 804/1845 variables, and 14 constraints, problems are : Problem set: 0 solved, 1040 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/804 constraints, PredecessorRefiner: 1040/1040 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1040 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/803 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
At refinement iteration 1 (OVERLAPS) 1/804 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/804 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
[2024-05-29 12:45:44] [INFO ] Deduced a trap composed of 297 places in 231 ms of which 4 ms to minimize.
[2024-05-29 12:45:45] [INFO ] Deduced a trap composed of 293 places in 211 ms of which 4 ms to minimize.
[2024-05-29 12:45:45] [INFO ] Deduced a trap composed of 304 places in 201 ms of which 4 ms to minimize.
[2024-05-29 12:45:46] [INFO ] Deduced a trap composed of 302 places in 187 ms of which 4 ms to minimize.
[2024-05-29 12:45:47] [INFO ] Deduced a trap composed of 291 places in 235 ms of which 5 ms to minimize.
[2024-05-29 12:45:48] [INFO ] Deduced a trap composed of 298 places in 230 ms of which 4 ms to minimize.
[2024-05-29 12:45:48] [INFO ] Deduced a trap composed of 304 places in 218 ms of which 5 ms to minimize.
[2024-05-29 12:45:49] [INFO ] Deduced a trap composed of 300 places in 233 ms of which 4 ms to minimize.
[2024-05-29 12:45:49] [INFO ] Deduced a trap composed of 293 places in 199 ms of which 3 ms to minimize.
[2024-05-29 12:45:49] [INFO ] Deduced a trap composed of 298 places in 238 ms of which 4 ms to minimize.
[2024-05-29 12:45:50] [INFO ] Deduced a trap composed of 299 places in 220 ms of which 4 ms to minimize.
[2024-05-29 12:45:50] [INFO ] Deduced a trap composed of 293 places in 206 ms of which 4 ms to minimize.
[2024-05-29 12:45:52] [INFO ] Deduced a trap composed of 297 places in 202 ms of which 4 ms to minimize.
[2024-05-29 12:45:58] [INFO ] Deduced a trap composed of 292 places in 212 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 804/1845 variables, and 28 constraints, problems are : Problem set: 0 solved, 1040 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/804 constraints, PredecessorRefiner: 0/1040 constraints, Known Traps: 23/23 constraints]
After SMT, in 60517ms problems are : Problem set: 0 solved, 1040 unsolved
Search for dead transitions found 0 dead transitions in 60530ms
Starting structural reductions in LTL mode, iteration 1 : 804/806 places, 1041/1043 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61311 ms. Remains : 804/806 places, 1041/1043 transitions.
Stuttering acceptance computed with spot in 398 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2) (NOT p3))), true, (NOT p1), (NOT p1), (AND (NOT p3) (NOT p0)), (NOT p3)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 4200 steps with 53 reset in 35 ms.
FORMULA StigmergyCommit-PT-03b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLCardinality-02 finished in 61919 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G(p1)))))'
Support contains 1 out of 806 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 806/806 places, 1043/1043 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 801 transition count 1038
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 801 transition count 1038
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 798 transition count 1035
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 798 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 797 transition count 1034
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 797 transition count 1034
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 796 transition count 1033
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 796 transition count 1033
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 795 transition count 1032
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 795 transition count 1032
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 794 transition count 1031
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 794 transition count 1031
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 793 transition count 1030
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 793 transition count 1030
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 792 transition count 1029
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 792 transition count 1029
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 791 transition count 1028
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 791 transition count 1028
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 790 transition count 1027
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 790 transition count 1027
Applied a total of 32 rules in 210 ms. Remains 790 /806 variables (removed 16) and now considering 1027/1043 (removed 16) transitions.
// Phase 1: matrix 1027 rows 790 cols
[2024-05-29 12:46:01] [INFO ] Computed 5 invariants in 7 ms
[2024-05-29 12:46:01] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-29 12:46:01] [INFO ] Invariant cache hit.
[2024-05-29 12:46:02] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 717 ms to find 0 implicit places.
Running 1026 sub problems to find dead transitions.
[2024-05-29 12:46:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/789 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 1 (OVERLAPS) 1/790 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
[2024-05-29 12:46:29] [INFO ] Deduced a trap composed of 297 places in 273 ms of which 5 ms to minimize.
[2024-05-29 12:46:29] [INFO ] Deduced a trap composed of 290 places in 195 ms of which 4 ms to minimize.
[2024-05-29 12:46:29] [INFO ] Deduced a trap composed of 297 places in 209 ms of which 4 ms to minimize.
[2024-05-29 12:46:30] [INFO ] Deduced a trap composed of 298 places in 199 ms of which 4 ms to minimize.
[2024-05-29 12:46:32] [INFO ] Deduced a trap composed of 297 places in 195 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 790/1817 variables, and 10 constraints, problems are : Problem set: 0 solved, 1026 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/790 constraints, PredecessorRefiner: 1026/1026 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1026 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/789 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 1 (OVERLAPS) 1/790 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/790 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
[2024-05-29 12:46:45] [INFO ] Deduced a trap composed of 292 places in 196 ms of which 4 ms to minimize.
[2024-05-29 12:46:51] [INFO ] Deduced a trap composed of 291 places in 233 ms of which 5 ms to minimize.
[2024-05-29 12:46:52] [INFO ] Deduced a trap composed of 299 places in 192 ms of which 3 ms to minimize.
[2024-05-29 12:46:53] [INFO ] Deduced a trap composed of 293 places in 182 ms of which 3 ms to minimize.
[2024-05-29 12:46:55] [INFO ] Deduced a trap composed of 299 places in 203 ms of which 4 ms to minimize.
[2024-05-29 12:46:56] [INFO ] Deduced a trap composed of 293 places in 191 ms of which 4 ms to minimize.
[2024-05-29 12:46:57] [INFO ] Deduced a trap composed of 299 places in 194 ms of which 3 ms to minimize.
[2024-05-29 12:46:57] [INFO ] Deduced a trap composed of 293 places in 179 ms of which 3 ms to minimize.
[2024-05-29 12:46:58] [INFO ] Deduced a trap composed of 293 places in 188 ms of which 4 ms to minimize.
[2024-05-29 12:46:59] [INFO ] Deduced a trap composed of 292 places in 225 ms of which 4 ms to minimize.
[2024-05-29 12:46:59] [INFO ] Deduced a trap composed of 292 places in 208 ms of which 4 ms to minimize.
[2024-05-29 12:46:59] [INFO ] Deduced a trap composed of 299 places in 200 ms of which 4 ms to minimize.
[2024-05-29 12:47:00] [INFO ] Deduced a trap composed of 291 places in 192 ms of which 4 ms to minimize.
[2024-05-29 12:47:00] [INFO ] Deduced a trap composed of 299 places in 193 ms of which 4 ms to minimize.
[2024-05-29 12:47:00] [INFO ] Deduced a trap composed of 297 places in 202 ms of which 4 ms to minimize.
[2024-05-29 12:47:01] [INFO ] Deduced a trap composed of 293 places in 205 ms of which 3 ms to minimize.
[2024-05-29 12:47:01] [INFO ] Deduced a trap composed of 299 places in 227 ms of which 4 ms to minimize.
[2024-05-29 12:47:01] [INFO ] Deduced a trap composed of 299 places in 213 ms of which 4 ms to minimize.
[2024-05-29 12:47:02] [INFO ] Deduced a trap composed of 298 places in 227 ms of which 5 ms to minimize.
[2024-05-29 12:47:02] [INFO ] Deduced a trap composed of 298 places in 210 ms of which 4 ms to minimize.
SMT process timed out in 60538ms, After SMT, problems are : Problem set: 0 solved, 1026 unsolved
Search for dead transitions found 0 dead transitions in 60549ms
Starting structural reductions in LTL mode, iteration 1 : 790/806 places, 1027/1043 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61479 ms. Remains : 790/806 places, 1027/1043 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLCardinality-03
Stuttering criterion allowed to conclude after 82 steps with 0 reset in 3 ms.
FORMULA StigmergyCommit-PT-03b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLCardinality-03 finished in 61642 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 4 out of 806 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 806/806 places, 1043/1043 transitions.
Graph (trivial) has 797 edges and 806 vertex of which 61 / 806 are part of one of the 11 SCC in 3 ms
Free SCC test removed 50 places
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 557 transitions
Trivial Post-agglo rules discarded 557 transitions
Performed 557 trivial Post agglomeration. Transition count delta: 557
Iterating post reduction 0 with 557 rules applied. Total rules applied 558 place count 755 transition count 428
Reduce places removed 557 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 571 rules applied. Total rules applied 1129 place count 198 transition count 414
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 1137 place count 192 transition count 412
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1139 place count 190 transition count 412
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 40 Pre rules applied. Total rules applied 1139 place count 190 transition count 372
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 1219 place count 150 transition count 372
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1223 place count 146 transition count 368
Iterating global reduction 4 with 4 rules applied. Total rules applied 1227 place count 146 transition count 368
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1227 place count 146 transition count 367
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1229 place count 145 transition count 367
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1230 place count 144 transition count 366
Iterating global reduction 4 with 1 rules applied. Total rules applied 1231 place count 144 transition count 366
Performed 29 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 1289 place count 115 transition count 336
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 1310 place count 94 transition count 191
Iterating global reduction 4 with 21 rules applied. Total rules applied 1331 place count 94 transition count 191
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 1342 place count 94 transition count 180
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1352 place count 84 transition count 168
Iterating global reduction 5 with 10 rules applied. Total rules applied 1362 place count 84 transition count 168
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1372 place count 74 transition count 156
Iterating global reduction 5 with 10 rules applied. Total rules applied 1382 place count 74 transition count 156
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1385 place count 74 transition count 153
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 1405 place count 64 transition count 167
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1406 place count 63 transition count 155
Iterating global reduction 6 with 1 rules applied. Total rules applied 1407 place count 63 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1408 place count 63 transition count 154
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 1412 place count 63 transition count 150
Applied a total of 1412 rules in 64 ms. Remains 63 /806 variables (removed 743) and now considering 150/1043 (removed 893) transitions.
[2024-05-29 12:47:02] [INFO ] Flow matrix only has 144 transitions (discarded 6 similar events)
// Phase 1: matrix 144 rows 63 cols
[2024-05-29 12:47:02] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 12:47:02] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-29 12:47:02] [INFO ] Flow matrix only has 144 transitions (discarded 6 similar events)
[2024-05-29 12:47:02] [INFO ] Invariant cache hit.
[2024-05-29 12:47:03] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 12:47:03] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2024-05-29 12:47:03] [INFO ] Redundant transitions in 4 ms returned []
Running 125 sub problems to find dead transitions.
[2024-05-29 12:47:03] [INFO ] Flow matrix only has 144 transitions (discarded 6 similar events)
[2024-05-29 12:47:03] [INFO ] Invariant cache hit.
[2024-05-29 12:47:03] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-29 12:47:03] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-29 12:47:03] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:47:03] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-29 12:47:03] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-29 12:47:03] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-29 12:47:03] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:47:03] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2024-05-29 12:47:03] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2024-05-29 12:47:03] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:47:03] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:47:03] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:47:03] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:47:04] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:47:04] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:47:04] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:47:04] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-29 12:47:04] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:47:04] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:47:04] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-29 12:47:04] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-29 12:47:04] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-29 12:47:04] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-29 12:47:04] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:47:05] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:47:05] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 143/206 variables, 63/90 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 14/104 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (OVERLAPS) 1/207 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 12 (OVERLAPS) 0/207 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 105 constraints, problems are : Problem set: 0 solved, 125 unsolved in 5142 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (OVERLAPS) 143/206 variables, 63/90 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 14/104 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 125/229 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (OVERLAPS) 1/207 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-29 12:47:12] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 12 (OVERLAPS) 0/207 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 231 constraints, problems are : Problem set: 0 solved, 125 unsolved in 8222 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 26/26 constraints]
After SMT, in 13420ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 13421ms
Starting structural reductions in SI_LTL mode, iteration 1 : 63/806 places, 150/1043 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13611 ms. Remains : 63/806 places, 150/1043 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLCardinality-05
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-03b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLCardinality-05 finished in 13714 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 806 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 806/806 places, 1043/1043 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 801 transition count 1038
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 801 transition count 1038
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 798 transition count 1035
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 798 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 797 transition count 1034
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 797 transition count 1034
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 796 transition count 1033
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 796 transition count 1033
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 795 transition count 1032
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 795 transition count 1032
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 794 transition count 1031
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 794 transition count 1031
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 793 transition count 1030
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 793 transition count 1030
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 792 transition count 1029
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 792 transition count 1029
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 791 transition count 1028
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 791 transition count 1028
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 790 transition count 1027
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 790 transition count 1027
Applied a total of 32 rules in 203 ms. Remains 790 /806 variables (removed 16) and now considering 1027/1043 (removed 16) transitions.
// Phase 1: matrix 1027 rows 790 cols
[2024-05-29 12:47:16] [INFO ] Computed 5 invariants in 14 ms
[2024-05-29 12:47:16] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-29 12:47:16] [INFO ] Invariant cache hit.
[2024-05-29 12:47:17] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 713 ms to find 0 implicit places.
Running 1026 sub problems to find dead transitions.
[2024-05-29 12:47:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/789 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 1 (OVERLAPS) 1/790 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
[2024-05-29 12:47:44] [INFO ] Deduced a trap composed of 297 places in 251 ms of which 5 ms to minimize.
[2024-05-29 12:47:44] [INFO ] Deduced a trap composed of 290 places in 180 ms of which 3 ms to minimize.
[2024-05-29 12:47:44] [INFO ] Deduced a trap composed of 297 places in 193 ms of which 3 ms to minimize.
[2024-05-29 12:47:45] [INFO ] Deduced a trap composed of 298 places in 187 ms of which 4 ms to minimize.
[2024-05-29 12:47:46] [INFO ] Deduced a trap composed of 297 places in 202 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)timeout

(s320 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 790/1817 variables, and 10 constraints, problems are : Problem set: 0 solved, 1026 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/790 constraints, PredecessorRefiner: 1026/1026 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1026 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/789 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 1 (OVERLAPS) 1/790 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/790 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
[2024-05-29 12:48:00] [INFO ] Deduced a trap composed of 292 places in 207 ms of which 4 ms to minimize.
[2024-05-29 12:48:07] [INFO ] Deduced a trap composed of 291 places in 248 ms of which 5 ms to minimize.
[2024-05-29 12:48:08] [INFO ] Deduced a trap composed of 299 places in 238 ms of which 3 ms to minimize.
[2024-05-29 12:48:10] [INFO ] Deduced a trap composed of 293 places in 187 ms of which 4 ms to minimize.
[2024-05-29 12:48:11] [INFO ] Deduced a trap composed of 299 places in 232 ms of which 13 ms to minimize.
[2024-05-29 12:48:12] [INFO ] Deduced a trap composed of 293 places in 188 ms of which 4 ms to minimize.
[2024-05-29 12:48:13] [INFO ] Deduced a trap composed of 299 places in 194 ms of which 4 ms to minimize.
[2024-05-29 12:48:14] [INFO ] Deduced a trap composed of 293 places in 197 ms of which 4 ms to minimize.
[2024-05-29 12:48:15] [INFO ] Deduced a trap composed of 293 places in 202 ms of which 4 ms to minimize.
[2024-05-29 12:48:15] [INFO ] Deduced a trap composed of 292 places in 256 ms of which 5 ms to minimize.
[2024-05-29 12:48:16] [INFO ] Deduced a trap composed of 292 places in 227 ms of which 4 ms to minimize.
[2024-05-29 12:48:16] [INFO ] Deduced a trap composed of 299 places in 205 ms of which 3 ms to minimize.
[2024-05-29 12:48:16] [INFO ] Deduced a trap composed of 291 places in 200 ms of which 3 ms to minimize.
[2024-05-29 12:48:16] [INFO ] Deduced a trap composed of 299 places in 201 ms of which 3 ms to minimize.
[2024-05-29 12:48:17] [INFO ] Deduced a trap composed of 297 places in 262 ms of which 3 ms to minimize.
[2024-05-29 12:48:17] [INFO ] Deduced a trap composed of 293 places in 217 ms of which 4 ms to minimize.
[2024-05-29 12:48:18] [INFO ] Deduced a trap composed of 299 places in 231 ms of which 4 ms to minimize.
SMT process timed out in 60517ms, After SMT, problems are : Problem set: 0 solved, 1026 unsolved
Search for dead transitions found 0 dead transitions in 60527ms
Starting structural reductions in LTL mode, iteration 1 : 790/806 places, 1027/1043 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61445 ms. Remains : 790/806 places, 1027/1043 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-03b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLCardinality-08 finished in 61597 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 806 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 806/806 places, 1043/1043 transitions.
Graph (trivial) has 803 edges and 806 vertex of which 68 / 806 are part of one of the 12 SCC in 4 ms
Free SCC test removed 56 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 559 place count 749 transition count 420
Reduce places removed 558 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 570 rules applied. Total rules applied 1129 place count 191 transition count 408
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 1134 place count 186 transition count 408
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 1134 place count 186 transition count 368
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 1214 place count 146 transition count 368
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1218 place count 142 transition count 364
Iterating global reduction 3 with 4 rules applied. Total rules applied 1222 place count 142 transition count 364
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1222 place count 142 transition count 363
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1224 place count 141 transition count 363
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1225 place count 140 transition count 362
Iterating global reduction 3 with 1 rules applied. Total rules applied 1226 place count 140 transition count 362
Performed 29 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 1284 place count 111 transition count 332
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1308 place count 87 transition count 182
Iterating global reduction 3 with 24 rules applied. Total rules applied 1332 place count 87 transition count 182
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 1343 place count 87 transition count 171
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1355 place count 75 transition count 155
Iterating global reduction 4 with 12 rules applied. Total rules applied 1367 place count 75 transition count 155
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1379 place count 63 transition count 139
Iterating global reduction 4 with 12 rules applied. Total rules applied 1391 place count 63 transition count 139
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1395 place count 63 transition count 135
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 1411 place count 55 transition count 142
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1412 place count 54 transition count 134
Iterating global reduction 5 with 1 rules applied. Total rules applied 1413 place count 54 transition count 134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1414 place count 54 transition count 133
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 1418 place count 54 transition count 129
Applied a total of 1418 rules in 76 ms. Remains 54 /806 variables (removed 752) and now considering 129/1043 (removed 914) transitions.
[2024-05-29 12:48:18] [INFO ] Flow matrix only has 124 transitions (discarded 5 similar events)
// Phase 1: matrix 124 rows 54 cols
[2024-05-29 12:48:18] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 12:48:18] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-29 12:48:18] [INFO ] Flow matrix only has 124 transitions (discarded 5 similar events)
[2024-05-29 12:48:18] [INFO ] Invariant cache hit.
[2024-05-29 12:48:18] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 12:48:18] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2024-05-29 12:48:18] [INFO ] Redundant transitions in 3 ms returned []
Running 112 sub problems to find dead transitions.
[2024-05-29 12:48:18] [INFO ] Flow matrix only has 124 transitions (discarded 5 similar events)
[2024-05-29 12:48:18] [INFO ] Invariant cache hit.
[2024-05-29 12:48:18] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-29 12:48:19] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-29 12:48:19] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-29 12:48:19] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 0 ms to minimize.
[2024-05-29 12:48:19] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 0 ms to minimize.
[2024-05-29 12:48:19] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-29 12:48:19] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-29 12:48:19] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-29 12:48:19] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:48:19] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-29 12:48:19] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2024-05-29 12:48:19] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2024-05-29 12:48:19] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-29 12:48:20] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-29 12:48:20] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-29 12:48:20] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-29 12:48:20] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 123/177 variables, 54/72 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 14/86 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-29 12:48:20] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (OVERLAPS) 1/178 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 12 (OVERLAPS) 0/178 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 88 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4388 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 123/177 variables, 54/73 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 14/87 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 112/199 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-29 12:48:24] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2024-05-29 12:48:24] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (OVERLAPS) 1/178 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-29 12:48:27] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-29 12:48:28] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:48:28] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/178 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/178 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 14 (OVERLAPS) 0/178 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 205 constraints, problems are : Problem set: 0 solved, 112 unsolved in 8530 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 22/22 constraints]
After SMT, in 12973ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 12974ms
Starting structural reductions in SI_LTL mode, iteration 1 : 54/806 places, 129/1043 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13458 ms. Remains : 54/806 places, 129/1043 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLCardinality-09
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-03b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLCardinality-09 finished in 13507 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 806 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 806/806 places, 1043/1043 transitions.
Graph (trivial) has 803 edges and 806 vertex of which 68 / 806 are part of one of the 12 SCC in 1 ms
Free SCC test removed 56 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 557 transitions
Trivial Post-agglo rules discarded 557 transitions
Performed 557 trivial Post agglomeration. Transition count delta: 557
Iterating post reduction 0 with 557 rules applied. Total rules applied 558 place count 749 transition count 421
Reduce places removed 557 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 569 rules applied. Total rules applied 1127 place count 192 transition count 409
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 1133 place count 187 transition count 408
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1134 place count 186 transition count 408
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 40 Pre rules applied. Total rules applied 1134 place count 186 transition count 368
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 1214 place count 146 transition count 368
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1218 place count 142 transition count 364
Iterating global reduction 4 with 4 rules applied. Total rules applied 1222 place count 142 transition count 364
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1222 place count 142 transition count 363
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1224 place count 141 transition count 363
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1225 place count 140 transition count 362
Iterating global reduction 4 with 1 rules applied. Total rules applied 1226 place count 140 transition count 362
Performed 29 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 1284 place count 111 transition count 332
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 1308 place count 87 transition count 182
Iterating global reduction 4 with 24 rules applied. Total rules applied 1332 place count 87 transition count 182
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 1344 place count 87 transition count 170
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1356 place count 75 transition count 154
Iterating global reduction 5 with 12 rules applied. Total rules applied 1368 place count 75 transition count 154
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1380 place count 63 transition count 138
Iterating global reduction 5 with 12 rules applied. Total rules applied 1392 place count 63 transition count 138
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1396 place count 63 transition count 134
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 1412 place count 55 transition count 141
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1413 place count 54 transition count 133
Iterating global reduction 6 with 1 rules applied. Total rules applied 1414 place count 54 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1415 place count 54 transition count 132
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 1419 place count 54 transition count 128
Applied a total of 1419 rules in 47 ms. Remains 54 /806 variables (removed 752) and now considering 128/1043 (removed 915) transitions.
[2024-05-29 12:48:31] [INFO ] Flow matrix only has 123 transitions (discarded 5 similar events)
// Phase 1: matrix 123 rows 54 cols
[2024-05-29 12:48:31] [INFO ] Computed 2 invariants in 8 ms
[2024-05-29 12:48:32] [INFO ] Implicit Places using invariants in 340 ms returned []
[2024-05-29 12:48:32] [INFO ] Flow matrix only has 123 transitions (discarded 5 similar events)
[2024-05-29 12:48:32] [INFO ] Invariant cache hit.
[2024-05-29 12:48:32] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 12:48:32] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
[2024-05-29 12:48:32] [INFO ] Redundant transitions in 3 ms returned []
Running 111 sub problems to find dead transitions.
[2024-05-29 12:48:32] [INFO ] Flow matrix only has 123 transitions (discarded 5 similar events)
[2024-05-29 12:48:32] [INFO ] Invariant cache hit.
[2024-05-29 12:48:32] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-29 12:48:32] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-29 12:48:32] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-29 12:48:32] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:48:32] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-05-29 12:48:32] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-29 12:48:32] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:48:32] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-29 12:48:32] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-29 12:48:33] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 0 ms to minimize.
[2024-05-29 12:48:33] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2024-05-29 12:48:33] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 0 ms to minimize.
[2024-05-29 12:48:33] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 0 ms to minimize.
[2024-05-29 12:48:33] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-29 12:48:33] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-29 12:48:33] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-29 12:48:33] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-29 12:48:33] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-29 12:48:33] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 12:48:33] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2024-05-29 12:48:34] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-05-29 12:48:34] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
[2024-05-29 12:48:34] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-05-29 12:48:34] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:48:34] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:48:34] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 122/176 variables, 54/81 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 14/95 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-29 12:48:35] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-29 12:48:35] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (OVERLAPS) 1/177 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/177 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 12 (OVERLAPS) 0/177 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 98 constraints, problems are : Problem set: 0 solved, 111 unsolved in 4935 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (OVERLAPS) 122/176 variables, 54/83 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 14/97 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 111/208 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (OVERLAPS) 1/177 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-29 12:48:40] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/177 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 12 (OVERLAPS) 0/177 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 210 constraints, problems are : Problem set: 0 solved, 111 unsolved in 7119 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 28/28 constraints]
After SMT, in 12102ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 12103ms
Starting structural reductions in SI_LTL mode, iteration 1 : 54/806 places, 128/1043 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12626 ms. Remains : 54/806 places, 128/1043 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLCardinality-10
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-03b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLCardinality-10 finished in 12710 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 806 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 806/806 places, 1043/1043 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 801 transition count 1038
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 801 transition count 1038
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 798 transition count 1035
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 798 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 797 transition count 1034
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 797 transition count 1034
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 796 transition count 1033
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 796 transition count 1033
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 795 transition count 1032
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 795 transition count 1032
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 794 transition count 1031
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 794 transition count 1031
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 793 transition count 1030
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 793 transition count 1030
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 792 transition count 1029
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 792 transition count 1029
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 791 transition count 1028
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 791 transition count 1028
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 790 transition count 1027
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 790 transition count 1027
Applied a total of 32 rules in 217 ms. Remains 790 /806 variables (removed 16) and now considering 1027/1043 (removed 16) transitions.
// Phase 1: matrix 1027 rows 790 cols
[2024-05-29 12:48:44] [INFO ] Computed 5 invariants in 5 ms
[2024-05-29 12:48:44] [INFO ] Implicit Places using invariants in 362 ms returned []
[2024-05-29 12:48:44] [INFO ] Invariant cache hit.
[2024-05-29 12:48:45] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 900 ms to find 0 implicit places.
Running 1026 sub problems to find dead transitions.
[2024-05-29 12:48:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/789 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 1 (OVERLAPS) 1/790 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
[2024-05-29 12:49:13] [INFO ] Deduced a trap composed of 297 places in 256 ms of which 6 ms to minimize.
[2024-05-29 12:49:13] [INFO ] Deduced a trap composed of 290 places in 212 ms of which 3 ms to minimize.
[2024-05-29 12:49:13] [INFO ] Deduced a trap composed of 297 places in 197 ms of which 3 ms to minimize.
[2024-05-29 12:49:14] [INFO ] Deduced a trap composed of 298 places in 225 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 790/1817 variables, and 9 constraints, problems are : Problem set: 0 solved, 1026 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/790 constraints, PredecessorRefiner: 1026/1026 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1026 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/789 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 1 (OVERLAPS) 1/790 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/790 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
[2024-05-29 12:49:28] [INFO ] Deduced a trap composed of 292 places in 203 ms of which 4 ms to minimize.
[2024-05-29 12:49:35] [INFO ] Deduced a trap composed of 298 places in 246 ms of which 5 ms to minimize.
[2024-05-29 12:49:36] [INFO ] Deduced a trap composed of 297 places in 240 ms of which 4 ms to minimize.
[2024-05-29 12:49:36] [INFO ] Deduced a trap composed of 298 places in 215 ms of which 4 ms to minimize.
[2024-05-29 12:49:38] [INFO ] Deduced a trap composed of 297 places in 261 ms of which 4 ms to minimize.
[2024-05-29 12:49:39] [INFO ] Deduced a trap composed of 292 places in 237 ms of which 4 ms to minimize.
[2024-05-29 12:49:40] [INFO ] Deduced a trap composed of 291 places in 251 ms of which 3 ms to minimize.
[2024-05-29 12:49:40] [INFO ] Deduced a trap composed of 293 places in 209 ms of which 3 ms to minimize.
[2024-05-29 12:49:40] [INFO ] Deduced a trap composed of 299 places in 195 ms of which 3 ms to minimize.
[2024-05-29 12:49:41] [INFO ] Deduced a trap composed of 292 places in 228 ms of which 4 ms to minimize.
[2024-05-29 12:49:41] [INFO ] Deduced a trap composed of 299 places in 253 ms of which 4 ms to minimize.
[2024-05-29 12:49:41] [INFO ] Deduced a trap composed of 292 places in 191 ms of which 4 ms to minimize.
[2024-05-29 12:49:42] [INFO ] Deduced a trap composed of 290 places in 253 ms of which 4 ms to minimize.
[2024-05-29 12:49:42] [INFO ] Deduced a trap composed of 293 places in 200 ms of which 3 ms to minimize.
[2024-05-29 12:49:44] [INFO ] Deduced a trap composed of 297 places in 240 ms of which 4 ms to minimize.
[2024-05-29 12:49:44] [INFO ] Deduced a trap composed of 293 places in 228 ms of which 3 ms to minimize.
[2024-05-29 12:49:44] [INFO ] Deduced a trap composed of 293 places in 211 ms of which 4 ms to minimize.
[2024-05-29 12:49:45] [INFO ] Deduced a trap composed of 292 places in 190 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 790/1817 variables, and 27 constraints, problems are : Problem set: 0 solved, 1026 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/790 constraints, PredecessorRefiner: 0/1026 constraints, Known Traps: 22/22 constraints]
After SMT, in 60397ms problems are : Problem set: 0 solved, 1026 unsolved
Search for dead transitions found 0 dead transitions in 60409ms
Starting structural reductions in LTL mode, iteration 1 : 790/806 places, 1027/1043 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61528 ms. Remains : 790/806 places, 1027/1043 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLCardinality-14
Stuttering criterion allowed to conclude after 64 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-03b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLCardinality-14 finished in 61615 ms.
All properties solved by simple procedures.
Total runtime 359608 ms.
ITS solved all properties within timeout

BK_STOP 1716986986057

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyCommit-PT-03b"
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 StigmergyCommit-PT-03b, 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 r399-tall-171690529600115"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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