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.r290-tajo-171654447000379.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 itstools
Input is PolyORBNT-COL-S05J40, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654447000379
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.7K Apr 12 09:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 09:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 09:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 12 09:51 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 4.2K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 12 10:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 12 10:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 10:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 10:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 93K 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-COL-S05J40-LTLCardinality-00
FORMULA_NAME PolyORBNT-COL-S05J40-LTLCardinality-01
FORMULA_NAME PolyORBNT-COL-S05J40-LTLCardinality-02
FORMULA_NAME PolyORBNT-COL-S05J40-LTLCardinality-03
FORMULA_NAME PolyORBNT-COL-S05J40-LTLCardinality-04
FORMULA_NAME PolyORBNT-COL-S05J40-LTLCardinality-05
FORMULA_NAME PolyORBNT-COL-S05J40-LTLCardinality-06
FORMULA_NAME PolyORBNT-COL-S05J40-LTLCardinality-07
FORMULA_NAME PolyORBNT-COL-S05J40-LTLCardinality-08
FORMULA_NAME PolyORBNT-COL-S05J40-LTLCardinality-09
FORMULA_NAME PolyORBNT-COL-S05J40-LTLCardinality-10
FORMULA_NAME PolyORBNT-COL-S05J40-LTLCardinality-11
FORMULA_NAME PolyORBNT-COL-S05J40-LTLCardinality-12
FORMULA_NAME PolyORBNT-COL-S05J40-LTLCardinality-13
FORMULA_NAME PolyORBNT-COL-S05J40-LTLCardinality-14
FORMULA_NAME PolyORBNT-COL-S05J40-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716923804260

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J40
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202405141337
[2024-05-28 19:16:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 19:16:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 19:16:45] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 19:16:46] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 19:16:46] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 644 ms
[2024-05-28 19:16:46] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 669 PT places and 1712.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 19:16:46] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 6 ms.
[2024-05-28 19:16:46] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 2 formulas.
FORMULA PolyORBNT-COL-S05J40-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40002 steps (3210 resets) in 3453 ms. (11 steps per ms) remains 17/29 properties
BEST_FIRST walk for 4003 steps (92 resets) in 65 ms. (60 steps per ms) remains 11/17 properties
BEST_FIRST walk for 4002 steps (99 resets) in 98 ms. (40 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4001 steps (92 resets) in 83 ms. (47 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4003 steps (112 resets) in 57 ms. (69 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4003 steps (105 resets) in 19 ms. (200 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4001 steps (104 resets) in 22 ms. (173 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4002 steps (99 resets) in 28 ms. (138 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4003 steps (81 resets) in 36 ms. (108 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4002 steps (144 resets) in 17 ms. (222 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4003 steps (101 resets) in 30 ms. (129 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4003 steps (166 resets) in 12 ms. (307 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4003 steps (98 resets) in 35 ms. (111 steps per ms) remains 11/11 properties
// Phase 1: matrix 38 rows 48 cols
[2024-05-28 19:16:47] [INFO ] Computed 13 invariants in 10 ms
[2024-05-28 19:16:47] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp17 is UNSAT
At refinement iteration 1 (OVERLAPS) 11/22 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 8 unsolved
Problem AtomicPropp9 is UNSAT
At refinement iteration 3 (OVERLAPS) 4/26 variables, 2/5 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 7 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 5 (OVERLAPS) 18/44 variables, 5/10 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/10 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/45 variables, 1/11 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/45 variables, 0/11 constraints. Problems are: Problem set: 8 solved, 3 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
After SMT solving in domain Real declared 47/86 variables, and 13 constraints, problems are : Problem set: 11 solved, 0 unsolved in 232 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/48 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 281ms problems are : Problem set: 11 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 11 atomic propositions for a total of 14 simplifications.
FORMULA PolyORBNT-COL-S05J40-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 19:16:48] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-28 19:16:48] [INFO ] Flatten gal took : 21 ms
FORMULA PolyORBNT-COL-S05J40-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 19:16:48] [INFO ] Flatten gal took : 5 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-28 19:16:48] [INFO ] Unfolded HLPN to a Petri net with 669 places and 1630 transitions 10784 arcs in 51 ms.
[2024-05-28 19:16:48] [INFO ] Unfolded 9 HLPN properties in 2 ms.
Deduced a syphon composed of 40 places in 6 ms
Reduce places removed 40 places and 40 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Support contains 388 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 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 935
Applied a total of 5 rules in 41 ms. Remains 624 /629 variables (removed 5) and now considering 935/935 (removed 0) transitions.
Running 929 sub problems to find dead transitions.
[2024-05-28 19:16:48] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 624 cols
[2024-05-28 19:16:48] [INFO ] Computed 97 invariants in 48 ms
[2024-05-28 19:16:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 5/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 TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD416 is UNSAT
At refinement iteration 3 (OVERLAPS) 5/623 variables, 5/96 constraints. Problems are: Problem set: 78 solved, 851 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1555 variables, and 96 constraints, problems are : Problem set: 78 solved, 851 unsolved in 20054 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/624 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 929/929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 78 solved, 851 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 86/86 constraints. Problems are: Problem set: 78 solved, 851 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 5/91 constraints. Problems are: Problem set: 78 solved, 851 unsolved
[2024-05-28 19:17:14] [INFO ] Deduced a trap composed of 99 places in 240 ms of which 24 ms to minimize.
[2024-05-28 19:17:14] [INFO ] Deduced a trap composed of 97 places in 188 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 2/93 constraints. Problems are: Problem set: 78 solved, 851 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/618 variables, 0/93 constraints. Problems are: Problem set: 78 solved, 851 unsolved
At refinement iteration 4 (OVERLAPS) 5/623 variables, 5/98 constraints. Problems are: Problem set: 78 solved, 851 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 623/1555 variables, and 98 constraints, problems are : Problem set: 78 solved, 851 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/624 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/929 constraints, Known Traps: 2/2 constraints]
After SMT, in 42125ms problems are : Problem set: 78 solved, 851 unsolved
Search for dead transitions found 78 dead transitions in 42147ms
Found 78 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 78 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 78 transitions.
[2024-05-28 19:17:30] [INFO ] Flow matrix only has 853 transitions (discarded 4 similar events)
// Phase 1: matrix 853 rows 624 cols
[2024-05-28 19:17:30] [INFO ] Computed 97 invariants in 35 ms
[2024-05-28 19:17:30] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-05-28 19:17:30] [INFO ] Flow matrix only has 853 transitions (discarded 4 similar events)
[2024-05-28 19:17:30] [INFO ] Invariant cache hit.
[2024-05-28 19:17:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:17:32] [INFO ] Implicit Places using invariants and state equation in 2213 ms returned []
Implicit Place search using SMT with State Equation took 2509 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 624/629 places, 857/935 transitions.
Applied a total of 0 rules in 29 ms. Remains 624 /624 variables (removed 0) and now considering 857/857 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44753 ms. Remains : 624/629 places, 857/935 transitions.
Support contains 388 out of 624 places after structural reductions.
[2024-05-28 19:17:33] [INFO ] Flatten gal took : 107 ms
[2024-05-28 19:17:33] [INFO ] Flatten gal took : 92 ms
[2024-05-28 19:17:33] [INFO ] Input system was already deterministic with 857 transitions.
RANDOM walk for 40001 steps (2770 resets) in 1285 ms. (31 steps per ms) remains 2/17 properties
BEST_FIRST walk for 40003 steps (637 resets) in 154 ms. (258 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1003 resets) in 199 ms. (200 steps per ms) remains 2/2 properties
[2024-05-28 19:17:33] [INFO ] Flow matrix only has 853 transitions (discarded 4 similar events)
[2024-05-28 19:17:33] [INFO ] Invariant cache hit.
[2024-05-28 19:17:33] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 554/597 variables, 83/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp11 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/597 variables, 1/84 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/597 variables, 0/84 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/612 variables, 7/91 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/612 variables, 0/91 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp12 is UNSAT
After SMT solving in domain Real declared 622/1477 variables, and 96 constraints, problems are : Problem set: 2 solved, 0 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 90/91 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/624 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 145ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 9 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 624 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 624/624 places, 857/857 transitions.
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 811
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 811
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 766
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 182 place count 533 transition count 766
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 532 transition count 765
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 532 transition count 765
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 763
Applied a total of 188 rules in 139 ms. Remains 530 /624 variables (removed 94) and now considering 763/857 (removed 94) transitions.
Running 757 sub problems to find dead transitions.
[2024-05-28 19:17:34] [INFO ] Flow matrix only has 759 transitions (discarded 4 similar events)
// Phase 1: matrix 759 rows 530 cols
[2024-05-28 19:17:34] [INFO ] Computed 97 invariants in 16 ms
[2024-05-28 19:17:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 757 unsolved
[2024-05-28 19:17:41] [INFO ] Deduced a trap composed of 136 places in 193 ms of which 4 ms to minimize.
[2024-05-28 19:17:41] [INFO ] Deduced a trap composed of 136 places in 222 ms of which 4 ms to minimize.
[2024-05-28 19:17:42] [INFO ] Deduced a trap composed of 136 places in 215 ms of which 4 ms to minimize.
[2024-05-28 19:17:42] [INFO ] Deduced a trap composed of 136 places in 203 ms of which 4 ms to minimize.
[2024-05-28 19:17:42] [INFO ] Deduced a trap composed of 136 places in 192 ms of which 3 ms to minimize.
[2024-05-28 19:17:42] [INFO ] Deduced a trap composed of 136 places in 186 ms of which 4 ms to minimize.
[2024-05-28 19:17:42] [INFO ] Deduced a trap composed of 136 places in 200 ms of which 3 ms to minimize.
[2024-05-28 19:17:43] [INFO ] Deduced a trap composed of 136 places in 185 ms of which 3 ms to minimize.
[2024-05-28 19:17:43] [INFO ] Deduced a trap composed of 136 places in 233 ms of which 4 ms to minimize.
[2024-05-28 19:17:43] [INFO ] Deduced a trap composed of 136 places in 204 ms of which 2 ms to minimize.
[2024-05-28 19:17:43] [INFO ] Deduced a trap composed of 136 places in 178 ms of which 3 ms to minimize.
[2024-05-28 19:17:44] [INFO ] Deduced a trap composed of 136 places in 156 ms of which 3 ms to minimize.
[2024-05-28 19:17:44] [INFO ] Deduced a trap composed of 136 places in 158 ms of which 2 ms to minimize.
[2024-05-28 19:17:44] [INFO ] Deduced a trap composed of 136 places in 152 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 14/106 constraints. Problems are: Problem set: 0 solved, 757 unsolved
[2024-05-28 19:17:50] [INFO ] Deduced a trap composed of 149 places in 204 ms of which 4 ms to minimize.
[2024-05-28 19:17:50] [INFO ] Deduced a trap composed of 136 places in 170 ms of which 3 ms to minimize.
[2024-05-28 19:17:50] [INFO ] Deduced a trap composed of 167 places in 168 ms of which 3 ms to minimize.
[2024-05-28 19:17:50] [INFO ] Deduced a trap composed of 136 places in 207 ms of which 4 ms to minimize.
[2024-05-28 19:17:51] [INFO ] Deduced a trap composed of 136 places in 223 ms of which 4 ms to minimize.
[2024-05-28 19:17:51] [INFO ] Deduced a trap composed of 136 places in 194 ms of which 4 ms to minimize.
[2024-05-28 19:17:51] [INFO ] Deduced a trap composed of 136 places in 214 ms of which 4 ms to minimize.
[2024-05-28 19:17:51] [INFO ] Deduced a trap composed of 136 places in 212 ms of which 4 ms to minimize.
[2024-05-28 19:17:52] [INFO ] Deduced a trap composed of 136 places in 214 ms of which 4 ms to minimize.
[2024-05-28 19:17:52] [INFO ] Deduced a trap composed of 136 places in 228 ms of which 4 ms to minimize.
[2024-05-28 19:17:52] [INFO ] Deduced a trap composed of 136 places in 163 ms of which 3 ms to minimize.
[2024-05-28 19:17:52] [INFO ] Deduced a trap composed of 136 places in 208 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 525/1289 variables, and 118 constraints, problems are : Problem set: 0 solved, 757 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/530 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 757/757 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 757 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 26/118 constraints. Problems are: Problem set: 0 solved, 757 unsolved
[2024-05-28 19:17:56] [INFO ] Deduced a trap composed of 158 places in 167 ms of which 3 ms to minimize.
[2024-05-28 19:17:57] [INFO ] Deduced a trap composed of 155 places in 149 ms of which 3 ms to minimize.
[2024-05-28 19:17:57] [INFO ] Deduced a trap composed of 161 places in 136 ms of which 3 ms to minimize.
[2024-05-28 19:17:57] [INFO ] Deduced a trap composed of 136 places in 146 ms of which 2 ms to minimize.
[2024-05-28 19:17:57] [INFO ] Deduced a trap composed of 136 places in 161 ms of which 2 ms to minimize.
[2024-05-28 19:17:58] [INFO ] Deduced a trap composed of 136 places in 142 ms of which 4 ms to minimize.
[2024-05-28 19:17:58] [INFO ] Deduced a trap composed of 136 places in 164 ms of which 12 ms to minimize.
[2024-05-28 19:17:58] [INFO ] Deduced a trap composed of 136 places in 145 ms of which 3 ms to minimize.
[2024-05-28 19:17:58] [INFO ] Deduced a trap composed of 136 places in 168 ms of which 4 ms to minimize.
[2024-05-28 19:17:58] [INFO ] Deduced a trap composed of 136 places in 154 ms of which 3 ms to minimize.
[2024-05-28 19:17:59] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 2 ms to minimize.
[2024-05-28 19:18:00] [INFO ] Deduced a trap composed of 164 places in 150 ms of which 3 ms to minimize.
[2024-05-28 19:18:00] [INFO ] Deduced a trap composed of 140 places in 159 ms of which 3 ms to minimize.
[2024-05-28 19:18:00] [INFO ] Deduced a trap composed of 136 places in 143 ms of which 3 ms to minimize.
[2024-05-28 19:18:00] [INFO ] Deduced a trap composed of 136 places in 184 ms of which 3 ms to minimize.
[2024-05-28 19:18:00] [INFO ] Deduced a trap composed of 136 places in 189 ms of which 3 ms to minimize.
[2024-05-28 19:18:01] [INFO ] Deduced a trap composed of 136 places in 160 ms of which 3 ms to minimize.
[2024-05-28 19:18:01] [INFO ] Deduced a trap composed of 136 places in 194 ms of which 3 ms to minimize.
[2024-05-28 19:18:01] [INFO ] Deduced a trap composed of 136 places in 179 ms of which 3 ms to minimize.
[2024-05-28 19:18:01] [INFO ] Deduced a trap composed of 140 places in 159 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 757 unsolved
[2024-05-28 19:18:02] [INFO ] Deduced a trap composed of 136 places in 211 ms of which 4 ms to minimize.
[2024-05-28 19:18:02] [INFO ] Deduced a trap composed of 136 places in 151 ms of which 2 ms to minimize.
[2024-05-28 19:18:02] [INFO ] Deduced a trap composed of 136 places in 157 ms of which 3 ms to minimize.
[2024-05-28 19:18:02] [INFO ] Deduced a trap composed of 136 places in 207 ms of which 4 ms to minimize.
[2024-05-28 19:18:02] [INFO ] Deduced a trap composed of 136 places in 198 ms of which 4 ms to minimize.
[2024-05-28 19:18:03] [INFO ] Deduced a trap composed of 136 places in 182 ms of which 4 ms to minimize.
[2024-05-28 19:18:03] [INFO ] Deduced a trap composed of 136 places in 191 ms of which 3 ms to minimize.
[2024-05-28 19:18:03] [INFO ] Deduced a trap composed of 136 places in 181 ms of which 10 ms to minimize.
[2024-05-28 19:18:03] [INFO ] Deduced a trap composed of 136 places in 174 ms of which 3 ms to minimize.
[2024-05-28 19:18:04] [INFO ] Deduced a trap composed of 136 places in 161 ms of which 3 ms to minimize.
[2024-05-28 19:18:04] [INFO ] Deduced a trap composed of 136 places in 158 ms of which 2 ms to minimize.
[2024-05-28 19:18:04] [INFO ] Deduced a trap composed of 136 places in 155 ms of which 3 ms to minimize.
[2024-05-28 19:18:04] [INFO ] Deduced a trap composed of 136 places in 160 ms of which 3 ms to minimize.
[2024-05-28 19:18:04] [INFO ] Deduced a trap composed of 136 places in 155 ms of which 3 ms to minimize.
[2024-05-28 19:18:04] [INFO ] Deduced a trap composed of 136 places in 153 ms of which 3 ms to minimize.
[2024-05-28 19:18:05] [INFO ] Deduced a trap composed of 136 places in 144 ms of which 4 ms to minimize.
[2024-05-28 19:18:05] [INFO ] Deduced a trap composed of 136 places in 152 ms of which 3 ms to minimize.
[2024-05-28 19:18:05] [INFO ] Deduced a trap composed of 136 places in 230 ms of which 4 ms to minimize.
[2024-05-28 19:18:05] [INFO ] Deduced a trap composed of 140 places in 200 ms of which 4 ms to minimize.
[2024-05-28 19:18:06] [INFO ] Deduced a trap composed of 136 places in 197 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 757 unsolved
[2024-05-28 19:18:07] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 4 ms to minimize.
[2024-05-28 19:18:07] [INFO ] Deduced a trap composed of 161 places in 192 ms of which 4 ms to minimize.
[2024-05-28 19:18:07] [INFO ] Deduced a trap composed of 161 places in 183 ms of which 3 ms to minimize.
[2024-05-28 19:18:07] [INFO ] Deduced a trap composed of 164 places in 233 ms of which 4 ms to minimize.
[2024-05-28 19:18:08] [INFO ] Deduced a trap composed of 136 places in 240 ms of which 4 ms to minimize.
[2024-05-28 19:18:08] [INFO ] Deduced a trap composed of 136 places in 220 ms of which 4 ms to minimize.
[2024-05-28 19:18:08] [INFO ] Deduced a trap composed of 136 places in 241 ms of which 3 ms to minimize.
[2024-05-28 19:18:08] [INFO ] Deduced a trap composed of 140 places in 195 ms of which 3 ms to minimize.
[2024-05-28 19:18:08] [INFO ] Deduced a trap composed of 136 places in 228 ms of which 4 ms to minimize.
[2024-05-28 19:18:09] [INFO ] Deduced a trap composed of 140 places in 226 ms of which 5 ms to minimize.
[2024-05-28 19:18:09] [INFO ] Deduced a trap composed of 136 places in 223 ms of which 4 ms to minimize.
[2024-05-28 19:18:09] [INFO ] Deduced a trap composed of 140 places in 225 ms of which 4 ms to minimize.
[2024-05-28 19:18:09] [INFO ] Deduced a trap composed of 136 places in 207 ms of which 4 ms to minimize.
[2024-05-28 19:18:10] [INFO ] Deduced a trap composed of 136 places in 214 ms of which 4 ms to minimize.
[2024-05-28 19:18:10] [INFO ] Deduced a trap composed of 136 places in 214 ms of which 4 ms to minimize.
[2024-05-28 19:18:10] [INFO ] Deduced a trap composed of 140 places in 186 ms of which 3 ms to minimize.
[2024-05-28 19:18:10] [INFO ] Deduced a trap composed of 136 places in 182 ms of which 3 ms to minimize.
[2024-05-28 19:18:11] [INFO ] Deduced a trap composed of 173 places in 212 ms of which 4 ms to minimize.
[2024-05-28 19:18:11] [INFO ] Deduced a trap composed of 140 places in 205 ms of which 3 ms to minimize.
[2024-05-28 19:18:11] [INFO ] Deduced a trap composed of 161 places in 194 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 757 unsolved
[2024-05-28 19:18:14] [INFO ] Deduced a trap composed of 166 places in 262 ms of which 4 ms to minimize.
[2024-05-28 19:18:14] [INFO ] Deduced a trap composed of 162 places in 190 ms of which 2 ms to minimize.
[2024-05-28 19:18:15] [INFO ] Deduced a trap composed of 170 places in 256 ms of which 4 ms to minimize.
[2024-05-28 19:18:15] [INFO ] Deduced a trap composed of 168 places in 215 ms of which 4 ms to minimize.
[2024-05-28 19:18:15] [INFO ] Deduced a trap composed of 170 places in 246 ms of which 3 ms to minimize.
[2024-05-28 19:18:16] [INFO ] Deduced a trap composed of 168 places in 237 ms of which 3 ms to minimize.
SMT process timed out in 41754ms, After SMT, problems are : Problem set: 0 solved, 757 unsolved
Search for dead transitions found 0 dead transitions in 41765ms
[2024-05-28 19:18:16] [INFO ] Flow matrix only has 759 transitions (discarded 4 similar events)
[2024-05-28 19:18:16] [INFO ] Invariant cache hit.
[2024-05-28 19:18:16] [INFO ] Implicit Places using invariants in 433 ms returned []
[2024-05-28 19:18:16] [INFO ] Flow matrix only has 759 transitions (discarded 4 similar events)
[2024-05-28 19:18:16] [INFO ] Invariant cache hit.
[2024-05-28 19:18:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:18:18] [INFO ] Implicit Places using invariants and state equation in 2269 ms returned []
Implicit Place search using SMT with State Equation took 2704 ms to find 0 implicit places.
[2024-05-28 19:18:19] [INFO ] Redundant transitions in 71 ms returned []
Running 757 sub problems to find dead transitions.
[2024-05-28 19:18:19] [INFO ] Flow matrix only has 759 transitions (discarded 4 similar events)
[2024-05-28 19:18:19] [INFO ] Invariant cache hit.
[2024-05-28 19:18:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 757 unsolved
[2024-05-28 19:18:26] [INFO ] Deduced a trap composed of 136 places in 199 ms of which 4 ms to minimize.
[2024-05-28 19:18:26] [INFO ] Deduced a trap composed of 136 places in 210 ms of which 3 ms to minimize.
[2024-05-28 19:18:26] [INFO ] Deduced a trap composed of 136 places in 190 ms of which 4 ms to minimize.
[2024-05-28 19:18:26] [INFO ] Deduced a trap composed of 136 places in 190 ms of which 4 ms to minimize.
[2024-05-28 19:18:27] [INFO ] Deduced a trap composed of 136 places in 207 ms of which 3 ms to minimize.
[2024-05-28 19:18:27] [INFO ] Deduced a trap composed of 136 places in 232 ms of which 4 ms to minimize.
[2024-05-28 19:18:27] [INFO ] Deduced a trap composed of 136 places in 180 ms of which 3 ms to minimize.
[2024-05-28 19:18:27] [INFO ] Deduced a trap composed of 136 places in 178 ms of which 3 ms to minimize.
[2024-05-28 19:18:28] [INFO ] Deduced a trap composed of 136 places in 181 ms of which 3 ms to minimize.
[2024-05-28 19:18:28] [INFO ] Deduced a trap composed of 136 places in 164 ms of which 3 ms to minimize.
[2024-05-28 19:18:28] [INFO ] Deduced a trap composed of 136 places in 202 ms of which 3 ms to minimize.
[2024-05-28 19:18:28] [INFO ] Deduced a trap composed of 136 places in 158 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 12/104 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 4 (OVERLAPS) 4/529 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/529 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 757 unsolved
Problem TDEAD504 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD544 is UNSAT
Error getting values : (error "ParserException while parsing response: ((s0 2.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 (/ 1.0 3.0))
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 (/ 1.0 3.0))
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 (/ 1.0 3.0))
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 9.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.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 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 1.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.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 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 4.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 0.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 0.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 0.0)
(s520 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 1/530 variables, 1/109 constraints. Problems are: Problem set: 17 solved, 740 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/1289 variables, and 109 constraints, problems are : Problem set: 17 solved, 740 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/530 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 757/757 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 17 solved, 740 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 86/86 constraints. Problems are: Problem set: 17 solved, 740 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 6/92 constraints. Problems are: Problem set: 17 solved, 740 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 12/104 constraints. Problems are: Problem set: 17 solved, 740 unsolved
[2024-05-28 19:18:51] [INFO ] Deduced a trap composed of 136 places in 163 ms of which 3 ms to minimize.
[2024-05-28 19:18:51] [INFO ] Deduced a trap composed of 136 places in 137 ms of which 3 ms to minimize.
[2024-05-28 19:18:51] [INFO ] Deduced a trap composed of 136 places in 144 ms of which 3 ms to minimize.
[2024-05-28 19:18:52] [INFO ] Deduced a trap composed of 136 places in 211 ms of which 4 ms to minimize.
[2024-05-28 19:18:52] [INFO ] Deduced a trap composed of 136 places in 217 ms of which 4 ms to minimize.
[2024-05-28 19:18:52] [INFO ] Deduced a trap composed of 136 places in 214 ms of which 4 ms to minimize.
[2024-05-28 19:18:52] [INFO ] Deduced a trap composed of 136 places in 213 ms of which 4 ms to minimize.
[2024-05-28 19:18:53] [INFO ] Deduced a trap composed of 136 places in 189 ms of which 3 ms to minimize.
[2024-05-28 19:18:53] [INFO ] Deduced a trap composed of 136 places in 142 ms of which 2 ms to minimize.
[2024-05-28 19:18:53] [INFO ] Deduced a trap composed of 136 places in 205 ms of which 4 ms to minimize.
[2024-05-28 19:18:53] [INFO ] Deduced a trap composed of 136 places in 187 ms of which 4 ms to minimize.
[2024-05-28 19:18:53] [INFO ] Deduced a trap composed of 136 places in 182 ms of which 3 ms to minimize.
[2024-05-28 19:18:54] [INFO ] Deduced a trap composed of 136 places in 189 ms of which 3 ms to minimize.
[2024-05-28 19:18:54] [INFO ] Deduced a trap composed of 173 places in 228 ms of which 3 ms to minimize.
[2024-05-28 19:18:54] [INFO ] Deduced a trap composed of 136 places in 198 ms of which 3 ms to minimize.
[2024-05-28 19:18:54] [INFO ] Deduced a trap composed of 136 places in 216 ms of which 3 ms to minimize.
[2024-05-28 19:18:55] [INFO ] Deduced a trap composed of 136 places in 188 ms of which 3 ms to minimize.
[2024-05-28 19:18:55] [INFO ] Deduced a trap composed of 136 places in 184 ms of which 4 ms to minimize.
[2024-05-28 19:18:55] [INFO ] Deduced a trap composed of 136 places in 192 ms of which 3 ms to minimize.
[2024-05-28 19:18:55] [INFO ] Deduced a trap composed of 136 places in 191 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 20/124 constraints. Problems are: Problem set: 17 solved, 740 unsolved
[2024-05-28 19:18:56] [INFO ] Deduced a trap composed of 167 places in 198 ms of which 4 ms to minimize.
[2024-05-28 19:18:56] [INFO ] Deduced a trap composed of 179 places in 192 ms of which 4 ms to minimize.
[2024-05-28 19:18:56] [INFO ] Deduced a trap composed of 182 places in 189 ms of which 3 ms to minimize.
[2024-05-28 19:18:56] [INFO ] Deduced a trap composed of 167 places in 205 ms of which 3 ms to minimize.
[2024-05-28 19:18:57] [INFO ] Deduced a trap composed of 176 places in 184 ms of which 3 ms to minimize.
[2024-05-28 19:18:57] [INFO ] Deduced a trap composed of 170 places in 196 ms of which 3 ms to minimize.
[2024-05-28 19:18:57] [INFO ] Deduced a trap composed of 173 places in 207 ms of which 3 ms to minimize.
[2024-05-28 19:18:57] [INFO ] Deduced a trap composed of 136 places in 221 ms of which 3 ms to minimize.
[2024-05-28 19:18:58] [INFO ] Deduced a trap composed of 136 places in 163 ms of which 3 ms to minimize.
[2024-05-28 19:18:58] [INFO ] Deduced a trap composed of 136 places in 161 ms of which 2 ms to minimize.
[2024-05-28 19:18:58] [INFO ] Deduced a trap composed of 136 places in 160 ms of which 3 ms to minimize.
[2024-05-28 19:18:58] [INFO ] Deduced a trap composed of 136 places in 160 ms of which 3 ms to minimize.
[2024-05-28 19:18:58] [INFO ] Deduced a trap composed of 136 places in 165 ms of which 3 ms to minimize.
[2024-05-28 19:18:59] [INFO ] Deduced a trap composed of 136 places in 156 ms of which 3 ms to minimize.
[2024-05-28 19:18:59] [INFO ] Deduced a trap composed of 136 places in 142 ms of which 2 ms to minimize.
[2024-05-28 19:18:59] [INFO ] Deduced a trap composed of 136 places in 140 ms of which 2 ms to minimize.
[2024-05-28 19:18:59] [INFO ] Deduced a trap composed of 136 places in 212 ms of which 4 ms to minimize.
[2024-05-28 19:18:59] [INFO ] Deduced a trap composed of 136 places in 181 ms of which 3 ms to minimize.
[2024-05-28 19:19:00] [INFO ] Deduced a trap composed of 136 places in 203 ms of which 3 ms to minimize.
[2024-05-28 19:19:00] [INFO ] Deduced a trap composed of 136 places in 185 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 20/144 constraints. Problems are: Problem set: 17 solved, 740 unsolved
[2024-05-28 19:19:01] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 2 ms to minimize.
[2024-05-28 19:19:07] [INFO ] Deduced a trap composed of 13 places in 246 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 2/146 constraints. Problems are: Problem set: 17 solved, 740 unsolved
[2024-05-28 19:19:17] [INFO ] Deduced a trap composed of 228 places in 209 ms of which 4 ms to minimize.
[2024-05-28 19:19:17] [INFO ] Deduced a trap composed of 239 places in 178 ms of which 2 ms to minimize.
[2024-05-28 19:19:17] [INFO ] Deduced a trap composed of 234 places in 207 ms of which 3 ms to minimize.
[2024-05-28 19:19:17] [INFO ] Deduced a trap composed of 231 places in 218 ms of which 4 ms to minimize.
[2024-05-28 19:19:18] [INFO ] Deduced a trap composed of 231 places in 201 ms of which 3 ms to minimize.
[2024-05-28 19:19:18] [INFO ] Deduced a trap composed of 237 places in 173 ms of which 3 ms to minimize.
[2024-05-28 19:19:18] [INFO ] Deduced a trap composed of 233 places in 248 ms of which 5 ms to minimize.
[2024-05-28 19:19:18] [INFO ] Deduced a trap composed of 233 places in 174 ms of which 3 ms to minimize.
[2024-05-28 19:19:18] [INFO ] Deduced a trap composed of 233 places in 148 ms of which 3 ms to minimize.
[2024-05-28 19:19:19] [INFO ] Deduced a trap composed of 241 places in 222 ms of which 4 ms to minimize.
[2024-05-28 19:19:19] [INFO ] Deduced a trap composed of 231 places in 202 ms of which 4 ms to minimize.
[2024-05-28 19:19:19] [INFO ] Deduced a trap composed of 238 places in 214 ms of which 3 ms to minimize.
[2024-05-28 19:19:19] [INFO ] Deduced a trap composed of 234 places in 221 ms of which 3 ms to minimize.
[2024-05-28 19:19:19] [INFO ] Deduced a trap composed of 235 places in 219 ms of which 3 ms to minimize.
[2024-05-28 19:19:20] [INFO ] Deduced a trap composed of 234 places in 158 ms of which 3 ms to minimize.
[2024-05-28 19:19:20] [INFO ] Deduced a trap composed of 235 places in 200 ms of which 4 ms to minimize.
[2024-05-28 19:19:20] [INFO ] Deduced a trap composed of 236 places in 199 ms of which 4 ms to minimize.
SMT process timed out in 61583ms, After SMT, problems are : Problem set: 17 solved, 740 unsolved
Search for dead transitions found 17 dead transitions in 61597ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 530/624 places, 746/857 transitions.
Applied a total of 0 rules in 36 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2024-05-28 19:19:20] [INFO ] Redundant transitions in 5 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 106348 ms. Remains : 530/624 places, 746/857 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLCardinality-00
Stuttering criterion allowed to conclude after 89 steps with 6 reset in 3 ms.
FORMULA PolyORBNT-COL-S05J40-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J40-LTLCardinality-00 finished in 106593 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 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 857/857 transitions.
Applied a total of 0 rules in 9 ms. Remains 624 /624 variables (removed 0) and now considering 857/857 (removed 0) transitions.
Running 851 sub problems to find dead transitions.
[2024-05-28 19:19:20] [INFO ] Flow matrix only has 853 transitions (discarded 4 similar events)
// Phase 1: matrix 853 rows 624 cols
[2024-05-28 19:19:20] [INFO ] Computed 97 invariants in 20 ms
[2024-05-28 19:19:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 3 (OVERLAPS) 5/623 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 851 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1477 variables, and 96 constraints, problems are : Problem set: 0 solved, 851 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/624 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 851/851 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 851 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 851 unsolved
[2024-05-28 19:19:45] [INFO ] Deduced a trap composed of 99 places in 198 ms of which 3 ms to minimize.
[2024-05-28 19:19:45] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/618 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 4 (OVERLAPS) 5/623 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 851 unsolved
[2024-05-28 19:20:01] [INFO ] Deduced a trap composed of 266 places in 270 ms of which 4 ms to minimize.
[2024-05-28 19:20:02] [INFO ] Deduced a trap composed of 303 places in 261 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 623/1477 variables, and 100 constraints, problems are : Problem set: 0 solved, 851 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/624 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/851 constraints, Known Traps: 4/4 constraints]
After SMT, in 41291ms problems are : Problem set: 0 solved, 851 unsolved
Search for dead transitions found 0 dead transitions in 41301ms
[2024-05-28 19:20:02] [INFO ] Flow matrix only has 853 transitions (discarded 4 similar events)
[2024-05-28 19:20:02] [INFO ] Invariant cache hit.
[2024-05-28 19:20:02] [INFO ] Implicit Places using invariants in 556 ms returned []
[2024-05-28 19:20:02] [INFO ] Flow matrix only has 853 transitions (discarded 4 similar events)
[2024-05-28 19:20:02] [INFO ] Invariant cache hit.
[2024-05-28 19:20:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:20:05] [INFO ] Implicit Places using invariants and state equation in 2645 ms returned []
Implicit Place search using SMT with State Equation took 3206 ms to find 0 implicit places.
Running 851 sub problems to find dead transitions.
[2024-05-28 19:20:05] [INFO ] Flow matrix only has 853 transitions (discarded 4 similar events)
[2024-05-28 19:20:05] [INFO ] Invariant cache hit.
[2024-05-28 19:20:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 3 (OVERLAPS) 5/623 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/623 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 851 unsolved
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD328 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/624 variables, 1/97 constraints. Problems are: Problem set: 17 solved, 834 unsolved
[2024-05-28 19:20:36] [INFO ] Deduced a trap composed of 200 places in 182 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 624/1477 variables, and 98 constraints, problems are : Problem set: 17 solved, 834 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/624 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 851/851 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 17 solved, 834 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 86/86 constraints. Problems are: Problem set: 17 solved, 834 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 5/91 constraints. Problems are: Problem set: 17 solved, 834 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/91 constraints. Problems are: Problem set: 17 solved, 834 unsolved
At refinement iteration 3 (OVERLAPS) 5/623 variables, 5/96 constraints. Problems are: Problem set: 17 solved, 834 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/623 variables, 1/97 constraints. Problems are: Problem set: 17 solved, 834 unsolved
[2024-05-28 19:20:55] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 3 ms to minimize.
[2024-05-28 19:20:55] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/623 variables, 2/99 constraints. Problems are: Problem set: 17 solved, 834 unsolved
[2024-05-28 19:20:59] [INFO ] Deduced a trap composed of 12 places in 273 ms of which 5 ms to minimize.
[2024-05-28 19:21:02] [INFO ] Deduced a trap composed of 260 places in 265 ms of which 4 ms to minimize.
[2024-05-28 19:21:02] [INFO ] Deduced a trap composed of 245 places in 256 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/623 variables, 3/102 constraints. Problems are: Problem set: 17 solved, 834 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 623/1477 variables, and 102 constraints, problems are : Problem set: 17 solved, 834 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/624 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/851 constraints, Known Traps: 6/6 constraints]
After SMT, in 61650ms problems are : Problem set: 17 solved, 834 unsolved
Search for dead transitions found 17 dead transitions in 61672ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 624/624 places, 840/857 transitions.
Applied a total of 0 rules in 11 ms. Remains 624 /624 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106209 ms. Remains : 624/624 places, 840/857 transitions.
Stuttering acceptance computed with spot in 352 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-COL-S05J40-LTLCardinality-01
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J40-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J40-LTLCardinality-01 finished in 106589 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 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 857/857 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 856
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 856
Applied a total of 2 rules in 12 ms. Remains 623 /624 variables (removed 1) and now considering 856/857 (removed 1) transitions.
Running 850 sub problems to find dead transitions.
[2024-05-28 19:21:07] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
// Phase 1: matrix 852 rows 623 cols
[2024-05-28 19:21:07] [INFO ] Computed 97 invariants in 10 ms
[2024-05-28 19:21:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1475 variables, and 96 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
[2024-05-28 19:21:42] [INFO ] Deduced a trap composed of 204 places in 295 ms of which 5 ms to minimize.
[2024-05-28 19:21:42] [INFO ] Deduced a trap composed of 14 places in 260 ms of which 5 ms to minimize.
[2024-05-28 19:21:42] [INFO ] Deduced a trap composed of 15 places in 302 ms of which 4 ms to minimize.
[2024-05-28 19:21:46] [INFO ] Deduced a trap composed of 24 places in 277 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/1475 variables, and 100 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/850 constraints, Known Traps: 4/4 constraints]
After SMT, in 41359ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 41372ms
[2024-05-28 19:21:48] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2024-05-28 19:21:48] [INFO ] Invariant cache hit.
[2024-05-28 19:21:49] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-05-28 19:21:49] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2024-05-28 19:21:49] [INFO ] Invariant cache hit.
[2024-05-28 19:21:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:21:52] [INFO ] Implicit Places using invariants and state equation in 3657 ms returned []
Implicit Place search using SMT with State Equation took 3963 ms to find 0 implicit places.
Running 850 sub problems to find dead transitions.
[2024-05-28 19:21:52] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2024-05-28 19:21:52] [INFO ] Invariant cache hit.
[2024-05-28 19:21:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD328 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/623 variables, 1/97 constraints. Problems are: Problem set: 17 solved, 833 unsolved
[2024-05-28 19:22:19] [INFO ] Deduced a trap composed of 259 places in 243 ms of which 4 ms to minimize.
[2024-05-28 19:22:19] [INFO ] Deduced a trap composed of 271 places in 263 ms of which 5 ms to minimize.
[2024-05-28 19:22:20] [INFO ] Deduced a trap composed of 253 places in 244 ms of which 5 ms to minimize.
[2024-05-28 19:22:20] [INFO ] Deduced a trap composed of 256 places in 280 ms of which 4 ms to minimize.
[2024-05-28 19:22:20] [INFO ] Deduced a trap composed of 262 places in 257 ms of which 5 ms to minimize.
[2024-05-28 19:22:20] [INFO ] Deduced a trap composed of 259 places in 238 ms of which 3 ms to minimize.
[2024-05-28 19:22:21] [INFO ] Deduced a trap composed of 247 places in 225 ms of which 4 ms to minimize.
[2024-05-28 19:22:21] [INFO ] Deduced a trap composed of 259 places in 243 ms of which 4 ms to minimize.
[2024-05-28 19:22:21] [INFO ] Deduced a trap composed of 256 places in 245 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1475 variables, and 106 constraints, problems are : Problem set: 17 solved, 833 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 17 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 17 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 17 solved, 833 unsolved
[2024-05-28 19:22:28] [INFO ] Deduced a trap composed of 14 places in 200 ms of which 4 ms to minimize.
[2024-05-28 19:22:28] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 2/93 constraints. Problems are: Problem set: 17 solved, 833 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 0/93 constraints. Problems are: Problem set: 17 solved, 833 unsolved
At refinement iteration 4 (OVERLAPS) 5/622 variables, 5/98 constraints. Problems are: Problem set: 17 solved, 833 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/622 variables, 9/107 constraints. Problems are: Problem set: 17 solved, 833 unsolved
[2024-05-28 19:22:45] [INFO ] Deduced a trap composed of 268 places in 201 ms of which 3 ms to minimize.
[2024-05-28 19:22:47] [INFO ] Deduced a trap composed of 298 places in 262 ms of which 4 ms to minimize.
[2024-05-28 19:22:48] [INFO ] Deduced a trap composed of 294 places in 238 ms of which 4 ms to minimize.
[2024-05-28 19:22:48] [INFO ] Deduced a trap composed of 304 places in 262 ms of which 4 ms to minimize.
[2024-05-28 19:22:48] [INFO ] Deduced a trap composed of 292 places in 270 ms of which 4 ms to minimize.
[2024-05-28 19:22:48] [INFO ] Deduced a trap composed of 290 places in 267 ms of which 5 ms to minimize.
[2024-05-28 19:22:49] [INFO ] Deduced a trap composed of 300 places in 244 ms of which 5 ms to minimize.
[2024-05-28 19:22:49] [INFO ] Deduced a trap composed of 300 places in 246 ms of which 5 ms to minimize.
[2024-05-28 19:22:49] [INFO ] Deduced a trap composed of 299 places in 292 ms of which 5 ms to minimize.
[2024-05-28 19:22:50] [INFO ] Deduced a trap composed of 284 places in 287 ms of which 4 ms to minimize.
[2024-05-28 19:22:50] [INFO ] Deduced a trap composed of 292 places in 235 ms of which 3 ms to minimize.
[2024-05-28 19:22:50] [INFO ] Deduced a trap composed of 297 places in 243 ms of which 5 ms to minimize.
[2024-05-28 19:22:50] [INFO ] Deduced a trap composed of 296 places in 222 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/1475 variables, and 120 constraints, problems are : Problem set: 17 solved, 833 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/850 constraints, Known Traps: 24/24 constraints]
After SMT, in 61361ms problems are : Problem set: 17 solved, 833 unsolved
Search for dead transitions found 17 dead transitions in 61371ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 623/624 places, 839/857 transitions.
Applied a total of 0 rules in 7 ms. Remains 623 /623 variables (removed 0) and now considering 839/839 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106731 ms. Remains : 623/624 places, 839/857 transitions.
Stuttering acceptance computed with spot in 198 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-COL-S05J40-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J40-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J40-LTLCardinality-03 finished in 106954 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 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 857/857 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 856
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 856
Applied a total of 2 rules in 18 ms. Remains 623 /624 variables (removed 1) and now considering 856/857 (removed 1) transitions.
Running 850 sub problems to find dead transitions.
[2024-05-28 19:22:54] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2024-05-28 19:22:54] [INFO ] Invariant cache hit.
[2024-05-28 19:22:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 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) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1475 variables, and 96 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
[2024-05-28 19:23:19] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 3 ms to minimize.
[2024-05-28 19:23:20] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 4 (OVERLAPS) 5/622 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/1475 variables, and 98 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/850 constraints, Known Traps: 2/2 constraints]
After SMT, in 41402ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 41413ms
[2024-05-28 19:23:35] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2024-05-28 19:23:35] [INFO ] Invariant cache hit.
[2024-05-28 19:23:36] [INFO ] Implicit Places using invariants in 593 ms returned []
[2024-05-28 19:23:36] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2024-05-28 19:23:36] [INFO ] Invariant cache hit.
[2024-05-28 19:23:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:23:38] [INFO ] Implicit Places using invariants and state equation in 2041 ms returned []
Implicit Place search using SMT with State Equation took 2637 ms to find 0 implicit places.
Running 850 sub problems to find dead transitions.
[2024-05-28 19:23:38] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2024-05-28 19:23:38] [INFO ] Invariant cache hit.
[2024-05-28 19:23:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD328 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/623 variables, 1/97 constraints. Problems are: Problem set: 17 solved, 833 unsolved
[2024-05-28 19:24:06] [INFO ] Deduced a trap composed of 259 places in 249 ms of which 5 ms to minimize.
[2024-05-28 19:24:06] [INFO ] Deduced a trap composed of 271 places in 238 ms of which 5 ms to minimize.
[2024-05-28 19:24:07] [INFO ] Deduced a trap composed of 253 places in 295 ms of which 4 ms to minimize.
[2024-05-28 19:24:07] [INFO ] Deduced a trap composed of 256 places in 175 ms of which 3 ms to minimize.
[2024-05-28 19:24:07] [INFO ] Deduced a trap composed of 262 places in 273 ms of which 4 ms to minimize.
[2024-05-28 19:24:08] [INFO ] Deduced a trap composed of 259 places in 280 ms of which 4 ms to minimize.
[2024-05-28 19:24:08] [INFO ] Deduced a trap composed of 247 places in 260 ms of which 4 ms to minimize.
[2024-05-28 19:24:08] [INFO ] Deduced a trap composed of 259 places in 273 ms of which 4 ms to minimize.
[2024-05-28 19:24:08] [INFO ] Deduced a trap composed of 256 places in 250 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1475 variables, and 106 constraints, problems are : Problem set: 17 solved, 833 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 17 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 17 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 17 solved, 833 unsolved
[2024-05-28 19:24:13] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 2 ms to minimize.
[2024-05-28 19:24:13] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 2/93 constraints. Problems are: Problem set: 17 solved, 833 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 0/93 constraints. Problems are: Problem set: 17 solved, 833 unsolved
At refinement iteration 4 (OVERLAPS) 5/622 variables, 5/98 constraints. Problems are: Problem set: 17 solved, 833 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/622 variables, 9/107 constraints. Problems are: Problem set: 17 solved, 833 unsolved
[2024-05-28 19:24:27] [INFO ] Deduced a trap composed of 268 places in 248 ms of which 4 ms to minimize.
[2024-05-28 19:24:29] [INFO ] Deduced a trap composed of 298 places in 260 ms of which 4 ms to minimize.
[2024-05-28 19:24:30] [INFO ] Deduced a trap composed of 294 places in 230 ms of which 4 ms to minimize.
[2024-05-28 19:24:30] [INFO ] Deduced a trap composed of 304 places in 234 ms of which 4 ms to minimize.
[2024-05-28 19:24:30] [INFO ] Deduced a trap composed of 292 places in 271 ms of which 5 ms to minimize.
[2024-05-28 19:24:31] [INFO ] Deduced a trap composed of 290 places in 276 ms of which 5 ms to minimize.
[2024-05-28 19:24:31] [INFO ] Deduced a trap composed of 300 places in 248 ms of which 5 ms to minimize.
[2024-05-28 19:24:31] [INFO ] Deduced a trap composed of 300 places in 264 ms of which 4 ms to minimize.
[2024-05-28 19:24:31] [INFO ] Deduced a trap composed of 299 places in 276 ms of which 4 ms to minimize.
[2024-05-28 19:24:32] [INFO ] Deduced a trap composed of 284 places in 243 ms of which 4 ms to minimize.
[2024-05-28 19:24:32] [INFO ] Deduced a trap composed of 292 places in 250 ms of which 4 ms to minimize.
[2024-05-28 19:24:32] [INFO ] Deduced a trap composed of 297 places in 270 ms of which 4 ms to minimize.
[2024-05-28 19:24:33] [INFO ] Deduced a trap composed of 296 places in 282 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/1475 variables, and 120 constraints, problems are : Problem set: 17 solved, 833 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/850 constraints, Known Traps: 24/24 constraints]
After SMT, in 61330ms problems are : Problem set: 17 solved, 833 unsolved
Search for dead transitions found 17 dead transitions in 61342ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 623/624 places, 839/857 transitions.
Applied a total of 0 rules in 13 ms. Remains 623 /623 variables (removed 0) and now considering 839/839 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 105433 ms. Remains : 623/624 places, 839/857 transitions.
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 23927 steps with 1661 reset in 140 ms.
FORMULA PolyORBNT-COL-S05J40-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J40-LTLCardinality-04 finished in 105770 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 624 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 624/624 places, 857/857 transitions.
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 812
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 811
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 811
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 767
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 767
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 181 place count 533 transition count 766
Iterating global reduction 3 with 1 rules applied. Total rules applied 182 place count 533 transition count 766
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 3 with 4 rules applied. Total rules applied 186 place count 531 transition count 764
Applied a total of 186 rules in 120 ms. Remains 531 /624 variables (removed 93) and now considering 764/857 (removed 93) transitions.
Running 758 sub problems to find dead transitions.
[2024-05-28 19:24:40] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
// Phase 1: matrix 760 rows 531 cols
[2024-05-28 19:24:40] [INFO ] Computed 97 invariants in 14 ms
[2024-05-28 19:24:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 19:24:47] [INFO ] Deduced a trap composed of 137 places in 232 ms of which 4 ms to minimize.
[2024-05-28 19:24:47] [INFO ] Deduced a trap composed of 137 places in 170 ms of which 3 ms to minimize.
[2024-05-28 19:24:48] [INFO ] Deduced a trap composed of 159 places in 182 ms of which 4 ms to minimize.
[2024-05-28 19:24:48] [INFO ] Deduced a trap composed of 159 places in 148 ms of which 2 ms to minimize.
[2024-05-28 19:24:48] [INFO ] Deduced a trap composed of 137 places in 201 ms of which 3 ms to minimize.
[2024-05-28 19:24:48] [INFO ] Deduced a trap composed of 137 places in 237 ms of which 3 ms to minimize.
[2024-05-28 19:24:49] [INFO ] Deduced a trap composed of 177 places in 213 ms of which 4 ms to minimize.
[2024-05-28 19:24:49] [INFO ] Deduced a trap composed of 137 places in 217 ms of which 4 ms to minimize.
[2024-05-28 19:24:49] [INFO ] Deduced a trap composed of 137 places in 213 ms of which 4 ms to minimize.
[2024-05-28 19:24:49] [INFO ] Deduced a trap composed of 137 places in 209 ms of which 4 ms to minimize.
[2024-05-28 19:24:50] [INFO ] Deduced a trap composed of 137 places in 194 ms of which 3 ms to minimize.
[2024-05-28 19:24:50] [INFO ] Deduced a trap composed of 137 places in 172 ms of which 3 ms to minimize.
[2024-05-28 19:24:50] [INFO ] Deduced a trap composed of 137 places in 152 ms of which 3 ms to minimize.
[2024-05-28 19:24:50] [INFO ] Deduced a trap composed of 137 places in 205 ms of which 4 ms to minimize.
[2024-05-28 19:24:50] [INFO ] Deduced a trap composed of 137 places in 218 ms of which 4 ms to minimize.
[2024-05-28 19:24:51] [INFO ] Deduced a trap composed of 137 places in 231 ms of which 4 ms to minimize.
[2024-05-28 19:24:51] [INFO ] Deduced a trap composed of 137 places in 214 ms of which 4 ms to minimize.
[2024-05-28 19:24:51] [INFO ] Deduced a trap composed of 137 places in 218 ms of which 4 ms to minimize.
[2024-05-28 19:24:51] [INFO ] Deduced a trap composed of 165 places in 246 ms of which 3 ms to minimize.
[2024-05-28 19:24:52] [INFO ] Deduced a trap composed of 174 places in 224 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 19:24:52] [INFO ] Deduced a trap composed of 137 places in 221 ms of which 3 ms to minimize.
[2024-05-28 19:24:52] [INFO ] Deduced a trap composed of 137 places in 224 ms of which 3 ms to minimize.
[2024-05-28 19:24:53] [INFO ] Deduced a trap composed of 137 places in 190 ms of which 4 ms to minimize.
[2024-05-28 19:24:53] [INFO ] Deduced a trap composed of 137 places in 243 ms of which 4 ms to minimize.
[2024-05-28 19:24:53] [INFO ] Deduced a trap composed of 137 places in 216 ms of which 4 ms to minimize.
[2024-05-28 19:24:53] [INFO ] Deduced a trap composed of 137 places in 268 ms of which 5 ms to minimize.
[2024-05-28 19:24:54] [INFO ] Deduced a trap composed of 137 places in 209 ms of which 4 ms to minimize.
[2024-05-28 19:24:54] [INFO ] Deduced a trap composed of 137 places in 209 ms of which 4 ms to minimize.
[2024-05-28 19:24:54] [INFO ] Deduced a trap composed of 137 places in 219 ms of which 3 ms to minimize.
[2024-05-28 19:24:54] [INFO ] Deduced a trap composed of 137 places in 187 ms of which 3 ms to minimize.
[2024-05-28 19:24:55] [INFO ] Deduced a trap composed of 137 places in 192 ms of which 4 ms to minimize.
[2024-05-28 19:24:55] [INFO ] Deduced a trap composed of 137 places in 196 ms of which 3 ms to minimize.
[2024-05-28 19:24:55] [INFO ] Deduced a trap composed of 137 places in 190 ms of which 4 ms to minimize.
[2024-05-28 19:24:55] [INFO ] Deduced a trap composed of 137 places in 184 ms of which 4 ms to minimize.
[2024-05-28 19:24:55] [INFO ] Deduced a trap composed of 137 places in 188 ms of which 4 ms to minimize.
[2024-05-28 19:24:58] [INFO ] Deduced a trap composed of 116 places in 214 ms of which 4 ms to minimize.
[2024-05-28 19:24:58] [INFO ] Deduced a trap composed of 115 places in 200 ms of which 4 ms to minimize.
[2024-05-28 19:24:58] [INFO ] Deduced a trap composed of 115 places in 193 ms of which 3 ms to minimize.
[2024-05-28 19:24:58] [INFO ] Deduced a trap composed of 113 places in 210 ms of which 4 ms to minimize.
[2024-05-28 19:24:59] [INFO ] Deduced a trap composed of 112 places in 211 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 758 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/1291 variables, and 132 constraints, problems are : Problem set: 0 solved, 758 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/531 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 758/758 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 758 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 19:25:03] [INFO ] Deduced a trap composed of 183 places in 199 ms of which 4 ms to minimize.
[2024-05-28 19:25:03] [INFO ] Deduced a trap composed of 177 places in 181 ms of which 3 ms to minimize.
[2024-05-28 19:25:03] [INFO ] Deduced a trap composed of 174 places in 175 ms of which 3 ms to minimize.
[2024-05-28 19:25:04] [INFO ] Deduced a trap composed of 168 places in 184 ms of which 3 ms to minimize.
[2024-05-28 19:25:04] [INFO ] Deduced a trap composed of 189 places in 194 ms of which 3 ms to minimize.
[2024-05-28 19:25:04] [INFO ] Deduced a trap composed of 137 places in 207 ms of which 3 ms to minimize.
[2024-05-28 19:25:05] [INFO ] Deduced a trap composed of 137 places in 260 ms of which 5 ms to minimize.
[2024-05-28 19:25:05] [INFO ] Deduced a trap composed of 137 places in 212 ms of which 4 ms to minimize.
[2024-05-28 19:25:05] [INFO ] Deduced a trap composed of 137 places in 205 ms of which 4 ms to minimize.
[2024-05-28 19:25:05] [INFO ] Deduced a trap composed of 137 places in 218 ms of which 3 ms to minimize.
[2024-05-28 19:25:05] [INFO ] Deduced a trap composed of 137 places in 221 ms of which 4 ms to minimize.
[2024-05-28 19:25:06] [INFO ] Deduced a trap composed of 137 places in 274 ms of which 4 ms to minimize.
[2024-05-28 19:25:06] [INFO ] Deduced a trap composed of 141 places in 222 ms of which 3 ms to minimize.
[2024-05-28 19:25:06] [INFO ] Deduced a trap composed of 137 places in 234 ms of which 4 ms to minimize.
[2024-05-28 19:25:07] [INFO ] Deduced a trap composed of 141 places in 224 ms of which 4 ms to minimize.
[2024-05-28 19:25:07] [INFO ] Deduced a trap composed of 137 places in 217 ms of which 4 ms to minimize.
[2024-05-28 19:25:07] [INFO ] Deduced a trap composed of 141 places in 221 ms of which 4 ms to minimize.
[2024-05-28 19:25:07] [INFO ] Deduced a trap composed of 137 places in 228 ms of which 3 ms to minimize.
[2024-05-28 19:25:08] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 2 ms to minimize.
[2024-05-28 19:25:10] [INFO ] Deduced a trap composed of 141 places in 254 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 19:25:11] [INFO ] Deduced a trap composed of 233 places in 239 ms of which 4 ms to minimize.
[2024-05-28 19:25:12] [INFO ] Deduced a trap composed of 141 places in 262 ms of which 4 ms to minimize.
[2024-05-28 19:25:12] [INFO ] Deduced a trap composed of 137 places in 258 ms of which 4 ms to minimize.
[2024-05-28 19:25:12] [INFO ] Deduced a trap composed of 141 places in 229 ms of which 4 ms to minimize.
[2024-05-28 19:25:12] [INFO ] Deduced a trap composed of 137 places in 219 ms of which 4 ms to minimize.
[2024-05-28 19:25:13] [INFO ] Deduced a trap composed of 175 places in 264 ms of which 3 ms to minimize.
[2024-05-28 19:25:13] [INFO ] Deduced a trap composed of 168 places in 226 ms of which 4 ms to minimize.
[2024-05-28 19:25:13] [INFO ] Deduced a trap composed of 141 places in 231 ms of which 4 ms to minimize.
[2024-05-28 19:25:14] [INFO ] Deduced a trap composed of 137 places in 243 ms of which 4 ms to minimize.
[2024-05-28 19:25:14] [INFO ] Deduced a trap composed of 177 places in 260 ms of which 4 ms to minimize.
[2024-05-28 19:25:14] [INFO ] Deduced a trap composed of 141 places in 245 ms of which 4 ms to minimize.
[2024-05-28 19:25:15] [INFO ] Deduced a trap composed of 141 places in 229 ms of which 3 ms to minimize.
[2024-05-28 19:25:15] [INFO ] Deduced a trap composed of 137 places in 221 ms of which 3 ms to minimize.
[2024-05-28 19:25:15] [INFO ] Deduced a trap composed of 137 places in 215 ms of which 3 ms to minimize.
[2024-05-28 19:25:15] [INFO ] Deduced a trap composed of 141 places in 162 ms of which 2 ms to minimize.
[2024-05-28 19:25:16] [INFO ] Deduced a trap composed of 137 places in 203 ms of which 4 ms to minimize.
[2024-05-28 19:25:16] [INFO ] Deduced a trap composed of 141 places in 183 ms of which 3 ms to minimize.
[2024-05-28 19:25:16] [INFO ] Deduced a trap composed of 141 places in 245 ms of which 5 ms to minimize.
[2024-05-28 19:25:16] [INFO ] Deduced a trap composed of 141 places in 218 ms of which 3 ms to minimize.
[2024-05-28 19:25:16] [INFO ] Deduced a trap composed of 141 places in 172 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 19:25:18] [INFO ] Deduced a trap composed of 137 places in 235 ms of which 3 ms to minimize.
[2024-05-28 19:25:18] [INFO ] Deduced a trap composed of 137 places in 213 ms of which 3 ms to minimize.
[2024-05-28 19:25:19] [INFO ] Deduced a trap composed of 137 places in 199 ms of which 3 ms to minimize.
[2024-05-28 19:25:19] [INFO ] Deduced a trap composed of 137 places in 196 ms of which 4 ms to minimize.
[2024-05-28 19:25:19] [INFO ] Deduced a trap composed of 137 places in 199 ms of which 4 ms to minimize.
[2024-05-28 19:25:19] [INFO ] Deduced a trap composed of 137 places in 212 ms of which 4 ms to minimize.
[2024-05-28 19:25:20] [INFO ] Deduced a trap composed of 137 places in 223 ms of which 4 ms to minimize.
[2024-05-28 19:25:20] [INFO ] Deduced a trap composed of 137 places in 211 ms of which 4 ms to minimize.
[2024-05-28 19:25:20] [INFO ] Deduced a trap composed of 137 places in 249 ms of which 3 ms to minimize.
[2024-05-28 19:25:21] [INFO ] Deduced a trap composed of 137 places in 222 ms of which 3 ms to minimize.
[2024-05-28 19:25:21] [INFO ] Deduced a trap composed of 137 places in 216 ms of which 4 ms to minimize.
[2024-05-28 19:25:21] [INFO ] Deduced a trap composed of 137 places in 217 ms of which 3 ms to minimize.
[2024-05-28 19:25:22] [INFO ] Deduced a trap composed of 137 places in 218 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/1291 variables, and 185 constraints, problems are : Problem set: 0 solved, 758 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/531 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/758 constraints, Known Traps: 93/93 constraints]
After SMT, in 41713ms problems are : Problem set: 0 solved, 758 unsolved
Search for dead transitions found 0 dead transitions in 41722ms
[2024-05-28 19:25:22] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
[2024-05-28 19:25:22] [INFO ] Invariant cache hit.
[2024-05-28 19:25:22] [INFO ] Implicit Places using invariants in 530 ms returned []
[2024-05-28 19:25:22] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
[2024-05-28 19:25:22] [INFO ] Invariant cache hit.
[2024-05-28 19:25:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:25:24] [INFO ] Implicit Places using invariants and state equation in 1954 ms returned []
Implicit Place search using SMT with State Equation took 2486 ms to find 0 implicit places.
[2024-05-28 19:25:24] [INFO ] Redundant transitions in 44 ms returned []
Running 758 sub problems to find dead transitions.
[2024-05-28 19:25:24] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
[2024-05-28 19:25:24] [INFO ] Invariant cache hit.
[2024-05-28 19:25:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 19:25:31] [INFO ] Deduced a trap composed of 165 places in 195 ms of which 3 ms to minimize.
[2024-05-28 19:25:31] [INFO ] Deduced a trap composed of 137 places in 188 ms of which 3 ms to minimize.
[2024-05-28 19:25:31] [INFO ] Deduced a trap composed of 137 places in 199 ms of which 4 ms to minimize.
[2024-05-28 19:25:32] [INFO ] Deduced a trap composed of 137 places in 213 ms of which 4 ms to minimize.
[2024-05-28 19:25:32] [INFO ] Deduced a trap composed of 137 places in 212 ms of which 3 ms to minimize.
[2024-05-28 19:25:32] [INFO ] Deduced a trap composed of 137 places in 206 ms of which 3 ms to minimize.
[2024-05-28 19:25:33] [INFO ] Deduced a trap composed of 137 places in 183 ms of which 3 ms to minimize.
[2024-05-28 19:25:33] [INFO ] Deduced a trap composed of 137 places in 210 ms of which 4 ms to minimize.
[2024-05-28 19:25:33] [INFO ] Deduced a trap composed of 137 places in 187 ms of which 3 ms to minimize.
[2024-05-28 19:25:33] [INFO ] Deduced a trap composed of 137 places in 184 ms of which 3 ms to minimize.
[2024-05-28 19:25:37] [INFO ] Deduced a trap composed of 14 places in 233 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 11/103 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 19:25:39] [INFO ] Deduced a trap composed of 159 places in 184 ms of which 3 ms to minimize.
[2024-05-28 19:25:39] [INFO ] Deduced a trap composed of 137 places in 225 ms of which 4 ms to minimize.
[2024-05-28 19:25:40] [INFO ] Deduced a trap composed of 137 places in 251 ms of which 4 ms to minimize.
[2024-05-28 19:25:40] [INFO ] Deduced a trap composed of 137 places in 248 ms of which 7 ms to minimize.
[2024-05-28 19:25:40] [INFO ] Deduced a trap composed of 137 places in 214 ms of which 4 ms to minimize.
[2024-05-28 19:25:40] [INFO ] Deduced a trap composed of 137 places in 225 ms of which 4 ms to minimize.
[2024-05-28 19:25:41] [INFO ] Deduced a trap composed of 137 places in 183 ms of which 2 ms to minimize.
[2024-05-28 19:25:41] [INFO ] Deduced a trap composed of 137 places in 207 ms of which 4 ms to minimize.
[2024-05-28 19:25:41] [INFO ] Deduced a trap composed of 137 places in 236 ms of which 4 ms to minimize.
[2024-05-28 19:25:41] [INFO ] Deduced a trap composed of 137 places in 240 ms of which 4 ms to minimize.
[2024-05-28 19:25:42] [INFO ] Deduced a trap composed of 137 places in 220 ms of which 3 ms to minimize.
[2024-05-28 19:25:42] [INFO ] Deduced a trap composed of 137 places in 242 ms of which 4 ms to minimize.
[2024-05-28 19:25:42] [INFO ] Deduced a trap composed of 137 places in 212 ms of which 4 ms to minimize.
[2024-05-28 19:25:42] [INFO ] Deduced a trap composed of 137 places in 218 ms of which 4 ms to minimize.
[2024-05-28 19:25:43] [INFO ] Deduced a trap composed of 137 places in 177 ms of which 3 ms to minimize.
[2024-05-28 19:25:48] [INFO ] Deduced a trap composed of 171 places in 209 ms of which 4 ms to minimize.
[2024-05-28 19:25:48] [INFO ] Deduced a trap composed of 207 places in 200 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 17/120 constraints. Problems are: Problem set: 0 solved, 758 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/1291 variables, and 120 constraints, problems are : Problem set: 0 solved, 758 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/531 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 758/758 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 758 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 28/120 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 19:25:57] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 2 ms to minimize.
[2024-05-28 19:25:59] [INFO ] Deduced a trap composed of 141 places in 234 ms of which 4 ms to minimize.
[2024-05-28 19:25:59] [INFO ] Deduced a trap composed of 137 places in 181 ms of which 3 ms to minimize.
[2024-05-28 19:25:59] [INFO ] Deduced a trap composed of 141 places in 223 ms of which 4 ms to minimize.
[2024-05-28 19:25:59] [INFO ] Deduced a trap composed of 137 places in 219 ms of which 4 ms to minimize.
[2024-05-28 19:26:00] [INFO ] Deduced a trap composed of 137 places in 234 ms of which 4 ms to minimize.
[2024-05-28 19:26:00] [INFO ] Deduced a trap composed of 137 places in 219 ms of which 4 ms to minimize.
[2024-05-28 19:26:00] [INFO ] Deduced a trap composed of 137 places in 196 ms of which 2 ms to minimize.
[2024-05-28 19:26:00] [INFO ] Deduced a trap composed of 137 places in 185 ms of which 3 ms to minimize.
[2024-05-28 19:26:01] [INFO ] Deduced a trap composed of 137 places in 243 ms of which 4 ms to minimize.
[2024-05-28 19:26:01] [INFO ] Deduced a trap composed of 141 places in 221 ms of which 4 ms to minimize.
[2024-05-28 19:26:01] [INFO ] Deduced a trap composed of 141 places in 195 ms of which 3 ms to minimize.
[2024-05-28 19:26:01] [INFO ] Deduced a trap composed of 137 places in 164 ms of which 3 ms to minimize.
[2024-05-28 19:26:01] [INFO ] Deduced a trap composed of 137 places in 144 ms of which 2 ms to minimize.
[2024-05-28 19:26:02] [INFO ] Deduced a trap composed of 137 places in 213 ms of which 3 ms to minimize.
[2024-05-28 19:26:02] [INFO ] Deduced a trap composed of 137 places in 186 ms of which 3 ms to minimize.
[2024-05-28 19:26:02] [INFO ] Deduced a trap composed of 141 places in 187 ms of which 3 ms to minimize.
[2024-05-28 19:26:02] [INFO ] Deduced a trap composed of 137 places in 184 ms of which 3 ms to minimize.
[2024-05-28 19:26:02] [INFO ] Deduced a trap composed of 141 places in 185 ms of which 3 ms to minimize.
[2024-05-28 19:26:03] [INFO ] Deduced a trap composed of 137 places in 244 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 19:26:10] [INFO ] Deduced a trap composed of 231 places in 216 ms of which 3 ms to minimize.
[2024-05-28 19:26:11] [INFO ] Deduced a trap composed of 211 places in 244 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 19:26:24] [INFO ] Deduced a trap composed of 237 places in 217 ms of which 3 ms to minimize.
[2024-05-28 19:26:25] [INFO ] Deduced a trap composed of 226 places in 228 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/1291 variables, and 144 constraints, problems are : Problem set: 0 solved, 758 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/531 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/758 constraints, Known Traps: 52/52 constraints]
After SMT, in 61343ms problems are : Problem set: 0 solved, 758 unsolved
Search for dead transitions found 0 dead transitions in 61356ms
Starting structural reductions in SI_LTL mode, iteration 1 : 531/624 places, 764/857 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105744 ms. Remains : 531/624 places, 764/857 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), false]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLCardinality-06
Stuttering criterion allowed to conclude after 31 steps with 1 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J40-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J40-LTLCardinality-06 finished in 105893 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((F(p0)&&(p0 U p1)) U !p0) U (G(p0) U p1)))'
Support contains 7 out of 624 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 624/624 places, 857/857 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 624 transition count 813
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 45 rules applied. Total rules applied 89 place count 580 transition count 812
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 579 transition count 812
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 90 place count 579 transition count 767
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 180 place count 534 transition count 767
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 3 with 2 rules applied. Total rules applied 182 place count 533 transition count 766
Applied a total of 182 rules in 70 ms. Remains 533 /624 variables (removed 91) and now considering 766/857 (removed 91) transitions.
Running 760 sub problems to find dead transitions.
[2024-05-28 19:26:26] [INFO ] Flow matrix only has 762 transitions (discarded 4 similar events)
// Phase 1: matrix 762 rows 533 cols
[2024-05-28 19:26:26] [INFO ] Computed 97 invariants in 9 ms
[2024-05-28 19:26:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-28 19:26:33] [INFO ] Deduced a trap composed of 167 places in 212 ms of which 4 ms to minimize.
[2024-05-28 19:26:33] [INFO ] Deduced a trap composed of 173 places in 218 ms of which 3 ms to minimize.
[2024-05-28 19:26:34] [INFO ] Deduced a trap composed of 139 places in 226 ms of which 4 ms to minimize.
[2024-05-28 19:26:34] [INFO ] Deduced a trap composed of 139 places in 196 ms of which 4 ms to minimize.
[2024-05-28 19:26:34] [INFO ] Deduced a trap composed of 167 places in 228 ms of which 4 ms to minimize.
[2024-05-28 19:26:34] [INFO ] Deduced a trap composed of 139 places in 218 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 6/98 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-28 19:26:40] [INFO ] Deduced a trap composed of 158 places in 210 ms of which 3 ms to minimize.
[2024-05-28 19:26:40] [INFO ] Deduced a trap composed of 173 places in 212 ms of which 3 ms to minimize.
[2024-05-28 19:26:41] [INFO ] Deduced a trap composed of 139 places in 215 ms of which 4 ms to minimize.
[2024-05-28 19:26:41] [INFO ] Deduced a trap composed of 139 places in 194 ms of which 4 ms to minimize.
[2024-05-28 19:26:41] [INFO ] Deduced a trap composed of 161 places in 195 ms of which 4 ms to minimize.
[2024-05-28 19:26:41] [INFO ] Deduced a trap composed of 170 places in 198 ms of which 3 ms to minimize.
[2024-05-28 19:26:41] [INFO ] Deduced a trap composed of 139 places in 176 ms of which 3 ms to minimize.
[2024-05-28 19:26:42] [INFO ] Deduced a trap composed of 139 places in 205 ms of which 4 ms to minimize.
[2024-05-28 19:26:42] [INFO ] Deduced a trap composed of 139 places in 191 ms of which 3 ms to minimize.
[2024-05-28 19:26:42] [INFO ] Deduced a trap composed of 139 places in 175 ms of which 3 ms to minimize.
[2024-05-28 19:26:42] [INFO ] Deduced a trap composed of 139 places in 226 ms of which 4 ms to minimize.
[2024-05-28 19:26:43] [INFO ] Deduced a trap composed of 139 places in 216 ms of which 4 ms to minimize.
[2024-05-28 19:26:43] [INFO ] Deduced a trap composed of 139 places in 212 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1295 variables, and 111 constraints, problems are : Problem set: 0 solved, 760 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/533 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 760/760 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 760 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 19/111 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-28 19:26:48] [INFO ] Deduced a trap composed of 142 places in 230 ms of which 3 ms to minimize.
[2024-05-28 19:26:48] [INFO ] Deduced a trap composed of 139 places in 203 ms of which 3 ms to minimize.
[2024-05-28 19:26:48] [INFO ] Deduced a trap composed of 143 places in 203 ms of which 4 ms to minimize.
[2024-05-28 19:26:49] [INFO ] Deduced a trap composed of 139 places in 199 ms of which 4 ms to minimize.
[2024-05-28 19:26:49] [INFO ] Deduced a trap composed of 139 places in 229 ms of which 3 ms to minimize.
[2024-05-28 19:26:49] [INFO ] Deduced a trap composed of 139 places in 169 ms of which 2 ms to minimize.
[2024-05-28 19:26:49] [INFO ] Deduced a trap composed of 139 places in 231 ms of which 4 ms to minimize.
[2024-05-28 19:26:50] [INFO ] Deduced a trap composed of 143 places in 198 ms of which 4 ms to minimize.
[2024-05-28 19:26:50] [INFO ] Deduced a trap composed of 139 places in 198 ms of which 4 ms to minimize.
[2024-05-28 19:26:50] [INFO ] Deduced a trap composed of 139 places in 202 ms of which 4 ms to minimize.
[2024-05-28 19:26:50] [INFO ] Deduced a trap composed of 139 places in 219 ms of which 4 ms to minimize.
[2024-05-28 19:26:50] [INFO ] Deduced a trap composed of 139 places in 205 ms of which 3 ms to minimize.
[2024-05-28 19:26:51] [INFO ] Deduced a trap composed of 139 places in 222 ms of which 4 ms to minimize.
[2024-05-28 19:26:51] [INFO ] Deduced a trap composed of 139 places in 237 ms of which 4 ms to minimize.
[2024-05-28 19:26:51] [INFO ] Deduced a trap composed of 139 places in 198 ms of which 4 ms to minimize.
[2024-05-28 19:26:51] [INFO ] Deduced a trap composed of 143 places in 208 ms of which 4 ms to minimize.
[2024-05-28 19:26:52] [INFO ] Deduced a trap composed of 139 places in 209 ms of which 3 ms to minimize.
[2024-05-28 19:26:52] [INFO ] Deduced a trap composed of 139 places in 233 ms of which 3 ms to minimize.
[2024-05-28 19:26:52] [INFO ] Deduced a trap composed of 139 places in 194 ms of which 4 ms to minimize.
[2024-05-28 19:26:52] [INFO ] Deduced a trap composed of 139 places in 217 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-28 19:26:54] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 1 ms to minimize.
[2024-05-28 19:26:57] [INFO ] Deduced a trap composed of 180 places in 202 ms of which 4 ms to minimize.
[2024-05-28 19:26:58] [INFO ] Deduced a trap composed of 165 places in 194 ms of which 3 ms to minimize.
[2024-05-28 19:26:58] [INFO ] Deduced a trap composed of 167 places in 183 ms of which 3 ms to minimize.
[2024-05-28 19:26:58] [INFO ] Deduced a trap composed of 203 places in 220 ms of which 4 ms to minimize.
[2024-05-28 19:26:58] [INFO ] Deduced a trap composed of 205 places in 207 ms of which 4 ms to minimize.
[2024-05-28 19:26:59] [INFO ] Deduced a trap composed of 211 places in 182 ms of which 3 ms to minimize.
[2024-05-28 19:26:59] [INFO ] Deduced a trap composed of 209 places in 197 ms of which 3 ms to minimize.
[2024-05-28 19:26:59] [INFO ] Deduced a trap composed of 205 places in 229 ms of which 4 ms to minimize.
[2024-05-28 19:26:59] [INFO ] Deduced a trap composed of 207 places in 213 ms of which 3 ms to minimize.
[2024-05-28 19:27:00] [INFO ] Deduced a trap composed of 199 places in 192 ms of which 3 ms to minimize.
[2024-05-28 19:27:00] [INFO ] Deduced a trap composed of 195 places in 167 ms of which 3 ms to minimize.
[2024-05-28 19:27:00] [INFO ] Deduced a trap composed of 203 places in 235 ms of which 4 ms to minimize.
[2024-05-28 19:27:00] [INFO ] Deduced a trap composed of 231 places in 249 ms of which 4 ms to minimize.
[2024-05-28 19:27:01] [INFO ] Deduced a trap composed of 239 places in 198 ms of which 4 ms to minimize.
[2024-05-28 19:27:03] [INFO ] Deduced a trap composed of 180 places in 207 ms of which 3 ms to minimize.
[2024-05-28 19:27:04] [INFO ] Deduced a trap composed of 173 places in 235 ms of which 4 ms to minimize.
[2024-05-28 19:27:04] [INFO ] Deduced a trap composed of 215 places in 252 ms of which 3 ms to minimize.
[2024-05-28 19:27:05] [INFO ] Deduced a trap composed of 213 places in 245 ms of which 4 ms to minimize.
[2024-05-28 19:27:05] [INFO ] Deduced a trap composed of 203 places in 233 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 760 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1295 variables, and 151 constraints, problems are : Problem set: 0 solved, 760 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/533 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/760 constraints, Known Traps: 59/59 constraints]
After SMT, in 41123ms problems are : Problem set: 0 solved, 760 unsolved
Search for dead transitions found 0 dead transitions in 41130ms
[2024-05-28 19:27:07] [INFO ] Flow matrix only has 762 transitions (discarded 4 similar events)
[2024-05-28 19:27:07] [INFO ] Invariant cache hit.
[2024-05-28 19:27:07] [INFO ] Implicit Places using invariants in 485 ms returned []
[2024-05-28 19:27:07] [INFO ] Flow matrix only has 762 transitions (discarded 4 similar events)
[2024-05-28 19:27:07] [INFO ] Invariant cache hit.
[2024-05-28 19:27:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:27:10] [INFO ] Implicit Places using invariants and state equation in 2230 ms returned []
Implicit Place search using SMT with State Equation took 2717 ms to find 0 implicit places.
[2024-05-28 19:27:10] [INFO ] Redundant transitions in 17 ms returned []
Running 760 sub problems to find dead transitions.
[2024-05-28 19:27:10] [INFO ] Flow matrix only has 762 transitions (discarded 4 similar events)
[2024-05-28 19:27:10] [INFO ] Invariant cache hit.
[2024-05-28 19:27:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-28 19:27:16] [INFO ] Deduced a trap composed of 170 places in 220 ms of which 3 ms to minimize.
[2024-05-28 19:27:17] [INFO ] Deduced a trap composed of 176 places in 208 ms of which 3 ms to minimize.
[2024-05-28 19:27:17] [INFO ] Deduced a trap composed of 139 places in 191 ms of which 3 ms to minimize.
[2024-05-28 19:27:17] [INFO ] Deduced a trap composed of 139 places in 194 ms of which 4 ms to minimize.
[2024-05-28 19:27:17] [INFO ] Deduced a trap composed of 139 places in 227 ms of which 4 ms to minimize.
[2024-05-28 19:27:18] [INFO ] Deduced a trap composed of 139 places in 231 ms of which 4 ms to minimize.
[2024-05-28 19:27:18] [INFO ] Deduced a trap composed of 164 places in 234 ms of which 4 ms to minimize.
[2024-05-28 19:27:18] [INFO ] Deduced a trap composed of 139 places in 243 ms of which 4 ms to minimize.
[2024-05-28 19:27:18] [INFO ] Deduced a trap composed of 139 places in 214 ms of which 4 ms to minimize.
[2024-05-28 19:27:19] [INFO ] Deduced a trap composed of 139 places in 197 ms of which 3 ms to minimize.
[2024-05-28 19:27:19] [INFO ] Deduced a trap composed of 139 places in 252 ms of which 4 ms to minimize.
[2024-05-28 19:27:19] [INFO ] Deduced a trap composed of 167 places in 248 ms of which 4 ms to minimize.
[2024-05-28 19:27:19] [INFO ] Deduced a trap composed of 139 places in 235 ms of which 3 ms to minimize.
[2024-05-28 19:27:20] [INFO ] Deduced a trap composed of 170 places in 233 ms of which 4 ms to minimize.
[2024-05-28 19:27:20] [INFO ] Deduced a trap composed of 139 places in 233 ms of which 3 ms to minimize.
[2024-05-28 19:27:20] [INFO ] Deduced a trap composed of 139 places in 235 ms of which 4 ms to minimize.
[2024-05-28 19:27:20] [INFO ] Deduced a trap composed of 167 places in 234 ms of which 3 ms to minimize.
[2024-05-28 19:27:21] [INFO ] Deduced a trap composed of 139 places in 219 ms of which 4 ms to minimize.
[2024-05-28 19:27:21] [INFO ] Deduced a trap composed of 139 places in 197 ms of which 4 ms to minimize.
[2024-05-28 19:27:21] [INFO ] Deduced a trap composed of 139 places in 243 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-28 19:27:22] [INFO ] Deduced a trap composed of 139 places in 232 ms of which 3 ms to minimize.
[2024-05-28 19:27:22] [INFO ] Deduced a trap composed of 139 places in 211 ms of which 4 ms to minimize.
[2024-05-28 19:27:22] [INFO ] Deduced a trap composed of 139 places in 216 ms of which 4 ms to minimize.
[2024-05-28 19:27:22] [INFO ] Deduced a trap composed of 139 places in 196 ms of which 4 ms to minimize.
[2024-05-28 19:27:23] [INFO ] Deduced a trap composed of 139 places in 218 ms of which 4 ms to minimize.
[2024-05-28 19:27:23] [INFO ] Deduced a trap composed of 139 places in 205 ms of which 4 ms to minimize.
[2024-05-28 19:27:23] [INFO ] Deduced a trap composed of 139 places in 196 ms of which 4 ms to minimize.
[2024-05-28 19:27:23] [INFO ] Deduced a trap composed of 139 places in 206 ms of which 4 ms to minimize.
[2024-05-28 19:27:24] [INFO ] Deduced a trap composed of 139 places in 194 ms of which 4 ms to minimize.
[2024-05-28 19:27:24] [INFO ] Deduced a trap composed of 139 places in 142 ms of which 3 ms to minimize.
[2024-05-28 19:27:24] [INFO ] Deduced a trap composed of 139 places in 151 ms of which 2 ms to minimize.
[2024-05-28 19:27:24] [INFO ] Deduced a trap composed of 139 places in 141 ms of which 3 ms to minimize.
[2024-05-28 19:27:24] [INFO ] Deduced a trap composed of 139 places in 213 ms of which 4 ms to minimize.
[2024-05-28 19:27:25] [INFO ] Deduced a trap composed of 139 places in 185 ms of which 3 ms to minimize.
[2024-05-28 19:27:25] [INFO ] Deduced a trap composed of 139 places in 192 ms of which 3 ms to minimize.
[2024-05-28 19:27:25] [INFO ] Deduced a trap composed of 139 places in 179 ms of which 4 ms to minimize.
[2024-05-28 19:27:25] [INFO ] Deduced a trap composed of 139 places in 175 ms of which 3 ms to minimize.
[2024-05-28 19:27:25] [INFO ] Deduced a trap composed of 139 places in 172 ms of which 3 ms to minimize.
[2024-05-28 19:27:26] [INFO ] Deduced a trap composed of 139 places in 160 ms of which 3 ms to minimize.
[2024-05-28 19:27:26] [INFO ] Deduced a trap composed of 139 places in 155 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-28 19:27:32] [INFO ] Deduced a trap composed of 139 places in 212 ms of which 4 ms to minimize.
[2024-05-28 19:27:32] [INFO ] Deduced a trap composed of 139 places in 176 ms of which 3 ms to minimize.
[2024-05-28 19:27:32] [INFO ] Deduced a trap composed of 139 places in 175 ms of which 4 ms to minimize.
[2024-05-28 19:27:33] [INFO ] Deduced a trap composed of 139 places in 173 ms of which 3 ms to minimize.
[2024-05-28 19:27:33] [INFO ] Deduced a trap composed of 139 places in 143 ms of which 3 ms to minimize.
[2024-05-28 19:27:33] [INFO ] Deduced a trap composed of 139 places in 139 ms of which 3 ms to minimize.
[2024-05-28 19:27:33] [INFO ] Deduced a trap composed of 139 places in 186 ms of which 3 ms to minimize.
[2024-05-28 19:27:33] [INFO ] Deduced a trap composed of 167 places in 154 ms of which 2 ms to minimize.
[2024-05-28 19:27:34] [INFO ] Deduced a trap composed of 139 places in 220 ms of which 4 ms to minimize.
[2024-05-28 19:27:34] [INFO ] Deduced a trap composed of 139 places in 230 ms of which 3 ms to minimize.
[2024-05-28 19:27:34] [INFO ] Deduced a trap composed of 139 places in 228 ms of which 5 ms to minimize.
[2024-05-28 19:27:34] [INFO ] Deduced a trap composed of 139 places in 184 ms of which 3 ms to minimize.
[2024-05-28 19:27:35] [INFO ] Deduced a trap composed of 139 places in 230 ms of which 4 ms to minimize.
[2024-05-28 19:27:35] [INFO ] Deduced a trap composed of 139 places in 219 ms of which 4 ms to minimize.
[2024-05-28 19:27:35] [INFO ] Deduced a trap composed of 139 places in 248 ms of which 3 ms to minimize.
[2024-05-28 19:27:35] [INFO ] Deduced a trap composed of 139 places in 216 ms of which 4 ms to minimize.
[2024-05-28 19:27:36] [INFO ] Deduced a trap composed of 139 places in 212 ms of which 3 ms to minimize.
[2024-05-28 19:27:36] [INFO ] Deduced a trap composed of 139 places in 225 ms of which 3 ms to minimize.
[2024-05-28 19:27:36] [INFO ] Deduced a trap composed of 139 places in 214 ms of which 3 ms to minimize.
[2024-05-28 19:27:36] [INFO ] Deduced a trap composed of 139 places in 199 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-28 19:27:37] [INFO ] Deduced a trap composed of 139 places in 174 ms of which 4 ms to minimize.
[2024-05-28 19:27:37] [INFO ] Deduced a trap composed of 139 places in 189 ms of which 4 ms to minimize.
[2024-05-28 19:27:37] [INFO ] Deduced a trap composed of 139 places in 225 ms of which 4 ms to minimize.
[2024-05-28 19:27:38] [INFO ] Deduced a trap composed of 139 places in 167 ms of which 2 ms to minimize.
[2024-05-28 19:27:38] [INFO ] Deduced a trap composed of 139 places in 140 ms of which 3 ms to minimize.
[2024-05-28 19:27:38] [INFO ] Deduced a trap composed of 139 places in 144 ms of which 2 ms to minimize.
[2024-05-28 19:27:38] [INFO ] Deduced a trap composed of 139 places in 191 ms of which 3 ms to minimize.
[2024-05-28 19:27:38] [INFO ] Deduced a trap composed of 139 places in 186 ms of which 4 ms to minimize.
[2024-05-28 19:27:39] [INFO ] Deduced a trap composed of 139 places in 140 ms of which 2 ms to minimize.
[2024-05-28 19:27:39] [INFO ] Deduced a trap composed of 139 places in 201 ms of which 3 ms to minimize.
[2024-05-28 19:27:39] [INFO ] Deduced a trap composed of 139 places in 202 ms of which 3 ms to minimize.
[2024-05-28 19:27:39] [INFO ] Deduced a trap composed of 139 places in 195 ms of which 3 ms to minimize.
[2024-05-28 19:27:40] [INFO ] Deduced a trap composed of 139 places in 411 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 (/ 1.0 3.0))
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 (/ 1.0 3.0))
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 (/ 1.0 3.0))
(s210 1.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 4.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 9.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 1.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 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.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 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.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 0.0)
(s370 0.0)
(s371 0.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 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 1.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 1.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1295 variables, and 165 constraints, problems are : Problem set: 0 solved, 760 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/533 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 760/760 constraints, Known Traps: 73/73 constraints]
Escalating to Integer solving :Problem set: 0 solved, 760 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 73/165 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-28 19:27:42] [INFO ] Deduced a trap composed of 139 places in 141 ms of which 3 ms to minimize.
[2024-05-28 19:27:42] [INFO ] Deduced a trap composed of 143 places in 220 ms of which 4 ms to minimize.
[2024-05-28 19:27:43] [INFO ] Deduced a trap composed of 139 places in 171 ms of which 3 ms to minimize.
[2024-05-28 19:27:43] [INFO ] Deduced a trap composed of 139 places in 143 ms of which 2 ms to minimize.
[2024-05-28 19:27:43] [INFO ] Deduced a trap composed of 139 places in 145 ms of which 3 ms to minimize.
[2024-05-28 19:27:43] [INFO ] Deduced a trap composed of 139 places in 224 ms of which 7 ms to minimize.
[2024-05-28 19:27:43] [INFO ] Deduced a trap composed of 139 places in 213 ms of which 4 ms to minimize.
[2024-05-28 19:27:44] [INFO ] Deduced a trap composed of 139 places in 202 ms of which 4 ms to minimize.
[2024-05-28 19:27:44] [INFO ] Deduced a trap composed of 139 places in 217 ms of which 4 ms to minimize.
[2024-05-28 19:27:44] [INFO ] Deduced a trap composed of 139 places in 210 ms of which 4 ms to minimize.
[2024-05-28 19:27:44] [INFO ] Deduced a trap composed of 139 places in 212 ms of which 4 ms to minimize.
[2024-05-28 19:27:45] [INFO ] Deduced a trap composed of 139 places in 219 ms of which 3 ms to minimize.
[2024-05-28 19:27:45] [INFO ] Deduced a trap composed of 139 places in 225 ms of which 6 ms to minimize.
[2024-05-28 19:27:45] [INFO ] Deduced a trap composed of 139 places in 192 ms of which 2 ms to minimize.
[2024-05-28 19:27:45] [INFO ] Deduced a trap composed of 139 places in 274 ms of which 4 ms to minimize.
[2024-05-28 19:27:46] [INFO ] Deduced a trap composed of 139 places in 232 ms of which 3 ms to minimize.
[2024-05-28 19:27:46] [INFO ] Deduced a trap composed of 139 places in 221 ms of which 4 ms to minimize.
[2024-05-28 19:27:46] [INFO ] Deduced a trap composed of 142 places in 237 ms of which 4 ms to minimize.
[2024-05-28 19:27:46] [INFO ] Deduced a trap composed of 139 places in 209 ms of which 4 ms to minimize.
[2024-05-28 19:27:47] [INFO ] Deduced a trap composed of 143 places in 233 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 20/185 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-28 19:27:48] [INFO ] Deduced a trap composed of 139 places in 205 ms of which 4 ms to minimize.
[2024-05-28 19:27:48] [INFO ] Deduced a trap composed of 139 places in 207 ms of which 4 ms to minimize.
[2024-05-28 19:27:48] [INFO ] Deduced a trap composed of 139 places in 212 ms of which 4 ms to minimize.
[2024-05-28 19:27:48] [INFO ] Deduced a trap composed of 139 places in 217 ms of which 4 ms to minimize.
[2024-05-28 19:27:49] [INFO ] Deduced a trap composed of 173 places in 283 ms of which 3 ms to minimize.
[2024-05-28 19:27:49] [INFO ] Deduced a trap composed of 185 places in 211 ms of which 3 ms to minimize.
[2024-05-28 19:27:49] [INFO ] Deduced a trap composed of 143 places in 219 ms of which 3 ms to minimize.
[2024-05-28 19:27:50] [INFO ] Deduced a trap composed of 185 places in 215 ms of which 3 ms to minimize.
[2024-05-28 19:27:50] [INFO ] Deduced a trap composed of 139 places in 190 ms of which 3 ms to minimize.
[2024-05-28 19:27:50] [INFO ] Deduced a trap composed of 139 places in 168 ms of which 3 ms to minimize.
[2024-05-28 19:27:50] [INFO ] Deduced a trap composed of 143 places in 182 ms of which 3 ms to minimize.
[2024-05-28 19:27:50] [INFO ] Deduced a trap composed of 139 places in 165 ms of which 3 ms to minimize.
[2024-05-28 19:27:50] [INFO ] Deduced a trap composed of 139 places in 155 ms of which 3 ms to minimize.
[2024-05-28 19:27:51] [INFO ] Deduced a trap composed of 139 places in 166 ms of which 2 ms to minimize.
[2024-05-28 19:27:51] [INFO ] Deduced a trap composed of 139 places in 171 ms of which 9 ms to minimize.
[2024-05-28 19:27:51] [INFO ] Deduced a trap composed of 144 places in 166 ms of which 3 ms to minimize.
[2024-05-28 19:27:51] [INFO ] Deduced a trap composed of 139 places in 170 ms of which 3 ms to minimize.
[2024-05-28 19:27:51] [INFO ] Deduced a trap composed of 139 places in 177 ms of which 3 ms to minimize.
[2024-05-28 19:27:52] [INFO ] Deduced a trap composed of 139 places in 160 ms of which 3 ms to minimize.
[2024-05-28 19:27:52] [INFO ] Deduced a trap composed of 139 places in 171 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 20/205 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-28 19:27:53] [INFO ] Deduced a trap composed of 139 places in 228 ms of which 4 ms to minimize.
[2024-05-28 19:27:54] [INFO ] Deduced a trap composed of 139 places in 210 ms of which 4 ms to minimize.
[2024-05-28 19:27:54] [INFO ] Deduced a trap composed of 139 places in 205 ms of which 3 ms to minimize.
[2024-05-28 19:27:54] [INFO ] Deduced a trap composed of 139 places in 182 ms of which 2 ms to minimize.
[2024-05-28 19:27:54] [INFO ] Deduced a trap composed of 139 places in 234 ms of which 5 ms to minimize.
[2024-05-28 19:27:55] [INFO ] Deduced a trap composed of 139 places in 258 ms of which 4 ms to minimize.
[2024-05-28 19:27:55] [INFO ] Deduced a trap composed of 139 places in 222 ms of which 4 ms to minimize.
[2024-05-28 19:27:55] [INFO ] Deduced a trap composed of 142 places in 246 ms of which 4 ms to minimize.
[2024-05-28 19:27:56] [INFO ] Deduced a trap composed of 139 places in 226 ms of which 4 ms to minimize.
[2024-05-28 19:27:56] [INFO ] Deduced a trap composed of 143 places in 232 ms of which 4 ms to minimize.
[2024-05-28 19:27:56] [INFO ] Deduced a trap composed of 139 places in 216 ms of which 4 ms to minimize.
[2024-05-28 19:27:56] [INFO ] Deduced a trap composed of 143 places in 175 ms of which 3 ms to minimize.
[2024-05-28 19:27:56] [INFO ] Deduced a trap composed of 139 places in 160 ms of which 3 ms to minimize.
[2024-05-28 19:27:57] [INFO ] Deduced a trap composed of 139 places in 261 ms of which 3 ms to minimize.
[2024-05-28 19:27:57] [INFO ] Deduced a trap composed of 139 places in 166 ms of which 3 ms to minimize.
[2024-05-28 19:27:57] [INFO ] Deduced a trap composed of 139 places in 162 ms of which 3 ms to minimize.
[2024-05-28 19:27:57] [INFO ] Deduced a trap composed of 139 places in 158 ms of which 2 ms to minimize.
[2024-05-28 19:27:57] [INFO ] Deduced a trap composed of 139 places in 162 ms of which 3 ms to minimize.
[2024-05-28 19:27:58] [INFO ] Deduced a trap composed of 139 places in 157 ms of which 2 ms to minimize.
[2024-05-28 19:27:58] [INFO ] Deduced a trap composed of 139 places in 165 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 20/225 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-28 19:28:01] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 1 ms to minimize.
[2024-05-28 19:28:06] [INFO ] Deduced a trap composed of 120 places in 296 ms of which 4 ms to minimize.
[2024-05-28 19:28:06] [INFO ] Deduced a trap composed of 112 places in 223 ms of which 4 ms to minimize.
[2024-05-28 19:28:07] [INFO ] Deduced a trap composed of 213 places in 239 ms of which 3 ms to minimize.
[2024-05-28 19:28:07] [INFO ] Deduced a trap composed of 203 places in 214 ms of which 4 ms to minimize.
[2024-05-28 19:28:07] [INFO ] Deduced a trap composed of 205 places in 182 ms of which 3 ms to minimize.
[2024-05-28 19:28:07] [INFO ] Deduced a trap composed of 209 places in 201 ms of which 4 ms to minimize.
[2024-05-28 19:28:08] [INFO ] Deduced a trap composed of 237 places in 221 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1295 variables, and 233 constraints, problems are : Problem set: 0 solved, 760 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/533 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/760 constraints, Known Traps: 141/141 constraints]
After SMT, in 61418ms problems are : Problem set: 0 solved, 760 unsolved
Search for dead transitions found 0 dead transitions in 61432ms
Starting structural reductions in SI_LTL mode, iteration 1 : 533/624 places, 766/857 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105382 ms. Remains : 533/624 places, 766/857 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), false, true]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 2317 steps with 562 reset in 26 ms.
FORMULA PolyORBNT-COL-S05J40-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J40-LTLCardinality-08 finished in 105583 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 42 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 857/857 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 856
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 856
Applied a total of 2 rules in 21 ms. Remains 623 /624 variables (removed 1) and now considering 856/857 (removed 1) transitions.
Running 850 sub problems to find dead transitions.
[2024-05-28 19:28:11] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
// Phase 1: matrix 852 rows 623 cols
[2024-05-28 19:28:11] [INFO ] Computed 97 invariants in 13 ms
[2024-05-28 19:28:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 3.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1475 variables, and 96 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
[2024-05-28 19:28:46] [INFO ] Deduced a trap composed of 204 places in 242 ms of which 4 ms to minimize.
[2024-05-28 19:28:47] [INFO ] Deduced a trap composed of 14 places in 228 ms of which 3 ms to minimize.
[2024-05-28 19:28:47] [INFO ] Deduced a trap composed of 15 places in 300 ms of which 5 ms to minimize.
[2024-05-28 19:28:51] [INFO ] Deduced a trap composed of 24 places in 261 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/1475 variables, and 100 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/850 constraints, Known Traps: 4/4 constraints]
After SMT, in 41422ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 41432ms
[2024-05-28 19:28:53] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2024-05-28 19:28:53] [INFO ] Invariant cache hit.
[2024-05-28 19:28:53] [INFO ] Implicit Places using invariants in 565 ms returned []
[2024-05-28 19:28:53] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2024-05-28 19:28:53] [INFO ] Invariant cache hit.
[2024-05-28 19:28:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:28:56] [INFO ] Implicit Places using invariants and state equation in 2680 ms returned []
Implicit Place search using SMT with State Equation took 3256 ms to find 0 implicit places.
Running 850 sub problems to find dead transitions.
[2024-05-28 19:28:56] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2024-05-28 19:28:56] [INFO ] Invariant cache hit.
[2024-05-28 19:28:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD328 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/623 variables, 1/97 constraints. Problems are: Problem set: 17 solved, 833 unsolved
[2024-05-28 19:29:24] [INFO ] Deduced a trap composed of 259 places in 202 ms of which 3 ms to minimize.
[2024-05-28 19:29:24] [INFO ] Deduced a trap composed of 271 places in 220 ms of which 3 ms to minimize.
[2024-05-28 19:29:24] [INFO ] Deduced a trap composed of 253 places in 190 ms of which 4 ms to minimize.
[2024-05-28 19:29:25] [INFO ] Deduced a trap composed of 256 places in 207 ms of which 3 ms to minimize.
[2024-05-28 19:29:25] [INFO ] Deduced a trap composed of 262 places in 192 ms of which 3 ms to minimize.
[2024-05-28 19:29:25] [INFO ] Deduced a trap composed of 259 places in 196 ms of which 3 ms to minimize.
[2024-05-28 19:29:25] [INFO ] Deduced a trap composed of 247 places in 210 ms of which 3 ms to minimize.
[2024-05-28 19:29:25] [INFO ] Deduced a trap composed of 259 places in 204 ms of which 3 ms to minimize.
[2024-05-28 19:29:26] [INFO ] Deduced a trap composed of 256 places in 186 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 3.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 9.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(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 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1475 variables, and 106 constraints, problems are : Problem set: 17 solved, 833 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 17 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 17 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 17 solved, 833 unsolved
[2024-05-28 19:29:31] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 2 ms to minimize.
[2024-05-28 19:29:31] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 2/93 constraints. Problems are: Problem set: 17 solved, 833 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 0/93 constraints. Problems are: Problem set: 17 solved, 833 unsolved
At refinement iteration 4 (OVERLAPS) 5/622 variables, 5/98 constraints. Problems are: Problem set: 17 solved, 833 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/622 variables, 9/107 constraints. Problems are: Problem set: 17 solved, 833 unsolved
[2024-05-28 19:29:46] [INFO ] Deduced a trap composed of 268 places in 182 ms of which 4 ms to minimize.
[2024-05-28 19:29:48] [INFO ] Deduced a trap composed of 298 places in 191 ms of which 4 ms to minimize.
[2024-05-28 19:29:48] [INFO ] Deduced a trap composed of 294 places in 188 ms of which 3 ms to minimize.
[2024-05-28 19:29:48] [INFO ] Deduced a trap composed of 304 places in 190 ms of which 3 ms to minimize.
[2024-05-28 19:29:48] [INFO ] Deduced a trap composed of 292 places in 201 ms of which 3 ms to minimize.
[2024-05-28 19:29:49] [INFO ] Deduced a trap composed of 290 places in 211 ms of which 16 ms to minimize.
[2024-05-28 19:29:49] [INFO ] Deduced a trap composed of 300 places in 202 ms of which 3 ms to minimize.
[2024-05-28 19:29:49] [INFO ] Deduced a trap composed of 300 places in 193 ms of which 3 ms to minimize.
[2024-05-28 19:29:49] [INFO ] Deduced a trap composed of 299 places in 218 ms of which 3 ms to minimize.
[2024-05-28 19:29:50] [INFO ] Deduced a trap composed of 284 places in 204 ms of which 3 ms to minimize.
[2024-05-28 19:29:50] [INFO ] Deduced a trap composed of 292 places in 181 ms of which 3 ms to minimize.
[2024-05-28 19:29:50] [INFO ] Deduced a trap composed of 297 places in 198 ms of which 3 ms to minimize.
[2024-05-28 19:29:50] [INFO ] Deduced a trap composed of 296 places in 195 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/622 variables, 13/120 constraints. Problems are: Problem set: 17 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/1475 variables, and 120 constraints, problems are : Problem set: 17 solved, 833 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/850 constraints, Known Traps: 24/24 constraints]
After SMT, in 61696ms problems are : Problem set: 17 solved, 833 unsolved
Search for dead transitions found 17 dead transitions in 61710ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 623/624 places, 839/857 transitions.
Applied a total of 0 rules in 14 ms. Remains 623 /623 variables (removed 0) and now considering 839/839 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106438 ms. Remains : 623/624 places, 839/857 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J40-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J40-LTLCardinality-10 finished in 106585 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 84 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 857/857 transitions.
Applied a total of 0 rules in 6 ms. Remains 624 /624 variables (removed 0) and now considering 857/857 (removed 0) transitions.
Running 851 sub problems to find dead transitions.
[2024-05-28 19:29:58] [INFO ] Flow matrix only has 853 transitions (discarded 4 similar events)
// Phase 1: matrix 853 rows 624 cols
[2024-05-28 19:29:58] [INFO ] Computed 97 invariants in 12 ms
[2024-05-28 19:29:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 851 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (OVERLAPS) 5/623 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 851 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1477 variables, and 96 constraints, problems are : Problem set: 0 solved, 851 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/624 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 851/851 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 851 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 851 unsolved
[2024-05-28 19:30:22] [INFO ] Deduced a trap composed of 99 places in 152 ms of which 2 ms to minimize.
[2024-05-28 19:30:23] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/618 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 4 (OVERLAPS) 5/623 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 851 unsolved
[2024-05-28 19:30:39] [INFO ] Deduced a trap composed of 266 places in 190 ms of which 3 ms to minimize.
[2024-05-28 19:30:39] [INFO ] Deduced a trap composed of 303 places in 204 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 623/1477 variables, and 100 constraints, problems are : Problem set: 0 solved, 851 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/624 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/851 constraints, Known Traps: 4/4 constraints]
After SMT, in 41223ms problems are : Problem set: 0 solved, 851 unsolved
Search for dead transitions found 0 dead transitions in 41231ms
[2024-05-28 19:30:39] [INFO ] Flow matrix only has 853 transitions (discarded 4 similar events)
[2024-05-28 19:30:39] [INFO ] Invariant cache hit.
[2024-05-28 19:30:39] [INFO ] Implicit Places using invariants in 456 ms returned []
[2024-05-28 19:30:39] [INFO ] Flow matrix only has 853 transitions (discarded 4 similar events)
[2024-05-28 19:30:39] [INFO ] Invariant cache hit.
[2024-05-28 19:30:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:30:42] [INFO ] Implicit Places using invariants and state equation in 2958 ms returned []
Implicit Place search using SMT with State Equation took 3445 ms to find 0 implicit places.
Running 851 sub problems to find dead transitions.
[2024-05-28 19:30:42] [INFO ] Flow matrix only has 853 transitions (discarded 4 similar events)
[2024-05-28 19:30:42] [INFO ] Invariant cache hit.
[2024-05-28 19:30:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 3 (OVERLAPS) 5/623 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/623 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 851 unsolved
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD328 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/624 variables, 1/97 constraints. Problems are: Problem set: 17 solved, 834 unsolved
[2024-05-28 19:31:10] [INFO ] Deduced a trap composed of 200 places in 208 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/624 variables, 1/98 constraints. Problems are: Problem set: 17 solved, 834 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 624/1477 variables, and 98 constraints, problems are : Problem set: 17 solved, 834 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/624 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 851/851 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 17 solved, 834 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 86/86 constraints. Problems are: Problem set: 17 solved, 834 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 5/91 constraints. Problems are: Problem set: 17 solved, 834 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/91 constraints. Problems are: Problem set: 17 solved, 834 unsolved
At refinement iteration 3 (OVERLAPS) 5/623 variables, 5/96 constraints. Problems are: Problem set: 17 solved, 834 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/623 variables, 1/97 constraints. Problems are: Problem set: 17 solved, 834 unsolved
[2024-05-28 19:31:30] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-05-28 19:31:30] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/623 variables, 2/99 constraints. Problems are: Problem set: 17 solved, 834 unsolved
[2024-05-28 19:31:34] [INFO ] Deduced a trap composed of 12 places in 210 ms of which 3 ms to minimize.
[2024-05-28 19:31:36] [INFO ] Deduced a trap composed of 260 places in 197 ms of which 3 ms to minimize.
[2024-05-28 19:31:36] [INFO ] Deduced a trap composed of 245 places in 195 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/623 variables, 3/102 constraints. Problems are: Problem set: 17 solved, 834 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 623/1477 variables, and 102 constraints, problems are : Problem set: 17 solved, 834 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/624 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/851 constraints, Known Traps: 6/6 constraints]
After SMT, in 61166ms problems are : Problem set: 17 solved, 834 unsolved
Search for dead transitions found 17 dead transitions in 61173ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 624/624 places, 840/857 transitions.
Applied a total of 0 rules in 7 ms. Remains 624 /624 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 105867 ms. Remains : 624/624 places, 840/857 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLCardinality-11
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J40-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J40-LTLCardinality-11 finished in 105936 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 624 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 624/624 places, 857/857 transitions.
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 811
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 811
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 92 place count 578 transition count 767
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 180 place count 534 transition count 767
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 2 with 4 rules applied. Total rules applied 184 place count 532 transition count 765
Applied a total of 184 rules in 69 ms. Remains 532 /624 variables (removed 92) and now considering 765/857 (removed 92) transitions.
Running 759 sub problems to find dead transitions.
[2024-05-28 19:31:44] [INFO ] Flow matrix only has 761 transitions (discarded 4 similar events)
// Phase 1: matrix 761 rows 532 cols
[2024-05-28 19:31:44] [INFO ] Computed 97 invariants in 8 ms
[2024-05-28 19:31:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:31:50] [INFO ] Deduced a trap composed of 138 places in 155 ms of which 15 ms to minimize.
[2024-05-28 19:31:50] [INFO ] Deduced a trap composed of 163 places in 156 ms of which 3 ms to minimize.
[2024-05-28 19:31:50] [INFO ] Deduced a trap composed of 139 places in 170 ms of which 3 ms to minimize.
[2024-05-28 19:31:50] [INFO ] Deduced a trap composed of 138 places in 170 ms of which 3 ms to minimize.
[2024-05-28 19:31:51] [INFO ] Deduced a trap composed of 160 places in 171 ms of which 2 ms to minimize.
[2024-05-28 19:31:51] [INFO ] Deduced a trap composed of 166 places in 162 ms of which 3 ms to minimize.
[2024-05-28 19:31:51] [INFO ] Deduced a trap composed of 138 places in 161 ms of which 7 ms to minimize.
[2024-05-28 19:31:51] [INFO ] Deduced a trap composed of 139 places in 158 ms of which 3 ms to minimize.
[2024-05-28 19:31:51] [INFO ] Deduced a trap composed of 139 places in 164 ms of which 3 ms to minimize.
[2024-05-28 19:31:51] [INFO ] Deduced a trap composed of 139 places in 159 ms of which 2 ms to minimize.
[2024-05-28 19:31:52] [INFO ] Deduced a trap composed of 138 places in 163 ms of which 3 ms to minimize.
[2024-05-28 19:31:52] [INFO ] Deduced a trap composed of 138 places in 187 ms of which 3 ms to minimize.
[2024-05-28 19:31:52] [INFO ] Deduced a trap composed of 151 places in 151 ms of which 3 ms to minimize.
[2024-05-28 19:31:52] [INFO ] Deduced a trap composed of 138 places in 151 ms of which 3 ms to minimize.
[2024-05-28 19:31:52] [INFO ] Deduced a trap composed of 138 places in 167 ms of which 2 ms to minimize.
[2024-05-28 19:31:53] [INFO ] Deduced a trap composed of 138 places in 158 ms of which 2 ms to minimize.
[2024-05-28 19:31:53] [INFO ] Deduced a trap composed of 138 places in 163 ms of which 2 ms to minimize.
[2024-05-28 19:31:53] [INFO ] Deduced a trap composed of 138 places in 154 ms of which 2 ms to minimize.
[2024-05-28 19:31:53] [INFO ] Deduced a trap composed of 138 places in 166 ms of which 2 ms to minimize.
[2024-05-28 19:31:53] [INFO ] Deduced a trap composed of 138 places in 150 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:31:58] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:32:04] [INFO ] Deduced a trap composed of 138 places in 169 ms of which 3 ms to minimize.
[2024-05-28 19:32:04] [INFO ] Deduced a trap composed of 138 places in 197 ms of which 6 ms to minimize.
[2024-05-28 19:32:04] [INFO ] Deduced a trap composed of 138 places in 155 ms of which 3 ms to minimize.
[2024-05-28 19:32:05] [INFO ] Deduced a trap composed of 138 places in 208 ms of which 5 ms to minimize.
[2024-05-28 19:32:05] [INFO ] Deduced a trap composed of 138 places in 202 ms of which 3 ms to minimize.
SMT process timed out in 21132ms, After SMT, problems are : Problem set: 0 solved, 759 unsolved
Search for dead transitions found 0 dead transitions in 21139ms
[2024-05-28 19:32:05] [INFO ] Flow matrix only has 761 transitions (discarded 4 similar events)
[2024-05-28 19:32:05] [INFO ] Invariant cache hit.
[2024-05-28 19:32:05] [INFO ] Implicit Places using invariants in 393 ms returned []
[2024-05-28 19:32:05] [INFO ] Flow matrix only has 761 transitions (discarded 4 similar events)
[2024-05-28 19:32:05] [INFO ] Invariant cache hit.
[2024-05-28 19:32:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:32:08] [INFO ] Implicit Places using invariants and state equation in 2759 ms returned []
Implicit Place search using SMT with State Equation took 3154 ms to find 0 implicit places.
[2024-05-28 19:32:08] [INFO ] Redundant transitions in 11 ms returned []
Running 759 sub problems to find dead transitions.
[2024-05-28 19:32:08] [INFO ] Flow matrix only has 761 transitions (discarded 4 similar events)
[2024-05-28 19:32:08] [INFO ] Invariant cache hit.
[2024-05-28 19:32:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:32:15] [INFO ] Deduced a trap composed of 166 places in 216 ms of which 4 ms to minimize.
[2024-05-28 19:32:15] [INFO ] Deduced a trap composed of 138 places in 193 ms of which 3 ms to minimize.
[2024-05-28 19:32:15] [INFO ] Deduced a trap composed of 157 places in 181 ms of which 3 ms to minimize.
[2024-05-28 19:32:15] [INFO ] Deduced a trap composed of 138 places in 159 ms of which 2 ms to minimize.
[2024-05-28 19:32:15] [INFO ] Deduced a trap composed of 138 places in 208 ms of which 4 ms to minimize.
[2024-05-28 19:32:15] [INFO ] Deduced a trap composed of 138 places in 142 ms of which 2 ms to minimize.
[2024-05-28 19:32:16] [INFO ] Deduced a trap composed of 138 places in 160 ms of which 2 ms to minimize.
[2024-05-28 19:32:16] [INFO ] Deduced a trap composed of 138 places in 157 ms of which 2 ms to minimize.
[2024-05-28 19:32:16] [INFO ] Deduced a trap composed of 138 places in 147 ms of which 3 ms to minimize.
[2024-05-28 19:32:16] [INFO ] Deduced a trap composed of 138 places in 183 ms of which 2 ms to minimize.
[2024-05-28 19:32:16] [INFO ] Deduced a trap composed of 138 places in 185 ms of which 3 ms to minimize.
[2024-05-28 19:32:17] [INFO ] Deduced a trap composed of 138 places in 184 ms of which 3 ms to minimize.
[2024-05-28 19:32:17] [INFO ] Deduced a trap composed of 138 places in 169 ms of which 2 ms to minimize.
[2024-05-28 19:32:17] [INFO ] Deduced a trap composed of 154 places in 151 ms of which 3 ms to minimize.
[2024-05-28 19:32:17] [INFO ] Deduced a trap composed of 154 places in 151 ms of which 3 ms to minimize.
[2024-05-28 19:32:17] [INFO ] Deduced a trap composed of 138 places in 184 ms of which 2 ms to minimize.
[2024-05-28 19:32:18] [INFO ] Deduced a trap composed of 138 places in 172 ms of which 3 ms to minimize.
[2024-05-28 19:32:18] [INFO ] Deduced a trap composed of 138 places in 171 ms of which 3 ms to minimize.
[2024-05-28 19:32:18] [INFO ] Deduced a trap composed of 138 places in 147 ms of which 3 ms to minimize.
[2024-05-28 19:32:18] [INFO ] Deduced a trap composed of 138 places in 137 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:32:20] [INFO ] Deduced a trap composed of 98 places in 155 ms of which 3 ms to minimize.
[2024-05-28 19:32:21] [INFO ] Deduced a trap composed of 98 places in 194 ms of which 3 ms to minimize.
[2024-05-28 19:32:21] [INFO ] Deduced a trap composed of 98 places in 251 ms of which 3 ms to minimize.
[2024-05-28 19:32:21] [INFO ] Deduced a trap composed of 138 places in 185 ms of which 3 ms to minimize.
[2024-05-28 19:32:21] [INFO ] Deduced a trap composed of 138 places in 193 ms of which 2 ms to minimize.
[2024-05-28 19:32:21] [INFO ] Deduced a trap composed of 138 places in 212 ms of which 3 ms to minimize.
[2024-05-28 19:32:22] [INFO ] Deduced a trap composed of 98 places in 182 ms of which 2 ms to minimize.
[2024-05-28 19:32:22] [INFO ] Deduced a trap composed of 138 places in 182 ms of which 3 ms to minimize.
[2024-05-28 19:32:22] [INFO ] Deduced a trap composed of 98 places in 183 ms of which 3 ms to minimize.
[2024-05-28 19:32:22] [INFO ] Deduced a trap composed of 138 places in 183 ms of which 3 ms to minimize.
[2024-05-28 19:32:22] [INFO ] Deduced a trap composed of 98 places in 176 ms of which 2 ms to minimize.
[2024-05-28 19:32:23] [INFO ] Deduced a trap composed of 98 places in 160 ms of which 2 ms to minimize.
[2024-05-28 19:32:23] [INFO ] Deduced a trap composed of 138 places in 157 ms of which 3 ms to minimize.
[2024-05-28 19:32:23] [INFO ] Deduced a trap composed of 138 places in 160 ms of which 3 ms to minimize.
[2024-05-28 19:32:23] [INFO ] Deduced a trap composed of 98 places in 158 ms of which 3 ms to minimize.
[2024-05-28 19:32:23] [INFO ] Deduced a trap composed of 98 places in 157 ms of which 2 ms to minimize.
[2024-05-28 19:32:23] [INFO ] Deduced a trap composed of 138 places in 158 ms of which 2 ms to minimize.
[2024-05-28 19:32:24] [INFO ] Deduced a trap composed of 138 places in 160 ms of which 3 ms to minimize.
[2024-05-28 19:32:24] [INFO ] Deduced a trap composed of 138 places in 160 ms of which 2 ms to minimize.
[2024-05-28 19:32:24] [INFO ] Deduced a trap composed of 138 places in 159 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 5 (OVERLAPS) 4/531 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:32:37] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 759 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/1293 variables, and 137 constraints, problems are : Problem set: 0 solved, 759 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 759/759 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 759 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 41/133 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:32:41] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2024-05-28 19:32:43] [INFO ] Deduced a trap composed of 163 places in 219 ms of which 3 ms to minimize.
[2024-05-28 19:32:43] [INFO ] Deduced a trap composed of 172 places in 253 ms of which 4 ms to minimize.
[2024-05-28 19:32:43] [INFO ] Deduced a trap composed of 141 places in 213 ms of which 3 ms to minimize.
[2024-05-28 19:32:43] [INFO ] Deduced a trap composed of 138 places in 178 ms of which 3 ms to minimize.
[2024-05-28 19:32:43] [INFO ] Deduced a trap composed of 141 places in 202 ms of which 3 ms to minimize.
[2024-05-28 19:32:44] [INFO ] Deduced a trap composed of 138 places in 191 ms of which 4 ms to minimize.
[2024-05-28 19:32:44] [INFO ] Deduced a trap composed of 141 places in 184 ms of which 3 ms to minimize.
[2024-05-28 19:32:44] [INFO ] Deduced a trap composed of 138 places in 149 ms of which 3 ms to minimize.
[2024-05-28 19:32:44] [INFO ] Deduced a trap composed of 152 places in 142 ms of which 3 ms to minimize.
[2024-05-28 19:32:44] [INFO ] Deduced a trap composed of 141 places in 253 ms of which 5 ms to minimize.
[2024-05-28 19:32:45] [INFO ] Deduced a trap composed of 138 places in 211 ms of which 4 ms to minimize.
[2024-05-28 19:32:45] [INFO ] Deduced a trap composed of 141 places in 197 ms of which 4 ms to minimize.
[2024-05-28 19:32:45] [INFO ] Deduced a trap composed of 138 places in 147 ms of which 2 ms to minimize.
[2024-05-28 19:32:45] [INFO ] Deduced a trap composed of 138 places in 218 ms of which 4 ms to minimize.
[2024-05-28 19:32:45] [INFO ] Deduced a trap composed of 141 places in 206 ms of which 4 ms to minimize.
[2024-05-28 19:32:46] [INFO ] Deduced a trap composed of 138 places in 193 ms of which 3 ms to minimize.
[2024-05-28 19:32:46] [INFO ] Deduced a trap composed of 156 places in 195 ms of which 4 ms to minimize.
[2024-05-28 19:32:46] [INFO ] Deduced a trap composed of 141 places in 165 ms of which 3 ms to minimize.
[2024-05-28 19:32:46] [INFO ] Deduced a trap composed of 138 places in 213 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:32:48] [INFO ] Deduced a trap composed of 169 places in 147 ms of which 2 ms to minimize.
[2024-05-28 19:32:49] [INFO ] Deduced a trap composed of 175 places in 198 ms of which 3 ms to minimize.
[2024-05-28 19:32:49] [INFO ] Deduced a trap composed of 175 places in 194 ms of which 4 ms to minimize.
[2024-05-28 19:32:49] [INFO ] Deduced a trap composed of 178 places in 154 ms of which 2 ms to minimize.
[2024-05-28 19:32:49] [INFO ] Deduced a trap composed of 163 places in 142 ms of which 3 ms to minimize.
[2024-05-28 19:32:49] [INFO ] Deduced a trap composed of 178 places in 220 ms of which 4 ms to minimize.
[2024-05-28 19:32:50] [INFO ] Deduced a trap composed of 169 places in 202 ms of which 3 ms to minimize.
[2024-05-28 19:32:50] [INFO ] Deduced a trap composed of 169 places in 162 ms of which 3 ms to minimize.
[2024-05-28 19:32:50] [INFO ] Deduced a trap composed of 163 places in 161 ms of which 3 ms to minimize.
[2024-05-28 19:32:50] [INFO ] Deduced a trap composed of 172 places in 157 ms of which 3 ms to minimize.
[2024-05-28 19:32:50] [INFO ] Deduced a trap composed of 172 places in 154 ms of which 2 ms to minimize.
[2024-05-28 19:32:50] [INFO ] Deduced a trap composed of 175 places in 155 ms of which 2 ms to minimize.
[2024-05-28 19:32:51] [INFO ] Deduced a trap composed of 141 places in 156 ms of which 3 ms to minimize.
[2024-05-28 19:32:51] [INFO ] Deduced a trap composed of 154 places in 217 ms of which 4 ms to minimize.
[2024-05-28 19:32:51] [INFO ] Deduced a trap composed of 166 places in 156 ms of which 3 ms to minimize.
[2024-05-28 19:32:51] [INFO ] Deduced a trap composed of 141 places in 143 ms of which 3 ms to minimize.
[2024-05-28 19:32:51] [INFO ] Deduced a trap composed of 166 places in 250 ms of which 4 ms to minimize.
[2024-05-28 19:32:52] [INFO ] Deduced a trap composed of 166 places in 147 ms of which 3 ms to minimize.
[2024-05-28 19:32:52] [INFO ] Deduced a trap composed of 175 places in 222 ms of which 4 ms to minimize.
[2024-05-28 19:32:52] [INFO ] Deduced a trap composed of 175 places in 156 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 20/173 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:32:56] [INFO ] Deduced a trap composed of 138 places in 251 ms of which 4 ms to minimize.
[2024-05-28 19:32:56] [INFO ] Deduced a trap composed of 138 places in 231 ms of which 4 ms to minimize.
[2024-05-28 19:32:56] [INFO ] Deduced a trap composed of 141 places in 217 ms of which 4 ms to minimize.
[2024-05-28 19:32:56] [INFO ] Deduced a trap composed of 138 places in 213 ms of which 4 ms to minimize.
[2024-05-28 19:32:57] [INFO ] Deduced a trap composed of 138 places in 201 ms of which 4 ms to minimize.
[2024-05-28 19:32:57] [INFO ] Deduced a trap composed of 138 places in 188 ms of which 3 ms to minimize.
[2024-05-28 19:32:57] [INFO ] Deduced a trap composed of 138 places in 162 ms of which 3 ms to minimize.
[2024-05-28 19:32:57] [INFO ] Deduced a trap composed of 138 places in 191 ms of which 4 ms to minimize.
[2024-05-28 19:32:57] [INFO ] Deduced a trap composed of 138 places in 180 ms of which 3 ms to minimize.
[2024-05-28 19:32:57] [INFO ] Deduced a trap composed of 138 places in 191 ms of which 4 ms to minimize.
[2024-05-28 19:32:58] [INFO ] Deduced a trap composed of 138 places in 163 ms of which 2 ms to minimize.
[2024-05-28 19:32:58] [INFO ] Deduced a trap composed of 138 places in 153 ms of which 3 ms to minimize.
[2024-05-28 19:32:58] [INFO ] Deduced a trap composed of 138 places in 140 ms of which 3 ms to minimize.
[2024-05-28 19:32:58] [INFO ] Deduced a trap composed of 138 places in 238 ms of which 2 ms to minimize.
[2024-05-28 19:32:59] [INFO ] Deduced a trap composed of 138 places in 165 ms of which 2 ms to minimize.
[2024-05-28 19:32:59] [INFO ] Deduced a trap composed of 138 places in 151 ms of which 3 ms to minimize.
[2024-05-28 19:32:59] [INFO ] Deduced a trap composed of 138 places in 147 ms of which 3 ms to minimize.
[2024-05-28 19:32:59] [INFO ] Deduced a trap composed of 138 places in 160 ms of which 3 ms to minimize.
[2024-05-28 19:33:00] [INFO ] Deduced a trap composed of 141 places in 251 ms of which 3 ms to minimize.
[2024-05-28 19:33:00] [INFO ] Deduced a trap composed of 141 places in 164 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 20/193 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:33:03] [INFO ] Deduced a trap composed of 141 places in 251 ms of which 4 ms to minimize.
[2024-05-28 19:33:04] [INFO ] Deduced a trap composed of 141 places in 202 ms of which 3 ms to minimize.
[2024-05-28 19:33:04] [INFO ] Deduced a trap composed of 141 places in 214 ms of which 4 ms to minimize.
[2024-05-28 19:33:04] [INFO ] Deduced a trap composed of 141 places in 213 ms of which 3 ms to minimize.
[2024-05-28 19:33:04] [INFO ] Deduced a trap composed of 138 places in 161 ms of which 3 ms to minimize.
[2024-05-28 19:33:05] [INFO ] Deduced a trap composed of 141 places in 168 ms of which 2 ms to minimize.
[2024-05-28 19:33:05] [INFO ] Deduced a trap composed of 141 places in 158 ms of which 2 ms to minimize.
[2024-05-28 19:33:05] [INFO ] Deduced a trap composed of 141 places in 149 ms of which 3 ms to minimize.
[2024-05-28 19:33:05] [INFO ] Deduced a trap composed of 138 places in 161 ms of which 3 ms to minimize.
[2024-05-28 19:33:05] [INFO ] Deduced a trap composed of 138 places in 152 ms of which 3 ms to minimize.
[2024-05-28 19:33:05] [INFO ] Deduced a trap composed of 138 places in 168 ms of which 2 ms to minimize.
[2024-05-28 19:33:06] [INFO ] Deduced a trap composed of 141 places in 161 ms of which 3 ms to minimize.
[2024-05-28 19:33:06] [INFO ] Deduced a trap composed of 141 places in 158 ms of which 2 ms to minimize.
[2024-05-28 19:33:06] [INFO ] Deduced a trap composed of 141 places in 190 ms of which 2 ms to minimize.
[2024-05-28 19:33:06] [INFO ] Deduced a trap composed of 141 places in 188 ms of which 3 ms to minimize.
[2024-05-28 19:33:06] [INFO ] Deduced a trap composed of 141 places in 179 ms of which 3 ms to minimize.
[2024-05-28 19:33:07] [INFO ] Deduced a trap composed of 138 places in 176 ms of which 3 ms to minimize.
[2024-05-28 19:33:07] [INFO ] Deduced a trap composed of 141 places in 159 ms of which 3 ms to minimize.
[2024-05-28 19:33:07] [INFO ] Deduced a trap composed of 141 places in 156 ms of which 2 ms to minimize.
[2024-05-28 19:33:07] [INFO ] Deduced a trap composed of 141 places in 154 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 20/213 constraints. Problems are: Problem set: 0 solved, 759 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 527/1293 variables, and 213 constraints, problems are : Problem set: 0 solved, 759 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/759 constraints, Known Traps: 121/121 constraints]
After SMT, in 61370ms problems are : Problem set: 0 solved, 759 unsolved
Search for dead transitions found 0 dead transitions in 61382ms
Starting structural reductions in SI_LTL mode, iteration 1 : 532/624 places, 765/857 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85790 ms. Remains : 532/624 places, 765/857 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLCardinality-15
Product exploration explored 100000 steps with 4748 reset in 621 ms.
Product exploration explored 100000 steps with 4797 reset in 568 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0)]
RANDOM walk for 19 steps (0 resets) in 6 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 170 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Support contains 2 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 765/765 transitions.
Applied a total of 0 rules in 25 ms. Remains 532 /532 variables (removed 0) and now considering 765/765 (removed 0) transitions.
Running 759 sub problems to find dead transitions.
[2024-05-28 19:33:11] [INFO ] Flow matrix only has 761 transitions (discarded 4 similar events)
[2024-05-28 19:33:11] [INFO ] Invariant cache hit.
[2024-05-28 19:33:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:33:18] [INFO ] Deduced a trap composed of 166 places in 197 ms of which 3 ms to minimize.
[2024-05-28 19:33:18] [INFO ] Deduced a trap composed of 138 places in 191 ms of which 3 ms to minimize.
[2024-05-28 19:33:19] [INFO ] Deduced a trap composed of 157 places in 176 ms of which 3 ms to minimize.
[2024-05-28 19:33:19] [INFO ] Deduced a trap composed of 138 places in 209 ms of which 3 ms to minimize.
[2024-05-28 19:33:19] [INFO ] Deduced a trap composed of 138 places in 174 ms of which 2 ms to minimize.
[2024-05-28 19:33:19] [INFO ] Deduced a trap composed of 138 places in 183 ms of which 3 ms to minimize.
[2024-05-28 19:33:19] [INFO ] Deduced a trap composed of 138 places in 175 ms of which 3 ms to minimize.
[2024-05-28 19:33:20] [INFO ] Deduced a trap composed of 138 places in 180 ms of which 3 ms to minimize.
[2024-05-28 19:33:20] [INFO ] Deduced a trap composed of 138 places in 148 ms of which 2 ms to minimize.
[2024-05-28 19:33:20] [INFO ] Deduced a trap composed of 138 places in 168 ms of which 3 ms to minimize.
[2024-05-28 19:33:20] [INFO ] Deduced a trap composed of 138 places in 145 ms of which 3 ms to minimize.
[2024-05-28 19:33:20] [INFO ] Deduced a trap composed of 138 places in 150 ms of which 2 ms to minimize.
[2024-05-28 19:33:20] [INFO ] Deduced a trap composed of 138 places in 167 ms of which 2 ms to minimize.
[2024-05-28 19:33:21] [INFO ] Deduced a trap composed of 154 places in 193 ms of which 3 ms to minimize.
[2024-05-28 19:33:21] [INFO ] Deduced a trap composed of 154 places in 161 ms of which 2 ms to minimize.
[2024-05-28 19:33:21] [INFO ] Deduced a trap composed of 138 places in 151 ms of which 3 ms to minimize.
[2024-05-28 19:33:21] [INFO ] Deduced a trap composed of 138 places in 163 ms of which 3 ms to minimize.
[2024-05-28 19:33:22] [INFO ] Deduced a trap composed of 138 places in 154 ms of which 2 ms to minimize.
[2024-05-28 19:33:22] [INFO ] Deduced a trap composed of 138 places in 148 ms of which 2 ms to minimize.
[2024-05-28 19:33:22] [INFO ] Deduced a trap composed of 138 places in 201 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:33:25] [INFO ] Deduced a trap composed of 98 places in 257 ms of which 3 ms to minimize.
[2024-05-28 19:33:25] [INFO ] Deduced a trap composed of 98 places in 187 ms of which 3 ms to minimize.
[2024-05-28 19:33:25] [INFO ] Deduced a trap composed of 98 places in 177 ms of which 3 ms to minimize.
[2024-05-28 19:33:25] [INFO ] Deduced a trap composed of 138 places in 172 ms of which 3 ms to minimize.
[2024-05-28 19:33:26] [INFO ] Deduced a trap composed of 138 places in 157 ms of which 3 ms to minimize.
[2024-05-28 19:33:26] [INFO ] Deduced a trap composed of 138 places in 160 ms of which 2 ms to minimize.
[2024-05-28 19:33:26] [INFO ] Deduced a trap composed of 98 places in 171 ms of which 2 ms to minimize.
[2024-05-28 19:33:26] [INFO ] Deduced a trap composed of 138 places in 148 ms of which 2 ms to minimize.
[2024-05-28 19:33:26] [INFO ] Deduced a trap composed of 98 places in 171 ms of which 3 ms to minimize.
[2024-05-28 19:33:27] [INFO ] Deduced a trap composed of 138 places in 155 ms of which 3 ms to minimize.
[2024-05-28 19:33:27] [INFO ] Deduced a trap composed of 98 places in 155 ms of which 2 ms to minimize.
[2024-05-28 19:33:27] [INFO ] Deduced a trap composed of 98 places in 150 ms of which 3 ms to minimize.
[2024-05-28 19:33:27] [INFO ] Deduced a trap composed of 138 places in 164 ms of which 3 ms to minimize.
[2024-05-28 19:33:27] [INFO ] Deduced a trap composed of 138 places in 158 ms of which 2 ms to minimize.
[2024-05-28 19:33:27] [INFO ] Deduced a trap composed of 98 places in 146 ms of which 2 ms to minimize.
[2024-05-28 19:33:28] [INFO ] Deduced a trap composed of 98 places in 160 ms of which 3 ms to minimize.
[2024-05-28 19:33:28] [INFO ] Deduced a trap composed of 138 places in 158 ms of which 3 ms to minimize.
[2024-05-28 19:33:28] [INFO ] Deduced a trap composed of 138 places in 162 ms of which 3 ms to minimize.
[2024-05-28 19:33:28] [INFO ] Deduced a trap composed of 138 places in 159 ms of which 2 ms to minimize.
[2024-05-28 19:33:28] [INFO ] Deduced a trap composed of 138 places in 155 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 759 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 527/1293 variables, and 132 constraints, problems are : Problem set: 0 solved, 759 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 759/759 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 759 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:33:34] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2024-05-28 19:33:36] [INFO ] Deduced a trap composed of 138 places in 235 ms of which 4 ms to minimize.
[2024-05-28 19:33:36] [INFO ] Deduced a trap composed of 141 places in 229 ms of which 4 ms to minimize.
[2024-05-28 19:33:36] [INFO ] Deduced a trap composed of 138 places in 184 ms of which 3 ms to minimize.
[2024-05-28 19:33:36] [INFO ] Deduced a trap composed of 141 places in 159 ms of which 3 ms to minimize.
[2024-05-28 19:33:37] [INFO ] Deduced a trap composed of 138 places in 162 ms of which 3 ms to minimize.
[2024-05-28 19:33:37] [INFO ] Deduced a trap composed of 138 places in 162 ms of which 3 ms to minimize.
[2024-05-28 19:33:37] [INFO ] Deduced a trap composed of 138 places in 184 ms of which 2 ms to minimize.
[2024-05-28 19:33:37] [INFO ] Deduced a trap composed of 141 places in 153 ms of which 2 ms to minimize.
[2024-05-28 19:33:37] [INFO ] Deduced a trap composed of 138 places in 154 ms of which 3 ms to minimize.
[2024-05-28 19:33:38] [INFO ] Deduced a trap composed of 138 places in 177 ms of which 3 ms to minimize.
[2024-05-28 19:33:38] [INFO ] Deduced a trap composed of 141 places in 196 ms of which 2 ms to minimize.
[2024-05-28 19:33:38] [INFO ] Deduced a trap composed of 138 places in 186 ms of which 3 ms to minimize.
[2024-05-28 19:33:38] [INFO ] Deduced a trap composed of 141 places in 185 ms of which 2 ms to minimize.
[2024-05-28 19:33:38] [INFO ] Deduced a trap composed of 138 places in 171 ms of which 3 ms to minimize.
[2024-05-28 19:33:39] [INFO ] Deduced a trap composed of 141 places in 154 ms of which 3 ms to minimize.
[2024-05-28 19:33:39] [INFO ] Deduced a trap composed of 138 places in 167 ms of which 2 ms to minimize.
[2024-05-28 19:33:39] [INFO ] Deduced a trap composed of 138 places in 168 ms of which 3 ms to minimize.
[2024-05-28 19:33:39] [INFO ] Deduced a trap composed of 141 places in 174 ms of which 3 ms to minimize.
[2024-05-28 19:33:39] [INFO ] Deduced a trap composed of 138 places in 173 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:33:42] [INFO ] Deduced a trap composed of 141 places in 197 ms of which 3 ms to minimize.
[2024-05-28 19:33:42] [INFO ] Deduced a trap composed of 138 places in 172 ms of which 3 ms to minimize.
[2024-05-28 19:33:43] [INFO ] Deduced a trap composed of 138 places in 192 ms of which 2 ms to minimize.
[2024-05-28 19:33:43] [INFO ] Deduced a trap composed of 138 places in 157 ms of which 3 ms to minimize.
[2024-05-28 19:33:43] [INFO ] Deduced a trap composed of 138 places in 160 ms of which 3 ms to minimize.
[2024-05-28 19:33:43] [INFO ] Deduced a trap composed of 138 places in 159 ms of which 3 ms to minimize.
[2024-05-28 19:33:43] [INFO ] Deduced a trap composed of 138 places in 158 ms of which 2 ms to minimize.
[2024-05-28 19:33:43] [INFO ] Deduced a trap composed of 138 places in 163 ms of which 3 ms to minimize.
[2024-05-28 19:33:44] [INFO ] Deduced a trap composed of 141 places in 156 ms of which 2 ms to minimize.
[2024-05-28 19:33:44] [INFO ] Deduced a trap composed of 141 places in 172 ms of which 2 ms to minimize.
[2024-05-28 19:33:44] [INFO ] Deduced a trap composed of 141 places in 174 ms of which 3 ms to minimize.
[2024-05-28 19:33:44] [INFO ] Deduced a trap composed of 138 places in 166 ms of which 3 ms to minimize.
[2024-05-28 19:33:44] [INFO ] Deduced a trap composed of 138 places in 158 ms of which 3 ms to minimize.
[2024-05-28 19:33:45] [INFO ] Deduced a trap composed of 138 places in 189 ms of which 2 ms to minimize.
[2024-05-28 19:33:45] [INFO ] Deduced a trap composed of 138 places in 180 ms of which 3 ms to minimize.
[2024-05-28 19:33:45] [INFO ] Deduced a trap composed of 141 places in 220 ms of which 2 ms to minimize.
[2024-05-28 19:33:45] [INFO ] Deduced a trap composed of 141 places in 161 ms of which 3 ms to minimize.
[2024-05-28 19:33:45] [INFO ] Deduced a trap composed of 141 places in 161 ms of which 2 ms to minimize.
[2024-05-28 19:33:46] [INFO ] Deduced a trap composed of 142 places in 161 ms of which 3 ms to minimize.
[2024-05-28 19:33:46] [INFO ] Deduced a trap composed of 142 places in 170 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:33:52] [INFO ] Deduced a trap composed of 184 places in 139 ms of which 2 ms to minimize.
[2024-05-28 19:33:52] [INFO ] Deduced a trap composed of 166 places in 178 ms of which 3 ms to minimize.
[2024-05-28 19:33:52] [INFO ] Deduced a trap composed of 181 places in 151 ms of which 3 ms to minimize.
[2024-05-28 19:33:52] [INFO ] Deduced a trap composed of 163 places in 144 ms of which 3 ms to minimize.
[2024-05-28 19:33:53] [INFO ] Deduced a trap composed of 163 places in 166 ms of which 2 ms to minimize.
SMT process timed out in 41299ms, After SMT, problems are : Problem set: 0 solved, 759 unsolved
Search for dead transitions found 0 dead transitions in 41308ms
[2024-05-28 19:33:53] [INFO ] Flow matrix only has 761 transitions (discarded 4 similar events)
[2024-05-28 19:33:53] [INFO ] Invariant cache hit.
[2024-05-28 19:33:53] [INFO ] Implicit Places using invariants in 548 ms returned []
[2024-05-28 19:33:53] [INFO ] Flow matrix only has 761 transitions (discarded 4 similar events)
[2024-05-28 19:33:53] [INFO ] Invariant cache hit.
[2024-05-28 19:33:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:33:56] [INFO ] Implicit Places using invariants and state equation in 2512 ms returned []
Implicit Place search using SMT with State Equation took 3075 ms to find 0 implicit places.
[2024-05-28 19:33:56] [INFO ] Redundant transitions in 4 ms returned []
Running 759 sub problems to find dead transitions.
[2024-05-28 19:33:56] [INFO ] Flow matrix only has 761 transitions (discarded 4 similar events)
[2024-05-28 19:33:56] [INFO ] Invariant cache hit.
[2024-05-28 19:33:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:34:02] [INFO ] Deduced a trap composed of 166 places in 174 ms of which 3 ms to minimize.
[2024-05-28 19:34:02] [INFO ] Deduced a trap composed of 138 places in 169 ms of which 3 ms to minimize.
[2024-05-28 19:34:02] [INFO ] Deduced a trap composed of 157 places in 185 ms of which 2 ms to minimize.
[2024-05-28 19:34:02] [INFO ] Deduced a trap composed of 138 places in 183 ms of which 3 ms to minimize.
[2024-05-28 19:34:02] [INFO ] Deduced a trap composed of 138 places in 156 ms of which 3 ms to minimize.
[2024-05-28 19:34:03] [INFO ] Deduced a trap composed of 138 places in 198 ms of which 4 ms to minimize.
[2024-05-28 19:34:03] [INFO ] Deduced a trap composed of 138 places in 186 ms of which 4 ms to minimize.
[2024-05-28 19:34:03] [INFO ] Deduced a trap composed of 138 places in 191 ms of which 4 ms to minimize.
[2024-05-28 19:34:03] [INFO ] Deduced a trap composed of 138 places in 139 ms of which 3 ms to minimize.
[2024-05-28 19:34:03] [INFO ] Deduced a trap composed of 138 places in 213 ms of which 4 ms to minimize.
[2024-05-28 19:34:04] [INFO ] Deduced a trap composed of 138 places in 197 ms of which 3 ms to minimize.
[2024-05-28 19:34:04] [INFO ] Deduced a trap composed of 138 places in 205 ms of which 4 ms to minimize.
[2024-05-28 19:34:04] [INFO ] Deduced a trap composed of 138 places in 189 ms of which 3 ms to minimize.
[2024-05-28 19:34:04] [INFO ] Deduced a trap composed of 154 places in 193 ms of which 4 ms to minimize.
[2024-05-28 19:34:05] [INFO ] Deduced a trap composed of 154 places in 208 ms of which 3 ms to minimize.
[2024-05-28 19:34:05] [INFO ] Deduced a trap composed of 138 places in 213 ms of which 3 ms to minimize.
[2024-05-28 19:34:05] [INFO ] Deduced a trap composed of 138 places in 177 ms of which 3 ms to minimize.
[2024-05-28 19:34:05] [INFO ] Deduced a trap composed of 138 places in 272 ms of which 2 ms to minimize.
[2024-05-28 19:34:05] [INFO ] Deduced a trap composed of 138 places in 155 ms of which 3 ms to minimize.
[2024-05-28 19:34:06] [INFO ] Deduced a trap composed of 138 places in 159 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:34:08] [INFO ] Deduced a trap composed of 98 places in 149 ms of which 3 ms to minimize.
[2024-05-28 19:34:08] [INFO ] Deduced a trap composed of 98 places in 166 ms of which 2 ms to minimize.
[2024-05-28 19:34:08] [INFO ] Deduced a trap composed of 98 places in 176 ms of which 2 ms to minimize.
[2024-05-28 19:34:08] [INFO ] Deduced a trap composed of 138 places in 160 ms of which 2 ms to minimize.
[2024-05-28 19:34:09] [INFO ] Deduced a trap composed of 138 places in 159 ms of which 3 ms to minimize.
[2024-05-28 19:34:09] [INFO ] Deduced a trap composed of 138 places in 181 ms of which 2 ms to minimize.
[2024-05-28 19:34:09] [INFO ] Deduced a trap composed of 98 places in 179 ms of which 3 ms to minimize.
[2024-05-28 19:34:09] [INFO ] Deduced a trap composed of 138 places in 178 ms of which 2 ms to minimize.
[2024-05-28 19:34:09] [INFO ] Deduced a trap composed of 98 places in 167 ms of which 2 ms to minimize.
[2024-05-28 19:34:10] [INFO ] Deduced a trap composed of 138 places in 158 ms of which 3 ms to minimize.
[2024-05-28 19:34:10] [INFO ] Deduced a trap composed of 98 places in 161 ms of which 2 ms to minimize.
[2024-05-28 19:34:10] [INFO ] Deduced a trap composed of 98 places in 179 ms of which 3 ms to minimize.
[2024-05-28 19:34:10] [INFO ] Deduced a trap composed of 138 places in 175 ms of which 2 ms to minimize.
[2024-05-28 19:34:10] [INFO ] Deduced a trap composed of 138 places in 177 ms of which 3 ms to minimize.
[2024-05-28 19:34:10] [INFO ] Deduced a trap composed of 98 places in 187 ms of which 2 ms to minimize.
[2024-05-28 19:34:11] [INFO ] Deduced a trap composed of 98 places in 190 ms of which 3 ms to minimize.
[2024-05-28 19:34:11] [INFO ] Deduced a trap composed of 138 places in 167 ms of which 3 ms to minimize.
[2024-05-28 19:34:11] [INFO ] Deduced a trap composed of 138 places in 165 ms of which 2 ms to minimize.
[2024-05-28 19:34:11] [INFO ] Deduced a trap composed of 138 places in 236 ms of which 3 ms to minimize.
[2024-05-28 19:34:11] [INFO ] Deduced a trap composed of 138 places in 179 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 5 (OVERLAPS) 4/531 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:34:22] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 759 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/1293 variables, and 137 constraints, problems are : Problem set: 0 solved, 759 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 759/759 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 759 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 41/133 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:34:28] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-28 19:34:29] [INFO ] Deduced a trap composed of 163 places in 167 ms of which 2 ms to minimize.
[2024-05-28 19:34:29] [INFO ] Deduced a trap composed of 172 places in 162 ms of which 13 ms to minimize.
[2024-05-28 19:34:30] [INFO ] Deduced a trap composed of 141 places in 158 ms of which 3 ms to minimize.
[2024-05-28 19:34:30] [INFO ] Deduced a trap composed of 138 places in 158 ms of which 3 ms to minimize.
[2024-05-28 19:34:30] [INFO ] Deduced a trap composed of 141 places in 181 ms of which 3 ms to minimize.
[2024-05-28 19:34:30] [INFO ] Deduced a trap composed of 138 places in 171 ms of which 2 ms to minimize.
[2024-05-28 19:34:30] [INFO ] Deduced a trap composed of 141 places in 171 ms of which 3 ms to minimize.
[2024-05-28 19:34:31] [INFO ] Deduced a trap composed of 138 places in 177 ms of which 2 ms to minimize.
[2024-05-28 19:34:31] [INFO ] Deduced a trap composed of 152 places in 189 ms of which 3 ms to minimize.
[2024-05-28 19:34:31] [INFO ] Deduced a trap composed of 141 places in 189 ms of which 3 ms to minimize.
[2024-05-28 19:34:31] [INFO ] Deduced a trap composed of 138 places in 170 ms of which 2 ms to minimize.
[2024-05-28 19:34:31] [INFO ] Deduced a trap composed of 141 places in 159 ms of which 3 ms to minimize.
[2024-05-28 19:34:31] [INFO ] Deduced a trap composed of 138 places in 163 ms of which 4 ms to minimize.
[2024-05-28 19:34:32] [INFO ] Deduced a trap composed of 138 places in 170 ms of which 3 ms to minimize.
[2024-05-28 19:34:32] [INFO ] Deduced a trap composed of 141 places in 169 ms of which 3 ms to minimize.
[2024-05-28 19:34:32] [INFO ] Deduced a trap composed of 138 places in 157 ms of which 2 ms to minimize.
[2024-05-28 19:34:32] [INFO ] Deduced a trap composed of 156 places in 157 ms of which 3 ms to minimize.
[2024-05-28 19:34:32] [INFO ] Deduced a trap composed of 141 places in 158 ms of which 2 ms to minimize.
[2024-05-28 19:34:33] [INFO ] Deduced a trap composed of 138 places in 162 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:34:35] [INFO ] Deduced a trap composed of 169 places in 172 ms of which 3 ms to minimize.
[2024-05-28 19:34:35] [INFO ] Deduced a trap composed of 175 places in 219 ms of which 3 ms to minimize.
[2024-05-28 19:34:35] [INFO ] Deduced a trap composed of 175 places in 189 ms of which 3 ms to minimize.
[2024-05-28 19:34:36] [INFO ] Deduced a trap composed of 178 places in 174 ms of which 2 ms to minimize.
[2024-05-28 19:34:36] [INFO ] Deduced a trap composed of 163 places in 156 ms of which 3 ms to minimize.
[2024-05-28 19:34:36] [INFO ] Deduced a trap composed of 178 places in 153 ms of which 2 ms to minimize.
[2024-05-28 19:34:36] [INFO ] Deduced a trap composed of 169 places in 170 ms of which 3 ms to minimize.
[2024-05-28 19:34:36] [INFO ] Deduced a trap composed of 169 places in 167 ms of which 3 ms to minimize.
[2024-05-28 19:34:36] [INFO ] Deduced a trap composed of 163 places in 176 ms of which 3 ms to minimize.
[2024-05-28 19:34:37] [INFO ] Deduced a trap composed of 172 places in 152 ms of which 2 ms to minimize.
[2024-05-28 19:34:37] [INFO ] Deduced a trap composed of 172 places in 171 ms of which 2 ms to minimize.
[2024-05-28 19:34:37] [INFO ] Deduced a trap composed of 175 places in 160 ms of which 3 ms to minimize.
[2024-05-28 19:34:37] [INFO ] Deduced a trap composed of 141 places in 162 ms of which 3 ms to minimize.
[2024-05-28 19:34:37] [INFO ] Deduced a trap composed of 154 places in 160 ms of which 3 ms to minimize.
[2024-05-28 19:34:38] [INFO ] Deduced a trap composed of 166 places in 150 ms of which 2 ms to minimize.
[2024-05-28 19:34:38] [INFO ] Deduced a trap composed of 141 places in 159 ms of which 2 ms to minimize.
[2024-05-28 19:34:38] [INFO ] Deduced a trap composed of 166 places in 169 ms of which 2 ms to minimize.
[2024-05-28 19:34:38] [INFO ] Deduced a trap composed of 166 places in 178 ms of which 3 ms to minimize.
[2024-05-28 19:34:38] [INFO ] Deduced a trap composed of 175 places in 165 ms of which 3 ms to minimize.
[2024-05-28 19:34:38] [INFO ] Deduced a trap composed of 175 places in 162 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 20/173 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:34:42] [INFO ] Deduced a trap composed of 138 places in 180 ms of which 3 ms to minimize.
[2024-05-28 19:34:42] [INFO ] Deduced a trap composed of 138 places in 146 ms of which 2 ms to minimize.
[2024-05-28 19:34:42] [INFO ] Deduced a trap composed of 141 places in 155 ms of which 3 ms to minimize.
[2024-05-28 19:34:42] [INFO ] Deduced a trap composed of 138 places in 154 ms of which 2 ms to minimize.
[2024-05-28 19:34:42] [INFO ] Deduced a trap composed of 138 places in 168 ms of which 2 ms to minimize.
[2024-05-28 19:34:43] [INFO ] Deduced a trap composed of 138 places in 175 ms of which 3 ms to minimize.
[2024-05-28 19:34:43] [INFO ] Deduced a trap composed of 138 places in 187 ms of which 3 ms to minimize.
[2024-05-28 19:34:43] [INFO ] Deduced a trap composed of 138 places in 160 ms of which 3 ms to minimize.
[2024-05-28 19:34:43] [INFO ] Deduced a trap composed of 138 places in 176 ms of which 4 ms to minimize.
[2024-05-28 19:34:43] [INFO ] Deduced a trap composed of 138 places in 160 ms of which 3 ms to minimize.
[2024-05-28 19:34:43] [INFO ] Deduced a trap composed of 138 places in 165 ms of which 3 ms to minimize.
[2024-05-28 19:34:44] [INFO ] Deduced a trap composed of 138 places in 177 ms of which 3 ms to minimize.
[2024-05-28 19:34:44] [INFO ] Deduced a trap composed of 138 places in 158 ms of which 3 ms to minimize.
[2024-05-28 19:34:44] [INFO ] Deduced a trap composed of 138 places in 208 ms of which 2 ms to minimize.
[2024-05-28 19:34:44] [INFO ] Deduced a trap composed of 138 places in 218 ms of which 3 ms to minimize.
[2024-05-28 19:34:45] [INFO ] Deduced a trap composed of 138 places in 181 ms of which 2 ms to minimize.
[2024-05-28 19:34:45] [INFO ] Deduced a trap composed of 138 places in 162 ms of which 3 ms to minimize.
[2024-05-28 19:34:45] [INFO ] Deduced a trap composed of 138 places in 200 ms of which 2 ms to minimize.
[2024-05-28 19:34:45] [INFO ] Deduced a trap composed of 141 places in 231 ms of which 3 ms to minimize.
[2024-05-28 19:34:45] [INFO ] Deduced a trap composed of 141 places in 181 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 20/193 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:34:48] [INFO ] Deduced a trap composed of 141 places in 178 ms of which 3 ms to minimize.
[2024-05-28 19:34:48] [INFO ] Deduced a trap composed of 141 places in 163 ms of which 2 ms to minimize.
[2024-05-28 19:34:49] [INFO ] Deduced a trap composed of 141 places in 164 ms of which 3 ms to minimize.
[2024-05-28 19:34:49] [INFO ] Deduced a trap composed of 141 places in 176 ms of which 3 ms to minimize.
[2024-05-28 19:34:49] [INFO ] Deduced a trap composed of 138 places in 195 ms of which 3 ms to minimize.
[2024-05-28 19:34:49] [INFO ] Deduced a trap composed of 141 places in 171 ms of which 2 ms to minimize.
[2024-05-28 19:34:49] [INFO ] Deduced a trap composed of 141 places in 158 ms of which 3 ms to minimize.
[2024-05-28 19:34:50] [INFO ] Deduced a trap composed of 141 places in 164 ms of which 3 ms to minimize.
[2024-05-28 19:34:50] [INFO ] Deduced a trap composed of 138 places in 149 ms of which 2 ms to minimize.
[2024-05-28 19:34:50] [INFO ] Deduced a trap composed of 138 places in 150 ms of which 3 ms to minimize.
[2024-05-28 19:34:50] [INFO ] Deduced a trap composed of 138 places in 152 ms of which 3 ms to minimize.
[2024-05-28 19:34:50] [INFO ] Deduced a trap composed of 141 places in 168 ms of which 3 ms to minimize.
[2024-05-28 19:34:50] [INFO ] Deduced a trap composed of 141 places in 178 ms of which 3 ms to minimize.
[2024-05-28 19:34:51] [INFO ] Deduced a trap composed of 141 places in 168 ms of which 3 ms to minimize.
[2024-05-28 19:34:51] [INFO ] Deduced a trap composed of 141 places in 187 ms of which 3 ms to minimize.
[2024-05-28 19:34:51] [INFO ] Deduced a trap composed of 141 places in 159 ms of which 3 ms to minimize.
[2024-05-28 19:34:51] [INFO ] Deduced a trap composed of 138 places in 159 ms of which 2 ms to minimize.
[2024-05-28 19:34:51] [INFO ] Deduced a trap composed of 141 places in 170 ms of which 2 ms to minimize.
[2024-05-28 19:34:52] [INFO ] Deduced a trap composed of 141 places in 155 ms of which 2 ms to minimize.
[2024-05-28 19:34:52] [INFO ] Deduced a trap composed of 141 places in 167 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 20/213 constraints. Problems are: Problem set: 0 solved, 759 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 527/1293 variables, and 213 constraints, problems are : Problem set: 0 solved, 759 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/759 constraints, Known Traps: 121/121 constraints]
After SMT, in 61140ms problems are : Problem set: 0 solved, 759 unsolved
Search for dead transitions found 0 dead transitions in 61146ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 105571 ms. Remains : 532/532 places, 765/765 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
RANDOM walk for 23 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4780 reset in 465 ms.
Product exploration explored 100000 steps with 4702 reset in 350 ms.
Built C files in :
/tmp/ltsmin2972551318103348657
[2024-05-28 19:34:58] [INFO ] Computing symmetric may disable matrix : 765 transitions.
[2024-05-28 19:34:58] [INFO ] Computation of Complete disable matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:34:58] [INFO ] Computing symmetric may enable matrix : 765 transitions.
[2024-05-28 19:34:58] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:34:58] [INFO ] Computing Do-Not-Accords matrix : 765 transitions.
[2024-05-28 19:34:58] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:34:58] [INFO ] Built C files in 180ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2972551318103348657
Running compilation step : cd /tmp/ltsmin2972551318103348657;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2972551318103348657;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2972551318103348657;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 765/765 transitions.
Applied a total of 0 rules in 28 ms. Remains 532 /532 variables (removed 0) and now considering 765/765 (removed 0) transitions.
Running 759 sub problems to find dead transitions.
[2024-05-28 19:35:01] [INFO ] Flow matrix only has 761 transitions (discarded 4 similar events)
[2024-05-28 19:35:01] [INFO ] Invariant cache hit.
[2024-05-28 19:35:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:35:08] [INFO ] Deduced a trap composed of 166 places in 135 ms of which 2 ms to minimize.
[2024-05-28 19:35:08] [INFO ] Deduced a trap composed of 138 places in 187 ms of which 3 ms to minimize.
[2024-05-28 19:35:08] [INFO ] Deduced a trap composed of 157 places in 149 ms of which 3 ms to minimize.
[2024-05-28 19:35:08] [INFO ] Deduced a trap composed of 138 places in 147 ms of which 3 ms to minimize.
[2024-05-28 19:35:08] [INFO ] Deduced a trap composed of 138 places in 142 ms of which 2 ms to minimize.
[2024-05-28 19:35:08] [INFO ] Deduced a trap composed of 138 places in 156 ms of which 2 ms to minimize.
[2024-05-28 19:35:09] [INFO ] Deduced a trap composed of 138 places in 153 ms of which 3 ms to minimize.
[2024-05-28 19:35:09] [INFO ] Deduced a trap composed of 138 places in 153 ms of which 2 ms to minimize.
[2024-05-28 19:35:09] [INFO ] Deduced a trap composed of 138 places in 166 ms of which 2 ms to minimize.
[2024-05-28 19:35:09] [INFO ] Deduced a trap composed of 138 places in 147 ms of which 3 ms to minimize.
[2024-05-28 19:35:09] [INFO ] Deduced a trap composed of 138 places in 206 ms of which 4 ms to minimize.
[2024-05-28 19:35:09] [INFO ] Deduced a trap composed of 138 places in 199 ms of which 4 ms to minimize.
[2024-05-28 19:35:10] [INFO ] Deduced a trap composed of 138 places in 186 ms of which 3 ms to minimize.
[2024-05-28 19:35:10] [INFO ] Deduced a trap composed of 154 places in 208 ms of which 3 ms to minimize.
[2024-05-28 19:35:10] [INFO ] Deduced a trap composed of 154 places in 233 ms of which 4 ms to minimize.
[2024-05-28 19:35:11] [INFO ] Deduced a trap composed of 138 places in 190 ms of which 4 ms to minimize.
[2024-05-28 19:35:11] [INFO ] Deduced a trap composed of 138 places in 148 ms of which 2 ms to minimize.
[2024-05-28 19:35:11] [INFO ] Deduced a trap composed of 138 places in 215 ms of which 4 ms to minimize.
[2024-05-28 19:35:11] [INFO ] Deduced a trap composed of 138 places in 139 ms of which 2 ms to minimize.
[2024-05-28 19:35:11] [INFO ] Deduced a trap composed of 138 places in 202 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:35:14] [INFO ] Deduced a trap composed of 98 places in 235 ms of which 4 ms to minimize.
[2024-05-28 19:35:14] [INFO ] Deduced a trap composed of 98 places in 211 ms of which 4 ms to minimize.
[2024-05-28 19:35:14] [INFO ] Deduced a trap composed of 98 places in 215 ms of which 4 ms to minimize.
[2024-05-28 19:35:14] [INFO ] Deduced a trap composed of 138 places in 191 ms of which 3 ms to minimize.
[2024-05-28 19:35:14] [INFO ] Deduced a trap composed of 138 places in 176 ms of which 8 ms to minimize.
[2024-05-28 19:35:15] [INFO ] Deduced a trap composed of 138 places in 166 ms of which 3 ms to minimize.
[2024-05-28 19:35:15] [INFO ] Deduced a trap composed of 98 places in 193 ms of which 3 ms to minimize.
[2024-05-28 19:35:15] [INFO ] Deduced a trap composed of 138 places in 238 ms of which 3 ms to minimize.
[2024-05-28 19:35:15] [INFO ] Deduced a trap composed of 98 places in 208 ms of which 2 ms to minimize.
[2024-05-28 19:35:15] [INFO ] Deduced a trap composed of 138 places in 230 ms of which 4 ms to minimize.
[2024-05-28 19:35:16] [INFO ] Deduced a trap composed of 98 places in 227 ms of which 4 ms to minimize.
[2024-05-28 19:35:16] [INFO ] Deduced a trap composed of 98 places in 203 ms of which 4 ms to minimize.
[2024-05-28 19:35:16] [INFO ] Deduced a trap composed of 138 places in 207 ms of which 3 ms to minimize.
[2024-05-28 19:35:16] [INFO ] Deduced a trap composed of 138 places in 204 ms of which 4 ms to minimize.
[2024-05-28 19:35:17] [INFO ] Deduced a trap composed of 98 places in 181 ms of which 3 ms to minimize.
[2024-05-28 19:35:17] [INFO ] Deduced a trap composed of 98 places in 180 ms of which 3 ms to minimize.
[2024-05-28 19:35:17] [INFO ] Deduced a trap composed of 138 places in 247 ms of which 4 ms to minimize.
[2024-05-28 19:35:17] [INFO ] Deduced a trap composed of 138 places in 180 ms of which 2 ms to minimize.
[2024-05-28 19:35:17] [INFO ] Deduced a trap composed of 138 places in 272 ms of which 4 ms to minimize.
[2024-05-28 19:35:18] [INFO ] Deduced a trap composed of 138 places in 198 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 759 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 527/1293 variables, and 132 constraints, problems are : Problem set: 0 solved, 759 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 759/759 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 759 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:35:24] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-28 19:35:25] [INFO ] Deduced a trap composed of 138 places in 215 ms of which 4 ms to minimize.
[2024-05-28 19:35:25] [INFO ] Deduced a trap composed of 141 places in 154 ms of which 3 ms to minimize.
[2024-05-28 19:35:25] [INFO ] Deduced a trap composed of 138 places in 208 ms of which 3 ms to minimize.
[2024-05-28 19:35:26] [INFO ] Deduced a trap composed of 141 places in 193 ms of which 4 ms to minimize.
[2024-05-28 19:35:26] [INFO ] Deduced a trap composed of 138 places in 151 ms of which 3 ms to minimize.
[2024-05-28 19:35:26] [INFO ] Deduced a trap composed of 138 places in 165 ms of which 5 ms to minimize.
[2024-05-28 19:35:26] [INFO ] Deduced a trap composed of 138 places in 152 ms of which 3 ms to minimize.
[2024-05-28 19:35:26] [INFO ] Deduced a trap composed of 141 places in 210 ms of which 3 ms to minimize.
[2024-05-28 19:35:27] [INFO ] Deduced a trap composed of 138 places in 193 ms of which 4 ms to minimize.
[2024-05-28 19:35:27] [INFO ] Deduced a trap composed of 138 places in 196 ms of which 3 ms to minimize.
[2024-05-28 19:35:27] [INFO ] Deduced a trap composed of 141 places in 154 ms of which 3 ms to minimize.
[2024-05-28 19:35:27] [INFO ] Deduced a trap composed of 138 places in 153 ms of which 2 ms to minimize.
[2024-05-28 19:35:27] [INFO ] Deduced a trap composed of 141 places in 149 ms of which 3 ms to minimize.
[2024-05-28 19:35:27] [INFO ] Deduced a trap composed of 138 places in 149 ms of which 3 ms to minimize.
[2024-05-28 19:35:28] [INFO ] Deduced a trap composed of 141 places in 154 ms of which 2 ms to minimize.
[2024-05-28 19:35:28] [INFO ] Deduced a trap composed of 138 places in 149 ms of which 3 ms to minimize.
[2024-05-28 19:35:28] [INFO ] Deduced a trap composed of 138 places in 147 ms of which 2 ms to minimize.
[2024-05-28 19:35:28] [INFO ] Deduced a trap composed of 141 places in 219 ms of which 2 ms to minimize.
[2024-05-28 19:35:28] [INFO ] Deduced a trap composed of 138 places in 153 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:35:31] [INFO ] Deduced a trap composed of 141 places in 224 ms of which 3 ms to minimize.
[2024-05-28 19:35:31] [INFO ] Deduced a trap composed of 138 places in 271 ms of which 3 ms to minimize.
[2024-05-28 19:35:32] [INFO ] Deduced a trap composed of 138 places in 243 ms of which 4 ms to minimize.
[2024-05-28 19:35:32] [INFO ] Deduced a trap composed of 138 places in 200 ms of which 3 ms to minimize.
[2024-05-28 19:35:32] [INFO ] Deduced a trap composed of 138 places in 215 ms of which 4 ms to minimize.
[2024-05-28 19:35:32] [INFO ] Deduced a trap composed of 138 places in 211 ms of which 4 ms to minimize.
[2024-05-28 19:35:33] [INFO ] Deduced a trap composed of 138 places in 184 ms of which 3 ms to minimize.
[2024-05-28 19:35:33] [INFO ] Deduced a trap composed of 138 places in 163 ms of which 3 ms to minimize.
[2024-05-28 19:35:33] [INFO ] Deduced a trap composed of 141 places in 156 ms of which 2 ms to minimize.
[2024-05-28 19:35:33] [INFO ] Deduced a trap composed of 141 places in 151 ms of which 3 ms to minimize.
[2024-05-28 19:35:33] [INFO ] Deduced a trap composed of 141 places in 200 ms of which 3 ms to minimize.
[2024-05-28 19:35:33] [INFO ] Deduced a trap composed of 138 places in 182 ms of which 3 ms to minimize.
[2024-05-28 19:35:34] [INFO ] Deduced a trap composed of 138 places in 182 ms of which 3 ms to minimize.
[2024-05-28 19:35:34] [INFO ] Deduced a trap composed of 138 places in 181 ms of which 3 ms to minimize.
[2024-05-28 19:35:34] [INFO ] Deduced a trap composed of 138 places in 158 ms of which 3 ms to minimize.
[2024-05-28 19:35:34] [INFO ] Deduced a trap composed of 141 places in 239 ms of which 3 ms to minimize.
[2024-05-28 19:35:34] [INFO ] Deduced a trap composed of 141 places in 159 ms of which 3 ms to minimize.
[2024-05-28 19:35:35] [INFO ] Deduced a trap composed of 141 places in 222 ms of which 3 ms to minimize.
[2024-05-28 19:35:35] [INFO ] Deduced a trap composed of 142 places in 161 ms of which 3 ms to minimize.
[2024-05-28 19:35:35] [INFO ] Deduced a trap composed of 142 places in 190 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:35:41] [INFO ] Deduced a trap composed of 184 places in 133 ms of which 2 ms to minimize.
[2024-05-28 19:35:41] [INFO ] Deduced a trap composed of 166 places in 140 ms of which 2 ms to minimize.
[2024-05-28 19:35:41] [INFO ] Deduced a trap composed of 181 places in 197 ms of which 4 ms to minimize.
[2024-05-28 19:35:41] [INFO ] Deduced a trap composed of 163 places in 179 ms of which 4 ms to minimize.
[2024-05-28 19:35:42] [INFO ] Deduced a trap composed of 163 places in 176 ms of which 3 ms to minimize.
[2024-05-28 19:35:42] [INFO ] Deduced a trap composed of 166 places in 182 ms of which 4 ms to minimize.
[2024-05-28 19:35:42] [INFO ] Deduced a trap composed of 163 places in 183 ms of which 3 ms to minimize.
[2024-05-28 19:35:42] [INFO ] Deduced a trap composed of 175 places in 149 ms of which 2 ms to minimize.
[2024-05-28 19:35:42] [INFO ] Deduced a trap composed of 163 places in 142 ms of which 3 ms to minimize.
[2024-05-28 19:35:42] [INFO ] Deduced a trap composed of 163 places in 142 ms of which 2 ms to minimize.
[2024-05-28 19:35:43] [INFO ] Deduced a trap composed of 157 places in 155 ms of which 3 ms to minimize.
SMT process timed out in 41377ms, After SMT, problems are : Problem set: 0 solved, 759 unsolved
Search for dead transitions found 0 dead transitions in 41388ms
[2024-05-28 19:35:43] [INFO ] Flow matrix only has 761 transitions (discarded 4 similar events)
[2024-05-28 19:35:43] [INFO ] Invariant cache hit.
[2024-05-28 19:35:43] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-05-28 19:35:43] [INFO ] Flow matrix only has 761 transitions (discarded 4 similar events)
[2024-05-28 19:35:43] [INFO ] Invariant cache hit.
[2024-05-28 19:35:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:35:45] [INFO ] Implicit Places using invariants and state equation in 2365 ms returned []
Implicit Place search using SMT with State Equation took 2771 ms to find 0 implicit places.
[2024-05-28 19:35:45] [INFO ] Redundant transitions in 12 ms returned []
Running 759 sub problems to find dead transitions.
[2024-05-28 19:35:45] [INFO ] Flow matrix only has 761 transitions (discarded 4 similar events)
[2024-05-28 19:35:45] [INFO ] Invariant cache hit.
[2024-05-28 19:35:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:35:52] [INFO ] Deduced a trap composed of 166 places in 208 ms of which 4 ms to minimize.
[2024-05-28 19:35:52] [INFO ] Deduced a trap composed of 138 places in 189 ms of which 4 ms to minimize.
[2024-05-28 19:35:52] [INFO ] Deduced a trap composed of 157 places in 177 ms of which 3 ms to minimize.
[2024-05-28 19:35:52] [INFO ] Deduced a trap composed of 138 places in 208 ms of which 4 ms to minimize.
[2024-05-28 19:35:53] [INFO ] Deduced a trap composed of 138 places in 187 ms of which 4 ms to minimize.
[2024-05-28 19:35:53] [INFO ] Deduced a trap composed of 138 places in 185 ms of which 3 ms to minimize.
[2024-05-28 19:35:53] [INFO ] Deduced a trap composed of 138 places in 163 ms of which 2 ms to minimize.
[2024-05-28 19:35:53] [INFO ] Deduced a trap composed of 138 places in 149 ms of which 2 ms to minimize.
[2024-05-28 19:35:53] [INFO ] Deduced a trap composed of 138 places in 210 ms of which 4 ms to minimize.
[2024-05-28 19:35:53] [INFO ] Deduced a trap composed of 138 places in 181 ms of which 3 ms to minimize.
[2024-05-28 19:35:54] [INFO ] Deduced a trap composed of 138 places in 183 ms of which 4 ms to minimize.
[2024-05-28 19:35:54] [INFO ] Deduced a trap composed of 138 places in 183 ms of which 3 ms to minimize.
[2024-05-28 19:35:54] [INFO ] Deduced a trap composed of 138 places in 158 ms of which 3 ms to minimize.
[2024-05-28 19:35:54] [INFO ] Deduced a trap composed of 154 places in 202 ms of which 3 ms to minimize.
[2024-05-28 19:35:55] [INFO ] Deduced a trap composed of 154 places in 201 ms of which 4 ms to minimize.
[2024-05-28 19:35:55] [INFO ] Deduced a trap composed of 138 places in 190 ms of which 4 ms to minimize.
[2024-05-28 19:35:55] [INFO ] Deduced a trap composed of 138 places in 181 ms of which 3 ms to minimize.
[2024-05-28 19:35:55] [INFO ] Deduced a trap composed of 138 places in 156 ms of which 2 ms to minimize.
[2024-05-28 19:35:55] [INFO ] Deduced a trap composed of 138 places in 201 ms of which 3 ms to minimize.
[2024-05-28 19:35:56] [INFO ] Deduced a trap composed of 138 places in 170 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:35:58] [INFO ] Deduced a trap composed of 98 places in 146 ms of which 3 ms to minimize.
[2024-05-28 19:35:58] [INFO ] Deduced a trap composed of 98 places in 221 ms of which 3 ms to minimize.
[2024-05-28 19:35:58] [INFO ] Deduced a trap composed of 98 places in 174 ms of which 2 ms to minimize.
[2024-05-28 19:35:59] [INFO ] Deduced a trap composed of 138 places in 220 ms of which 4 ms to minimize.
[2024-05-28 19:35:59] [INFO ] Deduced a trap composed of 138 places in 157 ms of which 2 ms to minimize.
[2024-05-28 19:35:59] [INFO ] Deduced a trap composed of 138 places in 162 ms of which 2 ms to minimize.
[2024-05-28 19:35:59] [INFO ] Deduced a trap composed of 98 places in 179 ms of which 2 ms to minimize.
[2024-05-28 19:35:59] [INFO ] Deduced a trap composed of 138 places in 217 ms of which 4 ms to minimize.
[2024-05-28 19:36:00] [INFO ] Deduced a trap composed of 98 places in 164 ms of which 3 ms to minimize.
[2024-05-28 19:36:00] [INFO ] Deduced a trap composed of 138 places in 155 ms of which 2 ms to minimize.
[2024-05-28 19:36:00] [INFO ] Deduced a trap composed of 98 places in 143 ms of which 3 ms to minimize.
[2024-05-28 19:36:00] [INFO ] Deduced a trap composed of 98 places in 153 ms of which 2 ms to minimize.
[2024-05-28 19:36:00] [INFO ] Deduced a trap composed of 138 places in 168 ms of which 2 ms to minimize.
[2024-05-28 19:36:00] [INFO ] Deduced a trap composed of 138 places in 159 ms of which 3 ms to minimize.
[2024-05-28 19:36:01] [INFO ] Deduced a trap composed of 98 places in 217 ms of which 3 ms to minimize.
[2024-05-28 19:36:01] [INFO ] Deduced a trap composed of 98 places in 156 ms of which 2 ms to minimize.
[2024-05-28 19:36:01] [INFO ] Deduced a trap composed of 138 places in 160 ms of which 3 ms to minimize.
[2024-05-28 19:36:01] [INFO ] Deduced a trap composed of 138 places in 224 ms of which 4 ms to minimize.
[2024-05-28 19:36:01] [INFO ] Deduced a trap composed of 138 places in 203 ms of which 4 ms to minimize.
[2024-05-28 19:36:02] [INFO ] Deduced a trap composed of 138 places in 156 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 5 (OVERLAPS) 4/531 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:36:14] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 759 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/1293 variables, and 137 constraints, problems are : Problem set: 0 solved, 759 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 759/759 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 759 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 41/133 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:36:18] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-28 19:36:19] [INFO ] Deduced a trap composed of 163 places in 179 ms of which 2 ms to minimize.
[2024-05-28 19:36:19] [INFO ] Deduced a trap composed of 172 places in 167 ms of which 3 ms to minimize.
[2024-05-28 19:36:20] [INFO ] Deduced a trap composed of 141 places in 175 ms of which 3 ms to minimize.
[2024-05-28 19:36:20] [INFO ] Deduced a trap composed of 138 places in 168 ms of which 3 ms to minimize.
[2024-05-28 19:36:20] [INFO ] Deduced a trap composed of 141 places in 178 ms of which 3 ms to minimize.
[2024-05-28 19:36:20] [INFO ] Deduced a trap composed of 138 places in 167 ms of which 3 ms to minimize.
[2024-05-28 19:36:20] [INFO ] Deduced a trap composed of 141 places in 163 ms of which 3 ms to minimize.
[2024-05-28 19:36:20] [INFO ] Deduced a trap composed of 138 places in 165 ms of which 3 ms to minimize.
[2024-05-28 19:36:21] [INFO ] Deduced a trap composed of 152 places in 169 ms of which 3 ms to minimize.
[2024-05-28 19:36:21] [INFO ] Deduced a trap composed of 141 places in 160 ms of which 3 ms to minimize.
[2024-05-28 19:36:21] [INFO ] Deduced a trap composed of 138 places in 156 ms of which 3 ms to minimize.
[2024-05-28 19:36:21] [INFO ] Deduced a trap composed of 141 places in 166 ms of which 2 ms to minimize.
[2024-05-28 19:36:21] [INFO ] Deduced a trap composed of 138 places in 177 ms of which 3 ms to minimize.
[2024-05-28 19:36:22] [INFO ] Deduced a trap composed of 138 places in 163 ms of which 3 ms to minimize.
[2024-05-28 19:36:22] [INFO ] Deduced a trap composed of 141 places in 154 ms of which 3 ms to minimize.
[2024-05-28 19:36:22] [INFO ] Deduced a trap composed of 138 places in 160 ms of which 2 ms to minimize.
[2024-05-28 19:36:22] [INFO ] Deduced a trap composed of 156 places in 170 ms of which 3 ms to minimize.
[2024-05-28 19:36:22] [INFO ] Deduced a trap composed of 141 places in 166 ms of which 2 ms to minimize.
[2024-05-28 19:36:22] [INFO ] Deduced a trap composed of 138 places in 168 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:36:25] [INFO ] Deduced a trap composed of 169 places in 163 ms of which 2 ms to minimize.
[2024-05-28 19:36:25] [INFO ] Deduced a trap composed of 175 places in 194 ms of which 3 ms to minimize.
[2024-05-28 19:36:25] [INFO ] Deduced a trap composed of 175 places in 160 ms of which 2 ms to minimize.
[2024-05-28 19:36:25] [INFO ] Deduced a trap composed of 178 places in 169 ms of which 3 ms to minimize.
[2024-05-28 19:36:25] [INFO ] Deduced a trap composed of 163 places in 162 ms of which 2 ms to minimize.
[2024-05-28 19:36:26] [INFO ] Deduced a trap composed of 178 places in 155 ms of which 2 ms to minimize.
[2024-05-28 19:36:26] [INFO ] Deduced a trap composed of 169 places in 189 ms of which 3 ms to minimize.
[2024-05-28 19:36:26] [INFO ] Deduced a trap composed of 169 places in 152 ms of which 2 ms to minimize.
[2024-05-28 19:36:26] [INFO ] Deduced a trap composed of 163 places in 167 ms of which 3 ms to minimize.
[2024-05-28 19:36:26] [INFO ] Deduced a trap composed of 172 places in 156 ms of which 3 ms to minimize.
[2024-05-28 19:36:26] [INFO ] Deduced a trap composed of 172 places in 156 ms of which 2 ms to minimize.
[2024-05-28 19:36:27] [INFO ] Deduced a trap composed of 175 places in 156 ms of which 3 ms to minimize.
[2024-05-28 19:36:27] [INFO ] Deduced a trap composed of 141 places in 162 ms of which 3 ms to minimize.
[2024-05-28 19:36:27] [INFO ] Deduced a trap composed of 154 places in 159 ms of which 3 ms to minimize.
[2024-05-28 19:36:27] [INFO ] Deduced a trap composed of 166 places in 150 ms of which 2 ms to minimize.
[2024-05-28 19:36:27] [INFO ] Deduced a trap composed of 141 places in 169 ms of which 3 ms to minimize.
[2024-05-28 19:36:27] [INFO ] Deduced a trap composed of 166 places in 160 ms of which 2 ms to minimize.
[2024-05-28 19:36:28] [INFO ] Deduced a trap composed of 166 places in 175 ms of which 2 ms to minimize.
[2024-05-28 19:36:28] [INFO ] Deduced a trap composed of 175 places in 157 ms of which 3 ms to minimize.
[2024-05-28 19:36:28] [INFO ] Deduced a trap composed of 175 places in 175 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 20/173 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:36:31] [INFO ] Deduced a trap composed of 138 places in 174 ms of which 3 ms to minimize.
[2024-05-28 19:36:31] [INFO ] Deduced a trap composed of 138 places in 152 ms of which 2 ms to minimize.
[2024-05-28 19:36:31] [INFO ] Deduced a trap composed of 141 places in 164 ms of which 3 ms to minimize.
[2024-05-28 19:36:31] [INFO ] Deduced a trap composed of 138 places in 156 ms of which 3 ms to minimize.
[2024-05-28 19:36:32] [INFO ] Deduced a trap composed of 138 places in 167 ms of which 3 ms to minimize.
[2024-05-28 19:36:32] [INFO ] Deduced a trap composed of 138 places in 168 ms of which 2 ms to minimize.
[2024-05-28 19:36:32] [INFO ] Deduced a trap composed of 138 places in 160 ms of which 4 ms to minimize.
[2024-05-28 19:36:32] [INFO ] Deduced a trap composed of 138 places in 176 ms of which 2 ms to minimize.
[2024-05-28 19:36:32] [INFO ] Deduced a trap composed of 138 places in 162 ms of which 3 ms to minimize.
[2024-05-28 19:36:33] [INFO ] Deduced a trap composed of 138 places in 163 ms of which 2 ms to minimize.
[2024-05-28 19:36:33] [INFO ] Deduced a trap composed of 138 places in 158 ms of which 3 ms to minimize.
[2024-05-28 19:36:33] [INFO ] Deduced a trap composed of 138 places in 159 ms of which 2 ms to minimize.
[2024-05-28 19:36:33] [INFO ] Deduced a trap composed of 138 places in 148 ms of which 2 ms to minimize.
[2024-05-28 19:36:33] [INFO ] Deduced a trap composed of 138 places in 245 ms of which 3 ms to minimize.
[2024-05-28 19:36:34] [INFO ] Deduced a trap composed of 138 places in 191 ms of which 2 ms to minimize.
[2024-05-28 19:36:34] [INFO ] Deduced a trap composed of 138 places in 176 ms of which 2 ms to minimize.
[2024-05-28 19:36:34] [INFO ] Deduced a trap composed of 138 places in 182 ms of which 3 ms to minimize.
[2024-05-28 19:36:34] [INFO ] Deduced a trap composed of 138 places in 169 ms of which 2 ms to minimize.
[2024-05-28 19:36:35] [INFO ] Deduced a trap composed of 141 places in 188 ms of which 3 ms to minimize.
[2024-05-28 19:36:35] [INFO ] Deduced a trap composed of 141 places in 214 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 20/193 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:36:38] [INFO ] Deduced a trap composed of 141 places in 157 ms of which 2 ms to minimize.
[2024-05-28 19:36:38] [INFO ] Deduced a trap composed of 141 places in 140 ms of which 2 ms to minimize.
[2024-05-28 19:36:38] [INFO ] Deduced a trap composed of 141 places in 168 ms of which 2 ms to minimize.
[2024-05-28 19:36:38] [INFO ] Deduced a trap composed of 141 places in 162 ms of which 3 ms to minimize.
[2024-05-28 19:36:38] [INFO ] Deduced a trap composed of 138 places in 162 ms of which 3 ms to minimize.
[2024-05-28 19:36:38] [INFO ] Deduced a trap composed of 141 places in 169 ms of which 3 ms to minimize.
[2024-05-28 19:36:39] [INFO ] Deduced a trap composed of 141 places in 167 ms of which 3 ms to minimize.
[2024-05-28 19:36:39] [INFO ] Deduced a trap composed of 141 places in 163 ms of which 2 ms to minimize.
[2024-05-28 19:36:39] [INFO ] Deduced a trap composed of 138 places in 155 ms of which 2 ms to minimize.
[2024-05-28 19:36:39] [INFO ] Deduced a trap composed of 138 places in 153 ms of which 2 ms to minimize.
[2024-05-28 19:36:39] [INFO ] Deduced a trap composed of 138 places in 172 ms of which 3 ms to minimize.
[2024-05-28 19:36:40] [INFO ] Deduced a trap composed of 141 places in 181 ms of which 3 ms to minimize.
[2024-05-28 19:36:40] [INFO ] Deduced a trap composed of 141 places in 166 ms of which 2 ms to minimize.
[2024-05-28 19:36:40] [INFO ] Deduced a trap composed of 141 places in 184 ms of which 2 ms to minimize.
[2024-05-28 19:36:40] [INFO ] Deduced a trap composed of 141 places in 159 ms of which 2 ms to minimize.
[2024-05-28 19:36:40] [INFO ] Deduced a trap composed of 141 places in 175 ms of which 3 ms to minimize.
[2024-05-28 19:36:41] [INFO ] Deduced a trap composed of 138 places in 161 ms of which 2 ms to minimize.
[2024-05-28 19:36:41] [INFO ] Deduced a trap composed of 141 places in 162 ms of which 2 ms to minimize.
[2024-05-28 19:36:41] [INFO ] Deduced a trap composed of 141 places in 157 ms of which 3 ms to minimize.
[2024-05-28 19:36:41] [INFO ] Deduced a trap composed of 141 places in 154 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 20/213 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:36:46] [INFO ] Deduced a trap composed of 233 places in 212 ms of which 3 ms to minimize.
[2024-05-28 19:36:46] [INFO ] Deduced a trap composed of 233 places in 185 ms of which 3 ms to minimize.
[2024-05-28 19:36:46] [INFO ] Deduced a trap composed of 232 places in 215 ms of which 3 ms to minimize.
[2024-05-28 19:36:46] [INFO ] Deduced a trap composed of 230 places in 187 ms of which 4 ms to minimize.
[2024-05-28 19:36:46] [INFO ] Deduced a trap composed of 235 places in 165 ms of which 2 ms to minimize.
[2024-05-28 19:36:47] [INFO ] Deduced a trap composed of 232 places in 166 ms of which 3 ms to minimize.
[2024-05-28 19:36:47] [INFO ] Deduced a trap composed of 231 places in 184 ms of which 2 ms to minimize.
SMT process timed out in 61432ms, After SMT, problems are : Problem set: 0 solved, 759 unsolved
Search for dead transitions found 0 dead transitions in 61449ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 105662 ms. Remains : 532/532 places, 765/765 transitions.
Built C files in :
/tmp/ltsmin5174861052499036632
[2024-05-28 19:36:47] [INFO ] Computing symmetric may disable matrix : 765 transitions.
[2024-05-28 19:36:47] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:36:47] [INFO ] Computing symmetric may enable matrix : 765 transitions.
[2024-05-28 19:36:47] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:36:47] [INFO ] Computing Do-Not-Accords matrix : 765 transitions.
[2024-05-28 19:36:47] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:36:47] [INFO ] Built C files in 144ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5174861052499036632
Running compilation step : cd /tmp/ltsmin5174861052499036632;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2279 ms.
Running link step : cd /tmp/ltsmin5174861052499036632;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 94 ms.
Running LTSmin : cd /tmp/ltsmin5174861052499036632;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11095625134788574630.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 19:37:02] [INFO ] Flatten gal took : 51 ms
[2024-05-28 19:37:02] [INFO ] Flatten gal took : 63 ms
[2024-05-28 19:37:02] [INFO ] Time to serialize gal into /tmp/LTL17640674024402324236.gal : 21 ms
[2024-05-28 19:37:02] [INFO ] Time to serialize properties into /tmp/LTL2968648511612627649.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17640674024402324236.gal' '-t' 'CGAL' '-hoa' '/tmp/aut780226684550422689.hoa' '-atoms' '/tmp/LTL2968648511612627649.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2968648511612627649.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut780226684550422689.hoa
Detected timeout of ITS tools.
[2024-05-28 19:37:17] [INFO ] Flatten gal took : 56 ms
[2024-05-28 19:37:17] [INFO ] Flatten gal took : 46 ms
[2024-05-28 19:37:17] [INFO ] Time to serialize gal into /tmp/LTL6534369219272485605.gal : 9 ms
[2024-05-28 19:37:17] [INFO ] Time to serialize properties into /tmp/LTL11163053004467854452.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6534369219272485605.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11163053004467854452.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(Check_Sources_E<=Perform_Work_E)"))))
Formula 0 simplified : GF!"(Check_Sources_E<=Perform_Work_E)"
Detected timeout of ITS tools.
[2024-05-28 19:37:32] [INFO ] Flatten gal took : 49 ms
[2024-05-28 19:37:32] [INFO ] Applying decomposition
[2024-05-28 19:37:33] [INFO ] Flatten gal took : 52 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8172123003943681862.txt' '-o' '/tmp/graph8172123003943681862.bin' '-w' '/tmp/graph8172123003943681862.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8172123003943681862.bin' '-l' '-1' '-v' '-w' '/tmp/graph8172123003943681862.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:37:33] [INFO ] Decomposing Gal with order
[2024-05-28 19:37:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:37:33] [INFO ] Removed a total of 456 redundant transitions.
[2024-05-28 19:37:33] [INFO ] Flatten gal took : 257 ms
[2024-05-28 19:37:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 36 ms.
[2024-05-28 19:37:33] [INFO ] Time to serialize gal into /tmp/LTL11353745842238470488.gal : 18 ms
[2024-05-28 19:37:33] [INFO ] Time to serialize properties into /tmp/LTL4623496228982583315.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11353745842238470488.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4623496228982583315.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(gu43.Check_Sources_E<=gu43.Perform_Work_E)"))))
Formula 0 simplified : GF!"(gu43.Check_Sources_E<=gu43.Perform_Work_E)"
Detected timeout of ITS tools.
Treatment of property PolyORBNT-COL-S05J40-LTLCardinality-15 finished in 364677 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)))'
[2024-05-28 19:37:49] [INFO ] Flatten gal took : 103 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9073460691946258625
[2024-05-28 19:37:49] [INFO ] Computing symmetric may disable matrix : 857 transitions.
[2024-05-28 19:37:49] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:37:49] [INFO ] Applying decomposition
[2024-05-28 19:37:49] [INFO ] Computing symmetric may enable matrix : 857 transitions.
[2024-05-28 19:37:49] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:37:49] [INFO ] Flatten gal took : 92 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3223552320350631387.txt' '-o' '/tmp/graph3223552320350631387.bin' '-w' '/tmp/graph3223552320350631387.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3223552320350631387.bin' '-l' '-1' '-v' '-w' '/tmp/graph3223552320350631387.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:37:49] [INFO ] Decomposing Gal with order
[2024-05-28 19:37:49] [INFO ] Computing Do-Not-Accords matrix : 857 transitions.
[2024-05-28 19:37:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:37:49] [INFO ] Computation of Completed DNA matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:37:49] [INFO ] Built C files in 352ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9073460691946258625
Running compilation step : cd /tmp/ltsmin9073460691946258625;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-28 19:37:49] [INFO ] Removed a total of 900 redundant transitions.
[2024-05-28 19:37:49] [INFO ] Flatten gal took : 181 ms
[2024-05-28 19:37:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 138 labels/synchronizations in 43 ms.
[2024-05-28 19:37:49] [INFO ] Time to serialize gal into /tmp/LTLCardinality2556957176002193257.gal : 30 ms
[2024-05-28 19:37:49] [INFO ] Time to serialize properties into /tmp/LTLCardinality15961153682299828703.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2556957176002193257.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15961153682299828703.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((F(G("(gu68.Check_Sources_E<=gu68.Perform_Work_E)"))))
Formula 0 simplified : GF!"(gu68.Check_Sources_E<=gu68.Perform_Work_E)"
Compilation finished in 2992 ms.
Running link step : cd /tmp/ltsmin9073460691946258625;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin9073460691946258625;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.171: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.181: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.255: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.655: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.986: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 1.506: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 1.559: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 1.559: Initializing POR dependencies: labels 858, guards 857
pins2lts-mc-linux64( 1/ 8), 2.515: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 14.847: LTL layer: formula: <>([]((LTLAPp0==true)))
pins2lts-mc-linux64( 4/ 8), 14.847: "<>([]((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 14.869: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 16.033: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 16.052: There are 859 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 16.052: State length is 625, there are 861 groups
pins2lts-mc-linux64( 0/ 8), 16.052: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 16.052: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 16.052: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 16.052: Visible groups: 0 / 861, labels: 1 / 859
pins2lts-mc-linux64( 0/ 8), 16.052: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 16.052: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 4/ 8), 16.225: [Blue] ~53 levels ~960 states ~2704 transitions
pins2lts-mc-linux64( 4/ 8), 16.301: [Blue] ~53 levels ~1920 states ~4480 transitions
pins2lts-mc-linux64( 4/ 8), 16.501: [Blue] ~53 levels ~3840 states ~8416 transitions
pins2lts-mc-linux64( 4/ 8), 16.962: [Blue] ~53 levels ~7680 states ~15864 transitions
pins2lts-mc-linux64( 4/ 8), 17.953: [Blue] ~53 levels ~15360 states ~30376 transitions
pins2lts-mc-linux64( 4/ 8), 19.913: [Blue] ~53 levels ~30720 states ~59920 transitions
pins2lts-mc-linux64( 4/ 8), 24.420: [Blue] ~53 levels ~61440 states ~119072 transitions
pins2lts-mc-linux64( 4/ 8), 33.367: [Blue] ~53 levels ~122880 states ~229472 transitions
pins2lts-mc-linux64( 4/ 8), 49.439: [Blue] ~53 levels ~245760 states ~455680 transitions
pins2lts-mc-linux64( 4/ 8), 78.006: [Blue] ~53 levels ~491520 states ~880584 transitions
pins2lts-mc-linux64( 4/ 8), 128.566: [Blue] ~53 levels ~983040 states ~1732944 transitions
pins2lts-mc-linux64( 4/ 8), 186.851: [Blue] ~55 levels ~1966080 states ~3476376 transitions
pins2lts-mc-linux64( 4/ 8), 288.626: [Blue] ~55 levels ~3932160 states ~6713888 transitions
pins2lts-mc-linux64( 5/ 8), 467.483: [Blue] ~55 levels ~7864320 states ~13310680 transitions
pins2lts-mc-linux64( 4/ 8), 768.369: [Blue] ~55 levels ~15728640 states ~26173528 transitions
pins2lts-mc-linux64( 4/ 8), 1348.418: [Blue] ~55 levels ~31457280 states ~51885784 transitions
pins2lts-mc-linux64( 1/ 8), 1408.843: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1408.893:
pins2lts-mc-linux64( 0/ 8), 1408.893: Explored 29729969 states 55358482 transitions, fanout: 1.862
pins2lts-mc-linux64( 0/ 8), 1408.893: Total exploration time 1392.830 sec (1392.730 sec minimum, 1392.785 sec on average)
pins2lts-mc-linux64( 0/ 8), 1408.893: States per second: 21345, Transitions per second: 39745
pins2lts-mc-linux64( 0/ 8), 1408.893:
pins2lts-mc-linux64( 0/ 8), 1408.893: State space has 29732521 states, 2 are accepting
pins2lts-mc-linux64( 0/ 8), 1408.893: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1408.893: blue states: 29729969 (99.99%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1408.893: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1408.893: all-red states: 12284449 (41.32%), bogus 5 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1408.893:
pins2lts-mc-linux64( 0/ 8), 1408.893: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 1408.893:
pins2lts-mc-linux64( 0/ 8), 1408.893: Queue width: 8B, total height: 326, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 1408.893: Tree memory: 482.8MB, 17.0 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 1408.893: Tree fill ratio (roots/leafs): 22.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1408.893: Stored 864 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1408.893: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1408.893: Est. total memory use: 482.8MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9073460691946258625;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9073460691946258625;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
ITS-tools command line returned an error code 137
[2024-05-28 20:03:23] [INFO ] Applying decomposition
[2024-05-28 20:03:23] [INFO ] Flatten gal took : 53 ms
[2024-05-28 20:03:23] [INFO ] Decomposing Gal with order
[2024-05-28 20:03:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:03:23] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to block in partition [CreatedJobs_0],[CreatedJobs_1],[CreatedJobs_2],[CreatedJobs_3],[CreatedJobs_4],[CreatedJobs_5],[CreatedJobs_6],[CreatedJobs_7],[CreatedJobs_8],[CreatedJobs_9],[CreatedJobs_10],[CreatedJobs_11],[CreatedJobs_12],[CreatedJobs_13],[CreatedJobs_14],[CreatedJobs_15],[CreatedJobs_16],[CreatedJobs_17],[CreatedJobs_18],[CreatedJobs_19],[CreatedJobs_20],[CreatedJobs_21],[CreatedJobs_22],[CreatedJobs_23],[CreatedJobs_24],[CreatedJobs_25],[CreatedJobs_26],[CreatedJobs_27],[CreatedJobs_28],[CreatedJobs_29],[CreatedJobs_30],[CreatedJobs_31],[CreatedJobs_32],[CreatedJobs_33],[CreatedJobs_34],[CreatedJobs_35],[CreatedJobs_36],[CreatedJobs_37],[CreatedJobs_38],[CreatedJobs_39],[CreatedJobs_40],[CreatedJobs_41],[CreatedJobs_42],[CreatedJobs_43],[CreatedJobs_44],[CreatedJobs_45],[CreatedJobs_46],[CreatedJobs_47],[CreatedJobs_48],[CreatedJobs_49],[CreatedJobs_50],[CreatedJobs_51],[CreatedJobs_52],[CreatedJobs_53],[CreatedJobs_54],[CreatedJobs_55],[CreatedJobs_56],[CreatedJobs_57],[CreatedJobs_58],[CreatedJobs_59],[CreatedJobs_60],[CreatedJobs_61],[CreatedJobs_62],[CreatedJobs_63],[CreatedJobs_64],[CreatedJobs_65],[CreatedJobs_66],[CreatedJobs_67],[CreatedJobs_68],[CreatedJobs_69],[CreatedJobs_70],[CreatedJobs_71],[CreatedJobs_72],[CreatedJobs_73],[CreatedJobs_74],[CreatedJobs_75],[CreatedJobs_76],[CreatedJobs_77],[CreatedJobs_78],[CreatedJobs_79],[CreatedJobs_80],[CreatedJobs_81],[CreatedJobs_82],[CreatedJobs_83],[CreatedJobs_84],[CreatedJobs_85],[CreatedJobs_86],[CreatedJobs_87],[CreatedJobs_88],[CreatedJobs_89],[CreatedJobs_90],[CreatedJobs_91],[CreatedJobs_92],[CreatedJobs_93],[CreatedJobs_94],[CreatedJobs_95],[CreatedJobs_96],[CreatedJobs_97],[CreatedJobs_98],[CreatedJobs_99],[CreatedJobs_100],[CreatedJobs_101],[CreatedJobs_102],[CreatedJobs_103],[CreatedJobs_104],[CreatedJobs_105],[CreatedJobs_106],[CreatedJobs_107],[CreatedJobs_108],[CreatedJobs_109],[CreatedJobs_110],[CreatedJobs_111],[CreatedJobs_112],[CreatedJobs_113],[CreatedJobs_114],[CreatedJobs_115],[CreatedJobs_116],[CreatedJobs_117],[CreatedJobs_118],[CreatedJobs_119],[CreatedJobs_120],[CreatedJobs_121],[CreatedJobs_122],[CreatedJobs_123],[CreatedJobs_124],[CreatedJobs_125],[CreatedJobs_126],[CreatedJobs_127],[CreatedJobs_128],[CreatedJobs_129],[CreatedJobs_130],[CreatedJobs_131],[CreatedJobs_132],[CreatedJobs_133],[CreatedJobs_134],[CreatedJobs_135],[CreatedJobs_136],[CreatedJobs_137],[CreatedJobs_138],[CreatedJobs_139],[CreatedJobs_140],[CreatedJobs_141],[CreatedJobs_142],[CreatedJobs_143],[CreatedJobs_144],[CreatedJobs_145],[CreatedJobs_146],[CreatedJobs_147],[CreatedJobs_148],[CreatedJobs_149],[CreatedJobs_150],[CreatedJobs_151],[CreatedJobs_152],[CreatedJobs_153],[CreatedJobs_154],[CreatedJobs_155],[CreatedJobs_156],[CreatedJobs_157],[CreatedJobs_158],[CreatedJobs_159],[CreatedJobs_160],[CreatedJobs_161],[CreatedJobs_162],[CreatedJobs_163],[CreatedJobs_164],[CreatedJobs_165],[CreatedJobs_166],[CreatedJobs_167],[CreatedJobs_168],[CreatedJobs_169],[CreatedJobs_170],[CreatedJobs_171],[CreatedJobs_172],[CreatedJobs_173],[CreatedJobs_174],[CreatedJobs_175],[CreatedJobs_176],[CreatedJobs_177],[CreatedJobs_178],[CreatedJobs_179],[CreatedJobs_180],[CreatedJobs_181],[CreatedJobs_182],[CreatedJobs_183],[CreatedJobs_184],[CreatedJobs_185],[CreatedJobs_186],[CreatedJobs_187],[CreatedJobs_188],[CreatedJobs_189],[CreatedJobs_190],[CreatedJobs_191],[CreatedJobs_192],[CreatedJobs_193],[CreatedJobs_194],[CreatedJobs_195],[CreatedJobs_196],[CreatedJobs_197],[CreatedJobs_198],[CreatedJobs_199],[CreatedJobs_200],[CreatedJobs_201],[CreatedJobs_202],[CreatedJobs_203],[CreatedJobs_204],[Schedule_Task_E_0],[Schedule_Task_E_1],[Schedule_Task_E_2],[Schedule_Task_E_3],[Schedule_Task_E_4],[Schedule_Task_E_5],[Schedule_Task_E_6],[Schedule_Task_E_7],[Schedule_Task_E_8],[Schedule_Task_E_9],[Schedule_Task_E_10],[Schedule_Task_E_11],[Schedule_Task_E_12],[Schedule_Task_E_13],[Schedule_Task_E_14],[Schedule_Task_E_15],[Schedule_Task_E_16],[Schedule_Task_E_17],[Schedule_Task_E_18],[Schedule_Task_E_19],[Schedule_Task_E_20],[Schedule_Task_E_21],[Schedule_Task_E_22],[Schedule_Task_E_23],[Schedule_Task_E_24],[Schedule_Task_E_25],[Schedule_Task_E_26],[Schedule_Task_E_27],[Schedule_Task_E_28],[Schedule_Task_E_29],[Schedule_Task_E_30],[Schedule_Task_E_31],[Schedule_Task_E_32],[Schedule_Task_E_33],[Schedule_Task_E_34],[Schedule_Task_E_35],[Schedule_Task_E_36],[Schedule_Task_E_37],[Schedule_Task_E_38],[Schedule_Task_E_39],[Schedule_Task_E_40],[Schedule_Task_E_41],[f3_0, f2_0, f1_0, AvailableJobId_0],[f3_1, f2_1, f1_1, AvailableJobId_1],[f3_2, f2_2, f1_2, AvailableJobId_2],[f3_3, f2_3, f1_3, AvailableJobId_3],[f3_4, f2_4, f1_4, AvailableJobId_4],[f3_5, f2_5, f1_5, AvailableJobId_5],[f3_6, f2_6, f1_6, AvailableJobId_6],[f3_7, f2_7, f1_7, AvailableJobId_7],[f3_8, f2_8, f1_8, AvailableJobId_8],[f3_9, f2_9, f1_9, AvailableJobId_9],[f3_10, f2_10, f1_10, AvailableJobId_10],[f3_11, f2_11, f1_11, AvailableJobId_11],[f3_12, f2_12, f1_12, AvailableJobId_12],[f3_13, f2_13, f1_13, AvailableJobId_13],[f3_14, f2_14, f1_14, AvailableJobId_14],[f3_15, f2_15, f1_15, AvailableJobId_15],[f3_16, f2_16, f1_16, AvailableJobId_16],[f3_17, f2_17, f1_17, AvailableJobId_17],[f3_18, f2_18, f1_18, AvailableJobId_18],[f3_19, f2_19, f1_19, AvailableJobId_19],[f3_20, f2_20, f1_20, AvailableJobId_20],[f3_21, f2_21, f1_21, AvailableJobId_21],[f3_22, f2_22, f1_22, AvailableJobId_22],[f3_23, f2_23, f1_23, AvailableJobId_23],[f3_24, f2_24, f1_24, AvailableJobId_24],[f3_25, f2_25, f1_25, AvailableJobId_25],[f3_26, f2_26, f1_26, AvailableJobId_26],[f3_27, f2_27, f1_27, AvailableJobId_27],[f3_28, f2_28, f1_28, AvailableJobId_28],[f3_29, f2_29, f1_29, AvailableJobId_29],[f3_30, f2_30, f1_30, AvailableJobId_30],[f3_31, f2_31, f1_31, AvailableJobId_31],[f3_32, f2_32, f1_32, AvailableJobId_32],[f3_33, f2_33, f1_33, AvailableJobId_33],[f3_34, f2_34, f1_34, AvailableJobId_34],[f3_35, f2_35, f1_35, AvailableJobId_35],[f3_36, f2_36, f1_36, AvailableJobId_36],[f3_37, f2_37, f1_37, AvailableJobId_37],[f3_38, f2_38, f1_38, AvailableJobId_38],[f3_39, f2_39, f1_39, AvailableJobId_39],[f3_40, f2_40, f1_40, AvailableJobId_40],[FetchJobE_0, QueueJobB_0, NotifyEventJobQueuedB_0, Perform_Work_B_0],[FetchJobE_1, QueueJobB_1, NotifyEventJobQueuedB_1, Perform_Work_B_1],[FetchJobE_2, QueueJobB_2, NotifyEventJobQueuedB_2, Perform_Work_B_2],[FetchJobE_3, QueueJobB_3, NotifyEventJobQueuedB_3, Perform_Work_B_3],[FetchJobE_4, QueueJobB_4, NotifyEventJobQueuedB_4, Perform_Work_B_4],[FetchJobE_5, QueueJobB_5, NotifyEventJobQueuedB_5, Perform_Work_B_5],[FetchJobE_6, QueueJobB_6, NotifyEventJobQueuedB_6, Perform_Work_B_6],[FetchJobE_7, QueueJobB_7, NotifyEventJobQueuedB_7, Perform_Work_B_7],[FetchJobE_8, QueueJobB_8, NotifyEventJobQueuedB_8, Perform_Work_B_8],[FetchJobE_9, QueueJobB_9, NotifyEventJobQueuedB_9, Perform_Work_B_9],[FetchJobE_10, QueueJobB_10, NotifyEventJobQueuedB_10, Perform_Work_B_10],[FetchJobE_11, QueueJobB_11, NotifyEventJobQueuedB_11, Perform_Work_B_11],[FetchJobE_12, QueueJobB_12, NotifyEventJobQueuedB_12, Perform_Work_B_12],[FetchJobE_13, QueueJobB_13, NotifyEventJobQueuedB_13, Perform_Work_B_13],[FetchJobE_14, QueueJobB_14, NotifyEventJobQueuedB_14, Perform_Work_B_14],[FetchJobE_15, QueueJobB_15, NotifyEventJobQueuedB_15, Perform_Work_B_15],[FetchJobE_16, QueueJobB_16, NotifyEventJobQueuedB_16, Perform_Work_B_16],[FetchJobE_17, QueueJobB_17, NotifyEventJobQueuedB_17, Perform_Work_B_17],[FetchJobE_18, QueueJobB_18, NotifyEventJobQueuedB_18, Perform_Work_B_18],[FetchJobE_19, QueueJobB_19, NotifyEventJobQueuedB_19, Perform_Work_B_19],[FetchJobE_20, QueueJobB_20, NotifyEventJobQueuedB_20, Perform_Work_B_20],[FetchJobE_21, QueueJobB_21, NotifyEventJobQueuedB_21, Perform_Work_B_21],[FetchJobE_22, QueueJobB_22, NotifyEventJobQueuedB_22, Perform_Work_B_22],[FetchJobE_23, QueueJobB_23, NotifyEventJobQueuedB_23, Perform_Work_B_23],[FetchJobE_24, QueueJobB_24, NotifyEventJobQueuedB_24, Perform_Work_B_24],[FetchJobE_25, QueueJobB_25, NotifyEventJobQueuedB_25, Perform_Work_B_25],[FetchJobE_26, QueueJobB_26, NotifyEventJobQueuedB_26, Perform_Work_B_26],[FetchJobE_27, QueueJobB_27, NotifyEventJobQueuedB_27, Perform_Work_B_27],[FetchJobE_28, QueueJobB_28, NotifyEventJobQueuedB_28, Perform_Work_B_28],[FetchJobE_29, QueueJobB_29, NotifyEventJobQueuedB_29, Perform_Work_B_29],[FetchJobE_30, QueueJobB_30, NotifyEventJobQueuedB_30, Perform_Work_B_30],[FetchJobE_31, QueueJobB_31, NotifyEventJobQueuedB_31, Perform_Work_B_31],[FetchJobE_32, QueueJobB_32, NotifyEventJobQueuedB_32, Perform_Work_B_32],[FetchJobE_33, QueueJobB_33, NotifyEventJobQueuedB_33, Perform_Work_B_33],[FetchJobE_34, QueueJobB_34, NotifyEventJobQueuedB_34, Perform_Work_B_34],[FetchJobE_35, QueueJobB_35, NotifyEventJobQueuedB_35, Perform_Work_B_35],[FetchJobE_36, QueueJobB_36, NotifyEventJobQueuedB_36, Perform_Work_B_36],[FetchJobE_37, QueueJobB_37, NotifyEventJobQueuedB_37, Perform_Work_B_37],[FetchJobE_38, QueueJobB_38, NotifyEventJobQueuedB_38, Perform_Work_B_38],[FetchJobE_39, QueueJobB_39, NotifyEventJobQueuedB_39, Perform_Work_B_39],[FetchJobE_40, QueueJobB_40, NotifyEventJobQueuedB_40, Perform_Work_B_40],[place_482_0],[place_482_1],[place_482_2],[place_482_3],[place_482_4],[ModifiedSrc_0, TheSour_0],[ModifiedSrc_1, TheSour_1],[ModifiedSrc_2, TheSour_2],[ModifiedSrc_3, TheSour_3],[ModifiedSrc_4, TheSour_4],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:1011)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-28 20:03:23] [INFO ] Flatten gal took : 47 ms
[2024-05-28 20:03:23] [INFO ] Time to serialize gal into /tmp/LTLCardinality17902799007883988210.gal : 12 ms
[2024-05-28 20:03:23] [INFO ] Time to serialize properties into /tmp/LTLCardinality1288523282597911454.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17902799007883988210.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1288523282597911454.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((F(G("(Check_Sources_E<=Perform_Work_E)"))))
Formula 0 simplified : GF!"(Check_Sources_E<=Perform_Work_E)"
ITS-tools command line returned an error code 137
[2024-05-28 20:15:14] [INFO ] Flatten gal took : 76 ms
[2024-05-28 20:15:14] [INFO ] Input system was already deterministic with 857 transitions.
[2024-05-28 20:15:14] [INFO ] Transformed 624 places.
[2024-05-28 20:15:14] [INFO ] Transformed 857 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 20:15:44] [INFO ] Time to serialize gal into /tmp/LTLCardinality11264310753851564366.gal : 9 ms
[2024-05-28 20:15:44] [INFO ] Time to serialize properties into /tmp/LTLCardinality267157394856910243.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11264310753851564366.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality267157394856910243.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("(Check_Sources_E<=Perform_Work_E)"))))
Formula 0 simplified : GF!"(Check_Sources_E<=Perform_Work_E)"

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-COL-S05J40"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is PolyORBNT-COL-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 r290-tajo-171654447000379"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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