Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654447200459.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBNT-PT-S05J40, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654447200459
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 17K Apr 12 09:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 09:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 76K Apr 12 09:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 346K Apr 12 09:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 28K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 46K Apr 12 10:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 253K Apr 12 10:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 100K Apr 12 10:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 438K Apr 12 10:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 14K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.3M 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 PolyORBNT-PT-S05J40-LTLCardinality-00
FORMULA_NAME PolyORBNT-PT-S05J40-LTLCardinality-01
FORMULA_NAME PolyORBNT-PT-S05J40-LTLCardinality-02
FORMULA_NAME PolyORBNT-PT-S05J40-LTLCardinality-03
FORMULA_NAME PolyORBNT-PT-S05J40-LTLCardinality-04
FORMULA_NAME PolyORBNT-PT-S05J40-LTLCardinality-05
FORMULA_NAME PolyORBNT-PT-S05J40-LTLCardinality-06
FORMULA_NAME PolyORBNT-PT-S05J40-LTLCardinality-07
FORMULA_NAME PolyORBNT-PT-S05J40-LTLCardinality-08
FORMULA_NAME PolyORBNT-PT-S05J40-LTLCardinality-09
FORMULA_NAME PolyORBNT-PT-S05J40-LTLCardinality-10
FORMULA_NAME PolyORBNT-PT-S05J40-LTLCardinality-11
FORMULA_NAME PolyORBNT-PT-S05J40-LTLCardinality-12
FORMULA_NAME PolyORBNT-PT-S05J40-LTLCardinality-13
FORMULA_NAME PolyORBNT-PT-S05J40-LTLCardinality-14
FORMULA_NAME PolyORBNT-PT-S05J40-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717260339065

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J40
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:45:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 16:45:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:45:40] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2024-06-01 16:45:40] [INFO ] Transformed 629 places.
[2024-06-01 16:45:40] [INFO ] Transformed 1590 transitions.
[2024-06-01 16:45:40] [INFO ] Parsed PT model containing 629 places and 1590 transitions and 10704 arcs in 288 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
FORMULA PolyORBNT-PT-S05J40-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 364 out of 629 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 935/935 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 625 transition count 935
Applied a total of 4 rules in 48 ms. Remains 625 /629 variables (removed 4) and now considering 935/935 (removed 0) transitions.
Running 929 sub problems to find dead transitions.
[2024-06-01 16:45:40] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 625 cols
[2024-06-01 16:45:41] [INFO ] Computed 98 invariants in 64 ms
[2024-06-01 16:45:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 929 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 929 unsolved
Problem TDEAD105 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
At refinement iteration 3 (OVERLAPS) 7/625 variables, 7/98 constraints. Problems are: Problem set: 95 solved, 834 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 625/1556 variables, and 98 constraints, problems are : Problem set: 95 solved, 834 unsolved in 20075 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/625 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 929/929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 95 solved, 834 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 76/76 constraints. Problems are: Problem set: 95 solved, 834 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 15/91 constraints. Problems are: Problem set: 95 solved, 834 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/91 constraints. Problems are: Problem set: 95 solved, 834 unsolved
At refinement iteration 3 (OVERLAPS) 7/625 variables, 7/98 constraints. Problems are: Problem set: 95 solved, 834 unsolved
[2024-06-01 16:46:15] [INFO ] Deduced a trap composed of 27 places in 386 ms of which 34 ms to minimize.
[2024-06-01 16:46:15] [INFO ] Deduced a trap composed of 24 places in 329 ms of which 5 ms to minimize.
[2024-06-01 16:46:15] [INFO ] Deduced a trap composed of 16 places in 277 ms of which 4 ms to minimize.
[2024-06-01 16:46:16] [INFO ] Deduced a trap composed of 16 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:46:16] [INFO ] Deduced a trap composed of 15 places in 322 ms of which 5 ms to minimize.
[2024-06-01 16:46:17] [INFO ] Deduced a trap composed of 14 places in 195 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 625/1556 variables, and 104 constraints, problems are : Problem set: 95 solved, 834 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/625 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/929 constraints, Known Traps: 6/6 constraints]
After SMT, in 41988ms problems are : Problem set: 95 solved, 834 unsolved
Search for dead transitions found 95 dead transitions in 42018ms
Found 95 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
[2024-06-01 16:46:22] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
// Phase 1: matrix 836 rows 625 cols
[2024-06-01 16:46:23] [INFO ] Computed 98 invariants in 29 ms
[2024-06-01 16:46:23] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-06-01 16:46:23] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
[2024-06-01 16:46:23] [INFO ] Invariant cache hit.
[2024-06-01 16:46:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:46:25] [INFO ] Implicit Places using invariants and state equation in 2066 ms returned []
Implicit Place search using SMT with State Equation took 2381 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 625/629 places, 840/935 transitions.
Applied a total of 0 rules in 38 ms. Remains 625 /625 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44534 ms. Remains : 625/629 places, 840/935 transitions.
Support contains 364 out of 625 places after structural reductions.
[2024-06-01 16:46:25] [INFO ] Flatten gal took : 125 ms
[2024-06-01 16:46:25] [INFO ] Flatten gal took : 83 ms
[2024-06-01 16:46:26] [INFO ] Input system was already deterministic with 840 transitions.
Support contains 362 out of 625 places (down from 364) after GAL structural reductions.
RANDOM walk for 40000 steps (2768 resets) in 2661 ms. (15 steps per ms) remains 13/32 properties
BEST_FIRST walk for 40003 steps (662 resets) in 183 ms. (217 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (559 resets) in 143 ms. (277 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (587 resets) in 184 ms. (216 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (663 resets) in 169 ms. (235 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (593 resets) in 186 ms. (213 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (585 resets) in 151 ms. (263 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (657 resets) in 177 ms. (224 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (596 resets) in 122 ms. (325 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1006 resets) in 150 ms. (264 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (635 resets) in 104 ms. (380 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (448 resets) in 123 ms. (322 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (76 resets) in 88 ms. (449 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (76 resets) in 136 ms. (292 steps per ms) remains 13/13 properties
[2024-06-01 16:46:27] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
[2024-06-01 16:46:27] [INFO ] Invariant cache hit.
[2024-06-01 16:46:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 1 (OVERLAPS) 492/546 variables, 76/76 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/546 variables, 0/76 constraints. Problems are: Problem set: 7 solved, 6 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp31 is UNSAT
After SMT solving in domain Real declared 624/1461 variables, and 98 constraints, problems are : Problem set: 13 solved, 0 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/625 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 249ms problems are : Problem set: 13 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 13 atomic propositions for a total of 15 simplifications.
FORMULA PolyORBNT-PT-S05J40-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J40-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J40-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA PolyORBNT-PT-S05J40-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J40-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J40-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 625 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 625/625 places, 840/840 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 624 transition count 794
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 578 transition count 794
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 92 place count 578 transition count 749
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 182 place count 533 transition count 749
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 532 transition count 748
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 532 transition count 748
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 188 place count 530 transition count 746
Applied a total of 188 rules in 179 ms. Remains 530 /625 variables (removed 95) and now considering 746/840 (removed 94) transitions.
Running 740 sub problems to find dead transitions.
[2024-06-01 16:46:28] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2024-06-01 16:46:28] [INFO ] Computed 97 invariants in 13 ms
[2024-06-01 16:46:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 740 unsolved
[2024-06-01 16:46:35] [INFO ] Deduced a trap composed of 159 places in 219 ms of which 3 ms to minimize.
[2024-06-01 16:46:35] [INFO ] Deduced a trap composed of 137 places in 223 ms of which 4 ms to minimize.
[2024-06-01 16:46:36] [INFO ] Deduced a trap composed of 144 places in 210 ms of which 4 ms to minimize.
[2024-06-01 16:46:36] [INFO ] Deduced a trap composed of 137 places in 227 ms of which 4 ms to minimize.
[2024-06-01 16:46:36] [INFO ] Deduced a trap composed of 136 places in 193 ms of which 3 ms to minimize.
[2024-06-01 16:46:36] [INFO ] Deduced a trap composed of 136 places in 209 ms of which 3 ms to minimize.
[2024-06-01 16:46:36] [INFO ] Deduced a trap composed of 136 places in 224 ms of which 4 ms to minimize.
[2024-06-01 16:46:37] [INFO ] Deduced a trap composed of 136 places in 256 ms of which 4 ms to minimize.
[2024-06-01 16:46:37] [INFO ] Deduced a trap composed of 144 places in 195 ms of which 3 ms to minimize.
[2024-06-01 16:46:37] [INFO ] Deduced a trap composed of 141 places in 214 ms of which 6 ms to minimize.
[2024-06-01 16:46:37] [INFO ] Deduced a trap composed of 136 places in 196 ms of which 3 ms to minimize.
[2024-06-01 16:46:38] [INFO ] Deduced a trap composed of 141 places in 204 ms of which 3 ms to minimize.
[2024-06-01 16:46:38] [INFO ] Deduced a trap composed of 139 places in 177 ms of which 3 ms to minimize.
[2024-06-01 16:46:38] [INFO ] Deduced a trap composed of 145 places in 218 ms of which 3 ms to minimize.
[2024-06-01 16:46:38] [INFO ] Deduced a trap composed of 143 places in 198 ms of which 3 ms to minimize.
[2024-06-01 16:46:39] [INFO ] Deduced a trap composed of 167 places in 167 ms of which 4 ms to minimize.
[2024-06-01 16:46:39] [INFO ] Deduced a trap composed of 167 places in 215 ms of which 4 ms to minimize.
[2024-06-01 16:46:39] [INFO ] Deduced a trap composed of 167 places in 197 ms of which 4 ms to minimize.
[2024-06-01 16:46:39] [INFO ] Deduced a trap composed of 110 places in 212 ms of which 3 ms to minimize.
[2024-06-01 16:46:39] [INFO ] Deduced a trap composed of 136 places in 186 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 740 unsolved
[2024-06-01 16:46:41] [INFO ] Deduced a trap composed of 143 places in 207 ms of which 5 ms to minimize.
[2024-06-01 16:46:41] [INFO ] Deduced a trap composed of 143 places in 164 ms of which 3 ms to minimize.
[2024-06-01 16:46:41] [INFO ] Deduced a trap composed of 146 places in 173 ms of which 3 ms to minimize.
[2024-06-01 16:46:41] [INFO ] Deduced a trap composed of 144 places in 193 ms of which 3 ms to minimize.
[2024-06-01 16:46:41] [INFO ] Deduced a trap composed of 145 places in 222 ms of which 3 ms to minimize.
[2024-06-01 16:46:42] [INFO ] Deduced a trap composed of 146 places in 185 ms of which 3 ms to minimize.
[2024-06-01 16:46:42] [INFO ] Deduced a trap composed of 147 places in 213 ms of which 4 ms to minimize.
[2024-06-01 16:46:42] [INFO ] Deduced a trap composed of 139 places in 175 ms of which 3 ms to minimize.
[2024-06-01 16:46:42] [INFO ] Deduced a trap composed of 141 places in 186 ms of which 6 ms to minimize.
[2024-06-01 16:46:43] [INFO ] Deduced a trap composed of 140 places in 181 ms of which 3 ms to minimize.
[2024-06-01 16:46:43] [INFO ] Deduced a trap composed of 143 places in 156 ms of which 3 ms to minimize.
[2024-06-01 16:46:43] [INFO ] Deduced a trap composed of 141 places in 204 ms of which 4 ms to minimize.
[2024-06-01 16:46:43] [INFO ] Deduced a trap composed of 140 places in 159 ms of which 3 ms to minimize.
[2024-06-01 16:46:43] [INFO ] Deduced a trap composed of 172 places in 162 ms of which 3 ms to minimize.
[2024-06-01 16:46:43] [INFO ] Deduced a trap composed of 142 places in 158 ms of which 3 ms to minimize.
[2024-06-01 16:46:44] [INFO ] Deduced a trap composed of 144 places in 216 ms of which 3 ms to minimize.
[2024-06-01 16:46:44] [INFO ] Deduced a trap composed of 144 places in 314 ms of which 5 ms to minimize.
[2024-06-01 16:46:44] [INFO ] Deduced a trap composed of 142 places in 205 ms of which 4 ms to minimize.
[2024-06-01 16:46:44] [INFO ] Deduced a trap composed of 136 places in 205 ms of which 3 ms to minimize.
[2024-06-01 16:46:45] [INFO ] Deduced a trap composed of 136 places in 203 ms of which 4 ms to minimize.
(s314 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.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 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.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 4.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 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 9.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 1.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 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.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 1.0)
(s152 0.0)
(s153 0.0)
(s154 1.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 1.0)
(s180 0.0)
(s181 0.0)
(s182 2.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.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)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 1.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 1.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 1.0)
(s268 0.0)
(s269 1.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 1.0)
(s288 0.0)
(s289 0.0)
(s290 1.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 1.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 1.0)
(s314 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 740 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 525/1272 variables, and 132 constraints, problems are : Problem set: 0 solved, 740 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/530 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 740/740 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 740 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 740 unsolved
[2024-06-01 16:47:08] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/1272 variables, and 133 constraints, problems are : Problem set: 0 solved, 740 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/530 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/740 constraints, Known Traps: 41/41 constraints]
After SMT, in 41434ms problems are : Problem set: 0 solved, 740 unsolved
Search for dead transitions found 0 dead transitions in 41443ms
[2024-06-01 16:47:09] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2024-06-01 16:47:09] [INFO ] Invariant cache hit.
[2024-06-01 16:47:10] [INFO ] Implicit Places using invariants in 814 ms returned []
[2024-06-01 16:47:10] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2024-06-01 16:47:10] [INFO ] Invariant cache hit.
[2024-06-01 16:47:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:47:17] [INFO ] Implicit Places using invariants and state equation in 7039 ms returned []
Implicit Place search using SMT with State Equation took 7856 ms to find 0 implicit places.
[2024-06-01 16:47:17] [INFO ] Redundant transitions in 50 ms returned []
Running 740 sub problems to find dead transitions.
[2024-06-01 16:47:17] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2024-06-01 16:47:17] [INFO ] Invariant cache hit.
[2024-06-01 16:47:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 740 unsolved
[2024-06-01 16:47:24] [INFO ] Deduced a trap composed of 159 places in 225 ms of which 4 ms to minimize.
[2024-06-01 16:47:24] [INFO ] Deduced a trap composed of 137 places in 202 ms of which 4 ms to minimize.
[2024-06-01 16:47:24] [INFO ] Deduced a trap composed of 136 places in 147 ms of which 3 ms to minimize.
[2024-06-01 16:47:25] [INFO ] Deduced a trap composed of 136 places in 144 ms of which 3 ms to minimize.
[2024-06-01 16:47:25] [INFO ] Deduced a trap composed of 136 places in 157 ms of which 2 ms to minimize.
[2024-06-01 16:47:25] [INFO ] Deduced a trap composed of 136 places in 223 ms of which 4 ms to minimize.
[2024-06-01 16:47:25] [INFO ] Deduced a trap composed of 167 places in 181 ms of which 3 ms to minimize.
[2024-06-01 16:47:25] [INFO ] Deduced a trap composed of 144 places in 184 ms of which 3 ms to minimize.
[2024-06-01 16:47:26] [INFO ] Deduced a trap composed of 136 places in 184 ms of which 3 ms to minimize.
[2024-06-01 16:47:26] [INFO ] Deduced a trap composed of 140 places in 149 ms of which 4 ms to minimize.
[2024-06-01 16:47:26] [INFO ] Deduced a trap composed of 143 places in 140 ms of which 3 ms to minimize.
[2024-06-01 16:47:26] [INFO ] Deduced a trap composed of 139 places in 145 ms of which 2 ms to minimize.
[2024-06-01 16:47:26] [INFO ] Deduced a trap composed of 142 places in 148 ms of which 2 ms to minimize.
[2024-06-01 16:47:26] [INFO ] Deduced a trap composed of 143 places in 145 ms of which 3 ms to minimize.
[2024-06-01 16:47:26] [INFO ] Deduced a trap composed of 144 places in 144 ms of which 2 ms to minimize.
[2024-06-01 16:47:27] [INFO ] Deduced a trap composed of 144 places in 140 ms of which 3 ms to minimize.
[2024-06-01 16:47:27] [INFO ] Deduced a trap composed of 139 places in 141 ms of which 3 ms to minimize.
[2024-06-01 16:47:27] [INFO ] Deduced a trap composed of 144 places in 140 ms of which 3 ms to minimize.
[2024-06-01 16:47:27] [INFO ] Deduced a trap composed of 141 places in 144 ms of which 3 ms to minimize.
[2024-06-01 16:47:27] [INFO ] Deduced a trap composed of 144 places in 262 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 740 unsolved
[2024-06-01 16:47:29] [INFO ] Deduced a trap composed of 144 places in 231 ms of which 3 ms to minimize.
[2024-06-01 16:47:29] [INFO ] Deduced a trap composed of 141 places in 286 ms of which 4 ms to minimize.
[2024-06-01 16:47:29] [INFO ] Deduced a trap composed of 163 places in 197 ms of which 4 ms to minimize.
[2024-06-01 16:47:29] [INFO ] Deduced a trap composed of 159 places in 203 ms of which 3 ms to minimize.
[2024-06-01 16:47:30] [INFO ] Deduced a trap composed of 143 places in 184 ms of which 3 ms to minimize.
[2024-06-01 16:47:30] [INFO ] Deduced a trap composed of 179 places in 236 ms of which 3 ms to minimize.
[2024-06-01 16:47:30] [INFO ] Deduced a trap composed of 144 places in 211 ms of which 3 ms to minimize.
[2024-06-01 16:47:30] [INFO ] Deduced a trap composed of 146 places in 208 ms of which 3 ms to minimize.
[2024-06-01 16:47:31] [INFO ] Deduced a trap composed of 139 places in 186 ms of which 3 ms to minimize.
[2024-06-01 16:47:31] [INFO ] Deduced a trap composed of 136 places in 171 ms of which 2 ms to minimize.
[2024-06-01 16:47:31] [INFO ] Deduced a trap composed of 136 places in 167 ms of which 3 ms to minimize.
[2024-06-01 16:47:31] [INFO ] Deduced a trap composed of 139 places in 164 ms of which 3 ms to minimize.
[2024-06-01 16:47:31] [INFO ] Deduced a trap composed of 141 places in 170 ms of which 4 ms to minimize.
[2024-06-01 16:47:31] [INFO ] Deduced a trap composed of 143 places in 217 ms of which 4 ms to minimize.
[2024-06-01 16:47:32] [INFO ] Deduced a trap composed of 138 places in 209 ms of which 3 ms to minimize.
[2024-06-01 16:47:32] [INFO ] Deduced a trap composed of 144 places in 159 ms of which 3 ms to minimize.
[2024-06-01 16:47:32] [INFO ] Deduced a trap composed of 140 places in 160 ms of which 3 ms to minimize.
[2024-06-01 16:47:32] [INFO ] Deduced a trap composed of 142 places in 165 ms of which 3 ms to minimize.
[2024-06-01 16:47:32] [INFO ] Deduced a trap composed of 143 places in 161 ms of which 3 ms to minimize.
[2024-06-01 16:47:33] [INFO ] Deduced a trap composed of 147 places in 219 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 740 unsolved
[2024-06-01 16:47:40] [INFO ] Deduced a trap composed of 136 places in 199 ms of which 3 ms to minimize.
[2024-06-01 16:47:40] [INFO ] Deduced a trap composed of 94 places in 206 ms of which 3 ms to minimize.
[2024-06-01 16:47:41] [INFO ] Deduced a trap composed of 158 places in 216 ms of which 3 ms to minimize.
[2024-06-01 16:47:41] [INFO ] Deduced a trap composed of 136 places in 159 ms of which 3 ms to minimize.
[2024-06-01 16:47:41] [INFO ] Deduced a trap composed of 141 places in 169 ms of which 4 ms to minimize.
[2024-06-01 16:47:41] [INFO ] Deduced a trap composed of 136 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:47:42] [INFO ] Deduced a trap composed of 136 places in 218 ms of which 3 ms to minimize.
[2024-06-01 16:47:42] [INFO ] Deduced a trap composed of 143 places in 234 ms of which 4 ms to minimize.
[2024-06-01 16:47:43] [INFO ] Deduced a trap composed of 144 places in 194 ms of which 3 ms to minimize.
[2024-06-01 16:47:43] [INFO ] Deduced a trap composed of 139 places in 220 ms of which 4 ms to minimize.
[2024-06-01 16:47:43] [INFO ] Deduced a trap composed of 96 places in 248 ms of which 3 ms to minimize.
[2024-06-01 16:47:44] [INFO ] Deduced a trap composed of 136 places in 224 ms of which 3 ms to minimize.
[2024-06-01 16:47:44] [INFO ] Deduced a trap composed of 97 places in 219 ms of which 4 ms to minimize.
[2024-06-01 16:47:44] [INFO ] Deduced a trap composed of 96 places in 202 ms of which 3 ms to minimize.
[2024-06-01 16:47:44] [INFO ] Deduced a trap composed of 97 places in 180 ms of which 3 ms to minimize.
[2024-06-01 16:47:44] [INFO ] Deduced a trap composed of 97 places in 215 ms of which 3 ms to minimize.
[2024-06-01 16:47:45] [INFO ] Deduced a trap composed of 97 places in 181 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 17/149 constraints. Problems are: Problem set: 0 solved, 740 unsolved
[2024-06-01 16:47:47] [INFO ] Deduced a trap composed of 142 places in 206 ms of which 4 ms to minimize.
[2024-06-01 16:47:47] [INFO ] Deduced a trap composed of 140 places in 221 ms of which 3 ms to minimize.
[2024-06-01 16:47:47] [INFO ] Deduced a trap composed of 139 places in 204 ms of which 3 ms to minimize.
[2024-06-01 16:47:48] [INFO ] Deduced a trap composed of 141 places in 223 ms of which 4 ms to minimize.
[2024-06-01 16:47:48] [INFO ] Deduced a trap composed of 142 places in 222 ms of which 4 ms to minimize.
[2024-06-01 16:47:48] [INFO ] Deduced a trap composed of 136 places in 222 ms of which 3 ms to minimize.
[2024-06-01 16:47:48] [INFO ] Deduced a trap composed of 136 places in 197 ms of which 3 ms to minimize.
[2024-06-01 16:47:48] [INFO ] Deduced a trap composed of 136 places in 196 ms of which 4 ms to minimize.
SMT process timed out in 31458ms, After SMT, problems are : Problem set: 0 solved, 740 unsolved
Search for dead transitions found 0 dead transitions in 31469ms
Starting structural reductions in SI_LTL mode, iteration 1 : 530/625 places, 746/840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 81012 ms. Remains : 530/625 places, 746/840 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLCardinality-00
Stuttering criterion allowed to conclude after 143 steps with 8 reset in 7 ms.
FORMULA PolyORBNT-PT-S05J40-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLCardinality-00 finished in 81274 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 U X(p1)) U (p1&&X(G(!p0)))))))'
Support contains 44 out of 625 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 625/625 places, 840/840 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 624 transition count 840
Applied a total of 1 rules in 13 ms. Remains 624 /625 variables (removed 1) and now considering 840/840 (removed 0) transitions.
Running 834 sub problems to find dead transitions.
[2024-06-01 16:47:49] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
// Phase 1: matrix 836 rows 624 cols
[2024-06-01 16:47:49] [INFO ] Computed 97 invariants in 11 ms
[2024-06-01 16:47:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 834 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 834 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 834 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 6/624 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 834 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 624/1460 variables, and 97 constraints, problems are : Problem set: 0 solved, 834 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/624 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 834/834 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 834 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 834 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 834 unsolved
[2024-06-01 16:48:12] [INFO ] Deduced a trap composed of 98 places in 148 ms of which 3 ms to minimize.
[2024-06-01 16:48:12] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 2 ms to minimize.
[2024-06-01 16:48:12] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 3 ms to minimize.
[2024-06-01 16:48:14] [INFO ] Deduced a trap composed of 97 places in 167 ms of which 3 ms to minimize.
[2024-06-01 16:48:14] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 2 ms to minimize.
[2024-06-01 16:48:16] [INFO ] Deduced a trap composed of 97 places in 194 ms of which 3 ms to minimize.
[2024-06-01 16:48:16] [INFO ] Deduced a trap composed of 97 places in 168 ms of which 3 ms to minimize.
[2024-06-01 16:48:18] [INFO ] Deduced a trap composed of 98 places in 127 ms of which 3 ms to minimize.
[2024-06-01 16:48:19] [INFO ] Deduced a trap composed of 98 places in 115 ms of which 2 ms to minimize.
[2024-06-01 16:48:19] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 2 ms to minimize.
[2024-06-01 16:48:19] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 3 ms to minimize.
[2024-06-01 16:48:20] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 2 ms to minimize.
[2024-06-01 16:48:20] [INFO ] Deduced a trap composed of 97 places in 141 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 13/104 constraints. Problems are: Problem set: 0 solved, 834 unsolved
[2024-06-01 16:48:23] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 1)
(s28 0)
(s29 0)
(s30 1)
(s31 0)
(s32 0)
(s33 timeout
0)
(s34 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 618/1460 variables, and 105 constraints, problems are : Problem set: 0 solved, 834 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/624 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/834 constraints, Known Traps: 14/14 constraints]
After SMT, in 41336ms problems are : Problem set: 0 solved, 834 unsolved
Search for dead transitions found 0 dead transitions in 41345ms
[2024-06-01 16:48:30] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
[2024-06-01 16:48:30] [INFO ] Invariant cache hit.
[2024-06-01 16:48:31] [INFO ] Implicit Places using invariants in 868 ms returned []
[2024-06-01 16:48:31] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
[2024-06-01 16:48:31] [INFO ] Invariant cache hit.
[2024-06-01 16:48:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:48:37] [INFO ] Implicit Places using invariants and state equation in 6029 ms returned []
Implicit Place search using SMT with State Equation took 6900 ms to find 0 implicit places.
Running 834 sub problems to find dead transitions.
[2024-06-01 16:48:37] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
[2024-06-01 16:48:37] [INFO ] Invariant cache hit.
[2024-06-01 16:48:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 834 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 834 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 834 unsolved
At refinement iteration 3 (OVERLAPS) 6/624 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 834 unsolved
[2024-06-01 16:48:59] [INFO ] Deduced a trap composed of 24 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:49:01] [INFO ] Deduced a trap composed of 301 places in 226 ms of which 3 ms to minimize.
[2024-06-01 16:49:01] [INFO ] Deduced a trap composed of 291 places in 210 ms of which 3 ms to minimize.
[2024-06-01 16:49:01] [INFO ] Deduced a trap composed of 297 places in 214 ms of which 4 ms to minimize.
[2024-06-01 16:49:02] [INFO ] Deduced a trap composed of 294 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:49:02] [INFO ] Deduced a trap composed of 290 places in 269 ms of which 3 ms to minimize.
[2024-06-01 16:49:02] [INFO ] Deduced a trap composed of 301 places in 288 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/624 variables, 7/104 constraints. Problems are: Problem set: 0 solved, 834 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 624/1460 variables, and 104 constraints, problems are : Problem set: 0 solved, 834 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/624 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 834/834 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 834 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 834 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 834 unsolved
[2024-06-01 16:49:09] [INFO ] Deduced a trap composed of 98 places in 129 ms of which 2 ms to minimize.
[2024-06-01 16:49:10] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 2 ms to minimize.
[2024-06-01 16:49:10] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 1 ms to minimize.
[2024-06-01 16:49:10] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 2 ms to minimize.
[2024-06-01 16:49:14] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 834 unsolved
[2024-06-01 16:49:21] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 3 ms to minimize.
[2024-06-01 16:49:27] [INFO ] Deduced a trap composed of 97 places in 156 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/618 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 834 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 1)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 1)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 1)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 9)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 1)
(s128 0)
(s129 0)
(s130 1)
(s131 0)
(s132 1)
(s133 0)
(s134 0)
(s135 0)
(s136 1)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 1)
(s155 1)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 1)
(s164 0)
(s165 1)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 1)
(s179 1)
(s180 0)
(s181 1)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 1)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 1)
(s218 0)
(s219 1)
(s220 0)
(s221 0)
(s222 1)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 1)
(s229 0)
(s230 1)
(s231 0)
(s232 0)
(s233 0)
(s234 1)
(s235 1)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 1)
(s243 0)
(s244 1)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 1)
(s251 0)
(s252 1)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 1)
(s259 0)
(s260 0)
(s261 1)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 1)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 1)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 1)
(s287 0)
(s288 0)
(s289 1)
(s290 1)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 1)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 1)
(s312 0)
(s313 0)
(s314 0)
(s315 1)
(s316 0)
(s317 1)
(s318 1)
(s319 1)
(s320 0)
(s321 0)
(s322 1)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 1)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 1)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 1)
(s379 1)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 1)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 1)
(s419 1)
(s420 0)
(s421 0)
(s422 0)
(s423 1)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 1)
(s429 0)
(s431 0)
(s432 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 618/1460 variables, and 98 constraints, problems are : Problem set: 0 solved, 834 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/624 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/834 constraints, Known Traps: 7/14 constraints]
After SMT, in 61151ms problems are : Problem set: 0 solved, 834 unsolved
Search for dead transitions found 0 dead transitions in 61161ms
Starting structural reductions in LTL mode, iteration 1 : 624/625 places, 840/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109426 ms. Remains : 624/625 places, 840/840 transitions.
Stuttering acceptance computed with spot in 310 ms :[(OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0), (AND (NOT p1) p0), p0, (AND p1 p0)]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLCardinality-01
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J40-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLCardinality-01 finished in 109763 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(p1))&&(p2||F(!p1))&&p0)))'
Support contains 209 out of 625 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 625/625 places, 840/840 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 623 transition count 839
Applied a total of 3 rules in 17 ms. Remains 623 /625 variables (removed 2) and now considering 839/840 (removed 1) transitions.
Running 833 sub problems to find dead transitions.
[2024-06-01 16:49:39] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2024-06-01 16:49:39] [INFO ] Computed 97 invariants in 20 ms
[2024-06-01 16:49:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 97 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 16:50:01] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 2 ms to minimize.
[2024-06-01 16:50:01] [INFO ] Deduced a trap composed of 97 places in 96 ms of which 2 ms to minimize.
[2024-06-01 16:50:06] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 5 ms to minimize.
[2024-06-01 16:50:06] [INFO ] Deduced a trap composed of 97 places in 155 ms of which 2 ms to minimize.
[2024-06-01 16:50:07] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 2 ms to minimize.
[2024-06-01 16:50:07] [INFO ] Deduced a trap composed of 97 places in 166 ms of which 3 ms to minimize.
[2024-06-01 16:50:09] [INFO ] Deduced a trap composed of 98 places in 137 ms of which 2 ms to minimize.
[2024-06-01 16:50:10] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 2 ms to minimize.
[2024-06-01 16:50:10] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 2 ms to minimize.
[2024-06-01 16:50:10] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 10/101 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 16:50:15] [INFO ] Deduced a trap composed of 97 places in 90 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(s3 0)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 1)
(s16 1)
(s17 0)
(s18 0)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 1)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 1)
(s70 1)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 4)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 1)
(s100 0)
(s101 1)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 1)
(s110 1)
(s111 0)
(s112 1)
(s113 0)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 8)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 1)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 1)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 1)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 1)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 1)
(s189 0)
(s190 1)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 1)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 1)
(s208 1)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 1)
(s218 1)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 1)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 1)
(s250 0)
(s251 1)
(s252 1)
(s253 0)
(s254 1)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 1)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 1)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 1)
(s290 0)
(s291 1)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 1)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 1)
(s322 0)
(s323 1)
(s324 0)
(s325 0)
(s326 0)
(s327 1)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 1)
(s339 1)
(s340 0)
(s341 0)
(s342 1)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s352 0)
(s353 1)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 1)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 1)
(s377 1)
(s378 1)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 1)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 1)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 102 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 11/11 constraints]
After SMT, in 41300ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 41309ms
[2024-06-01 16:50:20] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-06-01 16:50:20] [INFO ] Invariant cache hit.
[2024-06-01 16:50:21] [INFO ] Implicit Places using invariants in 690 ms returned []
[2024-06-01 16:50:21] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-06-01 16:50:21] [INFO ] Invariant cache hit.
[2024-06-01 16:50:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:50:25] [INFO ] Implicit Places using invariants and state equation in 4737 ms returned []
Implicit Place search using SMT with State Equation took 5430 ms to find 0 implicit places.
Running 833 sub problems to find dead transitions.
[2024-06-01 16:50:25] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-06-01 16:50:25] [INFO ] Invariant cache hit.
[2024-06-01 16:50:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 16:50:47] [INFO ] Deduced a trap composed of 145 places in 286 ms of which 4 ms to minimize.
[2024-06-01 16:50:47] [INFO ] Deduced a trap composed of 24 places in 250 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/623 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 16:50:53] [INFO ] Deduced a trap composed of 329 places in 285 ms of which 5 ms to minimize.
[2024-06-01 16:50:53] [INFO ] Deduced a trap composed of 325 places in 249 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 1.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 1.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 1.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 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 9.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 (/ 1.0 3.0))
(s134 1.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 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.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 1.0)
(s181 0.0)
(s182 0.0)
(s183 1.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 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 623/1458 variables, and 101 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 16:50:58] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 2 ms to minimize.
[2024-06-01 16:50:59] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 2 ms to minimize.
[2024-06-01 16:50:59] [INFO ] Deduced a trap composed of 97 places in 104 ms of which 2 ms to minimize.
[2024-06-01 16:51:03] [INFO ] Deduced a trap composed of 98 places in 222 ms of which 4 ms to minimize.
[2024-06-01 16:51:05] [INFO ] Deduced a trap composed of 97 places in 148 ms of which 2 ms to minimize.
[2024-06-01 16:51:05] [INFO ] Deduced a trap composed of 97 places in 92 ms of which 1 ms to minimize.
[2024-06-01 16:51:06] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 3 ms to minimize.
[2024-06-01 16:51:06] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 2 ms to minimize.
[2024-06-01 16:51:06] [INFO ] Deduced a trap composed of 98 places in 126 ms of which 2 ms to minimize.
[2024-06-01 16:51:06] [INFO ] Deduced a trap composed of 97 places in 96 ms of which 2 ms to minimize.
[2024-06-01 16:51:06] [INFO ] Deduced a trap composed of 98 places in 136 ms of which 2 ms to minimize.
[2024-06-01 16:51:07] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 2 ms to minimize.
[2024-06-01 16:51:07] [INFO ] Deduced a trap composed of 97 places in 135 ms of which 2 ms to minimize.
[2024-06-01 16:51:08] [INFO ] Deduced a trap composed of 98 places in 200 ms of which 3 ms to minimize.
[2024-06-01 16:51:08] [INFO ] Deduced a trap composed of 97 places in 206 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 15/106 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 16:51:09] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/617 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 5 (OVERLAPS) 6/623 variables, 6/113 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/623 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 623/1458 variables, and 117 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 20/20 constraints]
After SMT, in 61362ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 61373ms
Starting structural reductions in LTL mode, iteration 1 : 623/625 places, 839/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108134 ms. Remains : 623/625 places, 839/840 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), true]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J40-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLCardinality-03 finished in 108379 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 625 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 625/625 places, 840/840 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 623 transition count 839
Applied a total of 3 rules in 37 ms. Remains 623 /625 variables (removed 2) and now considering 839/840 (removed 1) transitions.
Running 833 sub problems to find dead transitions.
[2024-06-01 16:51:27] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-06-01 16:51:27] [INFO ] Invariant cache hit.
[2024-06-01 16:51:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 16:51:48] [INFO ] Deduced a trap composed of 145 places in 319 ms of which 5 ms to minimize.
[2024-06-01 16:51:48] [INFO ] Deduced a trap composed of 24 places in 282 ms of which 5 ms to minimize.
SMT process timed out in 21396ms, After SMT, problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 21407ms
[2024-06-01 16:51:48] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-06-01 16:51:48] [INFO ] Invariant cache hit.
[2024-06-01 16:51:49] [INFO ] Implicit Places using invariants in 668 ms returned []
[2024-06-01 16:51:49] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-06-01 16:51:49] [INFO ] Invariant cache hit.
[2024-06-01 16:51:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:51:56] [INFO ] Implicit Places using invariants and state equation in 7451 ms returned []
Implicit Place search using SMT with State Equation took 8121 ms to find 0 implicit places.
Running 833 sub problems to find dead transitions.
[2024-06-01 16:51:56] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-06-01 16:51:56] [INFO ] Invariant cache hit.
[2024-06-01 16:51:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 16:52:20] [INFO ] Deduced a trap composed of 145 places in 337 ms of which 5 ms to minimize.
[2024-06-01 16:52:20] [INFO ] Deduced a trap composed of 24 places in 284 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/623 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 16:52:26] [INFO ] Deduced a trap composed of 329 places in 279 ms of which 4 ms to minimize.
[2024-06-01 16:52:26] [INFO ] Deduced a trap composed of 325 places in 244 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 101 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 16:52:29] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 2 ms to minimize.
[2024-06-01 16:52:29] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 2 ms to minimize.
[2024-06-01 16:52:29] [INFO ] Deduced a trap composed of 97 places in 90 ms of which 1 ms to minimize.
[2024-06-01 16:52:34] [INFO ] Deduced a trap composed of 98 places in 200 ms of which 3 ms to minimize.
[2024-06-01 16:52:35] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 2 ms to minimize.
[2024-06-01 16:52:36] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 2 ms to minimize.
[2024-06-01 16:52:37] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 2 ms to minimize.
[2024-06-01 16:52:37] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 1 ms to minimize.
[2024-06-01 16:52:37] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 1 ms to minimize.
[2024-06-01 16:52:37] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 2 ms to minimize.
[2024-06-01 16:52:37] [INFO ] Deduced a trap composed of 98 places in 136 ms of which 2 ms to minimize.
[2024-06-01 16:52:37] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 2 ms to minimize.
[2024-06-01 16:52:38] [INFO ] Deduced a trap composed of 97 places in 136 ms of which 2 ms to minimize.
[2024-06-01 16:52:39] [INFO ] Deduced a trap composed of 98 places in 173 ms of which 3 ms to minimize.
[2024-06-01 16:52:39] [INFO ] Deduced a trap composed of 97 places in 154 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 15/106 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 16:52:40] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/617 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 5 (OVERLAPS) 6/623 variables, 6/113 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/623 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 623/1458 variables, and 117 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 20/20 constraints]
After SMT, in 61345ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 61359ms
Starting structural reductions in LTL mode, iteration 1 : 623/625 places, 839/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90931 ms. Remains : 623/625 places, 839/840 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 8919 steps with 646 reset in 63 ms.
FORMULA PolyORBNT-PT-S05J40-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLCardinality-04 finished in 91185 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)&&F((G(p1)||G(!p1))))))'
Support contains 42 out of 625 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 625/625 places, 840/840 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 624 transition count 795
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 91 place count 579 transition count 794
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 578 transition count 794
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 92 place count 578 transition count 750
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 180 place count 534 transition count 750
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 181 place count 533 transition count 749
Iterating global reduction 3 with 1 rules applied. Total rules applied 182 place count 533 transition count 749
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 186 place count 531 transition count 747
Applied a total of 186 rules in 84 ms. Remains 531 /625 variables (removed 94) and now considering 747/840 (removed 93) transitions.
Running 741 sub problems to find dead transitions.
[2024-06-01 16:52:58] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2024-06-01 16:52:58] [INFO ] Computed 97 invariants in 21 ms
[2024-06-01 16:52:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 741 unsolved
[2024-06-01 16:53:05] [INFO ] Deduced a trap composed of 137 places in 233 ms of which 4 ms to minimize.
[2024-06-01 16:53:05] [INFO ] Deduced a trap composed of 142 places in 211 ms of which 3 ms to minimize.
[2024-06-01 16:53:05] [INFO ] Deduced a trap composed of 137 places in 191 ms of which 3 ms to minimize.
[2024-06-01 16:53:06] [INFO ] Deduced a trap composed of 137 places in 208 ms of which 6 ms to minimize.
[2024-06-01 16:53:06] [INFO ] Deduced a trap composed of 137 places in 218 ms of which 4 ms to minimize.
[2024-06-01 16:53:06] [INFO ] Deduced a trap composed of 168 places in 201 ms of which 4 ms to minimize.
[2024-06-01 16:53:06] [INFO ] Deduced a trap composed of 137 places in 223 ms of which 3 ms to minimize.
[2024-06-01 16:53:07] [INFO ] Deduced a trap composed of 137 places in 218 ms of which 3 ms to minimize.
[2024-06-01 16:53:07] [INFO ] Deduced a trap composed of 138 places in 218 ms of which 4 ms to minimize.
[2024-06-01 16:53:07] [INFO ] Deduced a trap composed of 137 places in 227 ms of which 3 ms to minimize.
[2024-06-01 16:53:07] [INFO ] Deduced a trap composed of 137 places in 202 ms of which 4 ms to minimize.
[2024-06-01 16:53:07] [INFO ] Deduced a trap composed of 137 places in 198 ms of which 3 ms to minimize.
[2024-06-01 16:53:08] [INFO ] Deduced a trap composed of 137 places in 195 ms of which 4 ms to minimize.
[2024-06-01 16:53:08] [INFO ] Deduced a trap composed of 137 places in 181 ms of which 3 ms to minimize.
[2024-06-01 16:53:08] [INFO ] Deduced a trap composed of 137 places in 197 ms of which 3 ms to minimize.
[2024-06-01 16:53:08] [INFO ] Deduced a trap composed of 137 places in 218 ms of which 3 ms to minimize.
[2024-06-01 16:53:09] [INFO ] Deduced a trap composed of 140 places in 188 ms of which 3 ms to minimize.
[2024-06-01 16:53:09] [INFO ] Deduced a trap composed of 137 places in 202 ms of which 3 ms to minimize.
[2024-06-01 16:53:09] [INFO ] Deduced a trap composed of 137 places in 176 ms of which 2 ms to minimize.
[2024-06-01 16:53:09] [INFO ] Deduced a trap composed of 137 places in 182 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 741 unsolved
[2024-06-01 16:53:10] [INFO ] Deduced a trap composed of 137 places in 208 ms of which 4 ms to minimize.
[2024-06-01 16:53:10] [INFO ] Deduced a trap composed of 137 places in 181 ms of which 3 ms to minimize.
[2024-06-01 16:53:11] [INFO ] Deduced a trap composed of 174 places in 222 ms of which 4 ms to minimize.
[2024-06-01 16:53:11] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 3 ms to minimize.
[2024-06-01 16:53:11] [INFO ] Deduced a trap composed of 180 places in 176 ms of which 3 ms to minimize.
[2024-06-01 16:53:12] [INFO ] Deduced a trap composed of 137 places in 175 ms of which 3 ms to minimize.
[2024-06-01 16:53:12] [INFO ] Deduced a trap composed of 137 places in 224 ms of which 3 ms to minimize.
[2024-06-01 16:53:12] [INFO ] Deduced a trap composed of 137 places in 156 ms of which 3 ms to minimize.
[2024-06-01 16:53:12] [INFO ] Deduced a trap composed of 137 places in 220 ms of which 3 ms to minimize.
[2024-06-01 16:53:13] [INFO ] Deduced a trap composed of 137 places in 223 ms of which 3 ms to minimize.
[2024-06-01 16:53:13] [INFO ] Deduced a trap composed of 137 places in 237 ms of which 4 ms to minimize.
[2024-06-01 16:53:13] [INFO ] Deduced a trap composed of 137 places in 233 ms of which 4 ms to minimize.
[2024-06-01 16:53:13] [INFO ] Deduced a trap composed of 137 places in 248 ms of which 4 ms to minimize.
[2024-06-01 16:53:14] [INFO ] Deduced a trap composed of 137 places in 221 ms of which 4 ms to minimize.
[2024-06-01 16:53:14] [INFO ] Deduced a trap composed of 165 places in 245 ms of which 4 ms to minimize.
[2024-06-01 16:53:14] [INFO ] Deduced a trap composed of 137 places in 223 ms of which 3 ms to minimize.
[2024-06-01 16:53:14] [INFO ] Deduced a trap composed of 165 places in 203 ms of which 3 ms to minimize.
[2024-06-01 16:53:15] [INFO ] Deduced a trap composed of 137 places in 203 ms of which 3 ms to minimize.
[2024-06-01 16:53:15] [INFO ] Deduced a trap composed of 137 places in 248 ms of which 4 ms to minimize.
[2024-06-01 16:53:15] [INFO ] Deduced a trap composed of 168 places in 241 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 741 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/1274 variables, and 132 constraints, problems are : Problem set: 0 solved, 741 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/531 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 741/741 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 741 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 741 unsolved
[2024-06-01 16:53:38] [INFO ] Deduced a trap composed of 150 places in 240 ms of which 3 ms to minimize.
[2024-06-01 16:53:39] [INFO ] Deduced a trap composed of 168 places in 226 ms of which 4 ms to minimize.
[2024-06-01 16:53:39] [INFO ] Deduced a trap composed of 153 places in 248 ms of which 4 ms to minimize.
[2024-06-01 16:53:39] [INFO ] Deduced a trap composed of 174 places in 248 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/1274 variables, and 136 constraints, problems are : Problem set: 0 solved, 741 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/531 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/741 constraints, Known Traps: 44/44 constraints]
After SMT, in 41409ms problems are : Problem set: 0 solved, 741 unsolved
Search for dead transitions found 0 dead transitions in 41420ms
[2024-06-01 16:53:40] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
[2024-06-01 16:53:40] [INFO ] Invariant cache hit.
[2024-06-01 16:53:40] [INFO ] Implicit Places using invariants in 796 ms returned []
[2024-06-01 16:53:40] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
[2024-06-01 16:53:40] [INFO ] Invariant cache hit.
[2024-06-01 16:53:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:53:47] [INFO ] Implicit Places using invariants and state equation in 6953 ms returned []
Implicit Place search using SMT with State Equation took 7754 ms to find 0 implicit places.
[2024-06-01 16:53:47] [INFO ] Redundant transitions in 9 ms returned []
Running 741 sub problems to find dead transitions.
[2024-06-01 16:53:47] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
[2024-06-01 16:53:47] [INFO ] Invariant cache hit.
[2024-06-01 16:53:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 741 unsolved
[2024-06-01 16:53:54] [INFO ] Deduced a trap composed of 146 places in 202 ms of which 4 ms to minimize.
[2024-06-01 16:53:54] [INFO ] Deduced a trap composed of 142 places in 182 ms of which 3 ms to minimize.
[2024-06-01 16:53:54] [INFO ] Deduced a trap composed of 138 places in 180 ms of which 3 ms to minimize.
[2024-06-01 16:53:55] [INFO ] Deduced a trap composed of 164 places in 246 ms of which 4 ms to minimize.
[2024-06-01 16:53:55] [INFO ] Deduced a trap composed of 174 places in 218 ms of which 4 ms to minimize.
[2024-06-01 16:53:55] [INFO ] Deduced a trap composed of 143 places in 235 ms of which 4 ms to minimize.
[2024-06-01 16:53:55] [INFO ] Deduced a trap composed of 171 places in 246 ms of which 4 ms to minimize.
[2024-06-01 16:53:56] [INFO ] Deduced a trap composed of 165 places in 206 ms of which 3 ms to minimize.
[2024-06-01 16:53:56] [INFO ] Deduced a trap composed of 176 places in 228 ms of which 3 ms to minimize.
[2024-06-01 16:53:56] [INFO ] Deduced a trap composed of 168 places in 217 ms of which 4 ms to minimize.
[2024-06-01 16:53:56] [INFO ] Deduced a trap composed of 172 places in 225 ms of which 4 ms to minimize.
[2024-06-01 16:53:57] [INFO ] Deduced a trap composed of 181 places in 221 ms of which 4 ms to minimize.
[2024-06-01 16:53:57] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 4 ms to minimize.
[2024-06-01 16:53:57] [INFO ] Deduced a trap composed of 144 places in 196 ms of which 4 ms to minimize.
[2024-06-01 16:53:57] [INFO ] Deduced a trap composed of 142 places in 210 ms of which 4 ms to minimize.
[2024-06-01 16:53:58] [INFO ] Deduced a trap composed of 146 places in 226 ms of which 3 ms to minimize.
[2024-06-01 16:53:58] [INFO ] Deduced a trap composed of 139 places in 214 ms of which 4 ms to minimize.
[2024-06-01 16:53:58] [INFO ] Deduced a trap composed of 137 places in 197 ms of which 4 ms to minimize.
[2024-06-01 16:53:58] [INFO ] Deduced a trap composed of 137 places in 190 ms of which 6 ms to minimize.
[2024-06-01 16:53:58] [INFO ] Deduced a trap composed of 141 places in 166 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 741 unsolved
[2024-06-01 16:53:59] [INFO ] Deduced a trap composed of 168 places in 202 ms of which 4 ms to minimize.
[2024-06-01 16:54:00] [INFO ] Deduced a trap composed of 137 places in 199 ms of which 3 ms to minimize.
[2024-06-01 16:54:00] [INFO ] Deduced a trap composed of 171 places in 211 ms of which 4 ms to minimize.
[2024-06-01 16:54:00] [INFO ] Deduced a trap composed of 137 places in 180 ms of which 4 ms to minimize.
[2024-06-01 16:54:01] [INFO ] Deduced a trap composed of 137 places in 216 ms of which 4 ms to minimize.
[2024-06-01 16:54:01] [INFO ] Deduced a trap composed of 137 places in 163 ms of which 3 ms to minimize.
[2024-06-01 16:54:01] [INFO ] Deduced a trap composed of 137 places in 167 ms of which 3 ms to minimize.
[2024-06-01 16:54:01] [INFO ] Deduced a trap composed of 137 places in 162 ms of which 2 ms to minimize.
[2024-06-01 16:54:01] [INFO ] Deduced a trap composed of 137 places in 165 ms of which 2 ms to minimize.
[2024-06-01 16:54:02] [INFO ] Deduced a trap composed of 141 places in 205 ms of which 3 ms to minimize.
[2024-06-01 16:54:02] [INFO ] Deduced a trap composed of 142 places in 177 ms of which 3 ms to minimize.
[2024-06-01 16:54:02] [INFO ] Deduced a trap composed of 142 places in 186 ms of which 2 ms to minimize.
[2024-06-01 16:54:02] [INFO ] Deduced a trap composed of 166 places in 175 ms of which 2 ms to minimize.
[2024-06-01 16:54:02] [INFO ] Deduced a trap composed of 171 places in 166 ms of which 3 ms to minimize.
[2024-06-01 16:54:02] [INFO ] Deduced a trap composed of 172 places in 172 ms of which 2 ms to minimize.
[2024-06-01 16:54:03] [INFO ] Deduced a trap composed of 144 places in 168 ms of which 2 ms to minimize.
[2024-06-01 16:54:03] [INFO ] Deduced a trap composed of 137 places in 166 ms of which 3 ms to minimize.
[2024-06-01 16:54:03] [INFO ] Deduced a trap composed of 145 places in 160 ms of which 3 ms to minimize.
[2024-06-01 16:54:03] [INFO ] Deduced a trap composed of 146 places in 164 ms of which 2 ms to minimize.
[2024-06-01 16:54:04] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 741 unsolved
[2024-06-01 16:54:12] [INFO ] Deduced a trap composed of 141 places in 208 ms of which 4 ms to minimize.
[2024-06-01 16:54:13] [INFO ] Deduced a trap composed of 97 places in 233 ms of which 4 ms to minimize.
[2024-06-01 16:54:13] [INFO ] Deduced a trap composed of 165 places in 234 ms of which 3 ms to minimize.
[2024-06-01 16:54:13] [INFO ] Deduced a trap composed of 94 places in 200 ms of which 4 ms to minimize.
[2024-06-01 16:54:13] [INFO ] Deduced a trap composed of 137 places in 200 ms of which 4 ms to minimize.
[2024-06-01 16:54:14] [INFO ] Deduced a trap composed of 137 places in 209 ms of which 4 ms to minimize.
[2024-06-01 16:54:14] [INFO ] Deduced a trap composed of 137 places in 215 ms of which 5 ms to minimize.
[2024-06-01 16:54:14] [INFO ] Deduced a trap composed of 137 places in 180 ms of which 3 ms to minimize.
[2024-06-01 16:54:14] [INFO ] Deduced a trap composed of 137 places in 190 ms of which 4 ms to minimize.
[2024-06-01 16:54:14] [INFO ] Deduced a trap composed of 137 places in 186 ms of which 3 ms to minimize.
[2024-06-01 16:54:15] [INFO ] Deduced a trap composed of 137 places in 176 ms of which 4 ms to minimize.
[2024-06-01 16:54:15] [INFO ] Deduced a trap composed of 137 places in 181 ms of which 3 ms to minimize.
[2024-06-01 16:54:15] [INFO ] Deduced a trap composed of 137 places in 185 ms of which 3 ms to minimize.
[2024-06-01 16:54:15] [INFO ] Deduced a trap composed of 137 places in 230 ms of which 3 ms to minimize.
[2024-06-01 16:54:17] [INFO ] Deduced a trap composed of 145 places in 231 ms of which 4 ms to minimize.
[2024-06-01 16:54:17] [INFO ] Deduced a trap composed of 146 places in 203 ms of which 4 ms to minimize.
[2024-06-01 16:54:17] [INFO ] Deduced a trap composed of 144 places in 232 ms of which 4 ms to minimize.
[2024-06-01 16:54:18] [INFO ] Deduced a trap composed of 143 places in 209 ms of which 3 ms to minimize.
[2024-06-01 16:54:18] [INFO ] Deduced a trap composed of 157 places in 190 ms of which 2 ms to minimize.
[2024-06-01 16:54:18] [INFO ] Deduced a trap composed of 164 places in 190 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 741 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/1274 variables, and 152 constraints, problems are : Problem set: 0 solved, 741 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/531 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 741/741 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 741 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 60/152 constraints. Problems are: Problem set: 0 solved, 741 unsolved
[2024-06-01 16:54:29] [INFO ] Deduced a trap composed of 174 places in 266 ms of which 3 ms to minimize.
[2024-06-01 16:54:44] [INFO ] Deduced a trap composed of 168 places in 258 ms of which 4 ms to minimize.
[2024-06-01 16:54:44] [INFO ] Deduced a trap composed of 165 places in 256 ms of which 4 ms to minimize.
[2024-06-01 16:54:45] [INFO ] Deduced a trap composed of 137 places in 254 ms of which 4 ms to minimize.
[2024-06-01 16:54:45] [INFO ] Deduced a trap composed of 171 places in 255 ms of which 4 ms to minimize.
[2024-06-01 16:54:46] [INFO ] Deduced a trap composed of 137 places in 252 ms of which 4 ms to minimize.
[2024-06-01 16:54:46] [INFO ] Deduced a trap composed of 137 places in 251 ms of which 4 ms to minimize.
[2024-06-01 16:54:46] [INFO ] Deduced a trap composed of 137 places in 252 ms of which 4 ms to minimize.
[2024-06-01 16:54:47] [INFO ] Deduced a trap composed of 137 places in 250 ms of which 4 ms to minimize.
[2024-06-01 16:54:47] [INFO ] Deduced a trap composed of 137 places in 252 ms of which 4 ms to minimize.
[2024-06-01 16:54:48] [INFO ] Deduced a trap composed of 137 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:54:48] [INFO ] Deduced a trap composed of 137 places in 254 ms of which 3 ms to minimize.
[2024-06-01 16:54:49] [INFO ] Deduced a trap composed of 137 places in 280 ms of which 4 ms to minimize.
SMT process timed out in 61413ms, After SMT, problems are : Problem set: 0 solved, 741 unsolved
Search for dead transitions found 0 dead transitions in 61421ms
Starting structural reductions in SI_LTL mode, iteration 1 : 531/625 places, 747/840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 110702 ms. Remains : 531/625 places, 747/840 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), false]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLCardinality-06
Stuttering criterion allowed to conclude after 72 steps with 4 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J40-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLCardinality-06 finished in 110825 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||G(F(p1))))))'
Support contains 4 out of 625 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 625/625 places, 840/840 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 624 transition count 795
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 579 transition count 795
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 90 place count 579 transition count 750
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 180 place count 534 transition count 750
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 533 transition count 749
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 533 transition count 749
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 184 place count 532 transition count 748
Applied a total of 184 rules in 89 ms. Remains 532 /625 variables (removed 93) and now considering 748/840 (removed 92) transitions.
Running 742 sub problems to find dead transitions.
[2024-06-01 16:54:49] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
// Phase 1: matrix 744 rows 532 cols
[2024-06-01 16:54:49] [INFO ] Computed 97 invariants in 21 ms
[2024-06-01 16:54:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 3 (OVERLAPS) 6/532 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-06-01 16:55:07] [INFO ] Deduced a trap composed of 15 places in 228 ms of which 3 ms to minimize.
[2024-06-01 16:55:09] [INFO ] Deduced a trap composed of 136 places in 237 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 742 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/1276 variables, and 99 constraints, problems are : Problem set: 0 solved, 742 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 742/742 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 742 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 3 (OVERLAPS) 6/532 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-06-01 16:55:18] [INFO ] Deduced a trap composed of 178 places in 192 ms of which 3 ms to minimize.
[2024-06-01 16:55:18] [INFO ] Deduced a trap composed of 166 places in 216 ms of which 4 ms to minimize.
[2024-06-01 16:55:19] [INFO ] Deduced a trap composed of 175 places in 245 ms of which 4 ms to minimize.
[2024-06-01 16:55:19] [INFO ] Deduced a trap composed of 172 places in 219 ms of which 4 ms to minimize.
[2024-06-01 16:55:19] [INFO ] Deduced a trap composed of 93 places in 220 ms of which 4 ms to minimize.
[2024-06-01 16:55:19] [INFO ] Deduced a trap composed of 187 places in 206 ms of which 3 ms to minimize.
[2024-06-01 16:55:20] [INFO ] Deduced a trap composed of 169 places in 206 ms of which 5 ms to minimize.
[2024-06-01 16:55:20] [INFO ] Deduced a trap composed of 175 places in 203 ms of which 3 ms to minimize.
[2024-06-01 16:55:20] [INFO ] Deduced a trap composed of 163 places in 191 ms of which 4 ms to minimize.
[2024-06-01 16:55:20] [INFO ] Deduced a trap composed of 175 places in 200 ms of which 4 ms to minimize.
[2024-06-01 16:55:20] [INFO ] Deduced a trap composed of 163 places in 164 ms of which 3 ms to minimize.
[2024-06-01 16:55:21] [INFO ] Deduced a trap composed of 184 places in 204 ms of which 4 ms to minimize.
[2024-06-01 16:55:21] [INFO ] Deduced a trap composed of 160 places in 245 ms of which 4 ms to minimize.
[2024-06-01 16:55:21] [INFO ] Deduced a trap composed of 175 places in 204 ms of which 3 ms to minimize.
[2024-06-01 16:55:21] [INFO ] Deduced a trap composed of 173 places in 205 ms of which 4 ms to minimize.
[2024-06-01 16:55:22] [INFO ] Deduced a trap composed of 182 places in 198 ms of which 3 ms to minimize.
[2024-06-01 16:55:22] [INFO ] Deduced a trap composed of 172 places in 213 ms of which 3 ms to minimize.
[2024-06-01 16:55:22] [INFO ] Deduced a trap composed of 187 places in 231 ms of which 3 ms to minimize.
[2024-06-01 16:55:22] [INFO ] Deduced a trap composed of 172 places in 199 ms of which 4 ms to minimize.
[2024-06-01 16:55:23] [INFO ] Deduced a trap composed of 169 places in 199 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-06-01 16:55:25] [INFO ] Deduced a trap composed of 185 places in 199 ms of which 3 ms to minimize.
[2024-06-01 16:55:25] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 3 ms to minimize.
[2024-06-01 16:55:26] [INFO ] Deduced a trap composed of 195 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:55:26] [INFO ] Deduced a trap composed of 160 places in 231 ms of which 3 ms to minimize.
[2024-06-01 16:55:26] [INFO ] Deduced a trap composed of 204 places in 230 ms of which 4 ms to minimize.
[2024-06-01 16:55:27] [INFO ] Deduced a trap composed of 182 places in 195 ms of which 2 ms to minimize.
[2024-06-01 16:55:27] [INFO ] Deduced a trap composed of 166 places in 252 ms of which 4 ms to minimize.
[2024-06-01 16:55:30] [INFO ] Deduced a trap composed of 127 places in 284 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/1276 variables, and 127 constraints, problems are : Problem set: 0 solved, 742 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/742 constraints, Known Traps: 30/30 constraints]
After SMT, in 41356ms problems are : Problem set: 0 solved, 742 unsolved
Search for dead transitions found 0 dead transitions in 41365ms
[2024-06-01 16:55:30] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2024-06-01 16:55:30] [INFO ] Invariant cache hit.
[2024-06-01 16:55:31] [INFO ] Implicit Places using invariants in 854 ms returned []
[2024-06-01 16:55:31] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2024-06-01 16:55:31] [INFO ] Invariant cache hit.
[2024-06-01 16:55:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:55:39] [INFO ] Implicit Places using invariants and state equation in 7415 ms returned []
Implicit Place search using SMT with State Equation took 8272 ms to find 0 implicit places.
[2024-06-01 16:55:39] [INFO ] Redundant transitions in 9 ms returned []
Running 742 sub problems to find dead transitions.
[2024-06-01 16:55:39] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2024-06-01 16:55:39] [INFO ] Invariant cache hit.
[2024-06-01 16:55:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 3 (OVERLAPS) 6/532 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-06-01 16:55:57] [INFO ] Deduced a trap composed of 19 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:55:57] [INFO ] Deduced a trap composed of 15 places in 224 ms of which 3 ms to minimize.
[2024-06-01 16:55:59] [INFO ] Deduced a trap composed of 93 places in 244 ms of which 4 ms to minimize.
[2024-06-01 16:56:00] [INFO ] Deduced a trap composed of 93 places in 218 ms of which 4 ms to minimize.
[2024-06-01 16:56:00] [INFO ] Deduced a trap composed of 111 places in 223 ms of which 3 ms to minimize.
[2024-06-01 16:56:00] [INFO ] Deduced a trap composed of 93 places in 196 ms of which 2 ms to minimize.
[2024-06-01 16:56:00] [INFO ] Deduced a trap composed of 234 places in 238 ms of which 4 ms to minimize.
[2024-06-01 16:56:01] [INFO ] Deduced a trap composed of 93 places in 233 ms of which 4 ms to minimize.
[2024-06-01 16:56:01] [INFO ] Deduced a trap composed of 93 places in 242 ms of which 3 ms to minimize.
[2024-06-01 16:56:01] [INFO ] Deduced a trap composed of 163 places in 207 ms of which 4 ms to minimize.
[2024-06-01 16:56:01] [INFO ] Deduced a trap composed of 166 places in 237 ms of which 4 ms to minimize.
[2024-06-01 16:56:02] [INFO ] Deduced a trap composed of 166 places in 212 ms of which 4 ms to minimize.
[2024-06-01 16:56:02] [INFO ] Deduced a trap composed of 166 places in 236 ms of which 3 ms to minimize.
[2024-06-01 16:56:02] [INFO ] Deduced a trap composed of 175 places in 204 ms of which 3 ms to minimize.
[2024-06-01 16:56:02] [INFO ] Deduced a trap composed of 169 places in 205 ms of which 4 ms to minimize.
[2024-06-01 16:56:02] [INFO ] Deduced a trap composed of 169 places in 220 ms of which 4 ms to minimize.
[2024-06-01 16:56:03] [INFO ] Deduced a trap composed of 232 places in 261 ms of which 5 ms to minimize.
[2024-06-01 16:56:03] [INFO ] Deduced a trap composed of 235 places in 208 ms of which 3 ms to minimize.
[2024-06-01 16:56:03] [INFO ] Deduced a trap composed of 236 places in 202 ms of which 4 ms to minimize.
[2024-06-01 16:56:03] [INFO ] Deduced a trap composed of 238 places in 234 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 742 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/1276 variables, and 117 constraints, problems are : Problem set: 0 solved, 742 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 742/742 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 742 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 3 (OVERLAPS) 6/532 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-06-01 16:56:21] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 1 ms to minimize.
[2024-06-01 16:56:35] [INFO ] Deduced a trap composed of 209 places in 256 ms of which 4 ms to minimize.
[2024-06-01 16:56:35] [INFO ] Deduced a trap composed of 218 places in 243 ms of which 4 ms to minimize.
[2024-06-01 16:56:35] [INFO ] Deduced a trap composed of 204 places in 216 ms of which 4 ms to minimize.
[2024-06-01 16:56:35] [INFO ] Deduced a trap composed of 204 places in 242 ms of which 4 ms to minimize.
[2024-06-01 16:56:36] [INFO ] Deduced a trap composed of 229 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:56:36] [INFO ] Deduced a trap composed of 201 places in 257 ms of which 4 ms to minimize.
[2024-06-01 16:56:37] [INFO ] Deduced a trap composed of 204 places in 247 ms of which 3 ms to minimize.
[2024-06-01 16:56:37] [INFO ] Deduced a trap composed of 218 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:56:37] [INFO ] Deduced a trap composed of 223 places in 253 ms of which 4 ms to minimize.
[2024-06-01 16:56:38] [INFO ] Deduced a trap composed of 202 places in 275 ms of which 4 ms to minimize.
[2024-06-01 16:56:38] [INFO ] Deduced a trap composed of 210 places in 255 ms of which 4 ms to minimize.
[2024-06-01 16:56:38] [INFO ] Deduced a trap composed of 204 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:56:39] [INFO ] Deduced a trap composed of 204 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:56:39] [INFO ] Deduced a trap composed of 206 places in 251 ms of which 4 ms to minimize.
[2024-06-01 16:56:40] [INFO ] Deduced a trap composed of 202 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:56:40] [INFO ] Deduced a trap composed of 208 places in 255 ms of which 4 ms to minimize.
[2024-06-01 16:56:40] [INFO ] Deduced a trap composed of 212 places in 247 ms of which 4 ms to minimize.
SMT process timed out in 61511ms, After SMT, problems are : Problem set: 0 solved, 742 unsolved
Search for dead transitions found 0 dead transitions in 61523ms
Starting structural reductions in SI_LTL mode, iteration 1 : 532/625 places, 748/840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 111273 ms. Remains : 532/625 places, 748/840 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLCardinality-09
Product exploration explored 100000 steps with 5860 reset in 679 ms.
Product exploration explored 100000 steps with 5900 reset in 532 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 261 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2291 resets) in 292 ms. (136 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (1376 resets) in 217 ms. (183 steps per ms) remains 1/1 properties
[2024-06-01 16:56:42] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2024-06-01 16:56:42] [INFO ] Invariant cache hit.
[2024-06-01 16:56:42] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 275/287 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 222/509 variables, 75/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 22/531 variables, 17/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 744/1275 variables, 531/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1275 variables, 1/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1275 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/1276 variables, 1/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1276 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1276 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1276/1276 variables, and 630 constraints, problems are : Problem set: 0 solved, 1 unsolved in 554 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 532/532 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 275/287 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 222/509 variables, 75/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 531/1276 variables, and 97 constraints, problems are : Problem set: 1 solved, 0 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 758ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F p0)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 15 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-PT-S05J40-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S05J40-LTLCardinality-09 finished in 113935 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) U (p1&&X(F(p2)))))))'
Support contains 6 out of 625 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 625/625 places, 840/840 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 623 transition count 839
Applied a total of 3 rules in 36 ms. Remains 623 /625 variables (removed 2) and now considering 839/840 (removed 1) transitions.
Running 833 sub problems to find dead transitions.
[2024-06-01 16:56:43] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2024-06-01 16:56:43] [INFO ] Computed 97 invariants in 25 ms
[2024-06-01 16:56:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 97 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 16:57:06] [INFO ] Deduced a trap composed of 97 places in 136 ms of which 3 ms to minimize.
[2024-06-01 16:57:06] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 2 ms to minimize.
[2024-06-01 16:57:11] [INFO ] Deduced a trap composed of 98 places in 127 ms of which 3 ms to minimize.
[2024-06-01 16:57:11] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2024-06-01 16:57:11] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 2 ms to minimize.
[2024-06-01 16:57:11] [INFO ] Deduced a trap composed of 97 places in 191 ms of which 2 ms to minimize.
[2024-06-01 16:57:14] [INFO ] Deduced a trap composed of 98 places in 125 ms of which 2 ms to minimize.
[2024-06-01 16:57:14] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 2 ms to minimize.
[2024-06-01 16:57:14] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 2 ms to minimize.
[2024-06-01 16:57:15] [INFO ] Deduced a trap composed of 97 places in 137 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 10/101 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 16:57:19] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(s3 0)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 1)
(s16 1)
(s17 0)
(s18 0)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 1)
(timeout
s70 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 102 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 11/11 constraints]
After SMT, in 41468ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 41482ms
[2024-06-01 16:57:24] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-06-01 16:57:24] [INFO ] Invariant cache hit.
[2024-06-01 16:57:25] [INFO ] Implicit Places using invariants in 864 ms returned []
[2024-06-01 16:57:25] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-06-01 16:57:25] [INFO ] Invariant cache hit.
[2024-06-01 16:57:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:57:33] [INFO ] Implicit Places using invariants and state equation in 7866 ms returned []
Implicit Place search using SMT with State Equation took 8733 ms to find 0 implicit places.
Running 833 sub problems to find dead transitions.
[2024-06-01 16:57:33] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-06-01 16:57:33] [INFO ] Invariant cache hit.
[2024-06-01 16:57:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 16:57:56] [INFO ] Deduced a trap composed of 145 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:57:56] [INFO ] Deduced a trap composed of 24 places in 207 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/623 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 16:58:02] [INFO ] Deduced a trap composed of 329 places in 216 ms of which 3 ms to minimize.
[2024-06-01 16:58:02] [INFO ] Deduced a trap composed of 325 places in 197 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 101 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 16:58:06] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 1 ms to minimize.
[2024-06-01 16:58:06] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 2 ms to minimize.
[2024-06-01 16:58:06] [INFO ] Deduced a trap composed of 97 places in 96 ms of which 1 ms to minimize.
[2024-06-01 16:58:10] [INFO ] Deduced a trap composed of 98 places in 143 ms of which 2 ms to minimize.
[2024-06-01 16:58:11] [INFO ] Deduced a trap composed of 97 places in 94 ms of which 1 ms to minimize.
[2024-06-01 16:58:12] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 2 ms to minimize.
[2024-06-01 16:58:12] [INFO ] Deduced a trap composed of 97 places in 86 ms of which 1 ms to minimize.
[2024-06-01 16:58:12] [INFO ] Deduced a trap composed of 97 places in 91 ms of which 2 ms to minimize.
[2024-06-01 16:58:13] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 1 ms to minimize.
[2024-06-01 16:58:13] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 1 ms to minimize.
[2024-06-01 16:58:13] [INFO ] Deduced a trap composed of 98 places in 97 ms of which 1 ms to minimize.
[2024-06-01 16:58:13] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 2 ms to minimize.
[2024-06-01 16:58:14] [INFO ] Deduced a trap composed of 97 places in 96 ms of which 1 ms to minimize.
[2024-06-01 16:58:14] [INFO ] Deduced a trap composed of 98 places in 176 ms of which 2 ms to minimize.
[2024-06-01 16:58:14] [INFO ] Deduced a trap composed of 97 places in 137 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 15/106 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 16:58:15] [INFO ] Deduced a trap composed of 97 places in 86 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/617 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 5 (OVERLAPS) 6/623 variables, 6/113 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/623 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 16:58:35] [INFO ] Deduced a trap composed of 250 places in 297 ms of which 4 ms to minimize.
SMT process timed out in 61565ms, After SMT, problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 61571ms
Starting structural reductions in LTL mode, iteration 1 : 623/625 places, 839/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111827 ms. Remains : 623/625 places, 839/840 transitions.
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p0), (NOT p2)]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 3828 steps with 270 reset in 40 ms.
FORMULA PolyORBNT-PT-S05J40-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLCardinality-10 finished in 112209 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X((p1&&X((p1 U (p2||G(p1)))))))))'
Support contains 4 out of 625 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 625/625 places, 840/840 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 623 transition count 839
Applied a total of 3 rules in 44 ms. Remains 623 /625 variables (removed 2) and now considering 839/840 (removed 1) transitions.
Running 833 sub problems to find dead transitions.
[2024-06-01 16:58:35] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-06-01 16:58:35] [INFO ] Invariant cache hit.
[2024-06-01 16:58:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 97 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 16:58:58] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 2 ms to minimize.
[2024-06-01 16:58:58] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 2 ms to minimize.
[2024-06-01 16:58:58] [INFO ] Deduced a trap composed of 97 places in 94 ms of which 2 ms to minimize.
[2024-06-01 16:59:03] [INFO ] Deduced a trap composed of 98 places in 193 ms of which 3 ms to minimize.
[2024-06-01 16:59:04] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 2 ms to minimize.
[2024-06-01 16:59:04] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 2 ms to minimize.
[2024-06-01 16:59:05] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 3 ms to minimize.
[2024-06-01 16:59:05] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 3 ms to minimize.
[2024-06-01 16:59:05] [INFO ] Deduced a trap composed of 98 places in 94 ms of which 1 ms to minimize.
[2024-06-01 16:59:05] [INFO ] Deduced a trap composed of 97 places in 88 ms of which 2 ms to minimize.
[2024-06-01 16:59:06] [INFO ] Deduced a trap composed of 98 places in 92 ms of which 2 ms to minimize.
[2024-06-01 16:59:06] [INFO ] Deduced a trap composed of 97 places in 91 ms of which 2 ms to minimize.
[2024-06-01 16:59:07] [INFO ] Deduced a trap composed of 97 places in 124 ms of which 2 ms to minimize.
[2024-06-01 16:59:07] [INFO ] Deduced a trap composed of 98 places in 202 ms of which 2 ms to minimize.
[2024-06-01 16:59:07] [INFO ] Deduced a trap composed of 97 places in 160 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 15/106 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 16:59:08] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 1)
(s16 1)
(s17 0)
(s18 0)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 1)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 1)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 2)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 1)
(s70 1)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 4)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 1)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 1)
(s100 0)
(s101 1)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 1)
(s110 1)
(s111 0)
(s112 1)
(s113 0)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 9)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 1)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 1)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 1)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 1)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 1)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 1)
(s198 0)
(s199 1)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 1)
(s208 1)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 1)
(s219 0)
(s220 1)
(s221 0)
(s222 0)
(s223 1)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 1)
(s243 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 1)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 1)
(s263 1)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 1)
(s289 1)
(s290 0)
(s291 1)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 1)
(s303 0)
(s304 0)
(s305 1)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 1)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 1)
(s319 0)
(s320 0)
(s321 1)
(s322 0)
(s323 1)
(s324 0)
(s325 0)
(s326 0)
(s327 1)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 1)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 1)
(s352 0)
(s353 1)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 1)
(s377 0)
(s378 1)
(s379 0)
(s380 1)
(s381 0)
(s382 0)
(s383 1)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 107 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 16/16 constraints]
After SMT, in 41316ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 41330ms
[2024-06-01 16:59:16] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-06-01 16:59:16] [INFO ] Invariant cache hit.
[2024-06-01 16:59:17] [INFO ] Implicit Places using invariants in 842 ms returned []
[2024-06-01 16:59:17] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-06-01 16:59:17] [INFO ] Invariant cache hit.
[2024-06-01 16:59:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:59:26] [INFO ] Implicit Places using invariants and state equation in 8796 ms returned []
Implicit Place search using SMT with State Equation took 9642 ms to find 0 implicit places.
Running 833 sub problems to find dead transitions.
[2024-06-01 16:59:26] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-06-01 16:59:26] [INFO ] Invariant cache hit.
[2024-06-01 16:59:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 16:59:49] [INFO ] Deduced a trap composed of 145 places in 323 ms of which 5 ms to minimize.
[2024-06-01 16:59:49] [INFO ] Deduced a trap composed of 24 places in 328 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/623 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 16:59:56] [INFO ] Deduced a trap composed of 329 places in 207 ms of which 3 ms to minimize.
[2024-06-01 16:59:56] [INFO ] Deduced a trap composed of 325 places in 237 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 101 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 16:59:59] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 2 ms to minimize.
[2024-06-01 16:59:59] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 2 ms to minimize.
[2024-06-01 16:59:59] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 2 ms to minimize.
[2024-06-01 17:00:04] [INFO ] Deduced a trap composed of 98 places in 186 ms of which 3 ms to minimize.
[2024-06-01 17:00:05] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 2 ms to minimize.
[2024-06-01 17:00:06] [INFO ] Deduced a trap composed of 97 places in 135 ms of which 2 ms to minimize.
[2024-06-01 17:00:06] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 2 ms to minimize.
[2024-06-01 17:00:06] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 2 ms to minimize.
[2024-06-01 17:00:07] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 2 ms to minimize.
[2024-06-01 17:00:07] [INFO ] Deduced a trap composed of 97 places in 87 ms of which 1 ms to minimize.
[2024-06-01 17:00:07] [INFO ] Deduced a trap composed of 98 places in 121 ms of which 2 ms to minimize.
[2024-06-01 17:00:07] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 2 ms to minimize.
[2024-06-01 17:00:08] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 2 ms to minimize.
[2024-06-01 17:00:08] [INFO ] Deduced a trap composed of 98 places in 187 ms of which 3 ms to minimize.
[2024-06-01 17:00:08] [INFO ] Deduced a trap composed of 97 places in 150 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 15/106 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 17:00:09] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/617 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 5 (OVERLAPS) 6/623 variables, 6/113 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/623 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 623/1458 variables, and 117 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 20/20 constraints]
After SMT, in 61383ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 61398ms
Starting structural reductions in LTL mode, iteration 1 : 623/625 places, 839/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112424 ms. Remains : 623/625 places, 839/840 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 3348 steps with 560 reset in 18 ms.
FORMULA PolyORBNT-PT-S05J40-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLCardinality-14 finished in 112692 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(p0))))'
Support contains 1 out of 625 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 625/625 places, 840/840 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 623 transition count 839
Applied a total of 3 rules in 24 ms. Remains 623 /625 variables (removed 2) and now considering 839/840 (removed 1) transitions.
Running 833 sub problems to find dead transitions.
[2024-06-01 17:00:28] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-06-01 17:00:28] [INFO ] Invariant cache hit.
[2024-06-01 17:00:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 97 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 17:00:50] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 2 ms to minimize.
[2024-06-01 17:00:51] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 2 ms to minimize.
[2024-06-01 17:00:51] [INFO ] Deduced a trap composed of 97 places in 82 ms of which 2 ms to minimize.
[2024-06-01 17:00:55] [INFO ] Deduced a trap composed of 98 places in 211 ms of which 3 ms to minimize.
[2024-06-01 17:00:56] [INFO ] Deduced a trap composed of 97 places in 152 ms of which 2 ms to minimize.
[2024-06-01 17:00:57] [INFO ] Deduced a trap composed of 97 places in 84 ms of which 1 ms to minimize.
[2024-06-01 17:00:58] [INFO ] Deduced a trap composed of 97 places in 93 ms of which 2 ms to minimize.
[2024-06-01 17:00:58] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 1 ms to minimize.
[2024-06-01 17:00:58] [INFO ] Deduced a trap composed of 98 places in 78 ms of which 1 ms to minimize.
[2024-06-01 17:00:58] [INFO ] Deduced a trap composed of 97 places in 78 ms of which 1 ms to minimize.
[2024-06-01 17:00:58] [INFO ] Deduced a trap composed of 98 places in 76 ms of which 2 ms to minimize.
[2024-06-01 17:00:58] [INFO ] Deduced a trap composed of 97 places in 83 ms of which 1 ms to minimize.
[2024-06-01 17:00:59] [INFO ] Deduced a trap composed of 97 places in 136 ms of which 2 ms to minimize.
[2024-06-01 17:00:59] [INFO ] Deduced a trap composed of 98 places in 201 ms of which 2 ms to minimize.
[2024-06-01 17:00:59] [INFO ] Deduced a trap composed of 97 places in 152 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 15/106 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 17:01:01] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 107 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 16/16 constraints]
After SMT, in 41279ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 41287ms
[2024-06-01 17:01:09] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-06-01 17:01:09] [INFO ] Invariant cache hit.
[2024-06-01 17:01:10] [INFO ] Implicit Places using invariants in 656 ms returned []
[2024-06-01 17:01:10] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-06-01 17:01:10] [INFO ] Invariant cache hit.
[2024-06-01 17:01:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:01:18] [INFO ] Implicit Places using invariants and state equation in 8643 ms returned []
Implicit Place search using SMT with State Equation took 9303 ms to find 0 implicit places.
Running 833 sub problems to find dead transitions.
[2024-06-01 17:01:18] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-06-01 17:01:18] [INFO ] Invariant cache hit.
[2024-06-01 17:01:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 17:01:42] [INFO ] Deduced a trap composed of 145 places in 316 ms of which 5 ms to minimize.
[2024-06-01 17:01:42] [INFO ] Deduced a trap composed of 24 places in 271 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/623 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 17:01:48] [INFO ] Deduced a trap composed of 329 places in 279 ms of which 5 ms to minimize.
[2024-06-01 17:01:48] [INFO ] Deduced a trap composed of 325 places in 251 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 1.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 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 (/ 1.0 3.0))
(s94 1.0)
(s95 0.0)
(s96 1.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 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 9.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 1.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 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.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 1.0)
(s181 0.0)
(s182 0.0)
(s183 1.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 1.0)
(s213 0.0)
(s214 0.0)
(s215 2.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 1.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 1.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 1.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 (/ 1.0 3.0))
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.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 1.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.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 1.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 1.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 (/ 1.0 3.0))
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 1.0)
(s370 0.0)
(s371 1.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 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 623/1458 variables, and 101 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 17:01:51] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 2 ms to minimize.
[2024-06-01 17:01:52] [INFO ] Deduced a trap composed of 97 places in 142 ms of which 2 ms to minimize.
[2024-06-01 17:01:52] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 2 ms to minimize.
[2024-06-01 17:01:56] [INFO ] Deduced a trap composed of 98 places in 204 ms of which 3 ms to minimize.
[2024-06-01 17:01:58] [INFO ] Deduced a trap composed of 97 places in 137 ms of which 2 ms to minimize.
[2024-06-01 17:01:59] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 3 ms to minimize.
[2024-06-01 17:01:59] [INFO ] Deduced a trap composed of 97 places in 135 ms of which 2 ms to minimize.
[2024-06-01 17:01:59] [INFO ] Deduced a trap composed of 97 places in 124 ms of which 3 ms to minimize.
[2024-06-01 17:02:00] [INFO ] Deduced a trap composed of 98 places in 107 ms of which 2 ms to minimize.
[2024-06-01 17:02:00] [INFO ] Deduced a trap composed of 97 places in 137 ms of which 2 ms to minimize.
[2024-06-01 17:02:00] [INFO ] Deduced a trap composed of 98 places in 111 ms of which 2 ms to minimize.
[2024-06-01 17:02:00] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 2 ms to minimize.
[2024-06-01 17:02:01] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 2 ms to minimize.
[2024-06-01 17:02:01] [INFO ] Deduced a trap composed of 98 places in 220 ms of which 3 ms to minimize.
[2024-06-01 17:02:02] [INFO ] Deduced a trap composed of 97 places in 171 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 15/106 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 17:02:03] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/617 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 5 (OVERLAPS) 6/623 variables, 6/113 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/623 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 623/1458 variables, and 117 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 20/20 constraints]
After SMT, in 61517ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 61529ms
Starting structural reductions in LTL mode, iteration 1 : 623/625 places, 839/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112150 ms. Remains : 623/625 places, 839/840 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLCardinality-15
Product exploration explored 100000 steps with 25000 reset in 427 ms.
Product exploration explored 100000 steps with 25000 reset in 403 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 103 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
RANDOM walk for 465 steps (30 resets) in 14 ms. (31 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 124 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 1 out of 623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 839/839 transitions.
Applied a total of 0 rules in 13 ms. Remains 623 /623 variables (removed 0) and now considering 839/839 (removed 0) transitions.
Running 833 sub problems to find dead transitions.
[2024-06-01 17:02:22] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-06-01 17:02:22] [INFO ] Invariant cache hit.
[2024-06-01 17:02:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 97 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 17:02:44] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 2 ms to minimize.
[2024-06-01 17:02:45] [INFO ] Deduced a trap composed of 97 places in 153 ms of which 2 ms to minimize.
[2024-06-01 17:02:45] [INFO ] Deduced a trap composed of 97 places in 124 ms of which 2 ms to minimize.
[2024-06-01 17:02:50] [INFO ] Deduced a trap composed of 98 places in 211 ms of which 4 ms to minimize.
[2024-06-01 17:02:51] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 3 ms to minimize.
[2024-06-01 17:02:52] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 3 ms to minimize.
[2024-06-01 17:02:53] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 3 ms to minimize.
[2024-06-01 17:02:53] [INFO ] Deduced a trap composed of 97 places in 177 ms of which 3 ms to minimize.
[2024-06-01 17:02:53] [INFO ] Deduced a trap composed of 98 places in 105 ms of which 2 ms to minimize.
[2024-06-01 17:02:53] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 2 ms to minimize.
[2024-06-01 17:02:53] [INFO ] Deduced a trap composed of 98 places in 118 ms of which 2 ms to minimize.
[2024-06-01 17:02:53] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 2 ms to minimize.
[2024-06-01 17:02:54] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 2 ms to minimize.
[2024-06-01 17:02:54] [INFO ] Deduced a trap composed of 98 places in 140 ms of which 2 ms to minimize.
[2024-06-01 17:02:55] [INFO ] Deduced a trap composed of 97 places in 152 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 15/106 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 17:02:56] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 107 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 16/16 constraints]
After SMT, in 41434ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 41448ms
[2024-06-01 17:03:03] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-06-01 17:03:03] [INFO ] Invariant cache hit.
[2024-06-01 17:03:04] [INFO ] Implicit Places using invariants in 671 ms returned []
[2024-06-01 17:03:04] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-06-01 17:03:04] [INFO ] Invariant cache hit.
[2024-06-01 17:03:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:03:12] [INFO ] Implicit Places using invariants and state equation in 8505 ms returned []
Implicit Place search using SMT with State Equation took 9182 ms to find 0 implicit places.
Running 833 sub problems to find dead transitions.
[2024-06-01 17:03:12] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-06-01 17:03:12] [INFO ] Invariant cache hit.
[2024-06-01 17:03:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 17:03:34] [INFO ] Deduced a trap composed of 145 places in 313 ms of which 4 ms to minimize.
[2024-06-01 17:03:35] [INFO ] Deduced a trap composed of 24 places in 288 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/623 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 17:03:41] [INFO ] Deduced a trap composed of 329 places in 335 ms of which 4 ms to minimize.
[2024-06-01 17:03:41] [INFO ] Deduced a trap composed of 325 places in 287 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 101 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 17:03:45] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 3 ms to minimize.
[2024-06-01 17:03:46] [INFO ] Deduced a trap composed of 97 places in 148 ms of which 3 ms to minimize.
[2024-06-01 17:03:46] [INFO ] Deduced a trap composed of 97 places in 143 ms of which 2 ms to minimize.
[2024-06-01 17:03:51] [INFO ] Deduced a trap composed of 98 places in 165 ms of which 2 ms to minimize.
[2024-06-01 17:03:52] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 2 ms to minimize.
[2024-06-01 17:03:53] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 2 ms to minimize.
[2024-06-01 17:03:54] [INFO ] Deduced a trap composed of 97 places in 141 ms of which 2 ms to minimize.
[2024-06-01 17:03:54] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 1 ms to minimize.
[2024-06-01 17:03:54] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 1 ms to minimize.
[2024-06-01 17:03:54] [INFO ] Deduced a trap composed of 97 places in 93 ms of which 4 ms to minimize.
[2024-06-01 17:03:54] [INFO ] Deduced a trap composed of 98 places in 125 ms of which 2 ms to minimize.
[2024-06-01 17:03:54] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 1 ms to minimize.
[2024-06-01 17:03:55] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 2 ms to minimize.
[2024-06-01 17:03:56] [INFO ] Deduced a trap composed of 98 places in 196 ms of which 3 ms to minimize.
[2024-06-01 17:03:56] [INFO ] Deduced a trap composed of 97 places in 228 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 15/106 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 17:03:57] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/617 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 5 (OVERLAPS) 6/623 variables, 6/113 constraints. Problems are: Problem set: 0 solved, 833 unsolved
SMT process timed out in 61429ms, After SMT, problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 61444ms
Finished structural reductions in LTL mode , in 1 iterations and 112096 ms. Remains : 623/623 places, 839/839 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 103 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
RANDOM walk for 1079 steps (77 resets) in 13 ms. (77 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 25000 reset in 269 ms.
Product exploration explored 100000 steps with 25000 reset in 345 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 1 out of 623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 623/623 places, 839/839 transitions.
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 623 transition count 839
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 44 place count 623 transition count 840
Deduced a syphon composed of 46 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 623 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 622 transition count 839
Deduced a syphon composed of 45 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 622 transition count 839
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 91 places in 0 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 94 place count 622 transition count 839
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 138 place count 578 transition count 795
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 182 place count 578 transition count 795
Deduced a syphon composed of 47 places in 0 ms
Applied a total of 182 rules in 172 ms. Remains 578 /623 variables (removed 45) and now considering 795/839 (removed 44) transitions.
Running 789 sub problems to find dead transitions.
[2024-06-01 17:04:16] [INFO ] Flow matrix only has 791 transitions (discarded 4 similar events)
// Phase 1: matrix 791 rows 578 cols
[2024-06-01 17:04:16] [INFO ] Computed 97 invariants in 13 ms
[2024-06-01 17:04:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 789 unsolved
[2024-06-01 17:04:23] [INFO ] Deduced a trap composed of 137 places in 238 ms of which 4 ms to minimize.
[2024-06-01 17:04:24] [INFO ] Deduced a trap composed of 138 places in 192 ms of which 3 ms to minimize.
[2024-06-01 17:04:24] [INFO ] Deduced a trap composed of 137 places in 216 ms of which 3 ms to minimize.
[2024-06-01 17:04:24] [INFO ] Deduced a trap composed of 137 places in 175 ms of which 3 ms to minimize.
[2024-06-01 17:04:24] [INFO ] Deduced a trap composed of 137 places in 192 ms of which 3 ms to minimize.
[2024-06-01 17:04:24] [INFO ] Deduced a trap composed of 137 places in 190 ms of which 3 ms to minimize.
[2024-06-01 17:04:25] [INFO ] Deduced a trap composed of 155 places in 181 ms of which 3 ms to minimize.
[2024-06-01 17:04:25] [INFO ] Deduced a trap composed of 137 places in 197 ms of which 3 ms to minimize.
[2024-06-01 17:04:25] [INFO ] Deduced a trap composed of 137 places in 177 ms of which 3 ms to minimize.
[2024-06-01 17:04:25] [INFO ] Deduced a trap composed of 137 places in 181 ms of which 3 ms to minimize.
[2024-06-01 17:04:25] [INFO ] Deduced a trap composed of 137 places in 188 ms of which 3 ms to minimize.
[2024-06-01 17:04:26] [INFO ] Deduced a trap composed of 137 places in 188 ms of which 3 ms to minimize.
[2024-06-01 17:04:26] [INFO ] Deduced a trap composed of 137 places in 191 ms of which 3 ms to minimize.
[2024-06-01 17:04:26] [INFO ] Deduced a trap composed of 137 places in 177 ms of which 4 ms to minimize.
[2024-06-01 17:04:26] [INFO ] Deduced a trap composed of 137 places in 182 ms of which 3 ms to minimize.
[2024-06-01 17:04:26] [INFO ] Deduced a trap composed of 138 places in 181 ms of which 3 ms to minimize.
[2024-06-01 17:04:27] [INFO ] Deduced a trap composed of 137 places in 185 ms of which 3 ms to minimize.
[2024-06-01 17:04:27] [INFO ] Deduced a trap composed of 137 places in 237 ms of which 3 ms to minimize.
[2024-06-01 17:04:27] [INFO ] Deduced a trap composed of 137 places in 205 ms of which 3 ms to minimize.
[2024-06-01 17:04:27] [INFO ] Deduced a trap composed of 137 places in 177 ms of which 3 ms to minimize.
Problem TDEAD737 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/573 variables, 20/112 constraints. Problems are: Problem set: 1 solved, 788 unsolved
[2024-06-01 17:04:29] [INFO ] Deduced a trap composed of 164 places in 258 ms of which 4 ms to minimize.
[2024-06-01 17:04:29] [INFO ] Deduced a trap composed of 137 places in 290 ms of which 5 ms to minimize.
[2024-06-01 17:04:30] [INFO ] Deduced a trap composed of 137 places in 380 ms of which 4 ms to minimize.
[2024-06-01 17:04:30] [INFO ] Deduced a trap composed of 137 places in 207 ms of which 4 ms to minimize.
[2024-06-01 17:04:30] [INFO ] Deduced a trap composed of 137 places in 182 ms of which 3 ms to minimize.
[2024-06-01 17:04:30] [INFO ] Deduced a trap composed of 137 places in 252 ms of which 3 ms to minimize.
[2024-06-01 17:04:31] [INFO ] Deduced a trap composed of 158 places in 227 ms of which 3 ms to minimize.
[2024-06-01 17:04:31] [INFO ] Deduced a trap composed of 142 places in 239 ms of which 4 ms to minimize.
[2024-06-01 17:04:32] [INFO ] Deduced a trap composed of 103 places in 290 ms of which 4 ms to minimize.
[2024-06-01 17:04:32] [INFO ] Deduced a trap composed of 14 places in 269 ms of which 4 ms to minimize.
[2024-06-01 17:04:33] [INFO ] Deduced a trap composed of 137 places in 233 ms of which 4 ms to minimize.
[2024-06-01 17:04:33] [INFO ] Deduced a trap composed of 140 places in 215 ms of which 4 ms to minimize.
[2024-06-01 17:04:33] [INFO ] Deduced a trap composed of 143 places in 199 ms of which 4 ms to minimize.
[2024-06-01 17:04:33] [INFO ] Deduced a trap composed of 141 places in 203 ms of which 4 ms to minimize.
[2024-06-01 17:04:33] [INFO ] Deduced a trap composed of 145 places in 184 ms of which 3 ms to minimize.
[2024-06-01 17:04:34] [INFO ] Deduced a trap composed of 142 places in 152 ms of which 3 ms to minimize.
[2024-06-01 17:04:34] [INFO ] Deduced a trap composed of 137 places in 181 ms of which 3 ms to minimize.
[2024-06-01 17:04:34] [INFO ] Deduced a trap composed of 137 places in 166 ms of which 3 ms to minimize.
[2024-06-01 17:04:34] [INFO ] Deduced a trap composed of 165 places in 237 ms of which 3 ms to minimize.
[2024-06-01 17:04:35] [INFO ] Deduced a trap composed of 168 places in 215 ms of which 3 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD177 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/573 variables, 20/132 constraints. Problems are: Problem set: 3 solved, 786 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/1369 variables, and 132 constraints, problems are : Problem set: 3 solved, 786 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/578 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 789/789 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 3 solved, 786 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 75/75 constraints. Problems are: Problem set: 3 solved, 786 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 15/90 constraints. Problems are: Problem set: 3 solved, 786 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/571 variables, 40/130 constraints. Problems are: Problem set: 3 solved, 786 unsolved
[2024-06-01 17:04:38] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-06-01 17:04:39] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-06-01 17:04:39] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:04:39] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:04:39] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
Problem TDEAD77 is UNSAT
[2024-06-01 17:04:39] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-06-01 17:04:39] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
Problem TDEAD93 is UNSAT
[2024-06-01 17:04:40] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
Problem TDEAD172 is UNSAT
[2024-06-01 17:04:41] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-06-01 17:04:41] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
Problem TDEAD209 is UNSAT
[2024-06-01 17:04:41] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
Problem TDEAD222 is UNSAT
[2024-06-01 17:04:41] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
Problem TDEAD254 is UNSAT
[2024-06-01 17:04:41] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
Problem TDEAD256 is UNSAT
Problem TDEAD267 is UNSAT
[2024-06-01 17:04:41] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
Problem TDEAD279 is UNSAT
[2024-06-01 17:04:42] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
Problem TDEAD285 is UNSAT
[2024-06-01 17:04:42] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
Problem TDEAD293 is UNSAT
[2024-06-01 17:04:42] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
Problem TDEAD300 is UNSAT
[2024-06-01 17:04:42] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
Problem TDEAD332 is UNSAT
[2024-06-01 17:04:43] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
Problem TDEAD390 is UNSAT
[2024-06-01 17:04:43] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD437 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 20/150 constraints. Problems are: Problem set: 23 solved, 766 unsolved
[2024-06-01 17:04:45] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-06-01 17:04:45] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-06-01 17:04:45] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-06-01 17:04:46] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-06-01 17:04:46] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-06-01 17:04:46] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-06-01 17:04:48] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-06-01 17:04:48] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
Problem TDEAD329 is UNSAT
[2024-06-01 17:04:50] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
Problem TDEAD417 is UNSAT
[2024-06-01 17:04:50] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
Problem TDEAD429 is UNSAT
[2024-06-01 17:04:50] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
[2024-06-01 17:04:50] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
Problem TDEAD435 is UNSAT
[2024-06-01 17:04:50] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
Problem TDEAD436 is UNSAT
[2024-06-01 17:04:50] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
Problem TDEAD438 is UNSAT
[2024-06-01 17:04:50] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
Problem TDEAD439 is UNSAT
[2024-06-01 17:04:50] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
Problem TDEAD440 is UNSAT
[2024-06-01 17:04:50] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
[2024-06-01 17:04:50] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
Problem TDEAD445 is UNSAT
[2024-06-01 17:04:50] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
Problem TDEAD446 is UNSAT
[2024-06-01 17:04:50] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
Problem TDEAD329 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD451 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 20/170 constraints. Problems are: Problem set: 43 solved, 746 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/1369 variables, and 170 constraints, problems are : Problem set: 43 solved, 746 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 75/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/578 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/789 constraints, Known Traps: 80/80 constraints]
After SMT, in 41252ms problems are : Problem set: 43 solved, 746 unsolved
Search for dead transitions found 43 dead transitions in 41262ms
Found 43 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 43 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 43 transitions.
[2024-06-01 17:04:57] [INFO ] Redundant transitions in 7 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 578/623 places, 752/839 transitions.
Graph (complete) has 2908 edges and 578 vertex of which 536 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.5 ms
Discarding 42 places :
Also discarding 0 output transitions
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 1 rules in 36 ms. Remains 536 /578 variables (removed 42) and now considering 752/752 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 536/623 places, 752/839 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 41491 ms. Remains : 536/623 places, 752/839 transitions.
Support contains 1 out of 623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 839/839 transitions.
Applied a total of 0 rules in 10 ms. Remains 623 /623 variables (removed 0) and now considering 839/839 (removed 0) transitions.
Running 833 sub problems to find dead transitions.
[2024-06-01 17:04:57] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2024-06-01 17:04:57] [INFO ] Computed 97 invariants in 25 ms
[2024-06-01 17:04:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 97 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 17:05:20] [INFO ] Deduced a trap composed of 97 places in 84 ms of which 2 ms to minimize.
[2024-06-01 17:05:20] [INFO ] Deduced a trap composed of 97 places in 91 ms of which 1 ms to minimize.
[2024-06-01 17:05:25] [INFO ] Deduced a trap composed of 98 places in 130 ms of which 2 ms to minimize.
[2024-06-01 17:05:25] [INFO ] Deduced a trap composed of 97 places in 150 ms of which 2 ms to minimize.
[2024-06-01 17:05:25] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 2 ms to minimize.
[2024-06-01 17:05:26] [INFO ] Deduced a trap composed of 97 places in 212 ms of which 3 ms to minimize.
[2024-06-01 17:05:28] [INFO ] Deduced a trap composed of 98 places in 95 ms of which 2 ms to minimize.
[2024-06-01 17:05:28] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 2 ms to minimize.
[2024-06-01 17:05:28] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 2 ms to minimize.
[2024-06-01 17:05:28] [INFO ] Deduced a trap composed of 97 places in 143 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 10/101 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 17:05:35] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 102 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 11/11 constraints]
After SMT, in 41317ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 41325ms
[2024-06-01 17:05:38] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-06-01 17:05:38] [INFO ] Invariant cache hit.
[2024-06-01 17:05:39] [INFO ] Implicit Places using invariants in 773 ms returned []
[2024-06-01 17:05:39] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-06-01 17:05:39] [INFO ] Invariant cache hit.
[2024-06-01 17:05:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:05:49] [INFO ] Implicit Places using invariants and state equation in 9318 ms returned []
Implicit Place search using SMT with State Equation took 10109 ms to find 0 implicit places.
Running 833 sub problems to find dead transitions.
[2024-06-01 17:05:49] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-06-01 17:05:49] [INFO ] Invariant cache hit.
[2024-06-01 17:05:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 17:06:13] [INFO ] Deduced a trap composed of 145 places in 255 ms of which 4 ms to minimize.
[2024-06-01 17:06:14] [INFO ] Deduced a trap composed of 24 places in 293 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/623 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 17:06:20] [INFO ] Deduced a trap composed of 329 places in 285 ms of which 5 ms to minimize.
[2024-06-01 17:06:20] [INFO ] Deduced a trap composed of 325 places in 251 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 101 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 17:06:22] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 3 ms to minimize.
[2024-06-01 17:06:22] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 2 ms to minimize.
[2024-06-01 17:06:22] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 2 ms to minimize.
[2024-06-01 17:06:27] [INFO ] Deduced a trap composed of 98 places in 174 ms of which 2 ms to minimize.
[2024-06-01 17:06:28] [INFO ] Deduced a trap composed of 97 places in 135 ms of which 2 ms to minimize.
[2024-06-01 17:06:29] [INFO ] Deduced a trap composed of 97 places in 139 ms of which 2 ms to minimize.
[2024-06-01 17:06:30] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 2 ms to minimize.
[2024-06-01 17:06:30] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 2 ms to minimize.
[2024-06-01 17:06:30] [INFO ] Deduced a trap composed of 98 places in 126 ms of which 2 ms to minimize.
[2024-06-01 17:06:30] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 1 ms to minimize.
[2024-06-01 17:06:30] [INFO ] Deduced a trap composed of 98 places in 105 ms of which 2 ms to minimize.
[2024-06-01 17:06:30] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 2 ms to minimize.
[2024-06-01 17:06:31] [INFO ] Deduced a trap composed of 97 places in 140 ms of which 3 ms to minimize.
[2024-06-01 17:06:32] [INFO ] Deduced a trap composed of 98 places in 204 ms of which 3 ms to minimize.
[2024-06-01 17:06:32] [INFO ] Deduced a trap composed of 97 places in 206 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 15/106 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 17:06:33] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/617 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 833 unsolved
SMT process timed out in 61474ms, After SMT, problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 61487ms
Finished structural reductions in LTL mode , in 1 iterations and 112938 ms. Remains : 623/623 places, 839/839 transitions.
Treatment of property PolyORBNT-PT-S05J40-LTLCardinality-15 finished in 382527 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(p0))))'
[2024-06-01 17:06:50] [INFO ] Flatten gal took : 91 ms
[2024-06-01 17:06:50] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 17:06:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 625 places, 840 transitions and 4036 arcs took 13 ms.
Total runtime 1270634 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA PolyORBNT-PT-S05J40-LTLCardinality-15 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717261611554

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name PolyORBNT-PT-S05J40-LTLCardinality-15
ltl formula formula --ltl=/tmp/3125/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 625 places, 840 transitions and 4036 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3125/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3125/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3125/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.230 real 0.030 user 0.060 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3125/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 632 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 626, there are 845 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 49
pnml2lts-mc( 0/ 4): unique states count: 49
pnml2lts-mc( 0/ 4): unique transitions count: 108
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 66
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 62
pnml2lts-mc( 0/ 4): - cum. max stack depth: 10
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 62 states 161 transitions, fanout: 2.597
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.000 sec minimum, 0.005 sec on average)
pnml2lts-mc( 0/ 4): States per second: 6200, Transitions per second: 16100
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 62.0 B/state, compr.: 2.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 852 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-PT-S05J40"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBNT-PT-S05J40, 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 r516-tajo-171654447200459"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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