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.r289-tajo-171654445200091.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 greatspnxred
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 r289-tajo-171654445200091
=====================================================================

--------------------
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 1716845412795

Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 21:30:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-27 21:30:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 21:30:15] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-27 21:30:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 21:30:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1439 ms
[2024-05-27 21:30:16] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 752 PT places and 1664.0 transition bindings in 56 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
[2024-05-27 21:30:16] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 9 ms.
[2024-05-27 21:30:16] [INFO ] Skeletonized 16 HLPN properties in 3 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 40001 steps (22 resets) in 2789 ms. (14 steps per ms) remains 11/24 properties
BEST_FIRST walk for 40000 steps (11 resets) in 547 ms. (72 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40002 steps (12 resets) in 437 ms. (91 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 276 ms. (144 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 549 ms. (72 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (11 resets) in 268 ms. (148 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 324 ms. (123 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40002 steps (16 resets) in 315 ms. (126 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (11 resets) in 287 ms. (138 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (15 resets) in 196 ms. (203 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (15 resets) in 235 ms. (169 steps per ms) remains 9/9 properties
[2024-05-27 21:30:19] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-27 21:30:19] [INFO ] Computed 26 invariants in 19 ms
[2024-05-27 21:30:19] [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 388 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-05-27 21:30:20] [INFO ] Deduced a trap composed of 27 places in 195 ms of which 20 ms to minimize.
[2024-05-27 21:30:20] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 6 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 971 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 1436ms 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-05-27 21:30:20] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2024-05-27 21:30:20] [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-05-27 21:30:20] [INFO ] Flatten gal took : 12 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-05-27 21:30:20] [INFO ] Unfolded HLPN to a Petri net with 752 places and 1572 transitions 7262 arcs in 54 ms.
[2024-05-27 21:30:20] [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 107 ms. Remains 740 /752 variables (removed 12) and now considering 1402/1412 (removed 10) transitions.
Running 1400 sub problems to find dead transitions.
[2024-05-27 21:30:21] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
// Phase 1: matrix 1382 rows 740 cols
[2024-05-27 21:30:21] [INFO ] Computed 52 invariants in 129 ms
[2024-05-27 21:30:21] [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-05-27 21:30:41] [INFO ] Deduced a trap composed of 64 places in 139 ms of which 2 ms to minimize.
[2024-05-27 21:30:42] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 4 ms to minimize.
[2024-05-27 21:30:42] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-05-27 21:30:42] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-05-27 21:30:42] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 1 ms to minimize.
[2024-05-27 21:30:42] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-05-27 21:30:42] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-05-27 21:30:42] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-05-27 21:30:42] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2024-05-27 21:30:43] [INFO ] Deduced a trap composed of 230 places in 382 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 738/2122 variables, and 60 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20056 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: 10/10 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, 10/60 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-05-27 21:30:46] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 1 ms to minimize.
[2024-05-27 21:30:47] [INFO ] Deduced a trap composed of 378 places in 320 ms of which 4 ms to minimize.
[2024-05-27 21:30:58] [INFO ] Deduced a trap composed of 493 places in 382 ms of which 6 ms to minimize.
[2024-05-27 21:30:58] [INFO ] Deduced a trap composed of 522 places in 435 ms of which 7 ms to minimize.
[2024-05-27 21:30:59] [INFO ] Deduced a trap composed of 513 places in 394 ms of which 6 ms to minimize.
[2024-05-27 21:30:59] [INFO ] Deduced a trap composed of 495 places in 351 ms of which 4 ms to minimize.
[2024-05-27 21:31:02] [INFO ] Deduced a trap composed of 392 places in 400 ms of which 6 ms to minimize.
[2024-05-27 21:31:03] [INFO ] Deduced a trap composed of 424 places in 401 ms of which 5 ms to minimize.
[2024-05-27 21:31:03] [INFO ] Deduced a trap composed of 422 places in 395 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 738/2122 variables, and 69 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20034 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: 19/19 constraints]
After SMT, in 43151ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 43183ms
[2024-05-27 21:31:04] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-27 21:31:04] [INFO ] Invariant cache hit.
[2024-05-27 21:31:04] [INFO ] Implicit Places using invariants in 610 ms returned [574, 575, 576, 577, 578, 579, 580, 581, 582, 583]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 623 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 26 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 43968 ms. Remains : 730/752 places, 1402/1412 transitions.
Support contains 170 out of 730 places after structural reductions.
[2024-05-27 21:31:05] [INFO ] Flatten gal took : 163 ms
[2024-05-27 21:31:05] [INFO ] Flatten gal took : 118 ms
[2024-05-27 21:31:05] [INFO ] Input system was already deterministic with 1402 transitions.
RANDOM walk for 7734 steps (5 resets) in 97 ms. (78 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 2 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 2 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 185 ms. Remains 520 /730 variables (removed 210) and now considering 1192/1402 (removed 210) transitions.
Running 1190 sub problems to find dead transitions.
[2024-05-27 21:31:05] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
// Phase 1: matrix 1172 rows 520 cols
[2024-05-27 21:31:05] [INFO ] Computed 42 invariants in 36 ms
[2024-05-27 21:31:05] [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-05-27 21:31:17] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
[2024-05-27 21:31:17] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2024-05-27 21:31:17] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
[2024-05-27 21:31:17] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 2 ms to minimize.
[2024-05-27 21:31:17] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2024-05-27 21:31:17] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-27 21:31:17] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 1 ms to minimize.
[2024-05-27 21:31:17] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-05-27 21:31:17] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 0 ms to minimize.
[2024-05-27 21:31:18] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2024-05-27 21:31:18] [INFO ] Deduced a trap composed of 258 places in 342 ms of which 4 ms to minimize.
[2024-05-27 21:31:19] [INFO ] Deduced a trap composed of 223 places in 227 ms of which 3 ms to minimize.
[2024-05-27 21:31:19] [INFO ] Deduced a trap composed of 252 places in 291 ms of which 4 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 20039 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-05-27 21:31:35] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 18 ms to minimize.
[2024-05-27 21:31:38] [INFO ] Deduced a trap composed of 37 places in 214 ms of which 2 ms to minimize.
[2024-05-27 21:31:43] [INFO ] Deduced a trap composed of 121 places in 274 ms of which 4 ms to minimize.
[2024-05-27 21:31:44] [INFO ] Deduced a trap composed of 194 places in 286 ms of which 3 ms to minimize.
[2024-05-27 21:31:45] [INFO ] Deduced a trap composed of 3 places in 312 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 5/58 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 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 42428ms problems are : Problem set: 0 solved, 1190 unsolved
Search for dead transitions found 0 dead transitions in 42446ms
[2024-05-27 21:31:48] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-05-27 21:31:48] [INFO ] Invariant cache hit.
[2024-05-27 21:31:48] [INFO ] Implicit Places using invariants in 654 ms returned []
[2024-05-27 21:31:48] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-05-27 21:31:48] [INFO ] Invariant cache hit.
[2024-05-27 21:31:49] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 21:31:54] [INFO ] Implicit Places using invariants and state equation in 5626 ms returned []
Implicit Place search using SMT with State Equation took 6286 ms to find 0 implicit places.
[2024-05-27 21:31:54] [INFO ] Redundant transitions in 57 ms returned []
Running 1190 sub problems to find dead transitions.
[2024-05-27 21:31:54] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-05-27 21:31:54] [INFO ] Invariant cache hit.
[2024-05-27 21:31:54] [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-05-27 21:32:07] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 2 ms to minimize.
[2024-05-27 21:32:07] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-05-27 21:32:07] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 2 ms to minimize.
[2024-05-27 21:32:07] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2024-05-27 21:32:07] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 2 ms to minimize.
[2024-05-27 21:32:07] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 0 ms to minimize.
[2024-05-27 21:32:08] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 0 ms to minimize.
[2024-05-27 21:32:08] [INFO ] Deduced a trap composed of 44 places in 168 ms of which 1 ms to minimize.
[2024-05-27 21:32:08] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 2 ms to minimize.
[2024-05-27 21:32:08] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 0 ms to minimize.
[2024-05-27 21:32:09] [INFO ] Deduced a trap composed of 279 places in 395 ms of which 7 ms to minimize.
[2024-05-27 21:32:09] [INFO ] Deduced a trap composed of 223 places in 373 ms of which 4 ms to minimize.
[2024-05-27 21:32:10] [INFO ] Deduced a trap composed of 240 places in 369 ms of which 8 ms to minimize.
[2024-05-27 21:32:22] [INFO ] Deduced a trap composed of 217 places in 307 ms of which 4 ms to minimize.
[2024-05-27 21:32:23] [INFO ] Deduced a trap composed of 212 places in 267 ms of which 4 ms to minimize.
[2024-05-27 21:32:23] [INFO ] Deduced a trap composed of 216 places in 313 ms of which 3 ms to minimize.
[2024-05-27 21:32:23] [INFO ] Deduced a trap composed of 53 places in 144 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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 518/1692 variables, and 57 constraints, problems are : Problem set: 0 solved, 1190 unsolved in 30038 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: 17/17 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, 17/57 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
SMT process timed out in 61950ms, After SMT, problems are : Problem set: 0 solved, 1190 unsolved
Search for dead transitions found 0 dead transitions in 61963ms
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 110953 ms. Remains : 520/730 places, 1192/1402 transitions.
Stuttering acceptance computed with spot in 264 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLCardinality-02
Product exploration explored 100000 steps with 2317 reset in 506 ms.
Product exploration explored 100000 steps with 2317 reset in 478 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 143 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 40 ms :[(NOT p0)]
RANDOM walk for 164 steps (0 resets) in 8 ms. (18 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 109 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 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2024-05-27 21:32:58] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-05-27 21:32:58] [INFO ] Invariant cache hit.
[2024-05-27 21:33:01] [INFO ] [Real]Absence check using 13 positive place invariants in 22 ms returned sat
[2024-05-27 21:33:01] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 130 ms returned sat
[2024-05-27 21:33:03] [INFO ] [Real]Absence check using state equation in 1373 ms returned sat
[2024-05-27 21:33:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:33:03] [INFO ] [Nat]Absence check using 13 positive place invariants in 83 ms returned sat
[2024-05-27 21:33:04] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 51 ms returned sat
[2024-05-27 21:33:06] [INFO ] [Nat]Absence check using state equation in 2300 ms returned sat
[2024-05-27 21:33:06] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 21:33:07] [INFO ] [Nat]Added 120 Read/Feed constraints in 692 ms returned sat
[2024-05-27 21:33:07] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2024-05-27 21:33:08] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 2 ms to minimize.
[2024-05-27 21:33:08] [INFO ] Deduced a trap composed of 51 places in 248 ms of which 3 ms to minimize.
[2024-05-27 21:33:09] [INFO ] Deduced a trap composed of 45 places in 264 ms of which 5 ms to minimize.
[2024-05-27 21:33:09] [INFO ] Deduced a trap composed of 26 places in 234 ms of which 2 ms to minimize.
[2024-05-27 21:33:09] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 0 ms to minimize.
[2024-05-27 21:33:09] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2024-05-27 21:33:10] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 2 ms to minimize.
[2024-05-27 21:33:10] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-05-27 21:33:10] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3528 ms
[2024-05-27 21:33:10] [INFO ] Computed and/alt/rep : 410/868/400 causal constraints (skipped 770 transitions) in 147 ms.
[2024-05-27 21:33:13] [INFO ] Added : 95 causal constraints over 19 iterations in 2475 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 39 ms. Remains 520 /520 variables (removed 0) and now considering 1192/1192 (removed 0) transitions.
Running 1190 sub problems to find dead transitions.
[2024-05-27 21:33:13] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-05-27 21:33:13] [INFO ] Invariant cache hit.
[2024-05-27 21:33:13] [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-05-27 21:33:24] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
[2024-05-27 21:33:24] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-05-27 21:33:24] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
[2024-05-27 21:33:24] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-05-27 21:33:24] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-05-27 21:33:24] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 2 ms to minimize.
[2024-05-27 21:33:24] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 0 ms to minimize.
[2024-05-27 21:33:25] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-27 21:33:25] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 0 ms to minimize.
[2024-05-27 21:33:25] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-05-27 21:33:26] [INFO ] Deduced a trap composed of 279 places in 335 ms of which 4 ms to minimize.
[2024-05-27 21:33:26] [INFO ] Deduced a trap composed of 223 places in 308 ms of which 4 ms to minimize.
[2024-05-27 21:33:27] [INFO ] Deduced a trap composed of 240 places in 350 ms of which 4 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 20031 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-05-27 21:33:44] [INFO ] Deduced a trap composed of 310 places in 269 ms of which 4 ms to minimize.
[2024-05-27 21:33:45] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 2 ms to minimize.
[2024-05-27 21:33:54] [INFO ] Deduced a trap composed of 229 places in 311 ms of which 4 ms to minimize.
[2024-05-27 21:33:55] [INFO ] Deduced a trap composed of 231 places in 285 ms of which 4 ms to minimize.
[2024-05-27 21:33:55] [INFO ] Deduced a trap composed of 216 places in 327 ms of which 5 ms to minimize.
SMT process timed out in 42592ms, After SMT, problems are : Problem set: 0 solved, 1190 unsolved
Search for dead transitions found 0 dead transitions in 42613ms
[2024-05-27 21:33:55] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-05-27 21:33:55] [INFO ] Invariant cache hit.
[2024-05-27 21:33:56] [INFO ] Implicit Places using invariants in 509 ms returned []
[2024-05-27 21:33:56] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-05-27 21:33:56] [INFO ] Invariant cache hit.
[2024-05-27 21:33:56] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 21:34:03] [INFO ] Implicit Places using invariants and state equation in 6886 ms returned []
Implicit Place search using SMT with State Equation took 7411 ms to find 0 implicit places.
[2024-05-27 21:34:03] [INFO ] Redundant transitions in 8 ms returned []
Running 1190 sub problems to find dead transitions.
[2024-05-27 21:34:03] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-05-27 21:34:03] [INFO ] Invariant cache hit.
[2024-05-27 21:34: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-05-27 21:34:14] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 2 ms to minimize.
[2024-05-27 21:34:15] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 1 ms to minimize.
[2024-05-27 21:34:15] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 1 ms to minimize.
[2024-05-27 21:34:15] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-27 21:34:15] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-27 21:34:15] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-27 21:34:15] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-05-27 21:34:15] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 1 ms to minimize.
[2024-05-27 21:34:15] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-05-27 21:34:16] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-05-27 21:34:16] [INFO ] Deduced a trap composed of 279 places in 312 ms of which 4 ms to minimize.
[2024-05-27 21:34:17] [INFO ] Deduced a trap composed of 223 places in 378 ms of which 4 ms to minimize.
[2024-05-27 21:34:17] [INFO ] Deduced a trap composed of 240 places in 314 ms of which 3 ms to minimize.
[2024-05-27 21:34:30] [INFO ] Deduced a trap composed of 217 places in 335 ms of which 6 ms to minimize.
[2024-05-27 21:34:31] [INFO ] Deduced a trap composed of 212 places in 303 ms of which 4 ms to minimize.
[2024-05-27 21:34:32] [INFO ] Deduced a trap composed of 216 places in 330 ms of which 4 ms to minimize.
[2024-05-27 21:34:32] [INFO ] Deduced a trap composed of 53 places in 173 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 518/1692 variables, and 57 constraints, problems are : Problem set: 0 solved, 1190 unsolved in 30037 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: 17/17 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, 17/57 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/519 variables, 1/58 constraints. Problems are: Problem set: 60 solved, 1130 unsolved
[2024-05-27 21:35:02] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 3 ms to minimize.
[2024-05-27 21:35:02] [INFO ] Deduced a trap composed of 64 places in 257 ms of which 5 ms to minimize.
[2024-05-27 21:35:02] [INFO ] Deduced a trap composed of 41 places in 226 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 519/1692 variables, and 61 constraints, problems are : Problem set: 60 solved, 1130 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 13/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 62278ms problems are : Problem set: 60 solved, 1130 unsolved
Search for dead transitions found 60 dead transitions in 62298ms
Found 60 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 60 transitions
Dead transitions reduction (with SMT) removed 60 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 520/520 places, 1132/1192 transitions.
Applied a total of 0 rules in 27 ms. Remains 520 /520 variables (removed 0) and now considering 1132/1132 (removed 0) transitions.
[2024-05-27 21:35:05] [INFO ] Redundant transitions in 73 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 112524 ms. Remains : 520/520 places, 1132/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 215 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 74 ms :[(NOT p0)]
RANDOM walk for 169 steps (0 resets) in 4 ms. (33 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 218 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 93 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
[2024-05-27 21:35:06] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
// Phase 1: matrix 1112 rows 520 cols
[2024-05-27 21:35:06] [INFO ] Computed 42 invariants in 24 ms
[2024-05-27 21:35:07] [INFO ] [Real]Absence check using 13 positive place invariants in 19 ms returned sat
[2024-05-27 21:35:07] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 268 ms returned sat
[2024-05-27 21:35:09] [INFO ] [Real]Absence check using state equation in 1927 ms returned sat
[2024-05-27 21:35:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:35:09] [INFO ] [Nat]Absence check using 13 positive place invariants in 28 ms returned sat
[2024-05-27 21:35:10] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 75 ms returned sat
[2024-05-27 21:35:13] [INFO ] [Nat]Absence check using state equation in 3020 ms returned sat
[2024-05-27 21:35:13] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 21:35:14] [INFO ] [Nat]Added 120 Read/Feed constraints in 1052 ms returned sat
[2024-05-27 21:35:14] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 2 ms to minimize.
[2024-05-27 21:35:15] [INFO ] Deduced a trap composed of 37 places in 370 ms of which 4 ms to minimize.
[2024-05-27 21:35:16] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 2 ms to minimize.
[2024-05-27 21:35:17] [INFO ] Deduced a trap composed of 44 places in 110 ms of which 2 ms to minimize.
[2024-05-27 21:35:17] [INFO ] Deduced a trap composed of 44 places in 236 ms of which 3 ms to minimize.
[2024-05-27 21:35:18] [INFO ] Deduced a trap composed of 42 places in 337 ms of which 6 ms to minimize.
[2024-05-27 21:35:18] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2024-05-27 21:35:18] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 1 ms to minimize.
[2024-05-27 21:35:19] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-05-27 21:35:19] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2024-05-27 21:35:19] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5773 ms
[2024-05-27 21:35:20] [INFO ] Computed and/alt/rep : 450/1268/440 causal constraints (skipped 670 transitions) in 109 ms.
[2024-05-27 21:35:22] [INFO ] Added : 117 causal constraints over 24 iterations in 2889 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 2317 reset in 502 ms.
Product exploration explored 100000 steps with 2314 reset in 460 ms.
Support contains 32 out of 520 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 520/520 places, 1132/1132 transitions.
Applied a total of 0 rules in 21 ms. Remains 520 /520 variables (removed 0) and now considering 1132/1132 (removed 0) transitions.
Running 1130 sub problems to find dead transitions.
[2024-05-27 21:35:23] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2024-05-27 21:35:23] [INFO ] Invariant cache hit.
[2024-05-27 21:35:23] [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, 1130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
[2024-05-27 21:35:42] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 2 ms to minimize.
[2024-05-27 21:35:42] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 1 ms to minimize.
[2024-05-27 21:35:42] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
[2024-05-27 21:35:43] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-05-27 21:35:43] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-27 21:35:43] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 0 ms to minimize.
[2024-05-27 21:35:43] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 0 ms to minimize.
[2024-05-27 21:35:43] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-05-27 21:35:43] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-05-27 21:35:44] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 2 ms to minimize.
[2024-05-27 21:35:44] [INFO ] Deduced a trap composed of 209 places in 528 ms of which 4 ms to minimize.
[2024-05-27 21:35:45] [INFO ] Deduced a trap composed of 208 places in 317 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 518/1632 variables, and 52 constraints, problems are : Problem set: 0 solved, 1130 unsolved in 20023 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: 1130/1130 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
[2024-05-27 21:35:56] [INFO ] Deduced a trap composed of 253 places in 333 ms of which 5 ms to minimize.
[2024-05-27 21:35:56] [INFO ] Deduced a trap composed of 221 places in 346 ms of which 4 ms to minimize.
[2024-05-27 21:36:04] [INFO ] Deduced a trap composed of 42 places in 131 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 9)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 1)
(s9 1)
(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 9)
(s183 1)
(s184 0)
(s185 1)
(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 0)
(s203 0)
(s204 0)
(s205 0)
(s206 1)
(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 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 1)
(s247 0)
(s248 0)
(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 1)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 1)
(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 1)
(s310 0)
(s311 0)
(s312 1)
(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 1)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 1)
(s363 0)
(s364 0)
(s365 1)
(s366 1)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 518/1632 variables, and 55 constraints, problems are : Problem set: 0 solved, 1130 unsolved in 20042 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/1130 constraints, Known Traps: 15/15 constraints]
After SMT, in 41793ms problems are : Problem set: 0 solved, 1130 unsolved
Search for dead transitions found 0 dead transitions in 41811ms
[2024-05-27 21:36:05] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2024-05-27 21:36:05] [INFO ] Invariant cache hit.
[2024-05-27 21:36:06] [INFO ] Implicit Places using invariants in 678 ms returned []
[2024-05-27 21:36:06] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2024-05-27 21:36:06] [INFO ] Invariant cache hit.
[2024-05-27 21:36:06] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 21:36:15] [INFO ] Implicit Places using invariants and state equation in 8995 ms returned []
Implicit Place search using SMT with State Equation took 9695 ms to find 0 implicit places.
[2024-05-27 21:36:15] [INFO ] Redundant transitions in 12 ms returned []
Running 1130 sub problems to find dead transitions.
[2024-05-27 21:36:15] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2024-05-27 21:36:15] [INFO ] Invariant cache hit.
[2024-05-27 21:36: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, 1130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
[2024-05-27 21:36:25] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 2 ms to minimize.
[2024-05-27 21:36:25] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 2 ms to minimize.
[2024-05-27 21:36:25] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2024-05-27 21:36:26] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-05-27 21:36:26] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 1 ms to minimize.
[2024-05-27 21:36:26] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
[2024-05-27 21:36:26] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 ms to minimize.
[2024-05-27 21:36:26] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 ms to minimize.
[2024-05-27 21:36:26] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 ms to minimize.
[2024-05-27 21:36:26] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 1 ms to minimize.
[2024-05-27 21:36:27] [INFO ] Deduced a trap composed of 209 places in 308 ms of which 4 ms to minimize.
[2024-05-27 21:36:27] [INFO ] Deduced a trap composed of 208 places in 279 ms of which 4 ms to minimize.
[2024-05-27 21:36:29] [INFO ] Deduced a trap composed of 241 places in 319 ms of which 4 ms to minimize.
[2024-05-27 21:36:29] [INFO ] Deduced a trap composed of 222 places in 279 ms of which 3 ms to minimize.
[2024-05-27 21:36:29] [INFO ] Deduced a trap composed of 237 places in 246 ms of which 3 ms to minimize.
[2024-05-27 21:36:29] [INFO ] Deduced a trap composed of 227 places in 241 ms of which 3 ms to minimize.
[2024-05-27 21:36:30] [INFO ] Deduced a trap composed of 217 places in 241 ms of which 3 ms to minimize.
[2024-05-27 21:36:32] [INFO ] Deduced a trap composed of 310 places in 266 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 518/1632 variables, and 58 constraints, problems are : Problem set: 0 solved, 1130 unsolved in 30051 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: 1130/1130 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
[2024-05-27 21:36:49] [INFO ] Deduced a trap composed of 262 places in 379 ms of which 6 ms to minimize.
[2024-05-27 21:36:49] [INFO ] Deduced a trap composed of 23 places in 361 ms of which 6 ms to minimize.
[2024-05-27 21:36:50] [INFO ] Deduced a trap composed of 270 places in 371 ms of which 6 ms to minimize.
[2024-05-27 21:36:52] [INFO ] Deduced a trap composed of 53 places in 192 ms of which 3 ms to minimize.
[2024-05-27 21:37:04] [INFO ] Deduced a trap composed of 68 places in 266 ms of which 4 ms to minimize.
[2024-05-27 21:37:05] [INFO ] Deduced a trap composed of 115 places in 235 ms of which 3 ms to minimize.
[2024-05-27 21:37:05] [INFO ] Deduced a trap composed of 194 places in 261 ms of which 4 ms to minimize.
[2024-05-27 21:37:07] [INFO ] Deduced a trap composed of 231 places in 310 ms of which 4 ms to minimize.
[2024-05-27 21:37:08] [INFO ] Deduced a trap composed of 3 places in 291 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
(s409 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 8)
(s1 2)
(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 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(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 9)
(s183 1)
(s184 0)
(s185 1)
(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 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 1)
(s208 0)
(s209 0)
(s210 0)
(s211 1)
(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 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(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 1)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 1)
(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)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 1)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 1)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 1)
(s363 0)
(s364 0)
(s365 1)
(s366 1)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(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 1)
(s405 0)
(s406 1)
(s407 0)
(s408 0)
(s409 0timeout
)
(s410 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 518/1632 variables, and 67 constraints, problems are : Problem set: 0 solved, 1130 unsolved in 30057 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/1130 constraints, Known Traps: 27/27 constraints]
After SMT, in 61717ms problems are : Problem set: 0 solved, 1130 unsolved
Search for dead transitions found 0 dead transitions in 61731ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 113309 ms. Remains : 520/520 places, 1132/1132 transitions.
Treatment of property PolyORBLF-COL-S02J04T10-LTLCardinality-02 finished in 371720 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 25 ms. Remains 720 /730 variables (removed 10) and now considering 1392/1402 (removed 10) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-27 21:37:17] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 720 cols
[2024-05-27 21:37:17] [INFO ] Computed 42 invariants in 36 ms
[2024-05-27 21:37:17] [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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 718/2092 variables, and 40 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20042 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: 0/0 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
[2024-05-27 21:37:41] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 1 ms to minimize.
[2024-05-27 21:37:41] [INFO ] Deduced a trap composed of 64 places in 103 ms of which 1 ms to minimize.
[2024-05-27 21:37:41] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 2 ms to minimize.
[2024-05-27 21:37:41] [INFO ] Deduced a trap composed of 64 places in 135 ms of which 2 ms to minimize.
[2024-05-27 21:37:42] [INFO ] Deduced a trap composed of 176 places in 493 ms of which 4 ms to minimize.
[2024-05-27 21:37:43] [INFO ] Deduced a trap composed of 64 places in 482 ms of which 18 ms to minimize.
[2024-05-27 21:37:43] [INFO ] Deduced a trap composed of 221 places in 308 ms of which 4 ms to minimize.
[2024-05-27 21:37:44] [INFO ] Deduced a trap composed of 422 places in 399 ms of which 5 ms to minimize.
[2024-05-27 21:37:44] [INFO ] Deduced a trap composed of 431 places in 371 ms of which 5 ms to minimize.
[2024-05-27 21:37:45] [INFO ] Deduced a trap composed of 64 places in 483 ms of which 19 ms to minimize.
[2024-05-27 21:37:46] [INFO ] Deduced a trap composed of 422 places in 682 ms of which 6 ms to minimize.
[2024-05-27 21:37:46] [INFO ] Deduced a trap composed of 439 places in 381 ms of which 5 ms to minimize.
[2024-05-27 21:37:47] [INFO ] Deduced a trap composed of 59 places in 231 ms of which 3 ms to minimize.
[2024-05-27 21:37:48] [INFO ] Deduced a trap composed of 64 places in 228 ms of which 4 ms to minimize.
[2024-05-27 21:37:48] [INFO ] Deduced a trap composed of 64 places in 199 ms of which 3 ms to minimize.
[2024-05-27 21:37:48] [INFO ] Deduced a trap composed of 32 places in 170 ms of which 4 ms to minimize.
[2024-05-27 21:37:49] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 2 ms to minimize.
[2024-05-27 21:37:51] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 2 ms to minimize.
[2024-05-27 21:37:52] [INFO ] Deduced a trap composed of 46 places in 218 ms of which 3 ms to minimize.
[2024-05-27 21:37:53] [INFO ] Deduced a trap composed of 49 places in 295 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/718 variables, 20/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 20040 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 42555ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 42579ms
[2024-05-27 21:38:00] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-27 21:38:00] [INFO ] Invariant cache hit.
[2024-05-27 21:38:00] [INFO ] Implicit Places using invariants in 580 ms returned []
[2024-05-27 21:38:00] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-27 21:38:00] [INFO ] Invariant cache hit.
[2024-05-27 21:38:01] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 21:38:10] [INFO ] Implicit Places using invariants and state equation in 10351 ms returned []
Implicit Place search using SMT with State Equation took 10944 ms to find 0 implicit places.
Running 1390 sub problems to find dead transitions.
[2024-05-27 21:38:11] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-27 21:38:11] [INFO ] Invariant cache hit.
[2024-05-27 21:38:11] [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-05-27 21:38:31] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 2 ms to minimize.
[2024-05-27 21:38:31] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-05-27 21:38:35] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-05-27 21:38:35] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-05-27 21:38:36] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-05-27 21:38:36] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 1 ms to minimize.
[2024-05-27 21:38:36] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-05-27 21:38:36] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-05-27 21:38:36] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-05-27 21:38:36] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-05-27 21:38:39] [INFO ] Deduced a trap composed of 428 places in 399 ms of which 6 ms to minimize.
[2024-05-27 21:38:39] [INFO ] Deduced a trap composed of 412 places in 387 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 718/2092 variables, and 52 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30038 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: 12/12 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, 12/52 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 21:38:46] [INFO ] Deduced a trap composed of 178 places in 433 ms of which 5 ms to minimize.
[2024-05-27 21:38:47] [INFO ] Deduced a trap composed of 221 places in 366 ms of which 4 ms to minimize.
[2024-05-27 21:38:48] [INFO ] Deduced a trap composed of 421 places in 459 ms of which 5 ms to minimize.
[2024-05-27 21:38:57] [INFO ] Deduced a trap composed of 490 places in 398 ms of which 5 ms to minimize.
[2024-05-27 21:39:00] [INFO ] Deduced a trap composed of 49 places in 260 ms of which 3 ms to minimize.
[2024-05-27 21:39:00] [INFO ] Deduced a trap composed of 46 places in 162 ms of which 3 ms to minimize.
[2024-05-27 21:39:01] [INFO ] Deduced a trap composed of 23 places in 250 ms of which 3 ms to minimize.
[2024-05-27 21:39:05] [INFO ] Deduced a trap composed of 373 places in 494 ms of which 5 ms to minimize.
[2024-05-27 21:39:07] [INFO ] Deduced a trap composed of 57 places in 210 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 718/2092 variables, and 61 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30027 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: 21/21 constraints]
After SMT, in 62830ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 62855ms
Starting structural reductions in LTL mode, iteration 1 : 720/730 places, 1392/1402 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116415 ms. Remains : 720/730 places, 1392/1402 transitions.
Stuttering acceptance computed with spot in 201 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 534 ms.
Product exploration explored 100000 steps with 50000 reset in 611 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 28 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 117870 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 18 ms. Remains 730 /730 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
Running 1400 sub problems to find dead transitions.
[2024-05-27 21:39:15] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
// Phase 1: matrix 1382 rows 730 cols
[2024-05-27 21:39:15] [INFO ] Computed 42 invariants in 29 ms
[2024-05-27 21:39:15] [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-05-27 21:39:33] [INFO ] Deduced a trap composed of 65 places in 208 ms of which 5 ms to minimize.
[2024-05-27 21:39:34] [INFO ] Deduced a trap composed of 65 places in 169 ms of which 3 ms to minimize.
[2024-05-27 21:39:34] [INFO ] Deduced a trap composed of 65 places in 143 ms of which 2 ms to minimize.
[2024-05-27 21:39:34] [INFO ] Deduced a trap composed of 65 places in 156 ms of which 1 ms to minimize.
[2024-05-27 21:39:34] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 1 ms to minimize.
[2024-05-27 21:39:34] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 1 ms to minimize.
[2024-05-27 21:39:35] [INFO ] Deduced a trap composed of 232 places in 402 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2112 variables, and 47 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20048 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: 7/7 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, 7/47 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-05-27 21:39:39] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 1 ms to minimize.
[2024-05-27 21:39:39] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 1 ms to minimize.
[2024-05-27 21:39:39] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 1 ms to minimize.
[2024-05-27 21:39:40] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
[2024-05-27 21:39:42] [INFO ] Deduced a trap composed of 449 places in 534 ms of which 19 ms to minimize.
[2024-05-27 21:39:43] [INFO ] Deduced a trap composed of 97 places in 310 ms of which 4 ms to minimize.
[2024-05-27 21:39:45] [INFO ] Deduced a trap composed of 380 places in 478 ms of which 5 ms to minimize.
[2024-05-27 21:39:45] [INFO ] Deduced a trap composed of 49 places in 483 ms of which 5 ms to minimize.
[2024-05-27 21:39:45] [INFO ] Deduced a trap composed of 361 places in 398 ms of which 4 ms to minimize.
[2024-05-27 21:39:46] [INFO ] Deduced a trap composed of 427 places in 548 ms of which 19 ms to minimize.
[2024-05-27 21:39:47] [INFO ] Deduced a trap composed of 389 places in 552 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2112 variables, and 58 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20064 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: 18/18 constraints]
After SMT, in 42805ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 42870ms
[2024-05-27 21:39:58] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-27 21:39:58] [INFO ] Invariant cache hit.
[2024-05-27 21:39:58] [INFO ] Implicit Places using invariants in 643 ms returned []
[2024-05-27 21:39:58] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-27 21:39:58] [INFO ] Invariant cache hit.
[2024-05-27 21:39:59] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 21:40:12] [INFO ] Implicit Places using invariants and state equation in 14068 ms returned []
Implicit Place search using SMT with State Equation took 14748 ms to find 0 implicit places.
Running 1400 sub problems to find dead transitions.
[2024-05-27 21:40:12] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-27 21:40:12] [INFO ] Invariant cache hit.
[2024-05-27 21:40:12] [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-05-27 21:40:31] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 2 ms to minimize.
[2024-05-27 21:40:31] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 1 ms to minimize.
[2024-05-27 21:40:31] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 1 ms to minimize.
[2024-05-27 21:40:31] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 1 ms to minimize.
[2024-05-27 21:40:31] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 1 ms to minimize.
[2024-05-27 21:40:31] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 1 ms to minimize.
[2024-05-27 21:40:31] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 1 ms to minimize.
[2024-05-27 21:40:32] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 1 ms to minimize.
[2024-05-27 21:40:32] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 2 ms to minimize.
[2024-05-27 21:40:33] [INFO ] Deduced a trap composed of 379 places in 450 ms of which 5 ms to minimize.
[2024-05-27 21:40:33] [INFO ] Deduced a trap composed of 398 places in 475 ms of which 5 ms to minimize.
[2024-05-27 21:40:34] [INFO ] Deduced a trap composed of 236 places in 406 ms of which 7 ms to minimize.
[2024-05-27 21:40:34] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 2 ms to minimize.
[2024-05-27 21:40:35] [INFO ] Deduced a trap composed of 432 places in 536 ms of which 21 ms to minimize.
[2024-05-27 21:40:35] [INFO ] Deduced a trap composed of 57 places in 222 ms of which 3 ms to minimize.
[2024-05-27 21:40:36] [INFO ] Deduced a trap composed of 387 places in 422 ms of which 4 ms to minimize.
[2024-05-27 21:40:37] [INFO ] Deduced a trap composed of 358 places in 418 ms of which 6 ms to minimize.
[2024-05-27 21:40:37] [INFO ] Deduced a trap composed of 46 places in 370 ms of which 6 ms to minimize.
[2024-05-27 21:40:38] [INFO ] Deduced a trap composed of 46 places in 401 ms of which 5 ms to minimize.
[2024-05-27 21:40:38] [INFO ] Deduced a trap composed of 369 places in 351 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 30058 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-05-27 21:40:58] [INFO ] Deduced a trap composed of 407 places in 552 ms of which 21 ms to minimize.
[2024-05-27 21:41:01] [INFO ] Deduced a trap composed of 397 places in 548 ms of which 21 ms to minimize.
[2024-05-27 21:41:01] [INFO ] Deduced a trap composed of 46 places in 225 ms of which 6 ms to minimize.
[2024-05-27 21:41:02] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 5 ms to minimize.
[2024-05-27 21:41:02] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 3 ms to minimize.
[2024-05-27 21:41:07] [INFO ] Deduced a trap composed of 376 places in 470 ms of which 6 ms to minimize.
[2024-05-27 21:41:09] [INFO ] Deduced a trap composed of 401 places in 359 ms of which 6 ms to minimize.
[2024-05-27 21:41:10] [INFO ] Deduced a trap composed of 480 places in 340 ms of which 5 ms to minimize.
[2024-05-27 21:41:10] [INFO ] Deduced a trap composed of 496 places in 309 ms of which 4 ms to minimize.
[2024-05-27 21:41:10] [INFO ] Deduced a trap composed of 374 places in 320 ms of which 4 ms to minimize.
[2024-05-27 21:41:11] [INFO ] Deduced a trap composed of 388 places in 319 ms of which 4 ms to minimize.
[2024-05-27 21:41:14] [INFO ] Deduced a trap composed of 209 places in 367 ms of which 5 ms to minimize.
[2024-05-27 21:41:15] [INFO ] Deduced a trap composed of 441 places in 283 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 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: 0/1400 constraints, Known Traps: 33/33 constraints]
After SMT, in 62708ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 62745ms
Finished structural reductions in LTL mode , in 1 iterations and 120408 ms. Remains : 730/730 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 119 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 33335 reset in 609 ms.
Product exploration explored 100000 steps with 33482 reset in 537 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 328 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 133 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (13 resets) in 415 ms. (96 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 420 ms. (95 steps per ms) remains 1/1 properties
[2024-05-27 21:41:17] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-27 21:41:17] [INFO ] Invariant cache hit.
[2024-05-27 21:41:17] [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 186 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 211ms 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 254 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 83 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 86 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 56 ms. Remains 730 /730 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
Running 1400 sub problems to find dead transitions.
[2024-05-27 21:41:18] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-27 21:41:18] [INFO ] Invariant cache hit.
[2024-05-27 21:41:18] [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-05-27 21:41:35] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 1 ms to minimize.
[2024-05-27 21:41:35] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 1 ms to minimize.
[2024-05-27 21:41:35] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 1 ms to minimize.
[2024-05-27 21:41:35] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 1 ms to minimize.
[2024-05-27 21:41:35] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 1 ms to minimize.
[2024-05-27 21:41:36] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 2 ms to minimize.
[2024-05-27 21:41:36] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 1 ms to minimize.
[2024-05-27 21:41:36] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 2 ms to minimize.
[2024-05-27 21:41:36] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 1 ms to minimize.
[2024-05-27 21:41:37] [INFO ] Deduced a trap composed of 379 places in 391 ms of which 5 ms to minimize.
[2024-05-27 21:41:37] [INFO ] Deduced a trap composed of 398 places in 362 ms of which 5 ms to minimize.
[2024-05-27 21:41:38] [INFO ] Deduced a trap composed of 236 places in 367 ms of which 8 ms to minimize.
[2024-05-27 21:41:38] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 1 ms to minimize.
[2024-05-27 21:41:39] [INFO ] Deduced a trap composed of 432 places in 387 ms of which 5 ms to minimize.
[2024-05-27 21:41:39] [INFO ] Deduced a trap composed of 57 places in 184 ms of which 2 ms to minimize.
[2024-05-27 21:41:40] [INFO ] Deduced a trap composed of 387 places in 395 ms of which 5 ms to minimize.
[2024-05-27 21:41:41] [INFO ] Deduced a trap composed of 358 places in 402 ms of which 5 ms to minimize.
SMT process timed out in 22676ms, After SMT, problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 22697ms
[2024-05-27 21:41:41] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-27 21:41:41] [INFO ] Invariant cache hit.
[2024-05-27 21:41:41] [INFO ] Implicit Places using invariants in 562 ms returned []
[2024-05-27 21:41:41] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-27 21:41:41] [INFO ] Invariant cache hit.
[2024-05-27 21:41:42] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 21:41:54] [INFO ] Implicit Places using invariants and state equation in 12422 ms returned []
Implicit Place search using SMT with State Equation took 12987 ms to find 0 implicit places.
Running 1400 sub problems to find dead transitions.
[2024-05-27 21:41:54] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-27 21:41:54] [INFO ] Invariant cache hit.
[2024-05-27 21:41: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-05-27 21:42:15] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 1 ms to minimize.
[2024-05-27 21:42:15] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 1 ms to minimize.
[2024-05-27 21:42:15] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 1 ms to minimize.
[2024-05-27 21:42:15] [INFO ] Deduced a trap composed of 65 places in 148 ms of which 1 ms to minimize.
[2024-05-27 21:42:15] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 1 ms to minimize.
[2024-05-27 21:42:15] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 1 ms to minimize.
[2024-05-27 21:42:15] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 1 ms to minimize.
[2024-05-27 21:42:15] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 1 ms to minimize.
[2024-05-27 21:42:15] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 1 ms to minimize.
[2024-05-27 21:42:16] [INFO ] Deduced a trap composed of 379 places in 399 ms of which 6 ms to minimize.
[2024-05-27 21:42:17] [INFO ] Deduced a trap composed of 398 places in 405 ms of which 5 ms to minimize.
[2024-05-27 21:42:17] [INFO ] Deduced a trap composed of 236 places in 367 ms of which 6 ms to minimize.
[2024-05-27 21:42:17] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 1 ms to minimize.
[2024-05-27 21:42:19] [INFO ] Deduced a trap composed of 432 places in 405 ms of which 6 ms to minimize.
[2024-05-27 21:42:19] [INFO ] Deduced a trap composed of 57 places in 207 ms of which 3 ms to minimize.
[2024-05-27 21:42:20] [INFO ] Deduced a trap composed of 387 places in 437 ms of which 5 ms to minimize.
[2024-05-27 21:42:21] [INFO ] Deduced a trap composed of 358 places in 536 ms of which 19 ms to minimize.
[2024-05-27 21:42:21] [INFO ] Deduced a trap composed of 46 places in 502 ms of which 8 ms to minimize.
[2024-05-27 21:42:22] [INFO ] Deduced a trap composed of 46 places in 402 ms of which 6 ms to minimize.
[2024-05-27 21:42:22] [INFO ] Deduced a trap composed of 369 places in 419 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 30030 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-05-27 21:42:39] [INFO ] Deduced a trap composed of 407 places in 350 ms of which 4 ms to minimize.
[2024-05-27 21:42:41] [INFO ] Deduced a trap composed of 397 places in 349 ms of which 4 ms to minimize.
[2024-05-27 21:42:42] [INFO ] Deduced a trap composed of 46 places in 176 ms of which 3 ms to minimize.
[2024-05-27 21:42:42] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 2 ms to minimize.
[2024-05-27 21:42:42] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 2 ms to minimize.
[2024-05-27 21:42:47] [INFO ] Deduced a trap composed of 376 places in 427 ms of which 6 ms to minimize.
[2024-05-27 21:42:49] [INFO ] Deduced a trap composed of 401 places in 484 ms of which 5 ms to minimize.
[2024-05-27 21:42:50] [INFO ] Deduced a trap composed of 480 places in 484 ms of which 5 ms to minimize.
[2024-05-27 21:42:50] [INFO ] Deduced a trap composed of 496 places in 362 ms of which 7 ms to minimize.
[2024-05-27 21:42:51] [INFO ] Deduced a trap composed of 374 places in 375 ms of which 4 ms to minimize.
[2024-05-27 21:42:51] [INFO ] Deduced a trap composed of 388 places in 400 ms of which 5 ms to minimize.
[2024-05-27 21:42:56] [INFO ] Deduced a trap composed of 209 places in 387 ms of which 6 ms to minimize.
[2024-05-27 21:42:56] [INFO ] Deduced a trap composed of 441 places in 316 ms of which 4 ms to minimize.
SMT process timed out in 62672ms, After SMT, problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 62695ms
Finished structural reductions in LTL mode , in 1 iterations and 98449 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 137 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 217 steps (0 resets) in 12 ms. (16 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 297 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 89 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 33337 reset in 589 ms.
Product exploration explored 100000 steps with 33347 reset in 613 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 20 ms. Remains 730 /730 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
Running 1400 sub problems to find dead transitions.
[2024-05-27 21:42:59] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-27 21:42:59] [INFO ] Invariant cache hit.
[2024-05-27 21:42:59] [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
SMT process timed out in 22220ms, After SMT, problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 22241ms
[2024-05-27 21:43:21] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-27 21:43:21] [INFO ] Invariant cache hit.
[2024-05-27 21:43:22] [INFO ] Implicit Places using invariants in 638 ms returned []
[2024-05-27 21:43:22] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-27 21:43:22] [INFO ] Invariant cache hit.
[2024-05-27 21:43:22] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 21:43:35] [INFO ] Implicit Places using invariants and state equation in 13545 ms returned []
Implicit Place search using SMT with State Equation took 14209 ms to find 0 implicit places.
Running 1400 sub problems to find dead transitions.
[2024-05-27 21:43:35] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-27 21:43:35] [INFO ] Invariant cache hit.
[2024-05-27 21:43:35] [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-05-27 21:43:53] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 0 ms to minimize.
[2024-05-27 21:43:53] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 1 ms to minimize.
[2024-05-27 21:43:53] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 1 ms to minimize.
[2024-05-27 21:43:53] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 1 ms to minimize.
[2024-05-27 21:43:53] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 1 ms to minimize.
[2024-05-27 21:43:53] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 1 ms to minimize.
[2024-05-27 21:43:54] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 1 ms to minimize.
[2024-05-27 21:43:54] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 2 ms to minimize.
[2024-05-27 21:43:54] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 1 ms to minimize.
[2024-05-27 21:43:55] [INFO ] Deduced a trap composed of 379 places in 527 ms of which 11 ms to minimize.
[2024-05-27 21:43:55] [INFO ] Deduced a trap composed of 398 places in 415 ms of which 6 ms to minimize.
[2024-05-27 21:43:56] [INFO ] Deduced a trap composed of 236 places in 415 ms of which 6 ms to minimize.
[2024-05-27 21:43:56] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 2 ms to minimize.
[2024-05-27 21:43:57] [INFO ] Deduced a trap composed of 432 places in 438 ms of which 5 ms to minimize.
[2024-05-27 21:43:57] [INFO ] Deduced a trap composed of 57 places in 186 ms of which 3 ms to minimize.
[2024-05-27 21:43:58] [INFO ] Deduced a trap composed of 387 places in 392 ms of which 5 ms to minimize.
[2024-05-27 21:43:59] [INFO ] Deduced a trap composed of 358 places in 512 ms of which 5 ms to minimize.
[2024-05-27 21:43:59] [INFO ] Deduced a trap composed of 46 places in 408 ms of which 5 ms to minimize.
[2024-05-27 21:44:00] [INFO ] Deduced a trap composed of 46 places in 423 ms of which 5 ms to minimize.
[2024-05-27 21:44:00] [INFO ] Deduced a trap composed of 369 places in 384 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
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 30049 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-05-27 21:44:22] [INFO ] Deduced a trap composed of 407 places in 770 ms of which 19 ms to minimize.
[2024-05-27 21:44:25] [INFO ] Deduced a trap composed of 397 places in 603 ms of which 9 ms to minimize.
[2024-05-27 21:44:26] [INFO ] Deduced a trap composed of 46 places in 264 ms of which 15 ms to minimize.
[2024-05-27 21:44:26] [INFO ] Deduced a trap composed of 25 places in 267 ms of which 5 ms to minimize.
[2024-05-27 21:44:26] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 3 ms to minimize.
[2024-05-27 21:44:32] [INFO ] Deduced a trap composed of 376 places in 346 ms of which 4 ms to minimize.
[2024-05-27 21:44:33] [INFO ] Deduced a trap composed of 401 places in 527 ms of which 21 ms to minimize.
[2024-05-27 21:44:34] [INFO ] Deduced a trap composed of 480 places in 415 ms of which 4 ms to minimize.
[2024-05-27 21:44:34] [INFO ] Deduced a trap composed of 496 places in 511 ms of which 7 ms to minimize.
[2024-05-27 21:44:35] [INFO ] Deduced a trap composed of 374 places in 437 ms of which 6 ms to minimize.
[2024-05-27 21:44:35] [INFO ] Deduced a trap composed of 388 places in 521 ms of which 19 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2112 variables, and 71 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: 31/31 constraints]
After SMT, in 62570ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 62592ms
Finished structural reductions in LTL mode , in 1 iterations and 99076 ms. Remains : 730/730 places, 1402/1402 transitions.
Treatment of property PolyORBLF-COL-S02J04T10-LTLCardinality-08 finished in 323167 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 0 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 80 ms. Remains 530 /730 variables (removed 200) and now considering 1202/1402 (removed 200) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-27 21:44:38] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
// Phase 1: matrix 1182 rows 530 cols
[2024-05-27 21:44:38] [INFO ] Computed 42 invariants in 26 ms
[2024-05-27 21:44:38] [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-05-27 21:44:51] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 2 ms to minimize.
[2024-05-27 21:44:51] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 2 ms to minimize.
[2024-05-27 21:44:51] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 1 ms to minimize.
[2024-05-27 21:44:51] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 0 ms to minimize.
[2024-05-27 21:44:51] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2024-05-27 21:44:51] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 1 ms to minimize.
[2024-05-27 21:44:51] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 0 ms to minimize.
[2024-05-27 21:44:51] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-05-27 21:44:52] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2024-05-27 21:44:53] [INFO ] Deduced a trap composed of 249 places in 390 ms of which 7 ms to minimize.
[2024-05-27 21:44:53] [INFO ] Deduced a trap composed of 244 places in 390 ms of which 7 ms to minimize.
[2024-05-27 21:44:58] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
[2024-05-27 21:45:00] [INFO ] Deduced a trap composed of 212 places in 385 ms of which 7 ms to minimize.
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 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: 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-05-27 21:45:05] [INFO ] Deduced a trap composed of 45 places in 165 ms of which 2 ms to minimize.
[2024-05-27 21:45:05] [INFO ] Deduced a trap composed of 44 places in 177 ms of which 2 ms to minimize.
[2024-05-27 21:45:11] [INFO ] Deduced a trap composed of 68 places in 197 ms of which 3 ms to minimize.
[2024-05-27 21:45:17] [INFO ] Deduced a trap composed of 320 places in 297 ms of which 4 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 20029 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 42133ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 42149ms
[2024-05-27 21:45:20] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-05-27 21:45:20] [INFO ] Invariant cache hit.
[2024-05-27 21:45:25] [INFO ] Implicit Places using invariants in 4466 ms returned []
[2024-05-27 21:45:25] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-05-27 21:45:25] [INFO ] Invariant cache hit.
[2024-05-27 21:45:25] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 21:45:33] [INFO ] Implicit Places using invariants and state equation in 8482 ms returned []
Implicit Place search using SMT with State Equation took 12954 ms to find 0 implicit places.
[2024-05-27 21:45:33] [INFO ] Redundant transitions in 12 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-27 21:45:33] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-05-27 21:45:33] [INFO ] Invariant cache hit.
[2024-05-27 21:45:33] [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-05-27 21:45:45] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 2 ms to minimize.
[2024-05-27 21:45:45] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 2 ms to minimize.
[2024-05-27 21:45:45] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2024-05-27 21:45:46] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-05-27 21:45:46] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2024-05-27 21:45:46] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2024-05-27 21:45:46] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
[2024-05-27 21:45:46] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2024-05-27 21:45:46] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-05-27 21:45:47] [INFO ] Deduced a trap composed of 231 places in 430 ms of which 4 ms to minimize.
[2024-05-27 21:45:49] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
[2024-05-27 21:46:05] [INFO ] Deduced a trap composed of 218 places in 299 ms of which 4 ms to minimize.
SMT process timed out in 32051ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 32068ms
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 87282 ms. Remains : 530/730 places, 1202/1402 transitions.
Stuttering acceptance computed with spot in 152 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 803 reset in 718 ms.
Product exploration explored 100000 steps with 753 reset in 611 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 172 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 112 ms :[(AND (NOT p0) (NOT p2)), true, (NOT p2)]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40001 steps (16 resets) in 353 ms. (112 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 520 ms. (76 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 392 ms. (101 steps per ms) remains 2/2 properties
[2024-05-27 21:46:07] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-05-27 21:46:07] [INFO ] Invariant cache hit.
[2024-05-27 21:46:07] [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 1678 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-05-27 21:46:10] [INFO ] Deduced a trap composed of 184 places in 138 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-05-27 21:46:10] [INFO ] Deduced a trap composed of 45 places in 332 ms of which 5 ms to minimize.
[2024-05-27 21:46:10] [INFO ] Deduced a trap composed of 45 places in 319 ms of which 4 ms to minimize.
[2024-05-27 21:46:11] [INFO ] Deduced a trap composed of 207 places in 397 ms of which 4 ms to minimize.
[2024-05-27 21:46:11] [INFO ] Deduced a trap composed of 45 places in 347 ms of which 4 ms to minimize.
[2024-05-27 21:46:12] [INFO ] Deduced a trap composed of 45 places in 256 ms of which 3 ms to minimize.
[2024-05-27 21:46:12] [INFO ] Deduced a trap composed of 237 places in 300 ms of which 3 ms to minimize.
[2024-05-27 21:46:12] [INFO ] Deduced a trap composed of 45 places in 296 ms of which 3 ms to minimize.
[2024-05-27 21:46:13] [INFO ] Deduced a trap composed of 45 places in 319 ms of which 3 ms to minimize.
[2024-05-27 21:46:13] [INFO ] Deduced a trap composed of 45 places in 291 ms of which 3 ms to minimize.
[2024-05-27 21:46:13] [INFO ] Deduced a trap composed of 45 places in 350 ms of which 3 ms to minimize.
[2024-05-27 21:46:14] [INFO ] Deduced a trap composed of 216 places in 317 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 4370 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 6119ms 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 510 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 162 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 120 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 37 ms. Remains 530 /530 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-27 21:46:14] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-05-27 21:46:14] [INFO ] Invariant cache hit.
[2024-05-27 21:46:15] [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-05-27 21:46:29] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 2 ms to minimize.
[2024-05-27 21:46:29] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2024-05-27 21:46:29] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-05-27 21:46:29] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 0 ms to minimize.
[2024-05-27 21:46:29] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
[2024-05-27 21:46:29] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 0 ms to minimize.
[2024-05-27 21:46:29] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-05-27 21:46:29] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-05-27 21:46:29] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-05-27 21:46:30] [INFO ] Deduced a trap composed of 231 places in 291 ms of which 4 ms to minimize.
[2024-05-27 21:46:32] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 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 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.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 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 528/1712 variables, and 51 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: 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-05-27 21:46:46] [INFO ] Deduced a trap composed of 336 places in 422 ms of which 19 ms to minimize.
[2024-05-27 21:46:47] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 2 ms to minimize.
[2024-05-27 21:46:53] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 3 ms to minimize.
[2024-05-27 21:46:56] [INFO ] Deduced a trap composed of 195 places in 241 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1712 variables, and 55 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 20063 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: 15/15 constraints]
After SMT, in 43108ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 43138ms
[2024-05-27 21:46:58] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-05-27 21:46:58] [INFO ] Invariant cache hit.
[2024-05-27 21:46:58] [INFO ] Implicit Places using invariants in 459 ms returned []
[2024-05-27 21:46:58] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-05-27 21:46:58] [INFO ] Invariant cache hit.
[2024-05-27 21:46:59] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 21:47:07] [INFO ] Implicit Places using invariants and state equation in 8795 ms returned []
Implicit Place search using SMT with State Equation took 9256 ms to find 0 implicit places.
[2024-05-27 21:47:07] [INFO ] Redundant transitions in 24 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-27 21:47:07] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-05-27 21:47:07] [INFO ] Invariant cache hit.
[2024-05-27 21:47:07] [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-05-27 21:47:19] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 2 ms to minimize.
[2024-05-27 21:47:19] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2024-05-27 21:47:19] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-05-27 21:47:19] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 0 ms to minimize.
[2024-05-27 21:47:19] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-05-27 21:47:19] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2024-05-27 21:47:19] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
[2024-05-27 21:47:19] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 1 ms to minimize.
[2024-05-27 21:47:19] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
[2024-05-27 21:47:20] [INFO ] Deduced a trap composed of 231 places in 321 ms of which 4 ms to minimize.
[2024-05-27 21:47:22] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2024-05-27 21:47:33] [INFO ] Deduced a trap composed of 218 places in 288 ms of which 4 ms to minimize.
[2024-05-27 21:47:34] [INFO ] Deduced a trap composed of 3 places in 279 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-05-27 21:47:39] [INFO ] Deduced a trap composed of 37 places in 248 ms of which 3 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 30031 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-05-27 21:47:47] [INFO ] Deduced a trap composed of 320 places in 300 ms of which 4 ms to minimize.
[2024-05-27 21:47:50] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 2/56 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 56 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30022 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: 16/16 constraints]
After SMT, in 62119ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 62141ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 114629 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 143 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 84 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
RANDOM walk for 242 steps (0 resets) in 14 ms. (16 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 196 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 104 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 783 reset in 486 ms.
Product exploration explored 100000 steps with 807 reset in 466 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 28 ms. Remains 510 /530 variables (removed 20) and now considering 1182/1202 (removed 20) transitions.
Running 1180 sub problems to find dead transitions.
[2024-05-27 21:48:11] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
// Phase 1: matrix 1162 rows 510 cols
[2024-05-27 21:48:11] [INFO ] Computed 42 invariants in 34 ms
[2024-05-27 21:48:11] [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-05-27 21:48:22] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 1 ms to minimize.
[2024-05-27 21:48:22] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2024-05-27 21:48:22] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 0 ms to minimize.
[2024-05-27 21:48:23] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 0 ms to minimize.
[2024-05-27 21:48:23] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
[2024-05-27 21:48:23] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 0 ms to minimize.
[2024-05-27 21:48:23] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 0 ms to minimize.
[2024-05-27 21:48:23] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 0 ms to minimize.
[2024-05-27 21:48:23] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2024-05-27 21:48:23] [INFO ] Deduced a trap composed of 223 places in 265 ms of which 3 ms to minimize.
[2024-05-27 21:48:24] [INFO ] Deduced a trap composed of 224 places in 266 ms of which 4 ms to minimize.
[2024-05-27 21:48:25] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-05-27 21:48:30] [INFO ] Deduced a trap composed of 217 places in 304 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/1672 variables, and 53 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 20043 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: 13/13 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, 13/53 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-05-27 21:48:35] [INFO ] Deduced a trap composed of 23 places in 334 ms of which 5 ms to minimize.
[2024-05-27 21:48:36] [INFO ] Deduced a trap composed of 221 places in 308 ms of which 4 ms to minimize.
[2024-05-27 21:48:40] [INFO ] Deduced a trap composed of 37 places in 179 ms of which 3 ms to minimize.
[2024-05-27 21:48:50] [INFO ] Deduced a trap composed of 171 places in 304 ms of which 4 ms to minimize.
[2024-05-27 21:48:51] [INFO ] Deduced a trap composed of 3 places in 271 ms of which 3 ms to minimize.
[2024-05-27 21:48:52] [INFO ] Deduced a trap composed of 109 places in 269 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/508 variables, 6/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 20034 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 42259ms problems are : Problem set: 0 solved, 1180 unsolved
Search for dead transitions found 0 dead transitions in 42273ms
[2024-05-27 21:48:53] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-05-27 21:48:53] [INFO ] Invariant cache hit.
[2024-05-27 21:48:54] [INFO ] Implicit Places using invariants in 499 ms returned []
[2024-05-27 21:48:54] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-05-27 21:48:54] [INFO ] Invariant cache hit.
[2024-05-27 21:48:54] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 21:49:01] [INFO ] Implicit Places using invariants and state equation in 7003 ms returned []
Implicit Place search using SMT with State Equation took 7508 ms to find 0 implicit places.
[2024-05-27 21:49:01] [INFO ] Redundant transitions in 20 ms returned []
Running 1180 sub problems to find dead transitions.
[2024-05-27 21:49:01] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-05-27 21:49:01] [INFO ] Invariant cache hit.
[2024-05-27 21:49:01] [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-05-27 21:49:13] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 3 ms to minimize.
[2024-05-27 21:49:13] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 2 ms to minimize.
[2024-05-27 21:49:13] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 1 ms to minimize.
[2024-05-27 21:49:13] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-05-27 21:49:13] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-05-27 21:49:13] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-05-27 21:49:13] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
[2024-05-27 21:49:13] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-05-27 21:49:13] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2024-05-27 21:49:14] [INFO ] Deduced a trap composed of 221 places in 322 ms of which 3 ms to minimize.
[2024-05-27 21:49:14] [INFO ] Deduced a trap composed of 183 places in 322 ms of which 4 ms to minimize.
[2024-05-27 21:49:15] [INFO ] Deduced a trap composed of 23 places in 320 ms of which 4 ms to minimize.
[2024-05-27 21:49:15] [INFO ] Deduced a trap composed of 230 places in 343 ms of which 3 ms to minimize.
[2024-05-27 21:49:15] [INFO ] Deduced a trap composed of 216 places in 307 ms of which 4 ms to minimize.
[2024-05-27 21:49:16] [INFO ] Deduced a trap composed of 203 places in 291 ms of which 3 ms to minimize.
[2024-05-27 21:49:17] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 2 ms to minimize.
[2024-05-27 21:49:27] [INFO ] Deduced a trap composed of 111 places in 269 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 17/57 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 57 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 30024 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-05-27 21:49:48] [INFO ] Deduced a trap composed of 176 places in 259 ms of which 3 ms to minimize.
[2024-05-27 21:49:49] [INFO ] Deduced a trap composed of 3 places in 241 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-05-27 21:49:55] [INFO ] Deduced a trap composed of 54 places in 140 ms of which 2 ms to minimize.
[2024-05-27 21:49:55] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 2 ms to minimize.
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 30024 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 62605ms problems are : Problem set: 0 solved, 1180 unsolved
Search for dead transitions found 0 dead transitions in 62627ms
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 112478 ms. Remains : 510/530 places, 1182/1202 transitions.
Treatment of property PolyORBLF-COL-S02J04T10-LTLCardinality-13 finished in 325401 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 123 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 0 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 56 ms. Remains 510 /730 variables (removed 220) and now considering 1182/1402 (removed 220) transitions.
Running 1180 sub problems to find dead transitions.
[2024-05-27 21:50:04] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
// Phase 1: matrix 1162 rows 510 cols
[2024-05-27 21:50:04] [INFO ] Computed 42 invariants in 33 ms
[2024-05-27 21:50:04] [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-05-27 21:50:16] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 1 ms to minimize.
[2024-05-27 21:50:16] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2024-05-27 21:50:16] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2024-05-27 21:50:16] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-05-27 21:50:16] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-05-27 21:50:16] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-05-27 21:50:16] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2024-05-27 21:50:16] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-05-27 21:50:16] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2024-05-27 21:50:17] [INFO ] Deduced a trap composed of 190 places in 312 ms of which 4 ms to minimize.
[2024-05-27 21:50:17] [INFO ] Deduced a trap composed of 190 places in 288 ms of which 3 ms to minimize.
[2024-05-27 21:50:17] [INFO ] Deduced a trap composed of 199 places in 323 ms of which 4 ms to minimize.
[2024-05-27 21:50:18] [INFO ] Deduced a trap composed of 210 places in 284 ms of which 4 ms to minimize.
[2024-05-27 21:50:18] [INFO ] Deduced a trap composed of 232 places in 374 ms of which 6 ms to minimize.
[2024-05-27 21:50:18] [INFO ] Deduced a trap composed of 214 places in 311 ms of which 4 ms to minimize.
[2024-05-27 21:50:19] [INFO ] Deduced a trap composed of 190 places in 378 ms of which 4 ms to minimize.
[2024-05-27 21:50:19] [INFO ] Deduced a trap composed of 199 places in 433 ms of which 3 ms to minimize.
[2024-05-27 21:50:21] [INFO ] Deduced a trap composed of 23 places in 257 ms of which 4 ms to minimize.
[2024-05-27 21:50:21] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 0.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.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 10.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)timeout

