Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 8.8K Apr 11 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 11 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 11 16:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 11 16:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 11 16:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 16:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S02J04T10-LTLCardinality-00
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLCardinality-01
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLCardinality-02
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLCardinality-03
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLCardinality-04
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLCardinality-05
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLCardinality-06
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLCardinality-07
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLCardinality-08
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLCardinality-09
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717248319586

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J04T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:25:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 13:25:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:25:21] [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-06-01 13:25:21] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 13:25:21] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 822 ms
[2024-06-01 13:25:22] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 752 PT places and 1664.0 transition bindings in 37 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 13:25:22] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 7 ms.
[2024-06-01 13:25:22] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-06 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 40000 steps (11 resets) in 1660 ms. (24 steps per ms) remains 10/24 properties
BEST_FIRST walk for 40002 steps (11 resets) in 766 ms. (52 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40000 steps (14 resets) in 397 ms. (100 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 241 ms. (165 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 231 ms. (172 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (9 resets) in 203 ms. (196 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (16 resets) in 200 ms. (199 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (13 resets) in 233 ms. (170 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (15 resets) in 156 ms. (254 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (14 resets) in 196 ms. (203 steps per ms) remains 9/9 properties
[2024-06-01 13:25:23] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 13:25:23] [INFO ] Computed 26 invariants in 8 ms
[2024-06-01 13:25:23] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 39/52 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp22 is UNSAT
At refinement iteration 3 (OVERLAPS) 5/57 variables, 4/10 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
At refinement iteration 5 (OVERLAPS) 22/79 variables, 14/24 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/24 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/80 variables, 1/25 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/25 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/81 variables, 1/26 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/81 variables, 0/26 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 64/145 variables, 81/107 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/145 variables, 8/115 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 6 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 6 solved, 3 unsolved in 323 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 39/44 variables, 4/4 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/50 variables, 4/8 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/51 variables, 1/9 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 24/75 variables, 13/22 constraints. Problems are: Problem set: 6 solved, 3 unsolved
[2024-06-01 13:25:24] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 9 ms to minimize.
[2024-06-01 13:25:24] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 2 ms to minimize.
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 2/24 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/75 variables, 0/24 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/77 variables, 1/25 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/77 variables, 0/25 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/79 variables, 2/27 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/79 variables, 0/27 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 64/143 variables, 79/106 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/143 variables, 8/114 constraints. Problems are: Problem set: 8 solved, 1 unsolved
Problem AtomicPropp2 is UNSAT
After SMT solving in domain Int declared 143/145 variables, and 115 constraints, problems are : Problem set: 9 solved, 0 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 79/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/9 constraints, Known Traps: 2/2 constraints]
After SMT, in 722ms problems are : Problem set: 9 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 9 atomic propositions for a total of 14 simplifications.
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:25:24] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2024-06-01 13:25:24] [INFO ] Flatten gal took : 40 ms
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:25:24] [INFO ] Flatten gal took : 11 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-06-01 13:25:24] [INFO ] Unfolded HLPN to a Petri net with 752 places and 1572 transitions 7262 arcs in 46 ms.
[2024-06-01 13:25:24] [INFO ] Unfolded 7 HLPN properties in 0 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Support contains 170 out of 752 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 740 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 740 transition count 1402
Applied a total of 22 rules in 78 ms. Remains 740 /752 variables (removed 12) and now considering 1402/1412 (removed 10) transitions.
Running 1400 sub problems to find dead transitions.
[2024-06-01 13:25:24] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
// Phase 1: matrix 1382 rows 740 cols
[2024-06-01 13:25:24] [INFO ] Computed 52 invariants in 72 ms
[2024-06-01 13:25:24] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/738 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/738 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-06-01 13:25:41] [INFO ] Deduced a trap composed of 64 places in 119 ms of which 3 ms to minimize.
[2024-06-01 13:25:41] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:25:41] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:25:41] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:25:41] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 1 ms to minimize.
[2024-06-01 13:25:41] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:25:41] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:25:41] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:25:42] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 12 ms to minimize.
[2024-06-01 13:25:43] [INFO ] Deduced a trap composed of 230 places in 383 ms of which 6 ms to minimize.
[2024-06-01 13:25:44] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 738/2122 variables, and 61 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 37/38 constraints, State Equation: 0/740 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/738 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/738 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/738 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-06-01 13:25:50] [INFO ] Deduced a trap composed of 379 places in 398 ms of which 6 ms to minimize.
[2024-06-01 13:26:03] [INFO ] Deduced a trap composed of 83 places in 213 ms of which 4 ms to minimize.
[2024-06-01 13:26:03] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 738/2122 variables, and 64 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 37/38 constraints, State Equation: 0/740 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 14/14 constraints]
After SMT, in 42260ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 42286ms
[2024-06-01 13:26:07] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-06-01 13:26:07] [INFO ] Invariant cache hit.
[2024-06-01 13:26:07] [INFO ] Implicit Places using invariants in 497 ms returned [574, 575, 576, 577, 578, 579, 580, 581, 582, 583]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 511 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/752 places, 1402/1412 transitions.
Applied a total of 0 rules in 30 ms. Remains 730 /730 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42929 ms. Remains : 730/752 places, 1402/1412 transitions.
Support contains 170 out of 730 places after structural reductions.
[2024-06-01 13:26:07] [INFO ] Flatten gal took : 102 ms
[2024-06-01 13:26:07] [INFO ] Flatten gal took : 85 ms
[2024-06-01 13:26:08] [INFO ] Input system was already deterministic with 1402 transitions.
RANDOM walk for 10177 steps (2 resets) in 88 ms. (114 steps per ms) remains 0/13 properties
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(F(p0))'
Support contains 32 out of 730 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 730/730 places, 1402/1402 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 730 transition count 1362
Reduce places removed 40 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 50 rules applied. Total rules applied 90 place count 690 transition count 1352
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 100 place count 680 transition count 1352
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 70 Pre rules applied. Total rules applied 100 place count 680 transition count 1282
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 240 place count 610 transition count 1282
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 400 place count 530 transition count 1202
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 410 place count 520 transition count 1192
Iterating global reduction 3 with 10 rules applied. Total rules applied 420 place count 520 transition count 1192
Applied a total of 420 rules in 140 ms. Remains 520 /730 variables (removed 210) and now considering 1192/1402 (removed 210) transitions.
Running 1190 sub problems to find dead transitions.
[2024-06-01 13:26:08] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
// Phase 1: matrix 1172 rows 520 cols
[2024-06-01 13:26:08] [INFO ] Computed 42 invariants in 34 ms
[2024-06-01 13:26:08] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
[2024-06-01 13:26:19] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 2 ms to minimize.
[2024-06-01 13:26:19] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:26:19] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:26:19] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:26:20] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 2 ms to minimize.
[2024-06-01 13:26:20] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 2 ms to minimize.
[2024-06-01 13:26:20] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:26:20] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 0 ms to minimize.
[2024-06-01 13:26:20] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:26:20] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:26:21] [INFO ] Deduced a trap composed of 258 places in 327 ms of which 4 ms to minimize.
[2024-06-01 13:26:21] [INFO ] Deduced a trap composed of 223 places in 275 ms of which 4 ms to minimize.
[2024-06-01 13:26:21] [INFO ] Deduced a trap composed of 252 places in 288 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 518/1692 variables, and 53 constraints, problems are : Problem set: 0 solved, 1190 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1190/1190 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
[2024-06-01 13:26:37] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 2 ms to minimize.
[2024-06-01 13:26:41] [INFO ] Deduced a trap composed of 37 places in 172 ms of which 2 ms to minimize.
[2024-06-01 13:26:46] [INFO ] Deduced a trap composed of 121 places in 275 ms of which 4 ms to minimize.
[2024-06-01 13:26:47] [INFO ] Deduced a trap composed of 194 places in 282 ms of which 4 ms to minimize.
[2024-06-01 13:26:48] [INFO ] Deduced a trap composed of 3 places in 309 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 518/1692 variables, and 58 constraints, problems are : Problem set: 0 solved, 1190 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1190 constraints, Known Traps: 18/18 constraints]
After SMT, in 42224ms problems are : Problem set: 0 solved, 1190 unsolved
Search for dead transitions found 0 dead transitions in 42235ms
[2024-06-01 13:26:50] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-06-01 13:26:50] [INFO ] Invariant cache hit.
[2024-06-01 13:26:51] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-06-01 13:26:51] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-06-01 13:26:51] [INFO ] Invariant cache hit.
[2024-06-01 13:26:51] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:26:56] [INFO ] Implicit Places using invariants and state equation in 5198 ms returned []
Implicit Place search using SMT with State Equation took 5576 ms to find 0 implicit places.
[2024-06-01 13:26:56] [INFO ] Redundant transitions in 74 ms returned []
Running 1190 sub problems to find dead transitions.
[2024-06-01 13:26:56] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-06-01 13:26:56] [INFO ] Invariant cache hit.
[2024-06-01 13:26:56] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
[2024-06-01 13:27:07] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 5 ms to minimize.
[2024-06-01 13:27:07] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 2 ms to minimize.
[2024-06-01 13:27:07] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:27:07] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:27:07] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:27:07] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:27:07] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:27:07] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:27:07] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 0 ms to minimize.
[2024-06-01 13:27:08] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:27:08] [INFO ] Deduced a trap composed of 279 places in 311 ms of which 4 ms to minimize.
[2024-06-01 13:27:08] [INFO ] Deduced a trap composed of 223 places in 273 ms of which 3 ms to minimize.
[2024-06-01 13:27:09] [INFO ] Deduced a trap composed of 240 places in 269 ms of which 3 ms to minimize.
[2024-06-01 13:27:20] [INFO ] Deduced a trap composed of 217 places in 282 ms of which 4 ms to minimize.
[2024-06-01 13:27:21] [INFO ] Deduced a trap composed of 212 places in 284 ms of which 4 ms to minimize.
[2024-06-01 13:27:21] [INFO ] Deduced a trap composed of 216 places in 297 ms of which 4 ms to minimize.
[2024-06-01 13:27:22] [INFO ] Deduced a trap composed of 53 places in 188 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
[2024-06-01 13:27:26] [INFO ] Deduced a trap composed of 310 places in 272 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 518/1692 variables, and 58 constraints, problems are : Problem set: 0 solved, 1190 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1190/1190 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
[2024-06-01 13:27:44] [INFO ] Deduced a trap composed of 107 places in 255 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 518/1692 variables, and 59 constraints, problems are : Problem set: 0 solved, 1190 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1190 constraints, Known Traps: 19/19 constraints]
After SMT, in 62228ms problems are : Problem set: 0 solved, 1190 unsolved
Search for dead transitions found 0 dead transitions in 62246ms
Starting structural reductions in SI_LTL mode, iteration 1 : 520/730 places, 1192/1402 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 110288 ms. Remains : 520/730 places, 1192/1402 transitions.
Stuttering acceptance computed with spot in 246 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLCardinality-02
Product exploration explored 100000 steps with 2317 reset in 662 ms.
Product exploration explored 100000 steps with 2319 reset in 450 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 162 steps (0 resets) in 5 ms. (27 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2024-06-01 13:28:00] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-06-01 13:28:00] [INFO ] Invariant cache hit.
[2024-06-01 13:28:01] [INFO ] [Real]Absence check using 13 positive place invariants in 36 ms returned sat
[2024-06-01 13:28:01] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 140 ms returned sat
[2024-06-01 13:28:02] [INFO ] [Real]Absence check using state equation in 1475 ms returned sat
[2024-06-01 13:28:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:28:03] [INFO ] [Nat]Absence check using 13 positive place invariants in 86 ms returned sat
[2024-06-01 13:28:03] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 48 ms returned sat
[2024-06-01 13:28:05] [INFO ] [Nat]Absence check using state equation in 2092 ms returned sat
[2024-06-01 13:28:05] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:28:06] [INFO ] [Nat]Added 120 Read/Feed constraints in 632 ms returned sat
[2024-06-01 13:28:06] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 1 ms to minimize.
[2024-06-01 13:28:07] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 1 ms to minimize.
[2024-06-01 13:28:07] [INFO ] Deduced a trap composed of 51 places in 228 ms of which 6 ms to minimize.
[2024-06-01 13:28:08] [INFO ] Deduced a trap composed of 45 places in 220 ms of which 3 ms to minimize.
[2024-06-01 13:28:08] [INFO ] Deduced a trap composed of 26 places in 226 ms of which 3 ms to minimize.
[2024-06-01 13:28:08] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:28:09] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:28:09] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:28:10] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 2 ms to minimize.
[2024-06-01 13:28:10] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3918 ms
[2024-06-01 13:28:10] [INFO ] Computed and/alt/rep : 410/868/400 causal constraints (skipped 770 transitions) in 140 ms.
[2024-06-01 13:28:12] [INFO ] Added : 95 causal constraints over 19 iterations in 2376 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 32 out of 520 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 520/520 places, 1192/1192 transitions.
Applied a total of 0 rules in 51 ms. Remains 520 /520 variables (removed 0) and now considering 1192/1192 (removed 0) transitions.
Running 1190 sub problems to find dead transitions.
[2024-06-01 13:28:12] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-06-01 13:28:12] [INFO ] Invariant cache hit.
[2024-06-01 13:28:12] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
[2024-06-01 13:28:23] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2024-06-01 13:28:23] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 2 ms to minimize.
[2024-06-01 13:28:24] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:28:24] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:28:24] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:28:24] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:28:24] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:28:24] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 2 ms to minimize.
[2024-06-01 13:28:24] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:28:25] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:28:25] [INFO ] Deduced a trap composed of 279 places in 322 ms of which 4 ms to minimize.
[2024-06-01 13:28:25] [INFO ] Deduced a trap composed of 223 places in 282 ms of which 4 ms to minimize.
[2024-06-01 13:28:26] [INFO ] Deduced a trap composed of 240 places in 289 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 518/1692 variables, and 53 constraints, problems are : Problem set: 0 solved, 1190 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1190/1190 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
[2024-06-01 13:28:42] [INFO ] Deduced a trap composed of 310 places in 298 ms of which 4 ms to minimize.
[2024-06-01 13:28:43] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 2 ms to minimize.
[2024-06-01 13:28:51] [INFO ] Deduced a trap composed of 229 places in 283 ms of which 5 ms to minimize.
[2024-06-01 13:28:51] [INFO ] Deduced a trap composed of 231 places in 270 ms of which 4 ms to minimize.
[2024-06-01 13:28:52] [INFO ] Deduced a trap composed of 216 places in 288 ms of which 4 ms to minimize.
[2024-06-01 13:28:52] [INFO ] Deduced a trap composed of 42 places in 189 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 1190 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 518/1692 variables, and 59 constraints, problems are : Problem set: 0 solved, 1190 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1190 constraints, Known Traps: 19/19 constraints]
After SMT, in 42155ms problems are : Problem set: 0 solved, 1190 unsolved
Search for dead transitions found 0 dead transitions in 42173ms
[2024-06-01 13:28:54] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-06-01 13:28:54] [INFO ] Invariant cache hit.
[2024-06-01 13:28:55] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-06-01 13:28:55] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-06-01 13:28:55] [INFO ] Invariant cache hit.
[2024-06-01 13:28:55] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:28:59] [INFO ] Implicit Places using invariants and state equation in 4593 ms returned []
Implicit Place search using SMT with State Equation took 4920 ms to find 0 implicit places.
[2024-06-01 13:28:59] [INFO ] Redundant transitions in 20 ms returned []
Running 1190 sub problems to find dead transitions.
[2024-06-01 13:28:59] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-06-01 13:28:59] [INFO ] Invariant cache hit.
[2024-06-01 13:28:59] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
[2024-06-01 13:29:09] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:29:09] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2024-06-01 13:29:09] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:29:10] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 3 ms to minimize.
[2024-06-01 13:29:10] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:29:10] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:29:10] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:29:10] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:29:10] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:29:10] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:29:11] [INFO ] Deduced a trap composed of 279 places in 318 ms of which 4 ms to minimize.
[2024-06-01 13:29:11] [INFO ] Deduced a trap composed of 223 places in 248 ms of which 7 ms to minimize.
[2024-06-01 13:29:11] [INFO ] Deduced a trap composed of 240 places in 298 ms of which 4 ms to minimize.
[2024-06-01 13:29:23] [INFO ] Deduced a trap composed of 217 places in 292 ms of which 5 ms to minimize.
[2024-06-01 13:29:24] [INFO ] Deduced a trap composed of 212 places in 282 ms of which 4 ms to minimize.
[2024-06-01 13:29:24] [INFO ] Deduced a trap composed of 216 places in 296 ms of which 4 ms to minimize.
[2024-06-01 13:29:25] [INFO ] Deduced a trap composed of 53 places in 189 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
[2024-06-01 13:29:29] [INFO ] Deduced a trap composed of 310 places in 276 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 518/1692 variables, and 58 constraints, problems are : Problem set: 0 solved, 1190 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1190/1190 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
[2024-06-01 13:29:47] [INFO ] Deduced a trap composed of 107 places in 180 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 518/1692 variables, and 59 constraints, problems are : Problem set: 0 solved, 1190 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1190 constraints, Known Traps: 19/19 constraints]
After SMT, in 62109ms problems are : Problem set: 0 solved, 1190 unsolved
Search for dead transitions found 0 dead transitions in 62132ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 109313 ms. Remains : 520/520 places, 1192/1192 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
RANDOM walk for 169 steps (0 resets) in 6 ms. (24 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-06-01 13:30:02] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-06-01 13:30:02] [INFO ] Invariant cache hit.
[2024-06-01 13:30:02] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2024-06-01 13:30:03] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 88 ms returned sat
[2024-06-01 13:30:04] [INFO ] [Real]Absence check using state equation in 1631 ms returned sat
[2024-06-01 13:30:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:30:05] [INFO ] [Nat]Absence check using 13 positive place invariants in 74 ms returned sat
[2024-06-01 13:30:05] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 53 ms returned sat
[2024-06-01 13:30:07] [INFO ] [Nat]Absence check using state equation in 2429 ms returned sat
[2024-06-01 13:30:07] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:30:08] [INFO ] [Nat]Added 120 Read/Feed constraints in 628 ms returned sat
[2024-06-01 13:30:08] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 1 ms to minimize.
[2024-06-01 13:30:09] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
[2024-06-01 13:30:10] [INFO ] Deduced a trap composed of 51 places in 235 ms of which 3 ms to minimize.
[2024-06-01 13:30:10] [INFO ] Deduced a trap composed of 45 places in 173 ms of which 4 ms to minimize.
[2024-06-01 13:30:10] [INFO ] Deduced a trap composed of 26 places in 195 ms of which 3 ms to minimize.
[2024-06-01 13:30:11] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:30:11] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:30:11] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:30:12] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:30:12] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3853 ms
[2024-06-01 13:30:12] [INFO ] Computed and/alt/rep : 410/868/400 causal constraints (skipped 770 transitions) in 118 ms.
[2024-06-01 13:30:14] [INFO ] Added : 95 causal constraints over 19 iterations in 2335 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2318 reset in 478 ms.
Product exploration explored 100000 steps with 2318 reset in 474 ms.
Support contains 32 out of 520 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 520/520 places, 1192/1192 transitions.
Applied a total of 0 rules in 28 ms. Remains 520 /520 variables (removed 0) and now considering 1192/1192 (removed 0) transitions.
Running 1190 sub problems to find dead transitions.
[2024-06-01 13:30:15] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-06-01 13:30:15] [INFO ] Invariant cache hit.
[2024-06-01 13:30:15] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
[2024-06-01 13:30:25] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:30:26] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:30:26] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:30:26] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:30:26] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:30:26] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:30:26] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:30:26] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:30:26] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 0 ms to minimize.
[2024-06-01 13:30:26] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 7 ms to minimize.
[2024-06-01 13:30:27] [INFO ] Deduced a trap composed of 279 places in 361 ms of which 4 ms to minimize.
[2024-06-01 13:30:27] [INFO ] Deduced a trap composed of 223 places in 276 ms of which 4 ms to minimize.
[2024-06-01 13:30:28] [INFO ] Deduced a trap composed of 240 places in 252 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 518/1692 variables, and 53 constraints, problems are : Problem set: 0 solved, 1190 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1190/1190 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
[2024-06-01 13:30:43] [INFO ] Deduced a trap composed of 310 places in 282 ms of which 4 ms to minimize.
[2024-06-01 13:30:44] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 2 ms to minimize.
[2024-06-01 13:30:52] [INFO ] Deduced a trap composed of 229 places in 275 ms of which 7 ms to minimize.
[2024-06-01 13:30:53] [INFO ] Deduced a trap composed of 231 places in 281 ms of which 4 ms to minimize.
[2024-06-01 13:30:53] [INFO ] Deduced a trap composed of 216 places in 242 ms of which 2 ms to minimize.
[2024-06-01 13:30:54] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 518/1692 variables, and 59 constraints, problems are : Problem set: 0 solved, 1190 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1190 constraints, Known Traps: 19/19 constraints]
After SMT, in 42093ms problems are : Problem set: 0 solved, 1190 unsolved
Search for dead transitions found 0 dead transitions in 42107ms
[2024-06-01 13:30:57] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-06-01 13:30:57] [INFO ] Invariant cache hit.
[2024-06-01 13:30:58] [INFO ] Implicit Places using invariants in 335 ms returned []
[2024-06-01 13:30:58] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-06-01 13:30:58] [INFO ] Invariant cache hit.
[2024-06-01 13:30:58] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:31:03] [INFO ] Implicit Places using invariants and state equation in 5304 ms returned []
Implicit Place search using SMT with State Equation took 5642 ms to find 0 implicit places.
[2024-06-01 13:31:03] [INFO ] Redundant transitions in 91 ms returned []
Running 1190 sub problems to find dead transitions.
[2024-06-01 13:31:03] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-06-01 13:31:03] [INFO ] Invariant cache hit.
[2024-06-01 13:31:03] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
[2024-06-01 13:31:14] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:31:14] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:31:14] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:31:14] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:31:14] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:31:14] [INFO ] Deduced a trap composed of 44 places in 30 ms of which 1 ms to minimize.
[2024-06-01 13:31:14] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:31:15] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:31:15] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:31:15] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:31:16] [INFO ] Deduced a trap composed of 279 places in 240 ms of which 4 ms to minimize.
[2024-06-01 13:31:16] [INFO ] Deduced a trap composed of 223 places in 248 ms of which 4 ms to minimize.
[2024-06-01 13:31:16] [INFO ] Deduced a trap composed of 240 places in 308 ms of which 4 ms to minimize.
[2024-06-01 13:31:26] [INFO ] Deduced a trap composed of 217 places in 191 ms of which 3 ms to minimize.
[2024-06-01 13:31:27] [INFO ] Deduced a trap composed of 212 places in 278 ms of which 5 ms to minimize.
[2024-06-01 13:31:27] [INFO ] Deduced a trap composed of 216 places in 206 ms of which 3 ms to minimize.
[2024-06-01 13:31:28] [INFO ] Deduced a trap composed of 53 places in 174 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
[2024-06-01 13:31:31] [INFO ] Deduced a trap composed of 310 places in 197 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 518/1692 variables, and 58 constraints, problems are : Problem set: 0 solved, 1190 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1190/1190 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
[2024-06-01 13:31:49] [INFO ] Deduced a trap composed of 107 places in 260 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
[2024-06-01 13:32:05] [INFO ] Deduced a trap composed of 192 places in 282 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 518/1692 variables, and 60 constraints, problems are : Problem set: 0 solved, 1190 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1190 constraints, Known Traps: 20/20 constraints]
After SMT, in 62537ms problems are : Problem set: 0 solved, 1190 unsolved
Search for dead transitions found 0 dead transitions in 62558ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 110443 ms. Remains : 520/520 places, 1192/1192 transitions.
Treatment of property PolyORBLF-COL-S02J04T10-LTLCardinality-02 finished in 357835 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) U X(p1)))'
Support contains 11 out of 730 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 730/730 places, 1402/1402 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 720 transition count 1392
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 720 transition count 1392
Applied a total of 20 rules in 45 ms. Remains 720 /730 variables (removed 10) and now considering 1392/1402 (removed 10) transitions.
Running 1390 sub problems to find dead transitions.
[2024-06-01 13:32:06] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 720 cols
[2024-06-01 13:32:06] [INFO ] Computed 42 invariants in 46 ms
[2024-06-01 13:32:06] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 13:32:22] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 1 ms to minimize.
[2024-06-01 13:32:22] [INFO ] Deduced a trap composed of 64 places in 107 ms of which 2 ms to minimize.
[2024-06-01 13:32:22] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 2 ms to minimize.
[2024-06-01 13:32:22] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 1 ms to minimize.
[2024-06-01 13:32:22] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 1 ms to minimize.
[2024-06-01 13:32:23] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 0 ms to minimize.
[2024-06-01 13:32:24] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 2 ms to minimize.
[2024-06-01 13:32:24] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 1 ms to minimize.
[2024-06-01 13:32:25] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:32:27] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 718/2092 variables, and 50 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/718 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 13:32:30] [INFO ] Deduced a trap composed of 170 places in 368 ms of which 5 ms to minimize.
[2024-06-01 13:32:30] [INFO ] Deduced a trap composed of 224 places in 332 ms of which 5 ms to minimize.
[2024-06-01 13:32:31] [INFO ] Deduced a trap composed of 374 places in 382 ms of which 5 ms to minimize.
[2024-06-01 13:32:31] [INFO ] Deduced a trap composed of 430 places in 341 ms of which 5 ms to minimize.
[2024-06-01 13:32:41] [INFO ] Deduced a trap composed of 379 places in 386 ms of which 4 ms to minimize.
[2024-06-01 13:32:42] [INFO ] Deduced a trap composed of 401 places in 399 ms of which 5 ms to minimize.
[2024-06-01 13:32:42] [INFO ] Deduced a trap composed of 48 places in 395 ms of which 4 ms to minimize.
[2024-06-01 13:32:42] [INFO ] Deduced a trap composed of 412 places in 266 ms of which 4 ms to minimize.
[2024-06-01 13:32:43] [INFO ] Deduced a trap composed of 399 places in 397 ms of which 6 ms to minimize.
[2024-06-01 13:32:43] [INFO ] Deduced a trap composed of 415 places in 325 ms of which 4 ms to minimize.
[2024-06-01 13:32:44] [INFO ] Deduced a trap composed of 480 places in 412 ms of which 4 ms to minimize.
[2024-06-01 13:32:44] [INFO ] Deduced a trap composed of 422 places in 423 ms of which 5 ms to minimize.
[2024-06-01 13:32:45] [INFO ] Deduced a trap composed of 392 places in 374 ms of which 4 ms to minimize.
[2024-06-01 13:32:45] [INFO ] Deduced a trap composed of 392 places in 388 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 718/2092 variables, and 64 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 24/24 constraints]
After SMT, in 42029ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 42047ms
[2024-06-01 13:32:48] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-06-01 13:32:48] [INFO ] Invariant cache hit.
[2024-06-01 13:32:48] [INFO ] Implicit Places using invariants in 513 ms returned []
[2024-06-01 13:32:48] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-06-01 13:32:48] [INFO ] Invariant cache hit.
[2024-06-01 13:32:49] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:32:57] [INFO ] Implicit Places using invariants and state equation in 8667 ms returned []
Implicit Place search using SMT with State Equation took 9194 ms to find 0 implicit places.
Running 1390 sub problems to find dead transitions.
[2024-06-01 13:32:57] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-06-01 13:32:57] [INFO ] Invariant cache hit.
[2024-06-01 13:32:57] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 13:33:12] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:33:13] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 2 ms to minimize.
[2024-06-01 13:33:17] [INFO ] Deduced a trap composed of 64 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:33:17] [INFO ] Deduced a trap composed of 64 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:33:17] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 2 ms to minimize.
[2024-06-01 13:33:17] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:33:17] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:33:17] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:33:17] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:33:18] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:33:20] [INFO ] Deduced a trap composed of 428 places in 253 ms of which 4 ms to minimize.
[2024-06-01 13:33:20] [INFO ] Deduced a trap composed of 412 places in 283 ms of which 4 ms to minimize.
[2024-06-01 13:33:24] [INFO ] Deduced a trap composed of 351 places in 241 ms of which 4 ms to minimize.
[2024-06-01 13:33:25] [INFO ] Deduced a trap composed of 75 places in 175 ms of which 2 ms to minimize.
[2024-06-01 13:33:26] [INFO ] Deduced a trap composed of 160 places in 369 ms of which 3 ms to minimize.
[2024-06-01 13:33:26] [INFO ] Deduced a trap composed of 203 places in 243 ms of which 3 ms to minimize.
[2024-06-01 13:33:28] [INFO ] Deduced a trap composed of 422 places in 270 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 718/2092 variables, and 57 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/718 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 13:33:46] [INFO ] Deduced a trap composed of 71 places in 259 ms of which 4 ms to minimize.
[2024-06-01 13:33:46] [INFO ] Deduced a trap composed of 70 places in 313 ms of which 3 ms to minimize.
[2024-06-01 13:33:50] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/718 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 718/2092 variables, and 60 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 20/20 constraints]
After SMT, in 62061ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 62090ms
Starting structural reductions in LTL mode, iteration 1 : 720/730 places, 1392/1402 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113385 ms. Remains : 720/730 places, 1392/1402 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 432 ms.
Product exploration explored 100000 steps with 50000 reset in 442 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 21 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J04T10-LTLCardinality-04 finished in 114485 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||X((p1 U p2))))))'
Support contains 32 out of 730 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 730/730 places, 1402/1402 transitions.
Applied a total of 0 rules in 28 ms. Remains 730 /730 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
Running 1400 sub problems to find dead transitions.
[2024-06-01 13:34:00] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
// Phase 1: matrix 1382 rows 730 cols
[2024-06-01 13:34:00] [INFO ] Computed 42 invariants in 14 ms
[2024-06-01 13:34:00] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-06-01 13:34:14] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 2 ms to minimize.
[2024-06-01 13:34:14] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 2 ms to minimize.
[2024-06-01 13:34:14] [INFO ] Deduced a trap composed of 65 places in 121 ms of which 2 ms to minimize.
[2024-06-01 13:34:14] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 2 ms to minimize.
[2024-06-01 13:34:14] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 2 ms to minimize.
[2024-06-01 13:34:14] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:34:15] [INFO ] Deduced a trap composed of 232 places in 368 ms of which 5 ms to minimize.
[2024-06-01 13:34:18] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:34:20] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2112 variables, and 49 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-06-01 13:34:25] [INFO ] Deduced a trap composed of 360 places in 404 ms of which 6 ms to minimize.
[2024-06-01 13:34:26] [INFO ] Deduced a trap composed of 57 places in 212 ms of which 3 ms to minimize.
[2024-06-01 13:34:30] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:34:35] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:34:37] [INFO ] Deduced a trap composed of 421 places in 254 ms of which 3 ms to minimize.
[2024-06-01 13:34:37] [INFO ] Deduced a trap composed of 421 places in 271 ms of which 4 ms to minimize.
[2024-06-01 13:34:38] [INFO ] Deduced a trap composed of 409 places in 245 ms of which 4 ms to minimize.
[2024-06-01 13:34:38] [INFO ] Deduced a trap composed of 429 places in 260 ms of which 4 ms to minimize.
[2024-06-01 13:34:38] [INFO ] Deduced a trap composed of 401 places in 326 ms of which 4 ms to minimize.
[2024-06-01 13:34:39] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2112 variables, and 59 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 19/19 constraints]
After SMT, in 41908ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 41927ms
[2024-06-01 13:34:42] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-06-01 13:34:42] [INFO ] Invariant cache hit.
[2024-06-01 13:34:43] [INFO ] Implicit Places using invariants in 465 ms returned []
[2024-06-01 13:34:43] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-06-01 13:34:43] [INFO ] Invariant cache hit.
[2024-06-01 13:34:43] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:34:54] [INFO ] Implicit Places using invariants and state equation in 11371 ms returned []
Implicit Place search using SMT with State Equation took 11838 ms to find 0 implicit places.
Running 1400 sub problems to find dead transitions.
[2024-06-01 13:34:54] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-06-01 13:34:54] [INFO ] Invariant cache hit.
[2024-06-01 13:34:54] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-06-01 13:35:09] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:35:09] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 2 ms to minimize.
[2024-06-01 13:35:09] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:35:09] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:35:09] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:35:09] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 2 ms to minimize.
[2024-06-01 13:35:09] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:35:10] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:35:10] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 2 ms to minimize.
[2024-06-01 13:35:11] [INFO ] Deduced a trap composed of 379 places in 393 ms of which 6 ms to minimize.
[2024-06-01 13:35:11] [INFO ] Deduced a trap composed of 398 places in 384 ms of which 5 ms to minimize.
[2024-06-01 13:35:12] [INFO ] Deduced a trap composed of 236 places in 387 ms of which 5 ms to minimize.
[2024-06-01 13:35:12] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:35:13] [INFO ] Deduced a trap composed of 432 places in 378 ms of which 5 ms to minimize.
[2024-06-01 13:35:13] [INFO ] Deduced a trap composed of 57 places in 187 ms of which 2 ms to minimize.
[2024-06-01 13:35:14] [INFO ] Deduced a trap composed of 387 places in 354 ms of which 5 ms to minimize.
[2024-06-01 13:35:14] [INFO ] Deduced a trap composed of 358 places in 415 ms of which 6 ms to minimize.
[2024-06-01 13:35:15] [INFO ] Deduced a trap composed of 46 places in 367 ms of which 4 ms to minimize.
[2024-06-01 13:35:15] [INFO ] Deduced a trap composed of 46 places in 330 ms of which 3 ms to minimize.
[2024-06-01 13:35:16] [INFO ] Deduced a trap composed of 369 places in 265 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2112 variables, and 60 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-06-01 13:35:37] [INFO ] Deduced a trap composed of 407 places in 472 ms of which 7 ms to minimize.
[2024-06-01 13:35:40] [INFO ] Deduced a trap composed of 397 places in 279 ms of which 4 ms to minimize.
[2024-06-01 13:35:40] [INFO ] Deduced a trap composed of 46 places in 199 ms of which 3 ms to minimize.
[2024-06-01 13:35:40] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 3 ms to minimize.
[2024-06-01 13:35:41] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 3 ms to minimize.
[2024-06-01 13:35:45] [INFO ] Deduced a trap composed of 376 places in 360 ms of which 5 ms to minimize.
[2024-06-01 13:35:47] [INFO ] Deduced a trap composed of 401 places in 443 ms of which 5 ms to minimize.
[2024-06-01 13:35:48] [INFO ] Deduced a trap composed of 480 places in 394 ms of which 4 ms to minimize.
[2024-06-01 13:35:48] [INFO ] Deduced a trap composed of 496 places in 297 ms of which 4 ms to minimize.
[2024-06-01 13:35:48] [INFO ] Deduced a trap composed of 374 places in 368 ms of which 6 ms to minimize.
[2024-06-01 13:35:49] [INFO ] Deduced a trap composed of 388 places in 351 ms of which 5 ms to minimize.
[2024-06-01 13:35:51] [INFO ] Deduced a trap composed of 209 places in 360 ms of which 5 ms to minimize.
[2024-06-01 13:35:52] [INFO ] Deduced a trap composed of 441 places in 310 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/728 variables, 13/73 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2112 variables, and 73 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 33/33 constraints]
After SMT, in 62113ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 62136ms
Finished structural reductions in LTL mode , in 1 iterations and 115939 ms. Remains : 730/730 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLCardinality-08
Product exploration explored 100000 steps with 33272 reset in 444 ms.
Product exploration explored 100000 steps with 33362 reset in 473 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 160 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (11 resets) in 307 ms. (129 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40002 steps (10 resets) in 280 ms. (142 steps per ms) remains 1/1 properties
[2024-06-01 13:35:58] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-06-01 13:35:58] [INFO ] Invariant cache hit.
[2024-06-01 13:35:58] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 228/260 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 716/2112 variables, and 29 constraints, problems are : Problem set: 1 solved, 0 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 3/12 constraints, Generalized P Invariants (flows): 26/30 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 220ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (G (OR p2 (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p2 p0))), (F (NOT p1)), (F (NOT (OR p2 p1))), (F (NOT p2))]
Knowledge based reduction with 14 factoid took 314 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 32 out of 730 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 730/730 places, 1402/1402 transitions.
Applied a total of 0 rules in 17 ms. Remains 730 /730 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
Running 1400 sub problems to find dead transitions.
[2024-06-01 13:35:58] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-06-01 13:35:58] [INFO ] Invariant cache hit.
[2024-06-01 13:35:58] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-06-01 13:36:14] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 2 ms to minimize.
[2024-06-01 13:36:14] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:36:14] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:36:14] [INFO ] Deduced a trap composed of 65 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:36:14] [INFO ] Deduced a trap composed of 65 places in 43 ms of which 2 ms to minimize.
[2024-06-01 13:36:14] [INFO ] Deduced a trap composed of 65 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:36:14] [INFO ] Deduced a trap composed of 65 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:36:14] [INFO ] Deduced a trap composed of 65 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:36:15] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:36:15] [INFO ] Deduced a trap composed of 379 places in 278 ms of which 4 ms to minimize.
[2024-06-01 13:36:15] [INFO ] Deduced a trap composed of 398 places in 280 ms of which 4 ms to minimize.
[2024-06-01 13:36:16] [INFO ] Deduced a trap composed of 236 places in 370 ms of which 8 ms to minimize.
[2024-06-01 13:36:16] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:36:17] [INFO ] Deduced a trap composed of 432 places in 393 ms of which 5 ms to minimize.
[2024-06-01 13:36:17] [INFO ] Deduced a trap composed of 57 places in 175 ms of which 3 ms to minimize.
[2024-06-01 13:36:18] [INFO ] Deduced a trap composed of 387 places in 383 ms of which 5 ms to minimize.
[2024-06-01 13:36:19] [INFO ] Deduced a trap composed of 358 places in 367 ms of which 5 ms to minimize.
[2024-06-01 13:36:19] [INFO ] Deduced a trap composed of 46 places in 350 ms of which 3 ms to minimize.
[2024-06-01 13:36:19] [INFO ] Deduced a trap composed of 46 places in 324 ms of which 3 ms to minimize.
[2024-06-01 13:36:20] [INFO ] Deduced a trap composed of 369 places in 354 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 6.0)
(s1 4.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 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 10.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 (/ 2.0 3.0))
(s254 0.0)
(s255 (/ 1.0 3.0))
(s256 0.0)
(s257 0.0)
(s258 (/ 1.0 3.0))
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 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 1.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 (/ 2.0 3.0))
(s324 1.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 1.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 1.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 1.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 1.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 1.0)
(s465 0.0)
(s466 1.0)
(s467 0.0)
(s468 1.0)
(s469 0.0)
(s470 1.0)
(s471 10.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2112 variables, and 60 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-06-01 13:36:32] [INFO ] Deduced a trap composed of 407 places in 354 ms of which 5 ms to minimize.
[2024-06-01 13:36:35] [INFO ] Deduced a trap composed of 397 places in 373 ms of which 5 ms to minimize.
[2024-06-01 13:36:36] [INFO ] Deduced a trap composed of 46 places in 176 ms of which 3 ms to minimize.
[2024-06-01 13:36:36] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 3 ms to minimize.
[2024-06-01 13:36:36] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 2 ms to minimize.
[2024-06-01 13:36:41] [INFO ] Deduced a trap composed of 376 places in 353 ms of which 5 ms to minimize.
SMT process timed out in 42681ms, After SMT, problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 42704ms
[2024-06-01 13:36:41] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-06-01 13:36:41] [INFO ] Invariant cache hit.
[2024-06-01 13:36:42] [INFO ] Implicit Places using invariants in 628 ms returned []
[2024-06-01 13:36:42] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-06-01 13:36:42] [INFO ] Invariant cache hit.
[2024-06-01 13:36:42] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:36:53] [INFO ] Implicit Places using invariants and state equation in 11620 ms returned []
Implicit Place search using SMT with State Equation took 12249 ms to find 0 implicit places.
Running 1400 sub problems to find dead transitions.
[2024-06-01 13:36:53] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-06-01 13:36:53] [INFO ] Invariant cache hit.
[2024-06-01 13:36:53] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-06-01 13:37:09] [INFO ] Deduced a trap composed of 65 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:37:10] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:37:10] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:37:10] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:37:10] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:37:10] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:37:10] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:37:10] [INFO ] Deduced a trap composed of 65 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:37:10] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:37:11] [INFO ] Deduced a trap composed of 379 places in 392 ms of which 5 ms to minimize.
[2024-06-01 13:37:11] [INFO ] Deduced a trap composed of 398 places in 353 ms of which 5 ms to minimize.
[2024-06-01 13:37:12] [INFO ] Deduced a trap composed of 236 places in 345 ms of which 5 ms to minimize.
[2024-06-01 13:37:12] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:37:13] [INFO ] Deduced a trap composed of 432 places in 386 ms of which 5 ms to minimize.
[2024-06-01 13:37:13] [INFO ] Deduced a trap composed of 57 places in 183 ms of which 3 ms to minimize.
[2024-06-01 13:37:14] [INFO ] Deduced a trap composed of 387 places in 269 ms of which 4 ms to minimize.
[2024-06-01 13:37:14] [INFO ] Deduced a trap composed of 358 places in 364 ms of which 5 ms to minimize.
[2024-06-01 13:37:14] [INFO ] Deduced a trap composed of 46 places in 326 ms of which 4 ms to minimize.
[2024-06-01 13:37:15] [INFO ] Deduced a trap composed of 46 places in 321 ms of which 4 ms to minimize.
[2024-06-01 13:37:15] [INFO ] Deduced a trap composed of 369 places in 278 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2112 variables, and 60 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-06-01 13:37:36] [INFO ] Deduced a trap composed of 407 places in 408 ms of which 5 ms to minimize.
[2024-06-01 13:37:38] [INFO ] Deduced a trap composed of 397 places in 310 ms of which 5 ms to minimize.
[2024-06-01 13:37:39] [INFO ] Deduced a trap composed of 46 places in 129 ms of which 3 ms to minimize.
[2024-06-01 13:37:39] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 2 ms to minimize.
[2024-06-01 13:37:39] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2024-06-01 13:37:43] [INFO ] Deduced a trap composed of 376 places in 399 ms of which 5 ms to minimize.
[2024-06-01 13:37:45] [INFO ] Deduced a trap composed of 401 places in 387 ms of which 5 ms to minimize.
[2024-06-01 13:37:45] [INFO ] Deduced a trap composed of 480 places in 366 ms of which 4 ms to minimize.
[2024-06-01 13:37:45] [INFO ] Deduced a trap composed of 496 places in 306 ms of which 4 ms to minimize.
[2024-06-01 13:37:46] [INFO ] Deduced a trap composed of 374 places in 321 ms of which 5 ms to minimize.
[2024-06-01 13:37:46] [INFO ] Deduced a trap composed of 388 places in 296 ms of which 3 ms to minimize.
[2024-06-01 13:37:49] [INFO ] Deduced a trap composed of 209 places in 395 ms of which 5 ms to minimize.
[2024-06-01 13:37:50] [INFO ] Deduced a trap composed of 441 places in 272 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/728 variables, 13/73 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-06-01 13:37:55] [INFO ] Deduced a trap composed of 449 places in 382 ms of which 6 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 9)
(s203 0)
(s204 1)
(s205 1)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 1)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 1)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 1)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 1)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 9)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 1)
(s572 1)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 1)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 10)
(s647 0)
(s648 0)
(s649 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2112 variables, and 74 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 34/34 constraints]
After SMT, in 62260ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 62276ms
Finished structural reductions in LTL mode , in 1 iterations and 117260 ms. Remains : 730/730 places, 1402/1402 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 154 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 575 steps (0 resets) in 13 ms. (41 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR p2 p1))), (F (NOT (OR p2 p0))), (F (NOT p2))]
Knowledge based reduction with 11 factoid took 362 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 33354 reset in 508 ms.
Product exploration explored 100000 steps with 33416 reset in 584 ms.
Support contains 32 out of 730 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 730/730 places, 1402/1402 transitions.
Applied a total of 0 rules in 30 ms. Remains 730 /730 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
Running 1400 sub problems to find dead transitions.
[2024-06-01 13:37:58] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-06-01 13:37:58] [INFO ] Invariant cache hit.
[2024-06-01 13:37:58] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-06-01 13:38:14] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 2 ms to minimize.
[2024-06-01 13:38:14] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:38:14] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 2 ms to minimize.
[2024-06-01 13:38:14] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:38:14] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:38:14] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:38:14] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:38:14] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:38:14] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:38:15] [INFO ] Deduced a trap composed of 379 places in 403 ms of which 5 ms to minimize.
[2024-06-01 13:38:16] [INFO ] Deduced a trap composed of 398 places in 426 ms of which 5 ms to minimize.
[2024-06-01 13:38:16] [INFO ] Deduced a trap composed of 236 places in 378 ms of which 5 ms to minimize.
[2024-06-01 13:38:16] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:38:17] [INFO ] Deduced a trap composed of 432 places in 461 ms of which 5 ms to minimize.
[2024-06-01 13:38:18] [INFO ] Deduced a trap composed of 57 places in 195 ms of which 3 ms to minimize.
[2024-06-01 13:38:19] [INFO ] Deduced a trap composed of 387 places in 384 ms of which 6 ms to minimize.
[2024-06-01 13:38:19] [INFO ] Deduced a trap composed of 358 places in 413 ms of which 6 ms to minimize.
[2024-06-01 13:38:20] [INFO ] Deduced a trap composed of 46 places in 366 ms of which 9 ms to minimize.
[2024-06-01 13:38:20] [INFO ] Deduced a trap composed of 46 places in 406 ms of which 5 ms to minimize.
[2024-06-01 13:38:21] [INFO ] Deduced a trap composed of 369 places in 412 ms of which 5 ms to minimize.
SMT process timed out in 22458ms, After SMT, problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 22475ms
[2024-06-01 13:38:21] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-06-01 13:38:21] [INFO ] Invariant cache hit.
[2024-06-01 13:38:21] [INFO ] Implicit Places using invariants in 517 ms returned []
[2024-06-01 13:38:21] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-06-01 13:38:21] [INFO ] Invariant cache hit.
[2024-06-01 13:38:22] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:38:33] [INFO ] Implicit Places using invariants and state equation in 11833 ms returned []
Implicit Place search using SMT with State Equation took 12357 ms to find 0 implicit places.
Running 1400 sub problems to find dead transitions.
[2024-06-01 13:38:33] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-06-01 13:38:33] [INFO ] Invariant cache hit.
[2024-06-01 13:38:33] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 65 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 65 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 65 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 65 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:38:49] [INFO ] Deduced a trap composed of 65 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:38:49] [INFO ] Deduced a trap composed of 65 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:38:49] [INFO ] Deduced a trap composed of 65 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:38:49] [INFO ] Deduced a trap composed of 65 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:38:50] [INFO ] Deduced a trap composed of 379 places in 487 ms of which 5 ms to minimize.
[2024-06-01 13:38:50] [INFO ] Deduced a trap composed of 398 places in 328 ms of which 5 ms to minimize.
[2024-06-01 13:38:50] [INFO ] Deduced a trap composed of 236 places in 333 ms of which 5 ms to minimize.
[2024-06-01 13:38:50] [INFO ] Deduced a trap composed of 65 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:38:51] [INFO ] Deduced a trap composed of 432 places in 356 ms of which 5 ms to minimize.
[2024-06-01 13:38:52] [INFO ] Deduced a trap composed of 57 places in 170 ms of which 3 ms to minimize.
[2024-06-01 13:38:53] [INFO ] Deduced a trap composed of 387 places in 455 ms of which 5 ms to minimize.
[2024-06-01 13:38:53] [INFO ] Deduced a trap composed of 358 places in 398 ms of which 5 ms to minimize.
[2024-06-01 13:38:53] [INFO ] Deduced a trap composed of 46 places in 283 ms of which 4 ms to minimize.
[2024-06-01 13:38:54] [INFO ] Deduced a trap composed of 46 places in 291 ms of which 4 ms to minimize.
[2024-06-01 13:38:54] [INFO ] Deduced a trap composed of 369 places in 271 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2112 variables, and 60 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-06-01 13:39:17] [INFO ] Deduced a trap composed of 407 places in 358 ms of which 5 ms to minimize.
[2024-06-01 13:39:19] [INFO ] Deduced a trap composed of 397 places in 359 ms of which 5 ms to minimize.
[2024-06-01 13:39:20] [INFO ] Deduced a trap composed of 46 places in 169 ms of which 3 ms to minimize.
[2024-06-01 13:39:20] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 3 ms to minimize.
[2024-06-01 13:39:20] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 3 ms to minimize.
[2024-06-01 13:39:24] [INFO ] Deduced a trap composed of 376 places in 385 ms of which 5 ms to minimize.
[2024-06-01 13:39:26] [INFO ] Deduced a trap composed of 401 places in 366 ms of which 5 ms to minimize.
[2024-06-01 13:39:26] [INFO ] Deduced a trap composed of 480 places in 375 ms of which 5 ms to minimize.
[2024-06-01 13:39:27] [INFO ] Deduced a trap composed of 496 places in 425 ms of which 5 ms to minimize.
[2024-06-01 13:39:27] [INFO ] Deduced a trap composed of 374 places in 373 ms of which 5 ms to minimize.
[2024-06-01 13:39:28] [INFO ] Deduced a trap composed of 388 places in 366 ms of which 5 ms to minimize.
[2024-06-01 13:39:31] [INFO ] Deduced a trap composed of 209 places in 383 ms of which 5 ms to minimize.
[2024-06-01 13:39:31] [INFO ] Deduced a trap composed of 441 places in 262 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2112 variables, and 73 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 33/33 constraints]
After SMT, in 61895ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 61921ms
Finished structural reductions in LTL mode , in 1 iterations and 96793 ms. Remains : 730/730 places, 1402/1402 transitions.
Treatment of property PolyORBLF-COL-S02J04T10-LTLCardinality-08 finished in 334763 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(p1 U p2))))'
Support contains 70 out of 730 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 730/730 places, 1402/1402 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 730 transition count 1352
Reduce places removed 50 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 60 rules applied. Total rules applied 110 place count 680 transition count 1342
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 120 place count 670 transition count 1342
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 120 place count 670 transition count 1282
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 240 place count 610 transition count 1282
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 380 place count 540 transition count 1212
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 390 place count 530 transition count 1202
Iterating global reduction 3 with 10 rules applied. Total rules applied 400 place count 530 transition count 1202
Applied a total of 400 rules in 103 ms. Remains 530 /730 variables (removed 200) and now considering 1202/1402 (removed 200) transitions.
Running 1200 sub problems to find dead transitions.
[2024-06-01 13:39:35] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
// Phase 1: matrix 1182 rows 530 cols
[2024-06-01 13:39:35] [INFO ] Computed 42 invariants in 15 ms
[2024-06-01 13:39:35] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-06-01 13:39:45] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 1 ms to minimize.
[2024-06-01 13:39:46] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:39:46] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:39:46] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:39:46] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:39:46] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:39:46] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:39:46] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:39:46] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:39:47] [INFO ] Deduced a trap composed of 249 places in 309 ms of which 4 ms to minimize.
[2024-06-01 13:39:47] [INFO ] Deduced a trap composed of 244 places in 258 ms of which 4 ms to minimize.
[2024-06-01 13:39:53] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:39:54] [INFO ] Deduced a trap composed of 212 places in 276 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.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 1.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 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 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1712 variables, and 53 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/530 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-06-01 13:40:01] [INFO ] Deduced a trap composed of 45 places in 163 ms of which 2 ms to minimize.
[2024-06-01 13:40:01] [INFO ] Deduced a trap composed of 44 places in 165 ms of which 3 ms to minimize.
[2024-06-01 13:40:03] [INFO ] Deduced a trap composed of 68 places in 187 ms of which 3 ms to minimize.
[2024-06-01 13:40:05] [INFO ] Deduced a trap composed of 320 places in 274 ms of which 3 ms to minimize.
[2024-06-01 13:40:06] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 3 ms to minimize.
[2024-06-01 13:40:12] [INFO ] Deduced a trap composed of 172 places in 302 ms of which 5 ms to minimize.
[2024-06-01 13:40:13] [INFO ] Deduced a trap composed of 3 places in 300 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1712 variables, and 60 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/530 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 20/20 constraints]
After SMT, in 41814ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 41828ms
[2024-06-01 13:40:17] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-06-01 13:40:17] [INFO ] Invariant cache hit.
[2024-06-01 13:40:17] [INFO ] Implicit Places using invariants in 514 ms returned []
[2024-06-01 13:40:17] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-06-01 13:40:17] [INFO ] Invariant cache hit.
[2024-06-01 13:40:18] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:40:25] [INFO ] Implicit Places using invariants and state equation in 7467 ms returned []
Implicit Place search using SMT with State Equation took 7993 ms to find 0 implicit places.
[2024-06-01 13:40:25] [INFO ] Redundant transitions in 28 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-06-01 13:40:25] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-06-01 13:40:25] [INFO ] Invariant cache hit.
[2024-06-01 13:40:25] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-06-01 13:40:36] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 2 ms to minimize.
[2024-06-01 13:40:36] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:40:36] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:40:36] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:40:36] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:40:36] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:40:36] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:40:36] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:40:36] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:40:37] [INFO ] Deduced a trap composed of 231 places in 307 ms of which 4 ms to minimize.
[2024-06-01 13:40:39] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:40:48] [INFO ] Deduced a trap composed of 218 places in 263 ms of which 3 ms to minimize.
[2024-06-01 13:40:50] [INFO ] Deduced a trap composed of 3 places in 272 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-06-01 13:40:55] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1712 variables, and 54 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/530 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-06-01 13:41:04] [INFO ] Deduced a trap composed of 320 places in 283 ms of which 4 ms to minimize.
[2024-06-01 13:41:05] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-06-01 13:41:26] [INFO ] Deduced a trap composed of 115 places in 287 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1712 variables, and 57 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/530 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 17/17 constraints]
After SMT, in 61962ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 61983ms
Starting structural reductions in SI_LTL mode, iteration 1 : 530/730 places, 1202/1402 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 111957 ms. Remains : 530/730 places, 1202/1402 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLCardinality-13
Product exploration explored 100000 steps with 853 reset in 428 ms.
Product exploration explored 100000 steps with 794 reset in 521 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (OR p0 p2 p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X p1), (X (X (OR p0 p2 p1))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 166 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p2)), true, (NOT p2)]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (18 resets) in 342 ms. (116 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 568 ms. (70 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (8 resets) in 402 ms. (99 steps per ms) remains 2/2 properties
[2024-06-01 13:41:29] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-06-01 13:41:29] [INFO ] Invariant cache hit.
[2024-06-01 13:41:29] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 225/295 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/305 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 220/525 variables, 29/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/528 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1182/1710 variables, 528/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1710 variables, 120/689 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1710 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/1712 variables, 2/691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1712 variables, 1/692 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1712 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1712 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1712/1712 variables, and 692 constraints, problems are : Problem set: 0 solved, 2 unsolved in 938 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 530/530 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 225/295 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 13:41:30] [INFO ] Deduced a trap composed of 184 places in 167 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 10/305 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 6 (OVERLAPS) 220/525 variables, 29/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 13:41:30] [INFO ] Deduced a trap composed of 45 places in 271 ms of which 4 ms to minimize.
[2024-06-01 13:41:31] [INFO ] Deduced a trap composed of 45 places in 242 ms of which 4 ms to minimize.
[2024-06-01 13:41:31] [INFO ] Deduced a trap composed of 207 places in 306 ms of which 4 ms to minimize.
[2024-06-01 13:41:31] [INFO ] Deduced a trap composed of 45 places in 281 ms of which 4 ms to minimize.
[2024-06-01 13:41:32] [INFO ] Deduced a trap composed of 45 places in 278 ms of which 3 ms to minimize.
[2024-06-01 13:41:32] [INFO ] Deduced a trap composed of 237 places in 232 ms of which 3 ms to minimize.
[2024-06-01 13:41:32] [INFO ] Deduced a trap composed of 45 places in 230 ms of which 3 ms to minimize.
[2024-06-01 13:41:32] [INFO ] Deduced a trap composed of 45 places in 231 ms of which 3 ms to minimize.
[2024-06-01 13:41:33] [INFO ] Deduced a trap composed of 45 places in 228 ms of which 3 ms to minimize.
[2024-06-01 13:41:33] [INFO ] Deduced a trap composed of 45 places in 248 ms of which 3 ms to minimize.
[2024-06-01 13:41:33] [INFO ] Deduced a trap composed of 216 places in 290 ms of which 3 ms to minimize.
Problem apf3 is UNSAT
After SMT solving in domain Int declared 525/1712 variables, and 50 constraints, problems are : Problem set: 2 solved, 0 unsolved in 3355 ms.
Refiners :[Positive P Invariants (semi-flows): 9/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/530 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 12/12 constraints]
After SMT, in 4350ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X (OR p0 p2 p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X p1), (X (X (OR p0 p2 p1))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p1 p2)), (G (OR p0 p1 p2)), (G (OR p0 p1 p2))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 20 factoid took 341 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 40 out of 530 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 530/530 places, 1202/1202 transitions.
Applied a total of 0 rules in 24 ms. Remains 530 /530 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-06-01 13:41:34] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-06-01 13:41:34] [INFO ] Invariant cache hit.
[2024-06-01 13:41:34] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-06-01 13:41:44] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 1 ms to minimize.
[2024-06-01 13:41:44] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 2 ms to minimize.
[2024-06-01 13:41:44] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:41:44] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:41:44] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:41:45] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:41:45] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:41:45] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:41:45] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:41:46] [INFO ] Deduced a trap composed of 231 places in 277 ms of which 4 ms to minimize.
[2024-06-01 13:41:47] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1712 variables, and 51 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/530 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-06-01 13:42:03] [INFO ] Deduced a trap composed of 336 places in 269 ms of which 3 ms to minimize.
[2024-06-01 13:42:04] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 2 ms to minimize.
[2024-06-01 13:42:07] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 3 ms to minimize.
[2024-06-01 13:42:10] [INFO ] Deduced a trap composed of 195 places in 276 ms of which 4 ms to minimize.
[2024-06-01 13:42:11] [INFO ] Deduced a trap composed of 3 places in 289 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-06-01 13:42:12] [INFO ] Deduced a trap composed of 54 places in 175 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1712 variables, and 57 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/530 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 17/17 constraints]
After SMT, in 41692ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 41708ms
[2024-06-01 13:42:15] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-06-01 13:42:15] [INFO ] Invariant cache hit.
[2024-06-01 13:42:16] [INFO ] Implicit Places using invariants in 498 ms returned []
[2024-06-01 13:42:16] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-06-01 13:42:16] [INFO ] Invariant cache hit.
[2024-06-01 13:42:17] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:42:23] [INFO ] Implicit Places using invariants and state equation in 7592 ms returned []
Implicit Place search using SMT with State Equation took 8091 ms to find 0 implicit places.
[2024-06-01 13:42:24] [INFO ] Redundant transitions in 9 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-06-01 13:42:24] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-06-01 13:42:24] [INFO ] Invariant cache hit.
[2024-06-01 13:42:24] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-06-01 13:42:33] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 2 ms to minimize.
[2024-06-01 13:42:33] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:42:33] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:42:34] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:42:34] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:42:34] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:42:34] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:42:34] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:42:34] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:42:35] [INFO ] Deduced a trap composed of 231 places in 341 ms of which 4 ms to minimize.
[2024-06-01 13:42:37] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:42:46] [INFO ] Deduced a trap composed of 218 places in 280 ms of which 4 ms to minimize.
[2024-06-01 13:42:47] [INFO ] Deduced a trap composed of 3 places in 281 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-06-01 13:42:52] [INFO ] Deduced a trap composed of 37 places in 253 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1712 variables, and 54 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/530 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-06-01 13:43:02] [INFO ] Deduced a trap composed of 320 places in 273 ms of which 4 ms to minimize.
[2024-06-01 13:43:03] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-06-01 13:43:25] [INFO ] Deduced a trap composed of 115 places in 328 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1712 variables, and 57 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/530 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 17/17 constraints]
After SMT, in 61847ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 61858ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 111706 ms. Remains : 530/530 places, 1202/1202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2), (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
RANDOM walk for 252 steps (0 resets) in 10 ms. (22 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p2), (X p2), (X (X p2))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 3 factoid took 170 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 772 reset in 440 ms.
Product exploration explored 100000 steps with 784 reset in 445 ms.
Support contains 40 out of 530 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 530/530 places, 1202/1202 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 530 transition count 1182
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 510 transition count 1182
Applied a total of 40 rules in 44 ms. Remains 510 /530 variables (removed 20) and now considering 1182/1202 (removed 20) transitions.
Running 1180 sub problems to find dead transitions.
[2024-06-01 13:43:27] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
// Phase 1: matrix 1162 rows 510 cols
[2024-06-01 13:43:27] [INFO ] Computed 42 invariants in 29 ms
[2024-06-01 13:43:27] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-06-01 13:43:37] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:43:37] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:43:37] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 0 ms to minimize.
[2024-06-01 13:43:37] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:43:38] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:43:38] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:43:38] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:43:38] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 0 ms to minimize.
[2024-06-01 13:43:38] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:43:38] [INFO ] Deduced a trap composed of 223 places in 303 ms of which 3 ms to minimize.
[2024-06-01 13:43:39] [INFO ] Deduced a trap composed of 224 places in 241 ms of which 3 ms to minimize.
[2024-06-01 13:43:40] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:43:44] [INFO ] Deduced a trap composed of 217 places in 268 ms of which 4 ms to minimize.
[2024-06-01 13:43:48] [INFO ] Deduced a trap composed of 54 places in 166 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/1672 variables, and 54 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/510 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1180/1180 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-06-01 13:43:51] [INFO ] Deduced a trap composed of 23 places in 190 ms of which 3 ms to minimize.
[2024-06-01 13:43:51] [INFO ] Deduced a trap composed of 233 places in 218 ms of which 3 ms to minimize.
[2024-06-01 13:44:03] [INFO ] Deduced a trap composed of 191 places in 319 ms of which 4 ms to minimize.
[2024-06-01 13:44:04] [INFO ] Deduced a trap composed of 3 places in 309 ms of which 4 ms to minimize.
[2024-06-01 13:44:04] [INFO ] Deduced a trap composed of 115 places in 272 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/508 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/1672 variables, and 59 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/510 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1180 constraints, Known Traps: 19/19 constraints]
After SMT, in 41808ms problems are : Problem set: 0 solved, 1180 unsolved
Search for dead transitions found 0 dead transitions in 41832ms
[2024-06-01 13:44:09] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-06-01 13:44:09] [INFO ] Invariant cache hit.
[2024-06-01 13:44:09] [INFO ] Implicit Places using invariants in 495 ms returned []
[2024-06-01 13:44:09] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-06-01 13:44:09] [INFO ] Invariant cache hit.
[2024-06-01 13:44:10] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:44:16] [INFO ] Implicit Places using invariants and state equation in 6233 ms returned []
Implicit Place search using SMT with State Equation took 6731 ms to find 0 implicit places.
[2024-06-01 13:44:16] [INFO ] Redundant transitions in 22 ms returned []
Running 1180 sub problems to find dead transitions.
[2024-06-01 13:44:16] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-06-01 13:44:16] [INFO ] Invariant cache hit.
[2024-06-01 13:44:16] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-06-01 13:44:26] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 2 ms to minimize.
[2024-06-01 13:44:26] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 1 ms to minimize.
[2024-06-01 13:44:26] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:44:26] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:44:26] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:44:27] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:44:27] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:44:27] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:44:27] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:44:27] [INFO ] Deduced a trap composed of 221 places in 257 ms of which 4 ms to minimize.
[2024-06-01 13:44:27] [INFO ] Deduced a trap composed of 183 places in 264 ms of which 4 ms to minimize.
[2024-06-01 13:44:28] [INFO ] Deduced a trap composed of 23 places in 235 ms of which 3 ms to minimize.
[2024-06-01 13:44:28] [INFO ] Deduced a trap composed of 230 places in 246 ms of which 4 ms to minimize.
[2024-06-01 13:44:28] [INFO ] Deduced a trap composed of 216 places in 367 ms of which 3 ms to minimize.
[2024-06-01 13:44:29] [INFO ] Deduced a trap composed of 203 places in 225 ms of which 3 ms to minimize.
[2024-06-01 13:44:30] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:44:39] [INFO ] Deduced a trap composed of 111 places in 174 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 9.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 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)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/1672 variables, and 57 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/510 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1180/1180 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-06-01 13:45:02] [INFO ] Deduced a trap composed of 176 places in 262 ms of which 3 ms to minimize.
[2024-06-01 13:45:03] [INFO ] Deduced a trap composed of 3 places in 289 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/508 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-06-01 13:45:08] [INFO ] Deduced a trap composed of 54 places in 170 ms of which 2 ms to minimize.
[2024-06-01 13:45:08] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/508 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/1672 variables, and 61 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/510 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1180 constraints, Known Traps: 21/21 constraints]
After SMT, in 61978ms problems are : Problem set: 0 solved, 1180 unsolved
Search for dead transitions found 0 dead transitions in 61997ms
Starting structural reductions in SI_LTL mode, iteration 1 : 510/530 places, 1182/1202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 110645 ms. Remains : 510/530 places, 1182/1202 transitions.
Treatment of property PolyORBLF-COL-S02J04T10-LTLCardinality-13 finished in 342748 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))'
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||X((p1 U p2))))))'
Found a Lengthening insensitive property : PolyORBLF-COL-S02J04T10-LTLCardinality-08
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 32 out of 730 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 730/730 places, 1402/1402 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 730 transition count 1342
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 120 place count 670 transition count 1342
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 120 place count 670 transition count 1262
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 280 place count 590 transition count 1262
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 440 place count 510 transition count 1182
Applied a total of 440 rules in 79 ms. Remains 510 /730 variables (removed 220) and now considering 1182/1402 (removed 220) transitions.
Running 1180 sub problems to find dead transitions.
[2024-06-01 13:45:18] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
// Phase 1: matrix 1162 rows 510 cols
[2024-06-01 13:45:18] [INFO ] Computed 42 invariants in 28 ms
[2024-06-01 13:45:18] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-06-01 13:45:29] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:45:29] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 2 ms to minimize.
[2024-06-01 13:45:30] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:45:30] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:45:30] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:45:30] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:45:30] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:45:30] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:45:30] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:45:30] [INFO ] Deduced a trap composed of 190 places in 306 ms of which 4 ms to minimize.
[2024-06-01 13:45:31] [INFO ] Deduced a trap composed of 190 places in 255 ms of which 4 ms to minimize.
[2024-06-01 13:45:31] [INFO ] Deduced a trap composed of 199 places in 301 ms of which 3 ms to minimize.
[2024-06-01 13:45:31] [INFO ] Deduced a trap composed of 210 places in 265 ms of which 4 ms to minimize.
[2024-06-01 13:45:32] [INFO ] Deduced a trap composed of 232 places in 295 ms of which 3 ms to minimize.
[2024-06-01 13:45:32] [INFO ] Deduced a trap composed of 214 places in 239 ms of which 3 ms to minimize.
[2024-06-01 13:45:32] [INFO ] Deduced a trap composed of 190 places in 226 ms of which 3 ms to minimize.
[2024-06-01 13:45:32] [INFO ] Deduced a trap composed of 199 places in 261 ms of which 3 ms to minimize.
[2024-06-01 13:45:33] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 3 ms to minimize.
[2024-06-01 13:45:34] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/1672 variables, and 59 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/510 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1180/1180 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-06-01 13:45:42] [INFO ] Deduced a trap composed of 172 places in 281 ms of which 4 ms to minimize.
[2024-06-01 13:45:45] [INFO ] Deduced a trap composed of 301 places in 181 ms of which 3 ms to minimize.
[2024-06-01 13:45:46] [INFO ] Deduced a trap composed of 210 places in 259 ms of which 4 ms to minimize.
[2024-06-01 13:45:52] [INFO ] Deduced a trap composed of 182 places in 300 ms of which 4 ms to minimize.
[2024-06-01 13:45:53] [INFO ] Deduced a trap composed of 196 places in 266 ms of which 4 ms to minimize.
[2024-06-01 13:45:54] [INFO ] Deduced a trap composed of 246 places in 300 ms of which 3 ms to minimize.
[2024-06-01 13:45:55] [INFO ] Deduced a trap composed of 212 places in 303 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/508 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/1672 variables, and 66 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/510 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1180 constraints, Known Traps: 26/26 constraints]
After SMT, in 42287ms problems are : Problem set: 0 solved, 1180 unsolved
Search for dead transitions found 0 dead transitions in 42305ms
[2024-06-01 13:46:01] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-06-01 13:46:01] [INFO ] Invariant cache hit.
[2024-06-01 13:46:01] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-06-01 13:46:01] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-06-01 13:46:01] [INFO ] Invariant cache hit.
[2024-06-01 13:46:01] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:46:07] [INFO ] Implicit Places using invariants and state equation in 5714 ms returned []
Implicit Place search using SMT with State Equation took 6062 ms to find 0 implicit places.
Running 1180 sub problems to find dead transitions.
[2024-06-01 13:46:07] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-06-01 13:46:07] [INFO ] Invariant cache hit.
[2024-06-01 13:46:07] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-06-01 13:46:16] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 2 ms to minimize.
[2024-06-01 13:46:16] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 1 ms to minimize.
[2024-06-01 13:46:16] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:46:16] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:46:16] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:46:16] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 3 ms to minimize.
[2024-06-01 13:46:17] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:46:17] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:46:17] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:46:17] [INFO ] Deduced a trap composed of 191 places in 277 ms of which 4 ms to minimize.
[2024-06-01 13:46:17] [INFO ] Deduced a trap composed of 213 places in 282 ms of which 3 ms to minimize.
[2024-06-01 13:46:18] [INFO ] Deduced a trap composed of 196 places in 270 ms of which 4 ms to minimize.
[2024-06-01 13:46:18] [INFO ] Deduced a trap composed of 189 places in 252 ms of which 3 ms to minimize.
[2024-06-01 13:46:18] [INFO ] Deduced a trap composed of 198 places in 251 ms of which 3 ms to minimize.
[2024-06-01 13:46:18] [INFO ] Deduced a trap composed of 196 places in 221 ms of which 2 ms to minimize.
[2024-06-01 13:46:19] [INFO ] Deduced a trap composed of 199 places in 257 ms of which 3 ms to minimize.
[2024-06-01 13:46:19] [INFO ] Deduced a trap composed of 23 places in 266 ms of which 3 ms to minimize.
[2024-06-01 13:46:19] [INFO ] Deduced a trap composed of 199 places in 263 ms of which 3 ms to minimize.
[2024-06-01 13:46:20] [INFO ] Deduced a trap composed of 207 places in 240 ms of which 3 ms to minimize.
[2024-06-01 13:46:20] [INFO ] Deduced a trap composed of 198 places in 227 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-06-01 13:46:20] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:46:21] [INFO ] Deduced a trap composed of 205 places in 292 ms of which 3 ms to minimize.
[2024-06-01 13:46:31] [INFO ] Deduced a trap composed of 187 places in 188 ms of which 3 ms to minimize.
[2024-06-01 13:46:32] [INFO ] Deduced a trap composed of 192 places in 179 ms of which 3 ms to minimize.
[2024-06-01 13:46:32] [INFO ] Deduced a trap composed of 230 places in 244 ms of which 4 ms to minimize.
[2024-06-01 13:46:33] [INFO ] Deduced a trap composed of 280 places in 183 ms of which 3 ms to minimize.
[2024-06-01 13:46:33] [INFO ] Deduced a trap composed of 199 places in 194 ms of which 3 ms to minimize.
(s35 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 9.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.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.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/508 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/1672 variables, and 67 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/510 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1180/1180 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 27/67 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-06-01 13:46:41] [INFO ] Deduced a trap composed of 173 places in 299 ms of which 3 ms to minimize.
[2024-06-01 13:46:45] [INFO ] Deduced a trap composed of 301 places in 286 ms of which 4 ms to minimize.
[2024-06-01 13:46:55] [INFO ] Deduced a trap composed of 115 places in 252 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/508 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-06-01 13:46:59] [INFO ] Deduced a trap composed of 63 places in 236 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/1672 variables, and 71 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/510 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1180 constraints, Known Traps: 31/31 constraints]
After SMT, in 62153ms problems are : Problem set: 0 solved, 1180 unsolved
Search for dead transitions found 0 dead transitions in 62170ms
Starting structural reductions in LI_LTL mode, iteration 1 : 510/730 places, 1182/1402 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 110624 ms. Remains : 510/730 places, 1182/1402 transitions.
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLCardinality-08
Product exploration explored 100000 steps with 33259 reset in 351 ms.
Product exploration explored 100000 steps with 33307 reset in 359 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 204 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (15 resets) in 359 ms. (111 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40002 steps (9 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
[2024-06-01 13:47:10] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-06-01 13:47:10] [INFO ] Invariant cache hit.
[2024-06-01 13:47:10] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 198/230 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/271 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/278 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 501/1672 variables, and 34 constraints, problems are : Problem set: 1 solved, 0 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 9/14 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/510 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 195ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (G (OR p2 (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p2 p0))), (F (NOT p1)), (F (NOT (OR p2 p1))), (F (NOT p2))]
Knowledge based reduction with 14 factoid took 387 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 32 out of 510 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 1182/1182 transitions.
Applied a total of 0 rules in 13 ms. Remains 510 /510 variables (removed 0) and now considering 1182/1182 (removed 0) transitions.
Running 1180 sub problems to find dead transitions.
[2024-06-01 13:47:11] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-06-01 13:47:11] [INFO ] Invariant cache hit.
[2024-06-01 13:47:11] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-06-01 13:47:21] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 2 ms to minimize.
[2024-06-01 13:47:21] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 2 ms to minimize.
[2024-06-01 13:47:21] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 1 ms to minimize.
[2024-06-01 13:47:21] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:47:21] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:47:21] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:47:21] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:47:21] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:47:22] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:47:22] [INFO ] Deduced a trap composed of 191 places in 430 ms of which 3 ms to minimize.
[2024-06-01 13:47:22] [INFO ] Deduced a trap composed of 213 places in 299 ms of which 4 ms to minimize.
[2024-06-01 13:47:23] [INFO ] Deduced a trap composed of 196 places in 299 ms of which 3 ms to minimize.
[2024-06-01 13:47:23] [INFO ] Deduced a trap composed of 189 places in 245 ms of which 3 ms to minimize.
[2024-06-01 13:47:23] [INFO ] Deduced a trap composed of 198 places in 287 ms of which 4 ms to minimize.
[2024-06-01 13:47:24] [INFO ] Deduced a trap composed of 196 places in 237 ms of which 3 ms to minimize.
[2024-06-01 13:47:24] [INFO ] Deduced a trap composed of 199 places in 223 ms of which 3 ms to minimize.
[2024-06-01 13:47:24] [INFO ] Deduced a trap composed of 23 places in 217 ms of which 3 ms to minimize.
[2024-06-01 13:47:24] [INFO ] Deduced a trap composed of 199 places in 258 ms of which 3 ms to minimize.
[2024-06-01 13:47:25] [INFO ] Deduced a trap composed of 207 places in 282 ms of which 4 ms to minimize.
[2024-06-01 13:47:25] [INFO ] Deduced a trap composed of 198 places in 246 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-06-01 13:47:25] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 2 ms to minimize.
[2024-06-01 13:47:26] [INFO ] Deduced a trap composed of 205 places in 259 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/1672 variables, and 62 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/510 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1180/1180 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 22/62 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-06-01 13:47:35] [INFO ] Deduced a trap composed of 63 places in 176 ms of which 2 ms to minimize.
[2024-06-01 13:47:38] [INFO ] Deduced a trap composed of 310 places in 188 ms of which 3 ms to minimize.
[2024-06-01 13:47:45] [INFO ] Deduced a trap composed of 196 places in 187 ms of which 3 ms to minimize.
[2024-06-01 13:47:46] [INFO ] Deduced a trap composed of 176 places in 262 ms of which 4 ms to minimize.
[2024-06-01 13:47:47] [INFO ] Deduced a trap composed of 187 places in 269 ms of which 3 ms to minimize.
[2024-06-01 13:47:48] [INFO ] Deduced a trap composed of 316 places in 258 ms of which 3 ms to minimize.
[2024-06-01 13:47:48] [INFO ] Deduced a trap composed of 324 places in 227 ms of which 3 ms to minimize.
[2024-06-01 13:47:48] [INFO ] Deduced a trap composed of 200 places in 214 ms of which 3 ms to minimize.
[2024-06-01 13:47:49] [INFO ] Deduced a trap composed of 113 places in 280 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/508 variables, 9/71 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/1672 variables, and 71 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/510 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1180 constraints, Known Traps: 31/31 constraints]
After SMT, in 42313ms problems are : Problem set: 0 solved, 1180 unsolved
Search for dead transitions found 0 dead transitions in 42336ms
[2024-06-01 13:47:53] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-06-01 13:47:53] [INFO ] Invariant cache hit.
[2024-06-01 13:47:54] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-06-01 13:47:54] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-06-01 13:47:54] [INFO ] Invariant cache hit.
[2024-06-01 13:47:54] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:47:59] [INFO ] Implicit Places using invariants and state equation in 5613 ms returned []
Implicit Place search using SMT with State Equation took 6020 ms to find 0 implicit places.
Running 1180 sub problems to find dead transitions.
[2024-06-01 13:47:59] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-06-01 13:47:59] [INFO ] Invariant cache hit.
[2024-06-01 13:47:59] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-06-01 13:48:09] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 3 ms to minimize.
[2024-06-01 13:48:09] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 2 ms to minimize.
[2024-06-01 13:48:09] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 1 ms to minimize.
[2024-06-01 13:48:09] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 2 ms to minimize.
[2024-06-01 13:48:09] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:48:09] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:48:09] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:48:09] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:48:09] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:48:10] [INFO ] Deduced a trap composed of 191 places in 292 ms of which 4 ms to minimize.
[2024-06-01 13:48:10] [INFO ] Deduced a trap composed of 213 places in 264 ms of which 4 ms to minimize.
[2024-06-01 13:48:11] [INFO ] Deduced a trap composed of 196 places in 298 ms of which 4 ms to minimize.
[2024-06-01 13:48:11] [INFO ] Deduced a trap composed of 189 places in 277 ms of which 4 ms to minimize.
[2024-06-01 13:48:11] [INFO ] Deduced a trap composed of 198 places in 243 ms of which 3 ms to minimize.
[2024-06-01 13:48:11] [INFO ] Deduced a trap composed of 196 places in 219 ms of which 2 ms to minimize.
[2024-06-01 13:48:12] [INFO ] Deduced a trap composed of 199 places in 216 ms of which 3 ms to minimize.
[2024-06-01 13:48:12] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 2 ms to minimize.
[2024-06-01 13:48:12] [INFO ] Deduced a trap composed of 199 places in 217 ms of which 3 ms to minimize.
[2024-06-01 13:48:12] [INFO ] Deduced a trap composed of 207 places in 216 ms of which 2 ms to minimize.
[2024-06-01 13:48:12] [INFO ] Deduced a trap composed of 198 places in 216 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-06-01 13:48:13] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:48:13] [INFO ] Deduced a trap composed of 205 places in 189 ms of which 3 ms to minimize.
[2024-06-01 13:48:23] [INFO ] Deduced a trap composed of 187 places in 294 ms of which 4 ms to minimize.
[2024-06-01 13:48:24] [INFO ] Deduced a trap composed of 192 places in 298 ms of which 4 ms to minimize.
[2024-06-01 13:48:24] [INFO ] Deduced a trap composed of 230 places in 191 ms of which 2 ms to minimize.
[2024-06-01 13:48:25] [INFO ] Deduced a trap composed of 280 places in 188 ms of which 2 ms to minimize.
[2024-06-01 13:48:25] [INFO ] Deduced a trap composed of 199 places in 197 ms of which 3 ms to minimize.
(s395 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 9.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 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 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 9.0)
(s173 1.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 (/ 1.0 3.0))
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 (/ 1.0 3.0))
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 1.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 1.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 (/ 1.0 3.0))
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s280 1.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 1.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 1.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 1.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 1.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 6.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.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/508 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/1672 variables, and 67 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/510 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1180/1180 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 27/67 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-06-01 13:48:33] [INFO ] Deduced a trap composed of 173 places in 311 ms of which 3 ms to minimize.
[2024-06-01 13:48:37] [INFO ] Deduced a trap composed of 301 places in 267 ms of which 4 ms to minimize.
[2024-06-01 13:48:46] [INFO ] Deduced a trap composed of 115 places in 183 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/508 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-06-01 13:48:49] [INFO ] Deduced a trap composed of 63 places in 147 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/1672 variables, and 71 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/510 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1180 constraints, Known Traps: 31/31 constraints]
After SMT, in 62032ms problems are : Problem set: 0 solved, 1180 unsolved
Search for dead transitions found 0 dead transitions in 62044ms
Finished structural reductions in LTL mode , in 1 iterations and 110421 ms. Remains : 510/510 places, 1182/1182 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 115 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 728 steps (0 resets) in 12 ms. (56 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR p2 p1))), (F (NOT (OR p2 p0))), (F (NOT p2))]
Knowledge based reduction with 11 factoid took 246 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 33332 reset in 499 ms.
Product exploration explored 100000 steps with 33203 reset in 521 ms.
Support contains 32 out of 510 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 1182/1182 transitions.
Applied a total of 0 rules in 10 ms. Remains 510 /510 variables (removed 0) and now considering 1182/1182 (removed 0) transitions.
Running 1180 sub problems to find dead transitions.
[2024-06-01 13:49:03] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-06-01 13:49:03] [INFO ] Invariant cache hit.
[2024-06-01 13:49:03] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-06-01 13:49:14] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 2 ms to minimize.
[2024-06-01 13:49:14] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 2 ms to minimize.
[2024-06-01 13:49:14] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:49:14] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:49:14] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:49:14] [INFO ] Deduced a trap composed of 43 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:49:14] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:49:14] [INFO ] Deduced a trap composed of 43 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:49:14] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:49:15] [INFO ] Deduced a trap composed of 191 places in 242 ms of which 4 ms to minimize.
[2024-06-01 13:49:15] [INFO ] Deduced a trap composed of 213 places in 301 ms of which 3 ms to minimize.
[2024-06-01 13:49:15] [INFO ] Deduced a trap composed of 196 places in 230 ms of which 2 ms to minimize.
[2024-06-01 13:49:15] [INFO ] Deduced a trap composed of 189 places in 224 ms of which 3 ms to minimize.
[2024-06-01 13:49:16] [INFO ] Deduced a trap composed of 198 places in 219 ms of which 3 ms to minimize.
[2024-06-01 13:49:16] [INFO ] Deduced a trap composed of 196 places in 201 ms of which 3 ms to minimize.
[2024-06-01 13:49:16] [INFO ] Deduced a trap composed of 199 places in 208 ms of which 3 ms to minimize.
[2024-06-01 13:49:16] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 3 ms to minimize.
[2024-06-01 13:49:17] [INFO ] Deduced a trap composed of 199 places in 291 ms of which 4 ms to minimize.
[2024-06-01 13:49:17] [INFO ] Deduced a trap composed of 207 places in 184 ms of which 2 ms to minimize.
[2024-06-01 13:49:17] [INFO ] Deduced a trap composed of 198 places in 200 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-06-01 13:49:17] [INFO ] Deduced a trap composed of 43 places in 25 ms of which 0 ms to minimize.
[2024-06-01 13:49:18] [INFO ] Deduced a trap composed of 205 places in 313 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/1672 variables, and 62 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/510 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1180/1180 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 22/62 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-06-01 13:49:27] [INFO ] Deduced a trap composed of 63 places in 162 ms of which 3 ms to minimize.
[2024-06-01 13:49:31] [INFO ] Deduced a trap composed of 310 places in 292 ms of which 4 ms to minimize.
[2024-06-01 13:49:38] [INFO ] Deduced a trap composed of 196 places in 201 ms of which 3 ms to minimize.
[2024-06-01 13:49:39] [INFO ] Deduced a trap composed of 176 places in 300 ms of which 4 ms to minimize.
[2024-06-01 13:49:40] [INFO ] Deduced a trap composed of 187 places in 234 ms of which 3 ms to minimize.
[2024-06-01 13:49:40] [INFO ] Deduced a trap composed of 316 places in 276 ms of which 3 ms to minimize.
[2024-06-01 13:49:41] [INFO ] Deduced a trap composed of 324 places in 275 ms of which 4 ms to minimize.
[2024-06-01 13:49:41] [INFO ] Deduced a trap composed of 200 places in 255 ms of which 4 ms to minimize.
[2024-06-01 13:49:42] [INFO ] Deduced a trap composed of 113 places in 204 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/508 variables, 9/71 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/1672 variables, and 71 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/510 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1180 constraints, Known Traps: 31/31 constraints]
After SMT, in 42602ms problems are : Problem set: 0 solved, 1180 unsolved
Search for dead transitions found 0 dead transitions in 42617ms
[2024-06-01 13:49:46] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-06-01 13:49:46] [INFO ] Invariant cache hit.
[2024-06-01 13:49:46] [INFO ] Implicit Places using invariants in 474 ms returned []
[2024-06-01 13:49:46] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-06-01 13:49:46] [INFO ] Invariant cache hit.
[2024-06-01 13:49:47] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:49:52] [INFO ] Implicit Places using invariants and state equation in 5612 ms returned []
Implicit Place search using SMT with State Equation took 6091 ms to find 0 implicit places.
Running 1180 sub problems to find dead transitions.
[2024-06-01 13:49:52] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-06-01 13:49:52] [INFO ] Invariant cache hit.
[2024-06-01 13:49:52] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-06-01 13:50:04] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 2 ms to minimize.
[2024-06-01 13:50:04] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 1 ms to minimize.
[2024-06-01 13:50:04] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 1 ms to minimize.
[2024-06-01 13:50:04] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:50:04] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 3 ms to minimize.
[2024-06-01 13:50:04] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:50:04] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:50:04] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:50:05] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 0 ms to minimize.
[2024-06-01 13:50:05] [INFO ] Deduced a trap composed of 191 places in 283 ms of which 3 ms to minimize.
[2024-06-01 13:50:05] [INFO ] Deduced a trap composed of 213 places in 295 ms of which 4 ms to minimize.
[2024-06-01 13:50:06] [INFO ] Deduced a trap composed of 196 places in 268 ms of which 3 ms to minimize.
[2024-06-01 13:50:06] [INFO ] Deduced a trap composed of 189 places in 297 ms of which 3 ms to minimize.
[2024-06-01 13:50:06] [INFO ] Deduced a trap composed of 198 places in 221 ms of which 3 ms to minimize.
[2024-06-01 13:50:06] [INFO ] Deduced a trap composed of 196 places in 224 ms of which 3 ms to minimize.
[2024-06-01 13:50:07] [INFO ] Deduced a trap composed of 199 places in 292 ms of which 4 ms to minimize.
[2024-06-01 13:50:07] [INFO ] Deduced a trap composed of 23 places in 267 ms of which 3 ms to minimize.
[2024-06-01 13:50:07] [INFO ] Deduced a trap composed of 199 places in 230 ms of which 3 ms to minimize.
[2024-06-01 13:50:07] [INFO ] Deduced a trap composed of 207 places in 226 ms of which 2 ms to minimize.
[2024-06-01 13:50:08] [INFO ] Deduced a trap composed of 198 places in 290 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-06-01 13:50:08] [INFO ] Deduced a trap composed of 43 places in 28 ms of which 0 ms to minimize.
[2024-06-01 13:50:09] [INFO ] Deduced a trap composed of 205 places in 207 ms of which 2 ms to minimize.
[2024-06-01 13:50:19] [INFO ] Deduced a trap composed of 187 places in 216 ms of which 3 ms to minimize.
[2024-06-01 13:50:20] [INFO ] Deduced a trap composed of 192 places in 282 ms of which 4 ms to minimize.
[2024-06-01 13:50:20] [INFO ] Deduced a trap composed of 230 places in 256 ms of which 4 ms to minimize.
[2024-06-01 13:50:21] [INFO ] Deduced a trap composed of 280 places in 255 ms of which 4 ms to minimize.
[2024-06-01 13:50:21] [INFO ] Deduced a trap composed of 199 places in 260 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 6.0)
(s1 4.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 1.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 1.0)
(s20 1.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 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 9.0)
(s173 1.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 1.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 1.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 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 1.0)
(s363 0.0)
(s364 1.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 1.0)
(s369 1.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 1.0)
(s462 10.0)
(s463 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/508 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/1672 variables, and 67 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/510 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1180/1180 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 27/67 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-06-01 13:50:26] [INFO ] Deduced a trap composed of 173 places in 220 ms of which 3 ms to minimize.
[2024-06-01 13:50:29] [INFO ] Deduced a trap composed of 301 places in 177 ms of which 3 ms to minimize.
[2024-06-01 13:50:38] [INFO ] Deduced a trap composed of 115 places in 183 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/508 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-06-01 13:50:43] [INFO ] Deduced a trap composed of 63 places in 215 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/1672 variables, and 71 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/510 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1180 constraints, Known Traps: 31/31 constraints]
After SMT, in 62248ms problems are : Problem set: 0 solved, 1180 unsolved
Search for dead transitions found 0 dead transitions in 62269ms
Finished structural reductions in LTL mode , in 1 iterations and 110995 ms. Remains : 510/510 places, 1182/1182 transitions.
Treatment of property PolyORBLF-COL-S02J04T10-LTLCardinality-08 finished in 336339 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(p1 U p2))))'
[2024-06-01 13:50:55] [INFO ] Flatten gal took : 109 ms
[2024-06-01 13:50:55] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 13:50:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 730 places, 1402 transitions and 6080 arcs took 15 ms.
Total runtime 1534007 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : PolyORBLF-COL-S02J04T10-LTLCardinality-02
FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : PolyORBLF-COL-S02J04T10-LTLCardinality-13