(s211 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 59 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 20030 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-05-27 21:50:28] [INFO ] Deduced a trap composed of 172 places in 290 ms of which 4 ms to minimize.
[2024-05-27 21:50:33] [INFO ] Deduced a trap composed of 301 places in 287 ms of which 4 ms to minimize.
[2024-05-27 21:50:33] [INFO ] Deduced a trap composed of 210 places in 249 ms of which 3 ms to minimize.
[2024-05-27 21:50:42] [INFO ] Deduced a trap composed of 182 places in 295 ms of which 3 ms to minimize.
[2024-05-27 21:50:43] [INFO ] Deduced a trap composed of 196 places in 273 ms of which 4 ms to minimize.
[2024-05-27 21:50:44] [INFO ] Deduced a trap composed of 246 places in 282 ms of which 4 ms to minimize.
[2024-05-27 21:50:45] [INFO ] Deduced a trap composed of 212 places in 320 ms of which 4 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 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: 26/26 constraints]
After SMT, in 42493ms problems are : Problem set: 0 solved, 1180 unsolved
Search for dead transitions found 0 dead transitions in 42508ms
[2024-05-27 21:50:46] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-05-27 21:50:46] [INFO ] Invariant cache hit.
[2024-05-27 21:50:47] [INFO ] Implicit Places using invariants in 431 ms returned []
[2024-05-27 21:50:47] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-05-27 21:50:47] [INFO ] Invariant cache hit.
[2024-05-27 21:50:47] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 21:50:53] [INFO ] Implicit Places using invariants and state equation in 6276 ms returned []
Implicit Place search using SMT with State Equation took 6716 ms to find 0 implicit places.
Running 1180 sub problems to find dead transitions.
[2024-05-27 21:50:53] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-05-27 21:50:53] [INFO ] Invariant cache hit.
[2024-05-27 21:50:53] [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-05-27 21:51:05] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 2 ms to minimize.
[2024-05-27 21:51:05] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 2 ms to minimize.
[2024-05-27 21:51:05] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 1 ms to minimize.
[2024-05-27 21:51:05] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 1 ms to minimize.
[2024-05-27 21:51:05] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 0 ms to minimize.
[2024-05-27 21:51:05] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2024-05-27 21:51:06] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-05-27 21:51:06] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-05-27 21:51:06] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2024-05-27 21:51:06] [INFO ] Deduced a trap composed of 191 places in 307 ms of which 4 ms to minimize.
[2024-05-27 21:51:07] [INFO ] Deduced a trap composed of 213 places in 326 ms of which 5 ms to minimize.
[2024-05-27 21:51:07] [INFO ] Deduced a trap composed of 196 places in 306 ms of which 4 ms to minimize.
[2024-05-27 21:51:07] [INFO ] Deduced a trap composed of 189 places in 329 ms of which 4 ms to minimize.
[2024-05-27 21:51:08] [INFO ] Deduced a trap composed of 198 places in 311 ms of which 4 ms to minimize.
[2024-05-27 21:51:08] [INFO ] Deduced a trap composed of 196 places in 312 ms of which 3 ms to minimize.
[2024-05-27 21:51:08] [INFO ] Deduced a trap composed of 199 places in 307 ms of which 3 ms to minimize.
[2024-05-27 21:51:09] [INFO ] Deduced a trap composed of 23 places in 289 ms of which 3 ms to minimize.
[2024-05-27 21:51:09] [INFO ] Deduced a trap composed of 199 places in 355 ms of which 21 ms to minimize.
[2024-05-27 21:51:09] [INFO ] Deduced a trap composed of 207 places in 412 ms of which 4 ms to minimize.
[2024-05-27 21:51:10] [INFO ] Deduced a trap composed of 198 places in 288 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-05-27 21:51:10] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 0 ms to minimize.
[2024-05-27 21:51:11] [INFO ] Deduced a trap composed of 205 places in 319 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 30032 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-05-27 21:51:27] [INFO ] Deduced a trap composed of 63 places in 122 ms of which 2 ms to minimize.
[2024-05-27 21:51:32] [INFO ] Deduced a trap composed of 310 places in 324 ms of which 5 ms to minimize.
[2024-05-27 21:51:41] [INFO ] Deduced a trap composed of 196 places in 242 ms of which 3 ms to minimize.
[2024-05-27 21:51:43] [INFO ] Deduced a trap composed of 176 places in 248 ms of which 3 ms to minimize.
[2024-05-27 21:51:44] [INFO ] Deduced a trap composed of 187 places in 311 ms of which 4 ms to minimize.
[2024-05-27 21:51:44] [INFO ] Deduced a trap composed of 316 places in 289 ms of which 4 ms to minimize.
[2024-05-27 21:51:44] [INFO ] Deduced a trap composed of 324 places in 363 ms of which 7 ms to minimize.
[2024-05-27 21:51:45] [INFO ] Deduced a trap composed of 200 places in 380 ms of which 3 ms to minimize.
[2024-05-27 21:51:46] [INFO ] Deduced a trap composed of 113 places in 328 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 30028 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 62556ms problems are : Problem set: 0 solved, 1180 unsolved
Search for dead transitions found 0 dead transitions in 62581ms
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 111872 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 33411 reset in 456 ms.
Product exploration explored 100000 steps with 33344 reset in 469 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 219 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 133 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (14 resets) in 337 ms. (118 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (11 resets) in 170 ms. (233 steps per ms) remains 1/1 properties
[2024-05-27 21:51:57] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-05-27 21:51:57] [INFO ] Invariant cache hit.
[2024-05-27 21:51:57] [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 181 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 202ms 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 391 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 127 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 95 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 7 ms. Remains 510 /510 variables (removed 0) and now considering 1182/1182 (removed 0) transitions.
Running 1180 sub problems to find dead transitions.
[2024-05-27 21:51:58] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-05-27 21:51:58] [INFO ] Invariant cache hit.
[2024-05-27 21:51:58] [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-05-27 21:52:10] [INFO ] Deduced a trap composed of 43 places in 112 ms of which 3 ms to minimize.
[2024-05-27 21:52:10] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 1 ms to minimize.
[2024-05-27 21:52:10] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 1 ms to minimize.
[2024-05-27 21:52:11] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
[2024-05-27 21:52:11] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2024-05-27 21:52:11] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2024-05-27 21:52:11] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-05-27 21:52:11] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 0 ms to minimize.
[2024-05-27 21:52:11] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-05-27 21:52:11] [INFO ] Deduced a trap composed of 191 places in 258 ms of which 3 ms to minimize.
[2024-05-27 21:52:12] [INFO ] Deduced a trap composed of 213 places in 433 ms of which 7 ms to minimize.
[2024-05-27 21:52:12] [INFO ] Deduced a trap composed of 196 places in 389 ms of which 4 ms to minimize.
[2024-05-27 21:52:13] [INFO ] Deduced a trap composed of 189 places in 1030 ms of which 4 ms to minimize.
[2024-05-27 21:52:14] [INFO ] Deduced a trap composed of 198 places in 339 ms of which 3 ms to minimize.
[2024-05-27 21:52:14] [INFO ] Deduced a trap composed of 196 places in 304 ms of which 17 ms to minimize.
[2024-05-27 21:52:14] [INFO ] Deduced a trap composed of 199 places in 288 ms of which 3 ms to minimize.
[2024-05-27 21:52:15] [INFO ] Deduced a trap composed of 23 places in 271 ms of which 3 ms to minimize.
[2024-05-27 21:52:15] [INFO ] Deduced a trap composed of 199 places in 283 ms of which 4 ms to minimize.
[2024-05-27 21:52:15] [INFO ] Deduced a trap composed of 207 places in 260 ms of which 4 ms to minimize.
[2024-05-27 21:52:16] [INFO ] Deduced a trap composed of 198 places in 245 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-05-27 21:52:16] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 0 ms to minimize.
[2024-05-27 21:52:17] [INFO ] Deduced a trap composed of 205 places in 357 ms of which 4 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 Real declared 508/1672 variables, and 62 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 20023 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-05-27 21:52:23] [INFO ] Deduced a trap composed of 63 places in 216 ms of which 3 ms to minimize.
[2024-05-27 21:52:28] [INFO ] Deduced a trap composed of 310 places in 256 ms of which 3 ms to minimize.
[2024-05-27 21:52:37] [INFO ] Deduced a trap composed of 196 places in 297 ms of which 4 ms to minimize.
[2024-05-27 21:52:39] [INFO ] Deduced a trap composed of 176 places in 307 ms of which 4 ms to minimize.
[2024-05-27 21:52:40] [INFO ] Deduced a trap composed of 187 places in 325 ms of which 3 ms to minimize.
[2024-05-27 21:52:40] [INFO ] Deduced a trap composed of 316 places in 391 ms of which 18 ms to minimize.
[2024-05-27 21:52:40] [INFO ] Deduced a trap composed of 324 places in 263 ms of which 4 ms to minimize.
[2024-05-27 21:52:41] [INFO ] Deduced a trap composed of 200 places in 396 ms of which 6 ms to minimize.
SMT process timed out in 42829ms, After SMT, problems are : Problem set: 0 solved, 1180 unsolved
Search for dead transitions found 0 dead transitions in 42843ms
[2024-05-27 21:52:41] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-05-27 21:52:41] [INFO ] Invariant cache hit.
[2024-05-27 21:52:41] [INFO ] Implicit Places using invariants in 408 ms returned []
[2024-05-27 21:52:41] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-05-27 21:52:41] [INFO ] Invariant cache hit.
[2024-05-27 21:52:42] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 21:52:48] [INFO ] Implicit Places using invariants and state equation in 6708 ms returned []
Implicit Place search using SMT with State Equation took 7141 ms to find 0 implicit places.
Running 1180 sub problems to find dead transitions.
[2024-05-27 21:52:48] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-05-27 21:52:48] [INFO ] Invariant cache hit.
[2024-05-27 21:52:48] [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-05-27 21:53:02] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 2 ms to minimize.
[2024-05-27 21:53:02] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 1 ms to minimize.
[2024-05-27 21:53:02] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 1 ms to minimize.
[2024-05-27 21:53:02] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 1 ms to minimize.
[2024-05-27 21:53:02] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 0 ms to minimize.
[2024-05-27 21:53:02] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2024-05-27 21:53:02] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 0 ms to minimize.
[2024-05-27 21:53:03] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2024-05-27 21:53:03] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 0 ms to minimize.
[2024-05-27 21:53:03] [INFO ] Deduced a trap composed of 191 places in 362 ms of which 3 ms to minimize.
[2024-05-27 21:53:04] [INFO ] Deduced a trap composed of 213 places in 333 ms of which 3 ms to minimize.
[2024-05-27 21:53:04] [INFO ] Deduced a trap composed of 196 places in 329 ms of which 4 ms to minimize.
[2024-05-27 21:53:04] [INFO ] Deduced a trap composed of 189 places in 395 ms of which 20 ms to minimize.
[2024-05-27 21:53:05] [INFO ] Deduced a trap composed of 198 places in 330 ms of which 3 ms to minimize.
[2024-05-27 21:53:05] [INFO ] Deduced a trap composed of 196 places in 292 ms of which 4 ms to minimize.
[2024-05-27 21:53:05] [INFO ] Deduced a trap composed of 199 places in 314 ms of which 3 ms to minimize.
[2024-05-27 21:53:06] [INFO ] Deduced a trap composed of 23 places in 372 ms of which 6 ms to minimize.
[2024-05-27 21:53:06] [INFO ] Deduced a trap composed of 199 places in 395 ms of which 18 ms to minimize.
[2024-05-27 21:53:07] [INFO ] Deduced a trap composed of 207 places in 414 ms of which 8 ms to minimize.
[2024-05-27 21:53:07] [INFO ] Deduced a trap composed of 198 places in 380 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-05-27 21:53:07] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2024-05-27 21:53:08] [INFO ] Deduced a trap composed of 205 places in 418 ms of which 3 ms to minimize.
[2024-05-27 21:53:20] [INFO ] Deduced a trap composed of 187 places in 341 ms of which 3 ms to minimize.
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 1.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 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.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 1.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 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)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 63 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 30036 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: 23/23 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, 23/63 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-05-27 21:53:23] [INFO ] Deduced a trap composed of 163 places in 261 ms of which 4 ms to minimize.
[2024-05-27 21:53:32] [INFO ] Deduced a trap composed of 63 places in 181 ms of which 3 ms to minimize.
[2024-05-27 21:53:38] [INFO ] Deduced a trap composed of 280 places in 314 ms of which 4 ms to minimize.
[2024-05-27 21:53:39] [INFO ] Deduced a trap composed of 205 places in 293 ms of which 4 ms to minimize.
[2024-05-27 21:53:40] [INFO ] Deduced a trap composed of 110 places in 283 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/508 variables, 5/68 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 68 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 30024 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: 28/28 constraints]
After SMT, in 62693ms problems are : Problem set: 0 solved, 1180 unsolved
Search for dead transitions found 0 dead transitions in 62707ms
Finished structural reductions in LTL mode , in 1 iterations and 112708 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 193 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))]
RANDOM walk for 848 steps (0 resets) in 18 ms. (44 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 428 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 116 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 33408 reset in 495 ms.
Product exploration explored 100000 steps with 33329 reset in 542 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 25 ms. Remains 510 /510 variables (removed 0) and now considering 1182/1182 (removed 0) transitions.
Running 1180 sub problems to find dead transitions.
[2024-05-27 21:53:53] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-05-27 21:53:53] [INFO ] Invariant cache hit.
[2024-05-27 21:53:53] [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-05-27 21:54:08] [INFO ] Deduced a trap composed of 43 places in 166 ms of which 2 ms to minimize.
[2024-05-27 21:54:08] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 2 ms to minimize.
[2024-05-27 21:54:08] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 1 ms to minimize.
[2024-05-27 21:54:09] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 1 ms to minimize.
[2024-05-27 21:54:09] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 1 ms to minimize.
[2024-05-27 21:54:09] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 1 ms to minimize.
[2024-05-27 21:54:09] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 1 ms to minimize.
[2024-05-27 21:54:09] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 1 ms to minimize.
[2024-05-27 21:54:09] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2024-05-27 21:54:09] [INFO ] Deduced a trap composed of 191 places in 310 ms of which 3 ms to minimize.
[2024-05-27 21:54:10] [INFO ] Deduced a trap composed of 213 places in 345 ms of which 3 ms to minimize.
[2024-05-27 21:54:10] [INFO ] Deduced a trap composed of 196 places in 306 ms of which 3 ms to minimize.
[2024-05-27 21:54:11] [INFO ] Deduced a trap composed of 189 places in 311 ms of which 3 ms to minimize.
[2024-05-27 21:54:11] [INFO ] Deduced a trap composed of 198 places in 315 ms of which 3 ms to minimize.
[2024-05-27 21:54:11] [INFO ] Deduced a trap composed of 196 places in 313 ms of which 3 ms to minimize.
[2024-05-27 21:54:12] [INFO ] Deduced a trap composed of 199 places in 340 ms of which 3 ms to minimize.
[2024-05-27 21:54:12] [INFO ] Deduced a trap composed of 23 places in 334 ms of which 4 ms to minimize.
[2024-05-27 21:54:12] [INFO ] Deduced a trap composed of 199 places in 412 ms of which 7 ms to minimize.
[2024-05-27 21:54:13] [INFO ] Deduced a trap composed of 207 places in 308 ms of which 3 ms to minimize.
[2024-05-27 21:54:13] [INFO ] Deduced a trap composed of 198 places in 338 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-05-27 21:54:14] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-05-27 21:54:15] [INFO ] Deduced a trap composed of 205 places in 390 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 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 0.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 1.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 1.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 0.0)
(s174 1.0)
(s175 1.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 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 508/1672 variables, and 62 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 20040 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-05-27 21:54:17] [INFO ] Deduced a trap composed of 63 places in 144 ms of which 2 ms to minimize.
[2024-05-27 21:54:22] [INFO ] Deduced a trap composed of 310 places in 314 ms of which 4 ms to minimize.
[2024-05-27 21:54:31] [INFO ] Deduced a trap composed of 196 places in 466 ms of which 4 ms to minimize.
[2024-05-27 21:54:32] [INFO ] Deduced a trap composed of 176 places in 336 ms of which 4 ms to minimize.
[2024-05-27 21:54:33] [INFO ] Deduced a trap composed of 187 places in 288 ms of which 4 ms to minimize.
[2024-05-27 21:54:34] [INFO ] Deduced a trap composed of 316 places in 299 ms of which 4 ms to minimize.
[2024-05-27 21:54:34] [INFO ] Deduced a trap composed of 324 places in 408 ms of which 4 ms to minimize.
[2024-05-27 21:54:34] [INFO ] Deduced a trap composed of 200 places in 237 ms of which 3 ms to minimize.
[2024-05-27 21:54:35] [INFO ] Deduced a trap composed of 113 places in 350 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 20027 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 42390ms problems are : Problem set: 0 solved, 1180 unsolved
Search for dead transitions found 0 dead transitions in 42427ms
[2024-05-27 21:54:35] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-05-27 21:54:35] [INFO ] Invariant cache hit.
[2024-05-27 21:54:36] [INFO ] Implicit Places using invariants in 535 ms returned []
[2024-05-27 21:54:36] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-05-27 21:54:36] [INFO ] Invariant cache hit.
[2024-05-27 21:54:37] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 21:54:43] [INFO ] Implicit Places using invariants and state equation in 6738 ms returned []
Implicit Place search using SMT with State Equation took 7290 ms to find 0 implicit places.
Running 1180 sub problems to find dead transitions.
[2024-05-27 21:54:43] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-05-27 21:54:43] [INFO ] Invariant cache hit.
[2024-05-27 21:54:43] [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-05-27 21:54:56] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 2 ms to minimize.
[2024-05-27 21:54:56] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 1 ms to minimize.
[2024-05-27 21:54:56] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 1 ms to minimize.
[2024-05-27 21:54:57] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 1 ms to minimize.
[2024-05-27 21:54:57] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2024-05-27 21:54:57] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 1 ms to minimize.
[2024-05-27 21:54:57] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 1 ms to minimize.
[2024-05-27 21:54:57] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 1 ms to minimize.
[2024-05-27 21:54:57] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 1 ms to minimize.
[2024-05-27 21:54:58] [INFO ] Deduced a trap composed of 191 places in 403 ms of which 19 ms to minimize.
[2024-05-27 21:54:58] [INFO ] Deduced a trap composed of 213 places in 359 ms of which 3 ms to minimize.
[2024-05-27 21:54:59] [INFO ] Deduced a trap composed of 196 places in 431 ms of which 4 ms to minimize.
[2024-05-27 21:54:59] [INFO ] Deduced a trap composed of 189 places in 331 ms of which 3 ms to minimize.
[2024-05-27 21:54:59] [INFO ] Deduced a trap composed of 198 places in 390 ms of which 21 ms to minimize.
[2024-05-27 21:55:00] [INFO ] Deduced a trap composed of 196 places in 338 ms of which 3 ms to minimize.
[2024-05-27 21:55:00] [INFO ] Deduced a trap composed of 199 places in 338 ms of which 3 ms to minimize.
[2024-05-27 21:55:00] [INFO ] Deduced a trap composed of 23 places in 392 ms of which 7 ms to minimize.
[2024-05-27 21:55:01] [INFO ] Deduced a trap composed of 199 places in 409 ms of which 3 ms to minimize.
[2024-05-27 21:55:01] [INFO ] Deduced a trap composed of 207 places in 272 ms of which 3 ms to minimize.
[2024-05-27 21:55:02] [INFO ] Deduced a trap composed of 198 places in 318 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-05-27 21:55:02] [INFO ] Deduced a trap composed of 43 places in 496 ms of which 1 ms to minimize.
[2024-05-27 21:55:03] [INFO ] Deduced a trap composed of 205 places in 340 ms of which 4 ms to minimize.
[2024-05-27 21:55:15] [INFO ] Deduced a trap composed of 187 places in 343 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/1672 variables, and 63 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 30037 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: 23/23 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, 23/63 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-05-27 21:55:18] [INFO ] Deduced a trap composed of 163 places in 303 ms of which 4 ms to minimize.
[2024-05-27 21:55:26] [INFO ] Deduced a trap composed of 63 places in 226 ms of which 2 ms to minimize.
[2024-05-27 21:55:32] [INFO ] Deduced a trap composed of 280 places in 322 ms of which 4 ms to minimize.
[2024-05-27 21:55:32] [INFO ] Deduced a trap composed of 205 places in 304 ms of which 4 ms to minimize.
[2024-05-27 21:55:33] [INFO ] Deduced a trap composed of 110 places in 281 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/508 variables, 5/68 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 68 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 30024 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: 28/28 constraints]
After SMT, in 62397ms problems are : Problem set: 0 solved, 1180 unsolved
Search for dead transitions found 0 dead transitions in 62425ms
Finished structural reductions in LTL mode , in 1 iterations and 112178 ms. Remains : 510/510 places, 1182/1182 transitions.
Treatment of property PolyORBLF-COL-S02J04T10-LTLCardinality-08 finished in 341786 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-05-27 21:55:46] [INFO ] Flatten gal took : 148 ms
[2024-05-27 21:55:46] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-05-27 21:55:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 730 places, 1402 transitions and 6080 arcs took 34 ms.
Total runtime 1531585 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-COL-S02J04T10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/418/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 730
TRANSITIONS: 1402
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.050s, Sys 0.014s]


SAVING FILE /home/mcc/execution/418/model (.net / .def) ...
EXPORT TIME: [User 0.008s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 3239
MODEL NAME: /home/mcc/execution/418/model
730 places, 1402 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is 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 r289-tajo-171654445200091"
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 ;