BK_STOP 1717250235669

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name PolyORBLF-COL-S02J04T10-LTLCardinality-02
ltl formula formula --ltl=/tmp/3345/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 730 places, 1402 transitions and 6080 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.320 real 0.060 user 0.060 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3345/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3345/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3345/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3345/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 745 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 731, there are 1404 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~62 levels ~10000 states ~12716 transitions
pnml2lts-mc( 0/ 4): ~62 levels ~20000 states ~25268 transitions
pnml2lts-mc( 0/ 4): ~62 levels ~40000 states ~51124 transitions
pnml2lts-mc( 3/ 4): ~119 levels ~80000 states ~105568 transitions
pnml2lts-mc( 3/ 4): ~119 levels ~160000 states ~211392 transitions
pnml2lts-mc( 0/ 4): ~119 levels ~320000 states ~433440 transitions
pnml2lts-mc( 0/ 4): ~119 levels ~640000 states ~881980 transitions
pnml2lts-mc( 0/ 4): ~119 levels ~1280000 states ~1814344 transitions
pnml2lts-mc( 0/ 4): ~119 levels ~2560000 states ~4039024 transitions
pnml2lts-mc( 0/ 4): ~119 levels ~5120000 states ~8379472 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 8267851
pnml2lts-mc( 0/ 4): unique states count: 8268178
pnml2lts-mc( 0/ 4): unique transitions count: 14338270
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 6070499
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 8269280
pnml2lts-mc( 0/ 4): - cum. max stack depth: 476
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8269280 states 14341114 transitions, fanout: 1.734
pnml2lts-mc( 0/ 4): Total exploration time 249.160 sec (249.140 sec minimum, 249.150 sec on average)
pnml2lts-mc( 0/ 4): States per second: 33189, Transitions per second: 57558
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 127.1MB, 16.1 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 24.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1432 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 127.1MB (~256.0MB paged-in)
ltl formula name PolyORBLF-COL-S02J04T10-LTLCardinality-08
ltl formula formula --ltl=/tmp/3345/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 730 places, 1402 transitions and 6080 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.190 real 0.070 user 0.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3345/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3345/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3345/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3345/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 744 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 731, there are 1410 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~481!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1439
pnml2lts-mc( 0/ 4): unique states count: 2907
pnml2lts-mc( 0/ 4): unique transitions count: 5636
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 11
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 2926
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1483
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2926 states 5740 transitions, fanout: 1.962
pnml2lts-mc( 0/ 4): Total exploration time 0.140 sec (0.140 sec minimum, 0.140 sec on average)
pnml2lts-mc( 0/ 4): States per second: 20900, Transitions per second: 41000
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 31.3 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1432 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name PolyORBLF-COL-S02J04T10-LTLCardinality-13
ltl formula formula --ltl=/tmp/3345/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 730 places, 1402 transitions and 6080 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.170 real 0.040 user 0.060 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3345/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3345/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3345/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3345/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 745 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 731, there are 1410 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~253 levels ~10000 states ~19104 transitions
pnml2lts-mc( 0/ 4): ~253 levels ~20000 states ~35372 transitions
pnml2lts-mc( 0/ 4): ~427 levels ~40000 states ~72180 transitions
pnml2lts-mc( 0/ 4): ~871 levels ~80000 states ~148388 transitions
pnml2lts-mc( 0/ 4): ~2072 levels ~160000 states ~289536 transitions
pnml2lts-mc( 0/ 4): ~2248 levels ~320000 states ~598120 transitions
pnml2lts-mc( 0/ 4): ~2593 levels ~640000 states ~1205576 transitions
pnml2lts-mc( 0/ 4): ~4407 levels ~1280000 states ~2388756 transitions
pnml2lts-mc( 3/ 4): ~30578 levels ~2560000 states ~6301324 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2696922
pnml2lts-mc( 0/ 4): unique states count: 4292852
pnml2lts-mc( 0/ 4): unique transitions count: 13702165
pnml2lts-mc( 0/ 4): - self-loop count: 774
pnml2lts-mc( 0/ 4): - claim dead count: 2583528
pnml2lts-mc( 0/ 4): - claim found count: 1813869
pnml2lts-mc( 0/ 4): - claim success count: 4292867
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1134707
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4292871 states 13702312 transitions, fanout: 3.192
pnml2lts-mc( 0/ 4): Total exploration time 128.680 sec (128.670 sec minimum, 128.677 sec on average)
pnml2lts-mc( 0/ 4): States per second: 33361, Transitions per second: 106484
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 104.5MB, 20.7 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 15.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1432 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 104.5MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-COL-S02J04T10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654446300091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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