MCC'2024- Execution of r516-tajo-171654446400131

About the Execution of LTSMin+red for PolyORBLF-COL-S04J04T08

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16051.747	3339972.00	5695307.00	529.30	FFT?F?TFTFFFTFFT	normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.4K Apr 11 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 11 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 16:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 16:47 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.4K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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-S04J04T08-LTLCardinality-00
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-01
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-02
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-03
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-04
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-05
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-06
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-07
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-08
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-09
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717249947613

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J04T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:52:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 13:52:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:52:29] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 13:52:29] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 13:52:29] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 686 ms
[2024-06-01 13:52:29] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 712 PT places and 4080.0 transition bindings in 35 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 13:52:29] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-06-01 13:52:29] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA PolyORBLF-COL-S04J04T08-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T08-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (13 resets) in 1224 ms. (32 steps per ms) remains 8/30 properties
BEST_FIRST walk for 40003 steps (10 resets) in 303 ms. (131 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (15 resets) in 214 ms. (186 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 315 ms. (126 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (10 resets) in 220 ms. (181 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (9 resets) in 132 ms. (300 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (10 resets) in 149 ms. (266 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (10 resets) in 88 ms. (449 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (10 resets) in 92 ms. (430 steps per ms) remains 8/8 properties
[2024-06-01 13:52:31] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 13:52:31] [INFO ] Computed 26 invariants in 13 ms
[2024-06-01 13:52:31] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp25 is UNSAT
At refinement iteration 1 (OVERLAPS) 41/50 variables, 7/7 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 5/55 variables, 3/10 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/56 variables, 1/11 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
After SMT solving in domain Real declared 81/145 variables, and 26 constraints, problems are : Problem set: 8 solved, 0 unsolved in 260 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 311ms problems are : Problem set: 8 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 8 atomic propositions for a total of 14 simplifications.
FORMULA PolyORBLF-COL-S04J04T08-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T08-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T08-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:52:31] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2024-06-01 13:52:31] [INFO ] Flatten gal took : 25 ms
FORMULA PolyORBLF-COL-S04J04T08-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T08-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:52:31] [INFO ] Flatten gal took : 7 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-06-01 13:52:31] [INFO ] Unfolded HLPN to a Petri net with 712 places and 4012 transitions 27744 arcs in 96 ms.
[2024-06-01 13:52:31] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
Support contains 332 out of 712 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 712/712 places, 1844/1844 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 708 transition count 1844
Applied a total of 4 rules in 65 ms. Remains 708 /712 variables (removed 4) and now considering 1844/1844 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-06-01 13:52:31] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 708 cols
[2024-06-01 13:52:31] [INFO ] Computed 50 invariants in 122 ms
[2024-06-01 13:52:32] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-06-01 13:52:56] [INFO ] Deduced a trap composed of 75 places in 247 ms of which 29 ms to minimize.
[2024-06-01 13:52:56] [INFO ] Deduced a trap composed of 75 places in 112 ms of which 1 ms to minimize.
[2024-06-01 13:52:56] [INFO ] Deduced a trap composed of 75 places in 388 ms of which 1 ms to minimize.
[2024-06-01 13:52:56] [INFO ] Deduced a trap composed of 75 places in 87 ms of which 1 ms to minimize.
[2024-06-01 13:52:57] [INFO ] Deduced a trap composed of 75 places in 114 ms of which 1 ms to minimize.
[2024-06-01 13:52:57] [INFO ] Deduced a trap composed of 75 places in 122 ms of which 7 ms to minimize.
[2024-06-01 13:52:57] [INFO ] Deduced a trap composed of 75 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:52:58] [INFO ] Deduced a trap composed of 403 places in 442 ms of which 8 ms to minimize.
[2024-06-01 13:52:58] [INFO ] Deduced a trap composed of 378 places in 429 ms of which 6 ms to minimize.
[2024-06-01 13:52:59] [INFO ] Deduced a trap composed of 191 places in 496 ms of which 5 ms to minimize.
[2024-06-01 13:53:00] [INFO ] Deduced a trap composed of 416 places in 508 ms of which 18 ms to minimize.
SMT process timed out in 29038ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 29086ms
[2024-06-01 13:53:00] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-06-01 13:53:00] [INFO ] Invariant cache hit.
[2024-06-01 13:53:01] [INFO ] Implicit Places using invariants in 528 ms returned [548, 549, 550, 551, 552, 553, 554, 555]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 542 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 700/712 places, 1844/1844 transitions.
Applied a total of 0 rules in 17 ms. Remains 700 /700 variables (removed 0) and now considering 1844/1844 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29736 ms. Remains : 700/712 places, 1844/1844 transitions.
Support contains 332 out of 700 places after structural reductions.
[2024-06-01 13:53:01] [INFO ] Flatten gal took : 188 ms
[2024-06-01 13:53:01] [INFO ] Flatten gal took : 125 ms
[2024-06-01 13:53:02] [INFO ] Input system was already deterministic with 1844 transitions.
Support contains 284 out of 700 places (down from 332) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 616 ms. (64 steps per ms) remains 3/20 properties
BEST_FIRST walk for 40002 steps (9 resets) in 188 ms. (211 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 218 ms. (182 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 351 ms. (113 steps per ms) remains 3/3 properties
[2024-06-01 13:53:02] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 700 cols
[2024-06-01 13:53:02] [INFO ] Computed 42 invariants in 76 ms
[2024-06-01 13:53:02] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 635/656 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/656 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp10 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 12/668 variables, 10/23 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/668 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
After SMT solving in domain Real declared 698/2512 variables, and 41 constraints, problems are : Problem set: 3 solved, 0 unsolved in 457 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/700 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 571ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBLF-COL-S04J04T08-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 8 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 700 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 700/700 places, 1844/1844 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 692 transition count 1836
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 692 transition count 1836
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 684 transition count 1828
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 684 transition count 1828
Applied a total of 32 rules in 86 ms. Remains 684 /700 variables (removed 16) and now considering 1828/1844 (removed 16) transitions.
Running 1824 sub problems to find dead transitions.
[2024-06-01 13:53:03] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
// Phase 1: matrix 1796 rows 684 cols
[2024-06-01 13:53:03] [INFO ] Computed 42 invariants in 56 ms
[2024-06-01 13:53:03] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-06-01 13:53:28] [INFO ] Deduced a trap composed of 74 places in 210 ms of which 2 ms to minimize.
[2024-06-01 13:53:29] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 2 ms to minimize.
[2024-06-01 13:53:29] [INFO ] Deduced a trap composed of 74 places in 158 ms of which 2 ms to minimize.
[2024-06-01 13:53:29] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 2 ms to minimize.
[2024-06-01 13:53:29] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 2 ms to minimize.
[2024-06-01 13:53:30] [INFO ] Deduced a trap composed of 200 places in 382 ms of which 5 ms to minimize.
[2024-06-01 13:53:31] [INFO ] Deduced a trap composed of 74 places in 482 ms of which 5 ms to minimize.
[2024-06-01 13:53:32] [INFO ] Deduced a trap composed of 427 places in 401 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/2480 variables, and 46 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20107 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-06-01 13:53:35] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 2 ms to minimize.
[2024-06-01 13:53:37] [INFO ] Deduced a trap composed of 83 places in 306 ms of which 3 ms to minimize.
[2024-06-01 13:53:41] [INFO ] Deduced a trap composed of 74 places in 68 ms of which 2 ms to minimize.
[2024-06-01 13:53:46] [INFO ] Deduced a trap composed of 410 places in 436 ms of which 5 ms to minimize.
[2024-06-01 13:53:48] [INFO ] Deduced a trap composed of 20 places in 170 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2480 variables, and 51 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20067 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 13/13 constraints]
After SMT, in 49456ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 49477ms
[2024-06-01 13:53:53] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-06-01 13:53:53] [INFO ] Invariant cache hit.
[2024-06-01 13:53:53] [INFO ] Implicit Places using invariants in 556 ms returned []
[2024-06-01 13:53:53] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-06-01 13:53:53] [INFO ] Invariant cache hit.
[2024-06-01 13:53:54] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 13:54:04] [INFO ] Implicit Places using invariants and state equation in 11171 ms returned []
Implicit Place search using SMT with State Equation took 11730 ms to find 0 implicit places.
Running 1824 sub problems to find dead transitions.
[2024-06-01 13:54:04] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-06-01 13:54:04] [INFO ] Invariant cache hit.
[2024-06-01 13:54:04] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-06-01 13:54:31] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 2 ms to minimize.
[2024-06-01 13:54:31] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 1 ms to minimize.
[2024-06-01 13:54:31] [INFO ] Deduced a trap composed of 74 places in 82 ms of which 2 ms to minimize.
[2024-06-01 13:54:31] [INFO ] Deduced a trap composed of 74 places in 77 ms of which 1 ms to minimize.
[2024-06-01 13:54:31] [INFO ] Deduced a trap composed of 74 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:54:31] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:54:31] [INFO ] Deduced a trap composed of 74 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:54:32] [INFO ] Deduced a trap composed of 377 places in 416 ms of which 4 ms to minimize.
[2024-06-01 13:54:33] [INFO ] Deduced a trap composed of 181 places in 394 ms of which 5 ms to minimize.
[2024-06-01 13:54:33] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 2 ms to minimize.
[2024-06-01 13:54:36] [INFO ] Deduced a trap composed of 383 places in 395 ms of which 10 ms to minimize.
[2024-06-01 13:54:36] [INFO ] Deduced a trap composed of 394 places in 397 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 680/2480 variables, and 50 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-06-01 13:54:48] [INFO ] Deduced a trap composed of 410 places in 443 ms of which 6 ms to minimize.
[2024-06-01 13:55:09] [INFO ] Deduced a trap composed of 366 places in 424 ms of which 5 ms to minimize.
[2024-06-01 13:55:09] [INFO ] Deduced a trap composed of 379 places in 382 ms of which 5 ms to minimize.
[2024-06-01 13:55:09] [INFO ] Deduced a trap composed of 380 places in 330 ms of which 4 ms to minimize.
[2024-06-01 13:55:11] [INFO ] Deduced a trap composed of 69 places in 239 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2480 variables, and 55 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 17/17 constraints]
After SMT, in 69493ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 69523ms
Starting structural reductions in LTL mode, iteration 1 : 684/700 places, 1828/1844 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130830 ms. Remains : 684/700 places, 1828/1844 transitions.
Stuttering acceptance computed with spot in 305 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T08-LTLCardinality-02
Product exploration explored 100000 steps with 25000 reset in 861 ms.
Product exploration explored 100000 steps with 25000 reset in 681 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 93 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 262 steps (0 resets) in 7 ms. (32 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 128 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 684 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 684/684 places, 1828/1828 transitions.
Applied a total of 0 rules in 47 ms. Remains 684 /684 variables (removed 0) and now considering 1828/1828 (removed 0) transitions.
Running 1824 sub problems to find dead transitions.
[2024-06-01 13:55:17] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-06-01 13:55:17] [INFO ] Invariant cache hit.
[2024-06-01 13:55:17] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-06-01 13:55:40] [INFO ] Deduced a trap composed of 74 places in 141 ms of which 2 ms to minimize.
[2024-06-01 13:55:41] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 2 ms to minimize.
[2024-06-01 13:55:41] [INFO ] Deduced a trap composed of 74 places in 84 ms of which 2 ms to minimize.
[2024-06-01 13:55:41] [INFO ] Deduced a trap composed of 74 places in 120 ms of which 2 ms to minimize.
[2024-06-01 13:55:41] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 1 ms to minimize.
[2024-06-01 13:55:41] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 1 ms to minimize.
[2024-06-01 13:55:41] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:55:42] [INFO ] Deduced a trap composed of 377 places in 414 ms of which 5 ms to minimize.
[2024-06-01 13:55:43] [INFO ] Deduced a trap composed of 181 places in 374 ms of which 3 ms to minimize.
[2024-06-01 13:55:43] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:55:45] [INFO ] Deduced a trap composed of 383 places in 326 ms of which 4 ms to minimize.
[2024-06-01 13:55:45] [INFO ] Deduced a trap composed of 394 places in 440 ms of which 4 ms to minimize.
SMT process timed out in 28339ms, After SMT, problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 28363ms
[2024-06-01 13:55:45] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-06-01 13:55:45] [INFO ] Invariant cache hit.
[2024-06-01 13:55:46] [INFO ] Implicit Places using invariants in 575 ms returned []
[2024-06-01 13:55:46] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-06-01 13:55:46] [INFO ] Invariant cache hit.
[2024-06-01 13:55:47] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 13:55:57] [INFO ] Implicit Places using invariants and state equation in 11253 ms returned []
Implicit Place search using SMT with State Equation took 11847 ms to find 0 implicit places.
Running 1824 sub problems to find dead transitions.
[2024-06-01 13:55:57] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-06-01 13:55:57] [INFO ] Invariant cache hit.
[2024-06-01 13:55:57] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-06-01 13:56:18] [INFO ] Deduced a trap composed of 74 places in 100 ms of which 2 ms to minimize.
[2024-06-01 13:56:18] [INFO ] Deduced a trap composed of 74 places in 77 ms of which 1 ms to minimize.
[2024-06-01 13:56:18] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 11 ms to minimize.
[2024-06-01 13:56:18] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 2 ms to minimize.
[2024-06-01 13:56:18] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:56:19] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:56:19] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 0 ms to minimize.
[2024-06-01 13:56:19] [INFO ] Deduced a trap composed of 377 places in 299 ms of which 3 ms to minimize.
[2024-06-01 13:56:20] [INFO ] Deduced a trap composed of 181 places in 394 ms of which 5 ms to minimize.
[2024-06-01 13:56:20] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:56:22] [INFO ] Deduced a trap composed of 383 places in 464 ms of which 5 ms to minimize.
[2024-06-01 13:56:22] [INFO ] Deduced a trap composed of 394 places in 452 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/2480 variables, and 50 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-06-01 13:56:38] [INFO ] Deduced a trap composed of 410 places in 451 ms of which 5 ms to minimize.
[2024-06-01 13:57:00] [INFO ] Deduced a trap composed of 366 places in 327 ms of which 4 ms to minimize.
[2024-06-01 13:57:01] [INFO ] Deduced a trap composed of 379 places in 412 ms of which 5 ms to minimize.
[2024-06-01 13:57:01] [INFO ] Deduced a trap composed of 380 places in 397 ms of which 5 ms to minimize.
[2024-06-01 13:57:03] [INFO ] Deduced a trap composed of 69 places in 224 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2480 variables, and 55 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 17/17 constraints]
After SMT, in 67764ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 67780ms
Finished structural reductions in LTL mode , in 1 iterations and 108053 ms. Remains : 684/684 places, 1828/1828 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 59 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 285 steps (0 resets) in 8 ms. (31 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 101 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 644 ms.
Product exploration explored 100000 steps with 25000 reset in 672 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 684 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 684/684 places, 1828/1828 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 684 transition count 1828
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 48 Pre rules applied. Total rules applied 48 place count 684 transition count 1892
Deduced a syphon composed of 96 places in 1 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 96 place count 684 transition count 1892
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 112 place count 668 transition count 1876
Deduced a syphon composed of 80 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 128 place count 668 transition count 1876
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 200 places in 5 ms
Iterating global reduction 1 with 120 rules applied. Total rules applied 248 place count 668 transition count 1876
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 280 place count 636 transition count 1844
Deduced a syphon composed of 176 places in 2 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 312 place count 636 transition count 1844
Deduced a syphon composed of 176 places in 3 ms
Applied a total of 312 rules in 239 ms. Remains 636 /684 variables (removed 48) and now considering 1844/1828 (removed -16) transitions.
Running 1840 sub problems to find dead transitions.
[2024-06-01 13:57:07] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 636 cols
[2024-06-01 13:57:07] [INFO ] Computed 42 invariants in 25 ms
[2024-06-01 13:57:07] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/632 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-06-01 13:57:33] [INFO ] Deduced a trap composed of 46 places in 205 ms of which 4 ms to minimize.
[2024-06-01 13:57:33] [INFO ] Deduced a trap composed of 46 places in 191 ms of which 2 ms to minimize.
[2024-06-01 13:57:33] [INFO ] Deduced a trap composed of 46 places in 136 ms of which 2 ms to minimize.
[2024-06-01 13:57:33] [INFO ] Deduced a trap composed of 46 places in 132 ms of which 2 ms to minimize.
[2024-06-01 13:57:33] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 2 ms to minimize.
[2024-06-01 13:57:34] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 1 ms to minimize.
[2024-06-01 13:57:34] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 1 ms to minimize.
[2024-06-01 13:57:34] [INFO ] Deduced a trap composed of 46 places in 446 ms of which 5 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
[2024-06-01 13:57:35] [INFO ] Deduced a trap composed of 211 places in 506 ms of which 5 ms to minimize.
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
[2024-06-01 13:57:38] [INFO ] Deduced a trap composed of 203 places in 443 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 1.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 1.0)
(s23 1.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 9.0)
(s163 1.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 4.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 1.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 1.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 2.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 1.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 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 632/2448 variables, and 48 constraints, problems are : Problem set: 64 solved, 1776 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/636 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 1840/1840 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 64 solved, 1776 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 12/12 constraints. Problems are: Problem set: 64 solved, 1776 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 24/36 constraints. Problems are: Problem set: 64 solved, 1776 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/600 variables, 10/46 constraints. Problems are: Problem set: 64 solved, 1776 unsolved
[2024-06-01 13:57:41] [INFO ] Deduced a trap composed of 182 places in 291 ms of which 3 ms to minimize.
[2024-06-01 13:57:41] [INFO ] Deduced a trap composed of 157 places in 304 ms of which 2 ms to minimize.
[2024-06-01 13:57:41] [INFO ] Deduced a trap composed of 26 places in 316 ms of which 3 ms to minimize.
[2024-06-01 13:57:42] [INFO ] Deduced a trap composed of 9 places in 323 ms of which 3 ms to minimize.
[2024-06-01 13:57:48] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:57:54] [INFO ] Deduced a trap composed of 193 places in 192 ms of which 2 ms to minimize.
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1019 is UNSAT
[2024-06-01 13:57:55] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:57:55] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:57:58] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
[2024-06-01 13:57:58] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
[2024-06-01 13:57:58] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 600/2448 variables, and 57 constraints, problems are : Problem set: 120 solved, 1720 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/636 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 0/1840 constraints, Known Traps: 21/21 constraints]
After SMT, in 50991ms problems are : Problem set: 120 solved, 1720 unsolved
Search for dead transitions found 120 dead transitions in 51014ms
Found 120 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 120 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 120 transitions.
[2024-06-01 13:57:59] [INFO ] Redundant transitions in 87 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 636/684 places, 1724/1828 transitions.
Graph (complete) has 3646 edges and 636 vertex of which 548 are kept as prefixes of interest. Removing 88 places using SCC suffix rule.6 ms
Discarding 88 places :
Also discarding 0 output transitions
Deduced a syphon composed of 88 places in 3 ms
Applied a total of 1 rules in 43 ms. Remains 548 /636 variables (removed 88) and now considering 1724/1724 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 548/684 places, 1724/1828 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 51401 ms. Remains : 548/684 places, 1724/1828 transitions.
Support contains 2 out of 684 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 684/684 places, 1828/1828 transitions.
Applied a total of 0 rules in 18 ms. Remains 684 /684 variables (removed 0) and now considering 1828/1828 (removed 0) transitions.
Running 1824 sub problems to find dead transitions.
[2024-06-01 13:57:59] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
// Phase 1: matrix 1796 rows 684 cols
[2024-06-01 13:57:59] [INFO ] Computed 42 invariants in 23 ms
[2024-06-01 13:57:59] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-06-01 13:58:24] [INFO ] Deduced a trap composed of 74 places in 154 ms of which 2 ms to minimize.
[2024-06-01 13:58:24] [INFO ] Deduced a trap composed of 74 places in 116 ms of which 1 ms to minimize.
[2024-06-01 13:58:24] [INFO ] Deduced a trap composed of 74 places in 138 ms of which 2 ms to minimize.
[2024-06-01 13:58:24] [INFO ] Deduced a trap composed of 74 places in 126 ms of which 2 ms to minimize.
[2024-06-01 13:58:25] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 2 ms to minimize.
[2024-06-01 13:58:26] [INFO ] Deduced a trap composed of 200 places in 444 ms of which 5 ms to minimize.
[2024-06-01 13:58:27] [INFO ] Deduced a trap composed of 74 places in 431 ms of which 5 ms to minimize.
[2024-06-01 13:58:27] [INFO ] Deduced a trap composed of 427 places in 428 ms of which 5 ms to minimize.
SMT process timed out in 28874ms, After SMT, problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 28891ms
[2024-06-01 13:58:27] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-06-01 13:58:27] [INFO ] Invariant cache hit.
[2024-06-01 13:58:28] [INFO ] Implicit Places using invariants in 487 ms returned []
[2024-06-01 13:58:28] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-06-01 13:58:28] [INFO ] Invariant cache hit.
[2024-06-01 13:58:29] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 13:58:40] [INFO ] Implicit Places using invariants and state equation in 12273 ms returned []
Implicit Place search using SMT with State Equation took 12774 ms to find 0 implicit places.
Running 1824 sub problems to find dead transitions.
[2024-06-01 13:58:40] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-06-01 13:58:40] [INFO ] Invariant cache hit.
[2024-06-01 13:58:40] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-06-01 13:59:03] [INFO ] Deduced a trap composed of 74 places in 144 ms of which 2 ms to minimize.
[2024-06-01 13:59:03] [INFO ] Deduced a trap composed of 74 places in 82 ms of which 1 ms to minimize.
[2024-06-01 13:59:04] [INFO ] Deduced a trap composed of 74 places in 77 ms of which 1 ms to minimize.
[2024-06-01 13:59:04] [INFO ] Deduced a trap composed of 74 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:59:04] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 2 ms to minimize.
[2024-06-01 13:59:04] [INFO ] Deduced a trap composed of 74 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:59:04] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:59:05] [INFO ] Deduced a trap composed of 377 places in 413 ms of which 4 ms to minimize.
[2024-06-01 13:59:05] [INFO ] Deduced a trap composed of 181 places in 401 ms of which 4 ms to minimize.
[2024-06-01 13:59:06] [INFO ] Deduced a trap composed of 74 places in 77 ms of which 1 ms to minimize.
[2024-06-01 13:59:08] [INFO ] Deduced a trap composed of 383 places in 471 ms of which 5 ms to minimize.
[2024-06-01 13:59:09] [INFO ] Deduced a trap composed of 394 places in 388 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/2480 variables, and 50 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-06-01 13:59:23] [INFO ] Deduced a trap composed of 410 places in 479 ms of which 7 ms to minimize.
[2024-06-01 13:59:46] [INFO ] Deduced a trap composed of 366 places in 441 ms of which 5 ms to minimize.
[2024-06-01 13:59:46] [INFO ] Deduced a trap composed of 379 places in 353 ms of which 4 ms to minimize.
[2024-06-01 13:59:47] [INFO ] Deduced a trap composed of 380 places in 363 ms of which 5 ms to minimize.
[2024-06-01 13:59:48] [INFO ] Deduced a trap composed of 69 places in 276 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2480 variables, and 55 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 17/17 constraints]
After SMT, in 68793ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 68816ms
Finished structural reductions in LTL mode , in 1 iterations and 110508 ms. Remains : 684/684 places, 1828/1828 transitions.
Treatment of property PolyORBLF-COL-S04J04T08-LTLCardinality-02 finished in 406290 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(((p1||F(G(p0))) U (p0&&(p1||F(G(p0))))))))))'
Support contains 32 out of 700 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 700/700 places, 1844/1844 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 692 transition count 1836
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 692 transition count 1836
Applied a total of 16 rules in 43 ms. Remains 692 /700 variables (removed 8) and now considering 1836/1844 (removed 8) transitions.
Running 1832 sub problems to find dead transitions.
[2024-06-01 13:59:49] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
// Phase 1: matrix 1804 rows 692 cols
[2024-06-01 13:59:50] [INFO ] Computed 42 invariants in 64 ms
[2024-06-01 13:59:50] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-06-01 14:00:16] [INFO ] Deduced a trap composed of 75 places in 112 ms of which 2 ms to minimize.
[2024-06-01 14:00:17] [INFO ] Deduced a trap composed of 75 places in 67 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 688/2496 variables, and 40 constraints, problems are : Problem set: 0 solved, 1832 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1832/1832 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1832 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/688 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-06-01 14:00:21] [INFO ] Deduced a trap composed of 75 places in 90 ms of which 1 ms to minimize.
[2024-06-01 14:00:21] [INFO ] Deduced a trap composed of 75 places in 107 ms of which 2 ms to minimize.
[2024-06-01 14:00:21] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 1 ms to minimize.
[2024-06-01 14:00:21] [INFO ] Deduced a trap composed of 75 places in 122 ms of which 2 ms to minimize.
[2024-06-01 14:00:22] [INFO ] Deduced a trap composed of 75 places in 80 ms of which 1 ms to minimize.
[2024-06-01 14:00:22] [INFO ] Deduced a trap composed of 75 places in 44 ms of which 0 ms to minimize.
[2024-06-01 14:00:23] [INFO ] Deduced a trap composed of 209 places in 373 ms of which 4 ms to minimize.
[2024-06-01 14:00:26] [INFO ] Deduced a trap composed of 388 places in 475 ms of which 5 ms to minimize.
[2024-06-01 14:00:26] [INFO ] Deduced a trap composed of 395 places in 444 ms of which 4 ms to minimize.
[2024-06-01 14:00:34] [INFO ] Deduced a trap composed of 110 places in 264 ms of which 3 ms to minimize.
[2024-06-01 14:00:37] [INFO ] Deduced a trap composed of 19 places in 244 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 688/2496 variables, and 51 constraints, problems are : Problem set: 0 solved, 1832 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1832 constraints, Known Traps: 13/13 constraints]
After SMT, in 49095ms problems are : Problem set: 0 solved, 1832 unsolved
Search for dead transitions found 0 dead transitions in 49121ms
[2024-06-01 14:00:39] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
[2024-06-01 14:00:39] [INFO ] Invariant cache hit.
[2024-06-01 14:00:39] [INFO ] Implicit Places using invariants in 493 ms returned []
[2024-06-01 14:00:39] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
[2024-06-01 14:00:39] [INFO ] Invariant cache hit.
[2024-06-01 14:00:40] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 14:00:51] [INFO ] Implicit Places using invariants and state equation in 11803 ms returned []
Implicit Place search using SMT with State Equation took 12311 ms to find 0 implicit places.
Running 1832 sub problems to find dead transitions.
[2024-06-01 14:00:51] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
[2024-06-01 14:00:51] [INFO ] Invariant cache hit.
[2024-06-01 14:00:51] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-06-01 14:01:13] [INFO ] Deduced a trap composed of 75 places in 112 ms of which 2 ms to minimize.
[2024-06-01 14:01:13] [INFO ] Deduced a trap composed of 75 places in 87 ms of which 2 ms to minimize.
[2024-06-01 14:01:13] [INFO ] Deduced a trap composed of 75 places in 136 ms of which 1 ms to minimize.
[2024-06-01 14:01:13] [INFO ] Deduced a trap composed of 75 places in 44 ms of which 0 ms to minimize.
[2024-06-01 14:01:13] [INFO ] Deduced a trap composed of 75 places in 70 ms of which 2 ms to minimize.
[2024-06-01 14:01:13] [INFO ] Deduced a trap composed of 75 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:01:13] [INFO ] Deduced a trap composed of 75 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:01:14] [INFO ] Deduced a trap composed of 399 places in 428 ms of which 5 ms to minimize.
[2024-06-01 14:01:14] [INFO ] Deduced a trap composed of 403 places in 286 ms of which 3 ms to minimize.
[2024-06-01 14:01:15] [INFO ] Deduced a trap composed of 209 places in 439 ms of which 5 ms to minimize.
[2024-06-01 14:01:15] [INFO ] Deduced a trap composed of 75 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:01:16] [INFO ] Deduced a trap composed of 191 places in 182 ms of which 2 ms to minimize.
[2024-06-01 14:01:17] [INFO ] Deduced a trap composed of 395 places in 485 ms of which 5 ms to minimize.
[2024-06-01 14:01:18] [INFO ] Deduced a trap composed of 379 places in 393 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 688/2496 variables, and 52 constraints, problems are : Problem set: 0 solved, 1832 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1832/1832 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1832 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/688 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-06-01 14:01:32] [INFO ] Deduced a trap composed of 366 places in 415 ms of which 5 ms to minimize.
[2024-06-01 14:01:32] [INFO ] Deduced a trap composed of 411 places in 387 ms of which 5 ms to minimize.
[2024-06-01 14:01:40] [INFO ] Deduced a trap composed of 418 places in 277 ms of which 4 ms to minimize.
[2024-06-01 14:01:42] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 2 ms to minimize.
[2024-06-01 14:01:53] [INFO ] Deduced a trap composed of 397 places in 283 ms of which 4 ms to minimize.
[2024-06-01 14:01:55] [INFO ] Deduced a trap composed of 177 places in 314 ms of which 4 ms to minimize.
[2024-06-01 14:01:55] [INFO ] Deduced a trap composed of 208 places in 301 ms of which 3 ms to minimize.
[2024-06-01 14:01:58] [INFO ] Deduced a trap composed of 316 places in 355 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 688/2496 variables, and 60 constraints, problems are : Problem set: 0 solved, 1832 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1832 constraints, Known Traps: 22/22 constraints]
After SMT, in 68401ms problems are : Problem set: 0 solved, 1832 unsolved
Search for dead transitions found 0 dead transitions in 68417ms
Starting structural reductions in LTL mode, iteration 1 : 692/700 places, 1836/1844 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129904 ms. Remains : 692/700 places, 1836/1844 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T08-LTLCardinality-03
Product exploration explored 100000 steps with 572 reset in 430 ms.
Product exploration explored 100000 steps with 600 reset in 438 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 p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 88 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1895 steps (0 resets) in 14 ms. (126 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 143 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 32 out of 692 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 692/692 places, 1836/1836 transitions.
Applied a total of 0 rules in 23 ms. Remains 692 /692 variables (removed 0) and now considering 1836/1836 (removed 0) transitions.
Running 1832 sub problems to find dead transitions.
[2024-06-01 14:02:01] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
[2024-06-01 14:02:01] [INFO ] Invariant cache hit.
[2024-06-01 14:02:01] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-06-01 14:02:25] [INFO ] Deduced a trap composed of 75 places in 90 ms of which 2 ms to minimize.
[2024-06-01 14:02:25] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:02:26] [INFO ] Deduced a trap composed of 75 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:02:26] [INFO ] Deduced a trap composed of 75 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:02:26] [INFO ] Deduced a trap composed of 75 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:02:26] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:02:26] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:02:27] [INFO ] Deduced a trap composed of 399 places in 343 ms of which 4 ms to minimize.
[2024-06-01 14:02:27] [INFO ] Deduced a trap composed of 403 places in 412 ms of which 5 ms to minimize.
[2024-06-01 14:02:28] [INFO ] Deduced a trap composed of 209 places in 411 ms of which 5 ms to minimize.
[2024-06-01 14:02:28] [INFO ] Deduced a trap composed of 75 places in 74 ms of which 1 ms to minimize.
[2024-06-01 14:02:29] [INFO ] Deduced a trap composed of 191 places in 178 ms of which 1 ms to minimize.
[2024-06-01 14:02:30] [INFO ] Deduced a trap composed of 395 places in 318 ms of which 4 ms to minimize.
[2024-06-01 14:02:30] [INFO ] Deduced a trap composed of 379 places in 315 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 688/2496 variables, and 52 constraints, problems are : Problem set: 0 solved, 1832 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1832/1832 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1832 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/688 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-06-01 14:02:34] [INFO ] Deduced a trap composed of 366 places in 398 ms of which 5 ms to minimize.
[2024-06-01 14:02:34] [INFO ] Deduced a trap composed of 411 places in 380 ms of which 5 ms to minimize.
[2024-06-01 14:02:43] [INFO ] Deduced a trap composed of 418 places in 411 ms of which 5 ms to minimize.
[2024-06-01 14:02:46] [INFO ] Deduced a trap composed of 19 places in 174 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 688/2496 variables, and 56 constraints, problems are : Problem set: 0 solved, 1832 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1832 constraints, Known Traps: 18/18 constraints]
After SMT, in 49758ms problems are : Problem set: 0 solved, 1832 unsolved
Search for dead transitions found 0 dead transitions in 49788ms
[2024-06-01 14:02:51] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
[2024-06-01 14:02:51] [INFO ] Invariant cache hit.
[2024-06-01 14:02:51] [INFO ] Implicit Places using invariants in 424 ms returned []
[2024-06-01 14:02:51] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
[2024-06-01 14:02:51] [INFO ] Invariant cache hit.
[2024-06-01 14:02:52] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 14:03:03] [INFO ] Implicit Places using invariants and state equation in 11731 ms returned []
Implicit Place search using SMT with State Equation took 12157 ms to find 0 implicit places.
Running 1832 sub problems to find dead transitions.
[2024-06-01 14:03:03] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
[2024-06-01 14:03:03] [INFO ] Invariant cache hit.
[2024-06-01 14:03:03] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-06-01 14:03:29] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 2 ms to minimize.
[2024-06-01 14:03:30] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:03:30] [INFO ] Deduced a trap composed of 75 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:03:30] [INFO ] Deduced a trap composed of 75 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:03:30] [INFO ] Deduced a trap composed of 75 places in 95 ms of which 1 ms to minimize.
[2024-06-01 14:03:30] [INFO ] Deduced a trap composed of 75 places in 85 ms of which 1 ms to minimize.
[2024-06-01 14:03:30] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 2 ms to minimize.
[2024-06-01 14:03:31] [INFO ] Deduced a trap composed of 399 places in 472 ms of which 5 ms to minimize.
[2024-06-01 14:03:31] [INFO ] Deduced a trap composed of 403 places in 416 ms of which 4 ms to minimize.
[2024-06-01 14:03:32] [INFO ] Deduced a trap composed of 209 places in 418 ms of which 5 ms to minimize.
[2024-06-01 14:03:32] [INFO ] Deduced a trap composed of 75 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:03:34] [INFO ] Deduced a trap composed of 191 places in 249 ms of which 2 ms to minimize.
[2024-06-01 14:03:35] [INFO ] Deduced a trap composed of 395 places in 463 ms of which 5 ms to minimize.
[2024-06-01 14:03:35] [INFO ] Deduced a trap composed of 379 places in 422 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 688/2496 variables, and 52 constraints, problems are : Problem set: 0 solved, 1832 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1832/1832 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1832 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/688 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-06-01 14:03:46] [INFO ] Deduced a trap composed of 366 places in 320 ms of which 4 ms to minimize.
[2024-06-01 14:03:46] [INFO ] Deduced a trap composed of 411 places in 313 ms of which 4 ms to minimize.
[2024-06-01 14:03:55] [INFO ] Deduced a trap composed of 418 places in 412 ms of which 5 ms to minimize.
[2024-06-01 14:03:58] [INFO ] Deduced a trap composed of 19 places in 196 ms of which 3 ms to minimize.
[2024-06-01 14:04:09] [INFO ] Deduced a trap composed of 397 places in 287 ms of which 3 ms to minimize.
[2024-06-01 14:04:11] [INFO ] Deduced a trap composed of 177 places in 476 ms of which 6 ms to minimize.
[2024-06-01 14:04:12] [INFO ] Deduced a trap composed of 208 places in 454 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 688/2496 variables, and 59 constraints, problems are : Problem set: 0 solved, 1832 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1832 constraints, Known Traps: 21/21 constraints]
After SMT, in 69941ms problems are : Problem set: 0 solved, 1832 unsolved
Search for dead transitions found 0 dead transitions in 69966ms
Finished structural reductions in LTL mode , in 1 iterations and 131950 ms. Remains : 692/692 places, 1836/1836 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 p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 111 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1416 steps (0 resets) in 15 ms. (88 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 129 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 563 reset in 483 ms.
Product exploration explored 100000 steps with 605 reset in 496 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 32 out of 692 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 692/692 places, 1836/1836 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 692 transition count 1836
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 48 Pre rules applied. Total rules applied 48 place count 692 transition count 1900
Deduced a syphon composed of 96 places in 2 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 96 place count 692 transition count 1900
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 120 place count 668 transition count 1876
Deduced a syphon composed of 72 places in 2 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 144 place count 668 transition count 1876
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 192 places in 1 ms
Iterating global reduction 1 with 120 rules applied. Total rules applied 264 place count 668 transition count 1876
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 288 place count 644 transition count 1852
Deduced a syphon composed of 176 places in 1 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 312 place count 644 transition count 1852
Deduced a syphon composed of 176 places in 1 ms
Applied a total of 312 rules in 119 ms. Remains 644 /692 variables (removed 48) and now considering 1852/1836 (removed -16) transitions.
Running 1848 sub problems to find dead transitions.
[2024-06-01 14:04:15] [INFO ] Flow matrix only has 1820 transitions (discarded 32 similar events)
// Phase 1: matrix 1820 rows 644 cols
[2024-06-01 14:04:15] [INFO ] Computed 42 invariants in 55 ms
[2024-06-01 14:04:15] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1848 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 1848 unsolved
[2024-06-01 14:04:42] [INFO ] Deduced a trap composed of 47 places in 233 ms of which 4 ms to minimize.
[2024-06-01 14:04:43] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 3 ms to minimize.
[2024-06-01 14:04:43] [INFO ] Deduced a trap composed of 47 places in 143 ms of which 2 ms to minimize.
[2024-06-01 14:04:43] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 2 ms to minimize.
[2024-06-01 14:04:43] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 2 ms to minimize.
[2024-06-01 14:04:43] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 1 ms to minimize.
[2024-06-01 14:04:43] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:04:43] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:04:44] [INFO ] Deduced a trap composed of 233 places in 398 ms of which 5 ms to minimize.
[2024-06-01 14:04:44] [INFO ] Deduced a trap composed of 220 places in 410 ms of which 4 ms to minimize.
[2024-06-01 14:04:45] [INFO ] Deduced a trap composed of 234 places in 284 ms of which 4 ms to minimize.
[2024-06-01 14:04:45] [INFO ] Deduced a trap composed of 183 places in 269 ms of which 3 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
[2024-06-01 14:04:45] [INFO ] Deduced a trap composed of 214 places in 332 ms of which 3 ms to minimize.
[2024-06-01 14:04:46] [INFO ] Deduced a trap composed of 236 places in 347 ms of which 4 ms to minimize.
SMT process timed out in 30385ms, After SMT, problems are : Problem set: 0 solved, 1848 unsolved
Search for dead transitions found 0 dead transitions in 30407ms
[2024-06-01 14:04:46] [INFO ] Redundant transitions in 20 ms returned []
Running 1848 sub problems to find dead transitions.
[2024-06-01 14:04:46] [INFO ] Flow matrix only has 1820 transitions (discarded 32 similar events)
[2024-06-01 14:04:46] [INFO ] Invariant cache hit.
[2024-06-01 14:04:46] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1848 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 1848 unsolved
[2024-06-01 14:05:10] [INFO ] Deduced a trap composed of 47 places in 166 ms of which 3 ms to minimize.
[2024-06-01 14:05:10] [INFO ] Deduced a trap composed of 47 places in 163 ms of which 2 ms to minimize.
[2024-06-01 14:05:10] [INFO ] Deduced a trap composed of 47 places in 104 ms of which 2 ms to minimize.
[2024-06-01 14:05:10] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:05:10] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:05:11] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:05:11] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:05:11] [INFO ] Deduced a trap composed of 219 places in 364 ms of which 3 ms to minimize.
[2024-06-01 14:05:12] [INFO ] Deduced a trap composed of 224 places in 419 ms of which 5 ms to minimize.
[2024-06-01 14:05:12] [INFO ] Deduced a trap composed of 195 places in 366 ms of which 4 ms to minimize.
[2024-06-01 14:05:12] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
[2024-06-01 14:05:13] [INFO ] Deduced a trap composed of 230 places in 380 ms of which 4 ms to minimize.
[2024-06-01 14:05:13] [INFO ] Deduced a trap composed of 220 places in 353 ms of which 3 ms to minimize.
[2024-06-01 14:05:13] [INFO ] Deduced a trap composed of 211 places in 352 ms of which 4 ms to minimize.
[2024-06-01 14:05:14] [INFO ] Deduced a trap composed of 221 places in 335 ms of which 3 ms to minimize.
[2024-06-01 14:05:14] [INFO ] Deduced a trap composed of 238 places in 311 ms of which 3 ms to minimize.
[2024-06-01 14:05:15] [INFO ] Deduced a trap composed of 219 places in 314 ms of which 3 ms to minimize.
[2024-06-01 14:05:15] [INFO ] Deduced a trap composed of 204 places in 475 ms of which 3 ms to minimize.
[2024-06-01 14:05:15] [INFO ] Deduced a trap composed of 214 places in 388 ms of which 4 ms to minimize.
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 640/2464 variables, and 57 constraints, problems are : Problem set: 64 solved, 1784 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/644 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 1848/1848 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 64 solved, 1784 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 12/12 constraints. Problems are: Problem set: 64 solved, 1784 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 24/36 constraints. Problems are: Problem set: 64 solved, 1784 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 19/55 constraints. Problems are: Problem set: 64 solved, 1784 unsolved
[2024-06-01 14:05:28] [INFO ] Deduced a trap composed of 159 places in 358 ms of which 3 ms to minimize.
[2024-06-01 14:05:29] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:05:29] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2024-06-01 14:05:29] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2024-06-01 14:05:30] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:05:39] [INFO ] Deduced a trap composed of 69 places in 266 ms of which 3 ms to minimize.
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
[2024-06-01 14:05:39] [INFO ] Deduced a trap composed of 35 places in 273 ms of which 3 ms to minimize.
[2024-06-01 14:05:39] [INFO ] Deduced a trap composed of 57 places in 238 ms of which 3 ms to minimize.
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
[2024-06-01 14:05:42] [INFO ] Deduced a trap composed of 9 places in 249 ms of which 6 ms to minimize.
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
[2024-06-01 14:05:43] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
[2024-06-01 14:05:43] [INFO ] Deduced a trap composed of 3 places in 227 ms of which 3 ms to minimize.
Problem TDEAD1772 is UNSAT
[2024-06-01 14:05:49] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 2 ms to minimize.
Problem TDEAD1777 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1787 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1797 is UNSAT
Problem TDEAD1802 is UNSAT
Problem TDEAD1807 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/608 variables, 12/67 constraints. Problems are: Problem set: 128 solved, 1720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/2464 variables, and 67 constraints, problems are : Problem set: 128 solved, 1720 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/644 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 0/1848 constraints, Known Traps: 31/31 constraints]
After SMT, in 69445ms problems are : Problem set: 128 solved, 1720 unsolved
Search for dead transitions found 128 dead transitions in 69462ms
Found 128 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 128 transitions
Dead transitions reduction (with SMT) removed 128 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 644/692 places, 1724/1836 transitions.
Graph (complete) has 3630 edges and 644 vertex of which 548 are kept as prefixes of interest. Removing 96 places using SCC suffix rule.2 ms
Discarding 96 places :
Also discarding 0 output transitions
Deduced a syphon composed of 80 places in 1 ms
Applied a total of 1 rules in 29 ms. Remains 548 /644 variables (removed 96) and now considering 1724/1724 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 548/692 places, 1724/1836 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 100054 ms. Remains : 548/692 places, 1724/1836 transitions.
Support contains 32 out of 692 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 692/692 places, 1836/1836 transitions.
Applied a total of 0 rules in 9 ms. Remains 692 /692 variables (removed 0) and now considering 1836/1836 (removed 0) transitions.
Running 1832 sub problems to find dead transitions.
[2024-06-01 14:05:55] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
// Phase 1: matrix 1804 rows 692 cols
[2024-06-01 14:05:55] [INFO ] Computed 42 invariants in 38 ms
[2024-06-01 14:05:55] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-06-01 14:06:22] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 2 ms to minimize.
[2024-06-01 14:06:22] [INFO ] Deduced a trap composed of 75 places in 100 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 688/2496 variables, and 40 constraints, problems are : Problem set: 0 solved, 1832 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1832/1832 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1832 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/688 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-06-01 14:06:25] [INFO ] Deduced a trap composed of 75 places in 133 ms of which 2 ms to minimize.
[2024-06-01 14:06:26] [INFO ] Deduced a trap composed of 75 places in 135 ms of which 3 ms to minimize.
[2024-06-01 14:06:26] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 2 ms to minimize.
[2024-06-01 14:06:26] [INFO ] Deduced a trap composed of 75 places in 129 ms of which 2 ms to minimize.
[2024-06-01 14:06:26] [INFO ] Deduced a trap composed of 75 places in 79 ms of which 1 ms to minimize.
[2024-06-01 14:06:26] [INFO ] Deduced a trap composed of 75 places in 42 ms of which 0 ms to minimize.
[2024-06-01 14:06:27] [INFO ] Deduced a trap composed of 209 places in 369 ms of which 5 ms to minimize.
[2024-06-01 14:06:29] [INFO ] Deduced a trap composed of 388 places in 319 ms of which 3 ms to minimize.
[2024-06-01 14:06:29] [INFO ] Deduced a trap composed of 395 places in 483 ms of which 4 ms to minimize.
[2024-06-01 14:06:37] [INFO ] Deduced a trap composed of 110 places in 283 ms of which 3 ms to minimize.
[2024-06-01 14:06:42] [INFO ] Deduced a trap composed of 19 places in 183 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 688/2496 variables, and 51 constraints, problems are : Problem set: 0 solved, 1832 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1832 constraints, Known Traps: 13/13 constraints]
After SMT, in 47682ms problems are : Problem set: 0 solved, 1832 unsolved
Search for dead transitions found 0 dead transitions in 47698ms
[2024-06-01 14:06:43] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
[2024-06-01 14:06:43] [INFO ] Invariant cache hit.
[2024-06-01 14:06:43] [INFO ] Implicit Places using invariants in 488 ms returned []
[2024-06-01 14:06:43] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
[2024-06-01 14:06:43] [INFO ] Invariant cache hit.
[2024-06-01 14:06:44] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 14:06:56] [INFO ] Implicit Places using invariants and state equation in 12531 ms returned []
Implicit Place search using SMT with State Equation took 13049 ms to find 0 implicit places.
Running 1832 sub problems to find dead transitions.
[2024-06-01 14:06:56] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
[2024-06-01 14:06:56] [INFO ] Invariant cache hit.
[2024-06-01 14:06:56] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-06-01 14:07:22] [INFO ] Deduced a trap composed of 75 places in 74 ms of which 4 ms to minimize.
[2024-06-01 14:07:22] [INFO ] Deduced a trap composed of 75 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:07:22] [INFO ] Deduced a trap composed of 75 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:07:22] [INFO ] Deduced a trap composed of 75 places in 57 ms of which 0 ms to minimize.
[2024-06-01 14:07:22] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:07:22] [INFO ] Deduced a trap composed of 75 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:07:22] [INFO ] Deduced a trap composed of 75 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:07:23] [INFO ] Deduced a trap composed of 399 places in 318 ms of which 7 ms to minimize.
[2024-06-01 14:07:23] [INFO ] Deduced a trap composed of 403 places in 301 ms of which 4 ms to minimize.
[2024-06-01 14:07:24] [INFO ] Deduced a trap composed of 209 places in 307 ms of which 3 ms to minimize.
[2024-06-01 14:07:24] [INFO ] Deduced a trap composed of 75 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:07:26] [INFO ] Deduced a trap composed of 191 places in 357 ms of which 2 ms to minimize.
[2024-06-01 14:07:27] [INFO ] Deduced a trap composed of 395 places in 331 ms of which 3 ms to minimize.
[2024-06-01 14:07:28] [INFO ] Deduced a trap composed of 379 places in 345 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 688/2496 variables, and 52 constraints, problems are : Problem set: 0 solved, 1832 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1832/1832 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1832 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/688 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-06-01 14:07:38] [INFO ] Deduced a trap composed of 366 places in 289 ms of which 4 ms to minimize.
[2024-06-01 14:07:39] [INFO ] Deduced a trap composed of 411 places in 299 ms of which 3 ms to minimize.
[2024-06-01 14:07:48] [INFO ] Deduced a trap composed of 418 places in 345 ms of which 4 ms to minimize.
[2024-06-01 14:07:51] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 3 ms to minimize.
[2024-06-01 14:08:04] [INFO ] Deduced a trap composed of 397 places in 282 ms of which 3 ms to minimize.
[2024-06-01 14:08:06] [INFO ] Deduced a trap composed of 177 places in 449 ms of which 5 ms to minimize.
SMT process timed out in 69859ms, After SMT, problems are : Problem set: 0 solved, 1832 unsolved
Search for dead transitions found 0 dead transitions in 69875ms
Finished structural reductions in LTL mode , in 1 iterations and 130639 ms. Remains : 692/692 places, 1836/1836 transitions.
Treatment of property PolyORBLF-COL-S04J04T08-LTLCardinality-03 finished in 496525 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((F(p0) U X(p1)))))'
Support contains 56 out of 700 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 700/700 places, 1844/1844 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 700 transition count 1780
Reduce places removed 64 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 72 rules applied. Total rules applied 136 place count 636 transition count 1772
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 144 place count 628 transition count 1772
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 144 place count 628 transition count 1692
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 304 place count 548 transition count 1692
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 312 place count 540 transition count 1684
Iterating global reduction 3 with 8 rules applied. Total rules applied 320 place count 540 transition count 1684
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 464 place count 468 transition count 1612
Applied a total of 464 rules in 80 ms. Remains 468 /700 variables (removed 232) and now considering 1612/1844 (removed 232) transitions.
Running 1608 sub problems to find dead transitions.
[2024-06-01 14:08:06] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
// Phase 1: matrix 1580 rows 468 cols
[2024-06-01 14:08:06] [INFO ] Computed 42 invariants in 35 ms
[2024-06-01 14:08:06] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-06-01 14:08:25] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:08:25] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 1 ms to minimize.
[2024-06-01 14:08:25] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 0 ms to minimize.
[2024-06-01 14:08:26] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:08:26] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:08:26] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:08:26] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:08:26] [INFO ] Deduced a trap composed of 210 places in 265 ms of which 3 ms to minimize.
[2024-06-01 14:08:26] [INFO ] Deduced a trap composed of 205 places in 332 ms of which 2 ms to minimize.
[2024-06-01 14:08:27] [INFO ] Deduced a trap composed of 19 places in 363 ms of which 2 ms to minimize.
[2024-06-01 14:08:27] [INFO ] Deduced a trap composed of 218 places in 255 ms of which 3 ms to minimize.
[2024-06-01 14:08:28] [INFO ] Deduced a trap composed of 211 places in 336 ms of which 3 ms to minimize.
[2024-06-01 14:08:28] [INFO ] Deduced a trap composed of 225 places in 242 ms of which 3 ms to minimize.
[2024-06-01 14:08:28] [INFO ] Deduced a trap composed of 209 places in 256 ms of which 3 ms to minimize.
[2024-06-01 14:08:28] [INFO ] Deduced a trap composed of 206 places in 272 ms of which 3 ms to minimize.
[2024-06-01 14:08:29] [INFO ] Deduced a trap composed of 47 places in 31 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/2048 variables, and 54 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-06-01 14:08:54] [INFO ] Deduced a trap composed of 158 places in 226 ms of which 2 ms to minimize.
[2024-06-01 14:08:54] [INFO ] Deduced a trap composed of 155 places in 239 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/2048 variables, and 56 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1608 constraints, Known Traps: 18/18 constraints]
After SMT, in 48856ms problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 48875ms
[2024-06-01 14:08:55] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-06-01 14:08:55] [INFO ] Invariant cache hit.
[2024-06-01 14:08:55] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-06-01 14:08:55] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-06-01 14:08:55] [INFO ] Invariant cache hit.
[2024-06-01 14:08:56] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 14:09:05] [INFO ] Implicit Places using invariants and state equation in 9611 ms returned []
Implicit Place search using SMT with State Equation took 9981 ms to find 0 implicit places.
[2024-06-01 14:09:05] [INFO ] Redundant transitions in 105 ms returned []
Running 1608 sub problems to find dead transitions.
[2024-06-01 14:09:05] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-06-01 14:09:05] [INFO ] Invariant cache hit.
[2024-06-01 14:09:05] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-06-01 14:09:25] [INFO ] Deduced a trap composed of 47 places in 141 ms of which 2 ms to minimize.
[2024-06-01 14:09:25] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 1 ms to minimize.
[2024-06-01 14:09:25] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2024-06-01 14:09:25] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 1 ms to minimize.
[2024-06-01 14:09:25] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:09:26] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:09:26] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:09:26] [INFO ] Deduced a trap composed of 195 places in 425 ms of which 4 ms to minimize.
[2024-06-01 14:09:27] [INFO ] Deduced a trap composed of 199 places in 390 ms of which 4 ms to minimize.
[2024-06-01 14:09:27] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/2048 variables, and 48 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-06-01 14:09:51] [INFO ] Deduced a trap composed of 242 places in 248 ms of which 3 ms to minimize.
[2024-06-01 14:10:03] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 2 ms to minimize.
[2024-06-01 14:10:03] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 1 ms to minimize.
[2024-06-01 14:10:04] [INFO ] Deduced a trap composed of 58 places in 177 ms of which 1 ms to minimize.
[2024-06-01 14:10:07] [INFO ] Deduced a trap composed of 158 places in 218 ms of which 2 ms to minimize.
[2024-06-01 14:10:07] [INFO ] Deduced a trap composed of 154 places in 224 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/464 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/2048 variables, and 54 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1608 constraints, Known Traps: 16/16 constraints]
After SMT, in 68040ms problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 68057ms
Starting structural reductions in SI_LTL mode, iteration 1 : 468/700 places, 1612/1844 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 127129 ms. Remains : 468/700 places, 1612/1844 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false]
Running random walk in product with property : PolyORBLF-COL-S04J04T08-LTLCardinality-05
Product exploration explored 100000 steps with 33242 reset in 738 ms.
Product exploration explored 100000 steps with 33310 reset in 594 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 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 146 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), false]
RANDOM walk for 40000 steps (12 resets) in 332 ms. (120 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 222 ms. (179 steps per ms) remains 1/1 properties
[2024-06-01 14:10:15] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-06-01 14:10:15] [INFO ] Invariant cache hit.
[2024-06-01 14:10:15] [INFO ] State equation strengthened by 160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 183/239 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/262 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 196/458 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/463 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/466 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/466 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1580/2046 variables, 466/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2046 variables, 160/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2046 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/2048 variables, 2/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2048 variables, 1/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2048 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2048 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2048/2048 variables, and 670 constraints, problems are : Problem set: 0 solved, 1 unsolved in 943 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 468/468 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 183/239 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/262 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 458/2048 variables, and 33 constraints, problems are : Problem set: 1 solved, 0 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 9/15 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1132ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 177 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p1)]
Support contains 16 out of 468 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 : 468/468 places, 1612/1612 transitions.
Applied a total of 0 rules in 32 ms. Remains 468 /468 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
Running 1608 sub problems to find dead transitions.
[2024-06-01 14:10:16] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-06-01 14:10:16] [INFO ] Invariant cache hit.
[2024-06-01 14:10:16] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-06-01 14:10:39] [INFO ] Deduced a trap composed of 47 places in 131 ms of which 2 ms to minimize.
[2024-06-01 14:10:39] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 2 ms to minimize.
[2024-06-01 14:10:39] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2024-06-01 14:10:39] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:10:39] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 0 ms to minimize.
[2024-06-01 14:10:39] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:10:39] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 0 ms to minimize.
[2024-06-01 14:10:40] [INFO ] Deduced a trap composed of 195 places in 355 ms of which 3 ms to minimize.
[2024-06-01 14:10:40] [INFO ] Deduced a trap composed of 199 places in 320 ms of which 4 ms to minimize.
[2024-06-01 14:10:40] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/2048 variables, and 48 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-06-01 14:10:56] [INFO ] Deduced a trap composed of 242 places in 291 ms of which 3 ms to minimize.
[2024-06-01 14:11:07] [INFO ] Deduced a trap composed of 41 places in 246 ms of which 3 ms to minimize.
[2024-06-01 14:11:07] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 2 ms to minimize.
[2024-06-01 14:11:08] [INFO ] Deduced a trap composed of 58 places in 248 ms of which 2 ms to minimize.
SMT process timed out in 51140ms, After SMT, problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 51163ms
[2024-06-01 14:11:08] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-06-01 14:11:08] [INFO ] Invariant cache hit.
[2024-06-01 14:11:08] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-06-01 14:11:08] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-06-01 14:11:08] [INFO ] Invariant cache hit.
[2024-06-01 14:11:09] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 14:11:19] [INFO ] Implicit Places using invariants and state equation in 11079 ms returned []
Implicit Place search using SMT with State Equation took 11477 ms to find 0 implicit places.
[2024-06-01 14:11:19] [INFO ] Redundant transitions in 34 ms returned []
Running 1608 sub problems to find dead transitions.
[2024-06-01 14:11:19] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-06-01 14:11:19] [INFO ] Invariant cache hit.
[2024-06-01 14:11:19] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-06-01 14:11:39] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 1 ms to minimize.
[2024-06-01 14:11:39] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:11:39] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:11:39] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:11:39] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:11:39] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:11:39] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:11:40] [INFO ] Deduced a trap composed of 195 places in 280 ms of which 3 ms to minimize.
[2024-06-01 14:11:40] [INFO ] Deduced a trap composed of 199 places in 287 ms of which 3 ms to minimize.
[2024-06-01 14:11:40] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:11:55] [INFO ] Deduced a trap composed of 158 places in 242 ms of which 3 ms to minimize.
[2024-06-01 14:11:55] [INFO ] Deduced a trap composed of 151 places in 228 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/2048 variables, and 50 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-06-01 14:12:01] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 1 ms to minimize.
[2024-06-01 14:12:01] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 2 ms to minimize.
[2024-06-01 14:12:17] [INFO ] Deduced a trap composed of 88 places in 183 ms of which 1 ms to minimize.
[2024-06-01 14:12:17] [INFO ] Deduced a trap composed of 57 places in 183 ms of which 2 ms to minimize.
[2024-06-01 14:12:21] [INFO ] Deduced a trap composed of 270 places in 244 ms of which 2 ms to minimize.
[2024-06-01 14:12:22] [INFO ] Deduced a trap composed of 147 places in 232 ms of which 2 ms to minimize.
[2024-06-01 14:12:23] [INFO ] Deduced a trap composed of 40 places in 246 ms of which 3 ms to minimize.
[2024-06-01 14:12:23] [INFO ] Deduced a trap composed of 72 places in 247 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/464 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/2048 variables, and 58 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1608 constraints, Known Traps: 20/20 constraints]
After SMT, in 68747ms problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 68767ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 131497 ms. Remains : 468/468 places, 1612/1612 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 : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 422 steps (0 resets) in 6 ms. (60 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 321 reset in 363 ms.
Product exploration explored 100000 steps with 255 reset in 436 ms.
Support contains 16 out of 468 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 468/468 places, 1612/1612 transitions.
Applied a total of 0 rules in 19 ms. Remains 468 /468 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
Running 1608 sub problems to find dead transitions.
[2024-06-01 14:12:29] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-06-01 14:12:29] [INFO ] Invariant cache hit.
[2024-06-01 14:12:29] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-06-01 14:12:47] [INFO ] Deduced a trap composed of 47 places in 130 ms of which 2 ms to minimize.
[2024-06-01 14:12:47] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 2 ms to minimize.
[2024-06-01 14:12:47] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:12:47] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:12:47] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:12:47] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:12:48] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:12:48] [INFO ] Deduced a trap composed of 195 places in 380 ms of which 4 ms to minimize.
[2024-06-01 14:12:48] [INFO ] Deduced a trap composed of 199 places in 437 ms of which 4 ms to minimize.
[2024-06-01 14:12:49] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/2048 variables, and 48 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-06-01 14:13:05] [INFO ] Deduced a trap composed of 242 places in 240 ms of which 3 ms to minimize.
[2024-06-01 14:13:16] [INFO ] Deduced a trap composed of 41 places in 354 ms of which 2 ms to minimize.
[2024-06-01 14:13:17] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 2 ms to minimize.
[2024-06-01 14:13:18] [INFO ] Deduced a trap composed of 58 places in 408 ms of which 2 ms to minimize.
SMT process timed out in 48471ms, After SMT, problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 48485ms
[2024-06-01 14:13:18] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-06-01 14:13:18] [INFO ] Invariant cache hit.
[2024-06-01 14:13:18] [INFO ] Implicit Places using invariants in 637 ms returned []
[2024-06-01 14:13:18] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-06-01 14:13:18] [INFO ] Invariant cache hit.
[2024-06-01 14:13:19] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 14:13:27] [INFO ] Implicit Places using invariants and state equation in 9080 ms returned []
Implicit Place search using SMT with State Equation took 9721 ms to find 0 implicit places.
[2024-06-01 14:13:27] [INFO ] Redundant transitions in 15 ms returned []
Running 1608 sub problems to find dead transitions.
[2024-06-01 14:13:27] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-06-01 14:13:27] [INFO ] Invariant cache hit.
[2024-06-01 14:13:27] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-06-01 14:13:47] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 2 ms to minimize.
[2024-06-01 14:13:47] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:13:47] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:13:48] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:13:48] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:13:48] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 0 ms to minimize.
[2024-06-01 14:13:48] [INFO ] Deduced a trap composed of 47 places in 31 ms of which 0 ms to minimize.
[2024-06-01 14:13:48] [INFO ] Deduced a trap composed of 195 places in 313 ms of which 2 ms to minimize.
[2024-06-01 14:13:49] [INFO ] Deduced a trap composed of 199 places in 325 ms of which 3 ms to minimize.
[2024-06-01 14:13:49] [INFO ] Deduced a trap composed of 47 places in 35 ms of which 0 ms to minimize.
[2024-06-01 14:14:03] [INFO ] Deduced a trap composed of 158 places in 222 ms of which 3 ms to minimize.
[2024-06-01 14:14:04] [INFO ] Deduced a trap composed of 151 places in 239 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/2048 variables, and 50 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-06-01 14:14:09] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 1 ms to minimize.
[2024-06-01 14:14:09] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 2 ms to minimize.
[2024-06-01 14:14:26] [INFO ] Deduced a trap composed of 88 places in 246 ms of which 2 ms to minimize.
[2024-06-01 14:14:26] [INFO ] Deduced a trap composed of 57 places in 242 ms of which 2 ms to minimize.
[2024-06-01 14:14:30] [INFO ] Deduced a trap composed of 270 places in 247 ms of which 2 ms to minimize.
[2024-06-01 14:14:31] [INFO ] Deduced a trap composed of 147 places in 225 ms of which 3 ms to minimize.
[2024-06-01 14:14:32] [INFO ] Deduced a trap composed of 40 places in 240 ms of which 3 ms to minimize.
[2024-06-01 14:14:32] [INFO ] Deduced a trap composed of 72 places in 249 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/464 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/2048 variables, and 58 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1608 constraints, Known Traps: 20/20 constraints]
After SMT, in 68354ms problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 68366ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 126620 ms. Remains : 468/468 places, 1612/1612 transitions.
Treatment of property PolyORBLF-COL-S04J04T08-LTLCardinality-05 finished in 390036 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 5 out of 700 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 700/700 places, 1844/1844 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 692 transition count 1836
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 692 transition count 1836
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 684 transition count 1828
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 684 transition count 1828
Applied a total of 32 rules in 36 ms. Remains 684 /700 variables (removed 16) and now considering 1828/1844 (removed 16) transitions.
Running 1824 sub problems to find dead transitions.
[2024-06-01 14:14:36] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
// Phase 1: matrix 1796 rows 684 cols
[2024-06-01 14:14:36] [INFO ] Computed 42 invariants in 23 ms
[2024-06-01 14:14:36] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-06-01 14:15:00] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 1 ms to minimize.
[2024-06-01 14:15:00] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 1 ms to minimize.
[2024-06-01 14:15:00] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 1 ms to minimize.
[2024-06-01 14:15:01] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 1 ms to minimize.
[2024-06-01 14:15:01] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 1 ms to minimize.
[2024-06-01 14:15:01] [INFO ] Deduced a trap composed of 200 places in 282 ms of which 4 ms to minimize.
[2024-06-01 14:15:02] [INFO ] Deduced a trap composed of 74 places in 341 ms of which 3 ms to minimize.
[2024-06-01 14:15:03] [INFO ] Deduced a trap composed of 427 places in 295 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/2480 variables, and 46 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-06-01 14:15:06] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:15:10] [INFO ] Deduced a trap composed of 83 places in 892 ms of which 2 ms to minimize.
[2024-06-01 14:15:12] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 0 ms to minimize.
[2024-06-01 14:15:16] [INFO ] Deduced a trap composed of 410 places in 321 ms of which 3 ms to minimize.
[2024-06-01 14:15:19] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2480 variables, and 51 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 13/13 constraints]
After SMT, in 48572ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 48604ms
[2024-06-01 14:15:25] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-06-01 14:15:25] [INFO ] Invariant cache hit.
[2024-06-01 14:15:26] [INFO ] Implicit Places using invariants in 945 ms returned []
[2024-06-01 14:15:26] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-06-01 14:15:26] [INFO ] Invariant cache hit.
[2024-06-01 14:15:26] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 14:15:37] [INFO ] Implicit Places using invariants and state equation in 11258 ms returned []
Implicit Place search using SMT with State Equation took 12219 ms to find 0 implicit places.
Running 1824 sub problems to find dead transitions.
[2024-06-01 14:15:37] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-06-01 14:15:37] [INFO ] Invariant cache hit.
[2024-06-01 14:15:37] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-06-01 14:16:00] [INFO ] Deduced a trap composed of 74 places in 90 ms of which 2 ms to minimize.
[2024-06-01 14:16:00] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 1 ms to minimize.
[2024-06-01 14:16:00] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 1 ms to minimize.
[2024-06-01 14:16:00] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 1 ms to minimize.
[2024-06-01 14:16:01] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 0 ms to minimize.
[2024-06-01 14:16:01] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:16:01] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 0 ms to minimize.
[2024-06-01 14:16:01] [INFO ] Deduced a trap composed of 377 places in 300 ms of which 4 ms to minimize.
[2024-06-01 14:16:02] [INFO ] Deduced a trap composed of 181 places in 273 ms of which 4 ms to minimize.
[2024-06-01 14:16:02] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:16:04] [INFO ] Deduced a trap composed of 383 places in 370 ms of which 4 ms to minimize.
[2024-06-01 14:16:04] [INFO ] Deduced a trap composed of 394 places in 347 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/2480 variables, and 50 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-06-01 14:16:18] [INFO ] Deduced a trap composed of 410 places in 310 ms of which 3 ms to minimize.
[2024-06-01 14:16:44] [INFO ] Deduced a trap composed of 366 places in 432 ms of which 5 ms to minimize.
[2024-06-01 14:16:45] [INFO ] Deduced a trap composed of 379 places in 394 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2480 variables, and 53 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 15/15 constraints]
After SMT, in 68088ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 68117ms
Starting structural reductions in LTL mode, iteration 1 : 684/700 places, 1828/1844 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 128987 ms. Remains : 684/700 places, 1828/1844 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T08-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 742 ms.
Product exploration explored 100000 steps with 50000 reset in 727 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S04J04T08-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S04J04T08-LTLCardinality-06 finished in 130600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(F(p0)&&(p1||F(G(!p0))))))'
Support contains 8 out of 700 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 : 700/700 places, 1844/1844 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 700 transition count 1788
Reduce places removed 56 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 64 rules applied. Total rules applied 120 place count 644 transition count 1780
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 128 place count 636 transition count 1780
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 128 place count 636 transition count 1700
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 288 place count 556 transition count 1700
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 448 place count 476 transition count 1620
Applied a total of 448 rules in 90 ms. Remains 476 /700 variables (removed 224) and now considering 1620/1844 (removed 224) transitions.
Running 1616 sub problems to find dead transitions.
[2024-06-01 14:16:47] [INFO ] Flow matrix only has 1588 transitions (discarded 32 similar events)
// Phase 1: matrix 1588 rows 476 cols
[2024-06-01 14:16:47] [INFO ] Computed 42 invariants in 37 ms
[2024-06-01 14:16:47] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
[2024-06-01 14:17:07] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 1 ms to minimize.
[2024-06-01 14:17:07] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:17:07] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:17:07] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:17:07] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:17:07] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 0 ms to minimize.
[2024-06-01 14:17:07] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:17:08] [INFO ] Deduced a trap composed of 256 places in 421 ms of which 4 ms to minimize.
[2024-06-01 14:17:08] [INFO ] Deduced a trap composed of 221 places in 346 ms of which 3 ms to minimize.
[2024-06-01 14:17:08] [INFO ] Deduced a trap composed of 204 places in 364 ms of which 3 ms to minimize.
[2024-06-01 14:17:09] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:17:11] [INFO ] Deduced a trap composed of 242 places in 230 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/2064 variables, and 50 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/476 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1616/1616 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1616 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
[2024-06-01 14:17:17] [INFO ] Deduced a trap composed of 207 places in 379 ms of which 4 ms to minimize.
[2024-06-01 14:17:19] [INFO ] Deduced a trap composed of 59 places in 293 ms of which 2 ms to minimize.
[2024-06-01 14:17:22] [INFO ] Deduced a trap composed of 19 places in 204 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/2064 variables, and 53 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/476 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1616 constraints, Known Traps: 15/15 constraints]
After SMT, in 48484ms problems are : Problem set: 0 solved, 1616 unsolved
Search for dead transitions found 0 dead transitions in 48502ms
[2024-06-01 14:17:35] [INFO ] Flow matrix only has 1588 transitions (discarded 32 similar events)
[2024-06-01 14:17:35] [INFO ] Invariant cache hit.
[2024-06-01 14:17:36] [INFO ] Implicit Places using invariants in 453 ms returned []
[2024-06-01 14:17:36] [INFO ] Flow matrix only has 1588 transitions (discarded 32 similar events)
[2024-06-01 14:17:36] [INFO ] Invariant cache hit.
[2024-06-01 14:17:36] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 14:17:44] [INFO ] Implicit Places using invariants and state equation in 8658 ms returned []
Implicit Place search using SMT with State Equation took 9139 ms to find 0 implicit places.
[2024-06-01 14:17:44] [INFO ] Redundant transitions in 46 ms returned []
Running 1616 sub problems to find dead transitions.
[2024-06-01 14:17:44] [INFO ] Flow matrix only has 1588 transitions (discarded 32 similar events)
[2024-06-01 14:17:44] [INFO ] Invariant cache hit.
[2024-06-01 14:17:44] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
[2024-06-01 14:18:03] [INFO ] Deduced a trap composed of 48 places in 132 ms of which 2 ms to minimize.
[2024-06-01 14:18:03] [INFO ] Deduced a trap composed of 48 places in 87 ms of which 1 ms to minimize.
[2024-06-01 14:18:03] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 2 ms to minimize.
[2024-06-01 14:18:03] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:18:03] [INFO ] Deduced a trap composed of 48 places in 33 ms of which 0 ms to minimize.
[2024-06-01 14:18:03] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:18:04] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:18:04] [INFO ] Deduced a trap composed of 207 places in 340 ms of which 3 ms to minimize.
[2024-06-01 14:18:04] [INFO ] Deduced a trap composed of 203 places in 277 ms of which 3 ms to minimize.
[2024-06-01 14:18:06] [INFO ] Deduced a trap composed of 51 places in 232 ms of which 2 ms to minimize.
[2024-06-01 14:18:06] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:18:21] [INFO ] Deduced a trap composed of 166 places in 358 ms of which 4 ms to minimize.
[2024-06-01 14:18:22] [INFO ] Deduced a trap composed of 162 places in 340 ms of which 4 ms to minimize.
[2024-06-01 14:18:22] [INFO ] Deduced a trap composed of 229 places in 316 ms of which 3 ms to minimize.
[2024-06-01 14:18:23] [INFO ] Deduced a trap composed of 196 places in 259 ms of which 3 ms to minimize.
SMT process timed out in 38248ms, After SMT, problems are : Problem set: 0 solved, 1616 unsolved
Search for dead transitions found 0 dead transitions in 38271ms
Starting structural reductions in SI_LTL mode, iteration 1 : 476/700 places, 1620/1844 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96066 ms. Remains : 476/700 places, 1620/1844 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T08-LTLCardinality-08
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S04J04T08-LTLCardinality-08 TRUE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T08-LTLCardinality-08 finished in 96132 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((p1||X(G(p2)))&&p0)))))'
Support contains 65 out of 700 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 700/700 places, 1844/1844 transitions.
Applied a total of 0 rules in 10 ms. Remains 700 /700 variables (removed 0) and now considering 1844/1844 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-06-01 14:18:23] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 700 cols
[2024-06-01 14:18:23] [INFO ] Computed 42 invariants in 37 ms
[2024-06-01 14:18:23] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/696 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/696 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-06-01 14:18:50] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 696/2512 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/31 constraints, State Equation: 0/700 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1840/1840 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/696 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/696 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/696 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-06-01 14:18:54] [INFO ] Deduced a trap composed of 76 places in 47 ms of which 0 ms to minimize.
[2024-06-01 14:18:55] [INFO ] Deduced a trap composed of 201 places in 374 ms of which 4 ms to minimize.
[2024-06-01 14:18:57] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2024-06-01 14:18:59] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 1 ms to minimize.
[2024-06-01 14:18:59] [INFO ] Deduced a trap composed of 76 places in 55 ms of which 0 ms to minimize.
[2024-06-01 14:18:59] [INFO ] Deduced a trap composed of 76 places in 55 ms of which 0 ms to minimize.
[2024-06-01 14:18:59] [INFO ] Deduced a trap composed of 76 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:18:59] [INFO ] Deduced a trap composed of 76 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:19:06] [INFO ] Deduced a trap composed of 343 places in 277 ms of which 3 ms to minimize.
[2024-06-01 14:19:08] [INFO ] Deduced a trap composed of 19 places in 210 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 696/2512 variables, and 49 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/31 constraints, State Equation: 0/700 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1840 constraints, Known Traps: 11/11 constraints]
After SMT, in 49420ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 49436ms
[2024-06-01 14:19:12] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-06-01 14:19:12] [INFO ] Invariant cache hit.
[2024-06-01 14:19:12] [INFO ] Implicit Places using invariants in 398 ms returned []
[2024-06-01 14:19:13] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-06-01 14:19:13] [INFO ] Invariant cache hit.
[2024-06-01 14:19:13] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 14:19:24] [INFO ] Implicit Places using invariants and state equation in 11904 ms returned []
Implicit Place search using SMT with State Equation took 12339 ms to find 0 implicit places.
Running 1840 sub problems to find dead transitions.
[2024-06-01 14:19:24] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-06-01 14:19:24] [INFO ] Invariant cache hit.
[2024-06-01 14:19:24] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/696 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/696 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-06-01 14:19:47] [INFO ] Deduced a trap composed of 76 places in 78 ms of which 1 ms to minimize.
[2024-06-01 14:19:47] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 2 ms to minimize.
[2024-06-01 14:19:47] [INFO ] Deduced a trap composed of 76 places in 77 ms of which 1 ms to minimize.
[2024-06-01 14:19:47] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 5 ms to minimize.
[2024-06-01 14:19:48] [INFO ] Deduced a trap composed of 76 places in 59 ms of which 0 ms to minimize.
[2024-06-01 14:19:48] [INFO ] Deduced a trap composed of 76 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:19:48] [INFO ] Deduced a trap composed of 76 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:19:48] [INFO ] Deduced a trap composed of 387 places in 344 ms of which 3 ms to minimize.
[2024-06-01 14:19:49] [INFO ] Deduced a trap composed of 197 places in 300 ms of which 3 ms to minimize.
[2024-06-01 14:19:49] [INFO ] Deduced a trap composed of 76 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:19:50] [INFO ] Deduced a trap composed of 69 places in 188 ms of which 2 ms to minimize.
[2024-06-01 14:19:51] [INFO ] Deduced a trap composed of 391 places in 336 ms of which 4 ms to minimize.
[2024-06-01 14:19:51] [INFO ] Deduced a trap composed of 449 places in 341 ms of which 4 ms to minimize.
[2024-06-01 14:19:52] [INFO ] Deduced a trap composed of 393 places in 332 ms of which 3 ms to minimize.
[2024-06-01 14:19:52] [INFO ] Deduced a trap composed of 397 places in 333 ms of which 4 ms to minimize.
[2024-06-01 14:19:53] [INFO ] Deduced a trap composed of 414 places in 354 ms of which 4 ms to minimize.
[2024-06-01 14:19:53] [INFO ] Deduced a trap composed of 422 places in 320 ms of which 3 ms to minimize.
[2024-06-01 14:19:53] [INFO ] Deduced a trap composed of 396 places in 333 ms of which 3 ms to minimize.
[2024-06-01 14:19:54] [INFO ] Deduced a trap composed of 430 places in 330 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 696/2512 variables, and 57 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/31 constraints, State Equation: 0/700 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1840/1840 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/696 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/696 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/696 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-06-01 14:20:06] [INFO ] Deduced a trap composed of 364 places in 314 ms of which 3 ms to minimize.
[2024-06-01 14:20:08] [INFO ] Deduced a trap composed of 372 places in 354 ms of which 4 ms to minimize.
[2024-06-01 14:20:08] [INFO ] Deduced a trap composed of 47 places in 145 ms of which 2 ms to minimize.
[2024-06-01 14:20:08] [INFO ] Deduced a trap composed of 44 places in 160 ms of which 1 ms to minimize.
[2024-06-01 14:20:09] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 2 ms to minimize.
[2024-06-01 14:20:09] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 2 ms to minimize.
[2024-06-01 14:20:30] [INFO ] Deduced a trap composed of 368 places in 336 ms of which 3 ms to minimize.
[2024-06-01 14:20:30] [INFO ] Deduced a trap composed of 382 places in 305 ms of which 3 ms to minimize.
[2024-06-01 14:20:30] [INFO ] Deduced a trap composed of 362 places in 306 ms of which 4 ms to minimize.
[2024-06-01 14:20:32] [INFO ] Deduced a trap composed of 364 places in 318 ms of which 4 ms to minimize.
[2024-06-01 14:20:32] [INFO ] Deduced a trap composed of 379 places in 306 ms of which 4 ms to minimize.
[2024-06-01 14:20:32] [INFO ] Deduced a trap composed of 379 places in 301 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 696/2512 variables, and 69 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/31 constraints, State Equation: 0/700 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1840 constraints, Known Traps: 31/31 constraints]
After SMT, in 68722ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 68742ms
Finished structural reductions in LTL mode , in 1 iterations and 130539 ms. Remains : 700/700 places, 1844/1844 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : PolyORBLF-COL-S04J04T08-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S04J04T08-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T08-LTLCardinality-11 finished in 130684 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U ((!p1&&F(!p0)) U p2))))'
Support contains 102 out of 700 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 700/700 places, 1844/1844 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 692 transition count 1836
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 692 transition count 1836
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 684 transition count 1828
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 684 transition count 1828
Applied a total of 32 rules in 24 ms. Remains 684 /700 variables (removed 16) and now considering 1828/1844 (removed 16) transitions.
Running 1824 sub problems to find dead transitions.
[2024-06-01 14:20:33] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
// Phase 1: matrix 1796 rows 684 cols
[2024-06-01 14:20:33] [INFO ] Computed 42 invariants in 21 ms
[2024-06-01 14:20:33] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-06-01 14:20:57] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 1 ms to minimize.
[2024-06-01 14:20:57] [INFO ] Deduced a trap composed of 74 places in 110 ms of which 1 ms to minimize.
[2024-06-01 14:20:57] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 2 ms to minimize.
[2024-06-01 14:20:57] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 1 ms to minimize.
[2024-06-01 14:20:57] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 1 ms to minimize.
[2024-06-01 14:20:58] [INFO ] Deduced a trap composed of 200 places in 305 ms of which 3 ms to minimize.
[2024-06-01 14:21:00] [INFO ] Deduced a trap composed of 74 places in 516 ms of which 7 ms to minimize.
[2024-06-01 14:21:01] [INFO ] Deduced a trap composed of 427 places in 601 ms of which 19 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/2480 variables, and 46 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-06-01 14:21:04] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:21:05] [INFO ] Deduced a trap composed of 83 places in 200 ms of which 2 ms to minimize.
[2024-06-01 14:21:08] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 0 ms to minimize.
[2024-06-01 14:21:12] [INFO ] Deduced a trap composed of 410 places in 297 ms of which 3 ms to minimize.
[2024-06-01 14:21:17] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 9)
(s163 1)
(s164 0)
(s165 1)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 1)
(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 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 1)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 1)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 1)
(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 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 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 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 7)
(s464 0)
(s465 0)
(s466 0)
(s467 1)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2480 variables, and 51 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 13/13 constraints]
After SMT, in 48920ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 48936ms
[2024-06-01 14:21:22] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-06-01 14:21:22] [INFO ] Invariant cache hit.
[2024-06-01 14:21:23] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-06-01 14:21:23] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-06-01 14:21:23] [INFO ] Invariant cache hit.
[2024-06-01 14:21:23] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 14:21:34] [INFO ] Implicit Places using invariants and state equation in 10867 ms returned []
Implicit Place search using SMT with State Equation took 11273 ms to find 0 implicit places.
Running 1824 sub problems to find dead transitions.
[2024-06-01 14:21:34] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-06-01 14:21:34] [INFO ] Invariant cache hit.
[2024-06-01 14:21:34] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-06-01 14:21:59] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 2 ms to minimize.
[2024-06-01 14:21:59] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 1 ms to minimize.
[2024-06-01 14:21:59] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 1 ms to minimize.
[2024-06-01 14:21:59] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 1 ms to minimize.
[2024-06-01 14:21:59] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:21:59] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:21:59] [INFO ] Deduced a trap composed of 74 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:22:00] [INFO ] Deduced a trap composed of 377 places in 357 ms of which 4 ms to minimize.
[2024-06-01 14:22:01] [INFO ] Deduced a trap composed of 181 places in 359 ms of which 4 ms to minimize.
[2024-06-01 14:22:01] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 1 ms to minimize.
[2024-06-01 14:22:04] [INFO ] Deduced a trap composed of 383 places in 425 ms of which 4 ms to minimize.
[2024-06-01 14:22:04] [INFO ] Deduced a trap composed of 394 places in 533 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 680/2480 variables, and 50 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-06-01 14:22:15] [INFO ] Deduced a trap composed of 410 places in 297 ms of which 3 ms to minimize.
[2024-06-01 14:22:35] [INFO ] Deduced a trap composed of 366 places in 368 ms of which 3 ms to minimize.
[2024-06-01 14:22:35] [INFO ] Deduced a trap composed of 379 places in 313 ms of which 4 ms to minimize.
[2024-06-01 14:22:35] [INFO ] Deduced a trap composed of 380 places in 305 ms of which 4 ms to minimize.
[2024-06-01 14:22:37] [INFO ] Deduced a trap composed of 69 places in 189 ms of which 2 ms to minimize.
[2024-06-01 14:22:40] [INFO ] Deduced a trap composed of 392 places in 308 ms of which 3 ms to minimize.
[2024-06-01 14:22:40] [INFO ] Deduced a trap composed of 435 places in 315 ms of which 3 ms to minimize.
[2024-06-01 14:22:41] [INFO ] Deduced a trap composed of 404 places in 455 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2480 variables, and 58 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 20/20 constraints]
After SMT, in 68165ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 68190ms
Starting structural reductions in LTL mode, iteration 1 : 684/700 places, 1828/1844 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 128432 ms. Remains : 684/700 places, 1828/1844 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p2), (NOT p2), true, (NOT p0), (NOT p2), p0]
Running random walk in product with property : PolyORBLF-COL-S04J04T08-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 618 ms.
Product exploration explored 100000 steps with 50000 reset in 619 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 p2 (NOT p0) p1), (X p2), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 18 factoid took 12 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S04J04T08-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S04J04T08-LTLCardinality-12 finished in 129856 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 48 out of 700 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 700/700 places, 1844/1844 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 700 transition count 1772
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 628 transition count 1772
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 144 place count 628 transition count 1692
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 304 place count 548 transition count 1692
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 312 place count 540 transition count 1684
Iterating global reduction 2 with 8 rules applied. Total rules applied 320 place count 540 transition count 1684
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 480 place count 460 transition count 1604
Applied a total of 480 rules in 99 ms. Remains 460 /700 variables (removed 240) and now considering 1604/1844 (removed 240) transitions.
Running 1600 sub problems to find dead transitions.
[2024-06-01 14:22:43] [INFO ] Flow matrix only has 1572 transitions (discarded 32 similar events)
// Phase 1: matrix 1572 rows 460 cols
[2024-06-01 14:22:43] [INFO ] Computed 42 invariants in 19 ms
[2024-06-01 14:22:43] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:23:02] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 1 ms to minimize.
[2024-06-01 14:23:02] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 1 ms to minimize.
[2024-06-01 14:23:02] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 1 ms to minimize.
[2024-06-01 14:23:02] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:23:02] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:23:02] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 0 ms to minimize.
[2024-06-01 14:23:02] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:23:03] [INFO ] Deduced a trap composed of 199 places in 255 ms of which 2 ms to minimize.
[2024-06-01 14:23:03] [INFO ] Deduced a trap composed of 202 places in 265 ms of which 16 ms to minimize.
[2024-06-01 14:23:03] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 456/2032 variables, and 48 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/460 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/456 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:23:18] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 2 ms to minimize.
[2024-06-01 14:23:30] [INFO ] Deduced a trap composed of 158 places in 247 ms of which 2 ms to minimize.
[2024-06-01 14:23:30] [INFO ] Deduced a trap composed of 150 places in 243 ms of which 2 ms to minimize.
[2024-06-01 14:23:30] [INFO ] Deduced a trap composed of 146 places in 244 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/2032 variables, and 52 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/460 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 14/14 constraints]
After SMT, in 48303ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 48317ms
[2024-06-01 14:23:32] [INFO ] Flow matrix only has 1572 transitions (discarded 32 similar events)
[2024-06-01 14:23:32] [INFO ] Invariant cache hit.
[2024-06-01 14:23:32] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-06-01 14:23:32] [INFO ] Flow matrix only has 1572 transitions (discarded 32 similar events)
[2024-06-01 14:23:32] [INFO ] Invariant cache hit.
[2024-06-01 14:23:33] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 14:23:39] [INFO ] Implicit Places using invariants and state equation in 7145 ms returned []
Implicit Place search using SMT with State Equation took 7497 ms to find 0 implicit places.
[2024-06-01 14:23:39] [INFO ] Redundant transitions in 23 ms returned []
Running 1600 sub problems to find dead transitions.
[2024-06-01 14:23:39] [INFO ] Flow matrix only has 1572 transitions (discarded 32 similar events)
[2024-06-01 14:23:39] [INFO ] Invariant cache hit.
[2024-06-01 14:23:39] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:23:57] [INFO ] Deduced a trap composed of 46 places in 114 ms of which 2 ms to minimize.
[2024-06-01 14:23:57] [INFO ] Deduced a trap composed of 47 places in 119 ms of which 1 ms to minimize.
[2024-06-01 14:23:57] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 1 ms to minimize.
[2024-06-01 14:23:57] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 1 ms to minimize.
[2024-06-01 14:23:57] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:23:57] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:23:57] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 0 ms to minimize.
[2024-06-01 14:23:58] [INFO ] Deduced a trap composed of 190 places in 259 ms of which 2 ms to minimize.
[2024-06-01 14:23:58] [INFO ] Deduced a trap composed of 191 places in 254 ms of which 2 ms to minimize.
[2024-06-01 14:23:59] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 0 ms to minimize.
[2024-06-01 14:24:12] [INFO ] Deduced a trap composed of 158 places in 253 ms of which 2 ms to minimize.
[2024-06-01 14:24:14] [INFO ] Deduced a trap composed of 170 places in 235 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/456 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 456/2032 variables, and 50 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/460 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/456 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:24:21] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 1 ms to minimize.
[2024-06-01 14:24:24] [INFO ] Deduced a trap composed of 234 places in 225 ms of which 2 ms to minimize.
[2024-06-01 14:24:44] [INFO ] Deduced a trap composed of 71 places in 235 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/2032 variables, and 53 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/460 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 15/15 constraints]
After SMT, in 68405ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 68421ms
Starting structural reductions in SI_LTL mode, iteration 1 : 460/700 places, 1604/1844 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 124385 ms. Remains : 460/700 places, 1604/1844 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T08-LTLCardinality-14
Stuttering criterion allowed to conclude after 1391 steps with 0 reset in 8 ms.
FORMULA PolyORBLF-COL-S04J04T08-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T08-LTLCardinality-14 finished in 124441 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : PolyORBLF-COL-S04J04T08-LTLCardinality-02
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 700 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 700/700 places, 1844/1844 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 700 transition count 1772
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 628 transition count 1772
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 144 place count 628 transition count 1692
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 304 place count 548 transition count 1692
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 312 place count 540 transition count 1684
Iterating global reduction 2 with 8 rules applied. Total rules applied 320 place count 540 transition count 1684
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 480 place count 460 transition count 1604
Applied a total of 480 rules in 80 ms. Remains 460 /700 variables (removed 240) and now considering 1604/1844 (removed 240) transitions.
Running 1600 sub problems to find dead transitions.
[2024-06-01 14:24:48] [INFO ] Flow matrix only has 1572 transitions (discarded 32 similar events)
[2024-06-01 14:24:48] [INFO ] Invariant cache hit.
[2024-06-01 14:24:48] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:25:08] [INFO ] Deduced a trap composed of 46 places in 181 ms of which 2 ms to minimize.
[2024-06-01 14:25:08] [INFO ] Deduced a trap composed of 47 places in 185 ms of which 1 ms to minimize.
[2024-06-01 14:25:08] [INFO ] Deduced a trap composed of 46 places in 134 ms of which 1 ms to minimize.
[2024-06-01 14:25:08] [INFO ] Deduced a trap composed of 46 places in 131 ms of which 2 ms to minimize.
[2024-06-01 14:25:09] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 2 ms to minimize.
[2024-06-01 14:25:09] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 1 ms to minimize.
[2024-06-01 14:25:09] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 1 ms to minimize.
[2024-06-01 14:25:09] [INFO ] Deduced a trap composed of 190 places in 399 ms of which 4 ms to minimize.
[2024-06-01 14:25:10] [INFO ] Deduced a trap composed of 191 places in 364 ms of which 3 ms to minimize.
[2024-06-01 14:25:11] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 456/2032 variables, and 48 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/460 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/456 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:25:20] [INFO ] Deduced a trap composed of 33 places in 244 ms of which 2 ms to minimize.
[2024-06-01 14:25:22] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 2 ms to minimize.
[2024-06-01 14:25:37] [INFO ] Deduced a trap composed of 158 places in 382 ms of which 3 ms to minimize.
SMT process timed out in 48857ms, After SMT, problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 48875ms
[2024-06-01 14:25:37] [INFO ] Flow matrix only has 1572 transitions (discarded 32 similar events)
[2024-06-01 14:25:37] [INFO ] Invariant cache hit.
[2024-06-01 14:25:37] [INFO ] Implicit Places using invariants in 503 ms returned []
[2024-06-01 14:25:37] [INFO ] Flow matrix only has 1572 transitions (discarded 32 similar events)
[2024-06-01 14:25:37] [INFO ] Invariant cache hit.
[2024-06-01 14:25:38] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 14:25:46] [INFO ] Implicit Places using invariants and state equation in 8500 ms returned []
Implicit Place search using SMT with State Equation took 9005 ms to find 0 implicit places.
Running 1600 sub problems to find dead transitions.
[2024-06-01 14:25:46] [INFO ] Flow matrix only has 1572 transitions (discarded 32 similar events)
[2024-06-01 14:25:46] [INFO ] Invariant cache hit.
[2024-06-01 14:25:46] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:26:05] [INFO ] Deduced a trap composed of 46 places in 156 ms of which 2 ms to minimize.
[2024-06-01 14:26:05] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 2 ms to minimize.
[2024-06-01 14:26:05] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 2 ms to minimize.
[2024-06-01 14:26:05] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:26:05] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:26:05] [INFO ] Deduced a trap composed of 46 places in 33 ms of which 0 ms to minimize.
[2024-06-01 14:26:05] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:26:06] [INFO ] Deduced a trap composed of 190 places in 354 ms of which 3 ms to minimize.
[2024-06-01 14:26:06] [INFO ] Deduced a trap composed of 191 places in 357 ms of which 3 ms to minimize.
[2024-06-01 14:26:07] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:26:23] [INFO ] Deduced a trap composed of 158 places in 296 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 456/2032 variables, and 49 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/460 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/456 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:26:31] [INFO ] Deduced a trap composed of 234 places in 277 ms of which 3 ms to minimize.
[2024-06-01 14:26:45] [INFO ] Deduced a trap composed of 42 places in 203 ms of which 2 ms to minimize.
[2024-06-01 14:26:51] [INFO ] Deduced a trap composed of 50 places in 187 ms of which 2 ms to minimize.
[2024-06-01 14:26:54] [INFO ] Deduced a trap composed of 73 places in 267 ms of which 3 ms to minimize.
SMT process timed out in 68033ms, After SMT, problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 68049ms
Starting structural reductions in LI_LTL mode, iteration 1 : 460/700 places, 1604/1844 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 126015 ms. Remains : 460/700 places, 1604/1844 transitions.
Running random walk in product with property : PolyORBLF-COL-S04J04T08-LTLCardinality-02
Product exploration explored 100000 steps with 25000 reset in 548 ms.
Product exploration explored 100000 steps with 25000 reset in 559 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 97 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 198 steps (0 resets) in 4 ms. (39 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 76 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 460 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 460/460 places, 1604/1604 transitions.
Applied a total of 0 rules in 6 ms. Remains 460 /460 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Running 1600 sub problems to find dead transitions.
[2024-06-01 14:26:56] [INFO ] Flow matrix only has 1572 transitions (discarded 32 similar events)
[2024-06-01 14:26:56] [INFO ] Invariant cache hit.
[2024-06-01 14:26:56] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:27:16] [INFO ] Deduced a trap composed of 46 places in 170 ms of which 3 ms to minimize.
[2024-06-01 14:27:17] [INFO ] Deduced a trap composed of 47 places in 196 ms of which 2 ms to minimize.
[2024-06-01 14:27:17] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 2 ms to minimize.
[2024-06-01 14:27:17] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 1 ms to minimize.
[2024-06-01 14:27:17] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 2 ms to minimize.
[2024-06-01 14:27:17] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:27:17] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 0 ms to minimize.
[2024-06-01 14:27:17] [INFO ] Deduced a trap composed of 190 places in 377 ms of which 3 ms to minimize.
[2024-06-01 14:27:18] [INFO ] Deduced a trap composed of 191 places in 336 ms of which 2 ms to minimize.
[2024-06-01 14:27:19] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 456/2032 variables, and 48 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/460 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/456 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:27:29] [INFO ] Deduced a trap composed of 33 places in 299 ms of which 2 ms to minimize.
[2024-06-01 14:27:31] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 2 ms to minimize.
[2024-06-01 14:27:42] [INFO ] Deduced a trap composed of 158 places in 213 ms of which 2 ms to minimize.
[2024-06-01 14:27:43] [INFO ] Deduced a trap composed of 165 places in 215 ms of which 2 ms to minimize.
[2024-06-01 14:27:44] [INFO ] Deduced a trap composed of 79 places in 341 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/2032 variables, and 53 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/460 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 15/15 constraints]
After SMT, in 48938ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 48953ms
[2024-06-01 14:27:44] [INFO ] Flow matrix only has 1572 transitions (discarded 32 similar events)
[2024-06-01 14:27:44] [INFO ] Invariant cache hit.
[2024-06-01 14:27:45] [INFO ] Implicit Places using invariants in 557 ms returned []
[2024-06-01 14:27:45] [INFO ] Flow matrix only has 1572 transitions (discarded 32 similar events)
[2024-06-01 14:27:45] [INFO ] Invariant cache hit.
[2024-06-01 14:27:46] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 14:27:53] [INFO ] Implicit Places using invariants and state equation in 8380 ms returned []
Implicit Place search using SMT with State Equation took 8938 ms to find 0 implicit places.
Running 1600 sub problems to find dead transitions.
[2024-06-01 14:27:53] [INFO ] Flow matrix only has 1572 transitions (discarded 32 similar events)
[2024-06-01 14:27:53] [INFO ] Invariant cache hit.
[2024-06-01 14:27:53] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:28:12] [INFO ] Deduced a trap composed of 46 places in 173 ms of which 3 ms to minimize.
[2024-06-01 14:28:12] [INFO ] Deduced a trap composed of 47 places in 141 ms of which 2 ms to minimize.
[2024-06-01 14:28:12] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 1 ms to minimize.
[2024-06-01 14:28:12] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:28:12] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:28:12] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 0 ms to minimize.
[2024-06-01 14:28:12] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 0 ms to minimize.
[2024-06-01 14:28:13] [INFO ] Deduced a trap composed of 190 places in 243 ms of which 2 ms to minimize.
[2024-06-01 14:28:13] [INFO ] Deduced a trap composed of 191 places in 346 ms of which 3 ms to minimize.
[2024-06-01 14:28:14] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:28:27] [INFO ] Deduced a trap composed of 158 places in 321 ms of which 3 ms to minimize.
[2024-06-01 14:28:29] [INFO ] Deduced a trap composed of 170 places in 220 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/456 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 456/2032 variables, and 50 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/460 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/456 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:28:35] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 2 ms to minimize.
[2024-06-01 14:28:39] [INFO ] Deduced a trap composed of 234 places in 320 ms of which 3 ms to minimize.
[2024-06-01 14:28:59] [INFO ] Deduced a trap composed of 71 places in 349 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/2032 variables, and 53 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/460 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 15/15 constraints]
After SMT, in 68411ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 68426ms
Finished structural reductions in LTL mode , in 1 iterations and 126333 ms. Remains : 460/460 places, 1604/1604 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 94 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 207 steps (0 resets) in 6 ms. (29 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 84 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 740 ms.
Product exploration explored 100000 steps with 25000 reset in 567 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 460 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 460/460 places, 1604/1604 transitions.
Applied a total of 0 rules in 26 ms. Remains 460 /460 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Running 1600 sub problems to find dead transitions.
[2024-06-01 14:29:04] [INFO ] Flow matrix only has 1572 transitions (discarded 32 similar events)
[2024-06-01 14:29:04] [INFO ] Invariant cache hit.
[2024-06-01 14:29:04] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:29:23] [INFO ] Deduced a trap composed of 46 places in 165 ms of which 3 ms to minimize.
[2024-06-01 14:29:23] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 2 ms to minimize.
[2024-06-01 14:29:23] [INFO ] Deduced a trap composed of 46 places in 138 ms of which 2 ms to minimize.
[2024-06-01 14:29:23] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 1 ms to minimize.
[2024-06-01 14:29:24] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:29:24] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 1 ms to minimize.
[2024-06-01 14:29:24] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:29:24] [INFO ] Deduced a trap composed of 190 places in 419 ms of which 4 ms to minimize.
[2024-06-01 14:29:25] [INFO ] Deduced a trap composed of 191 places in 354 ms of which 3 ms to minimize.
[2024-06-01 14:29:26] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 456/2032 variables, and 48 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/460 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/456 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:29:36] [INFO ] Deduced a trap composed of 33 places in 235 ms of which 2 ms to minimize.
[2024-06-01 14:29:38] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 1 ms to minimize.
[2024-06-01 14:29:49] [INFO ] Deduced a trap composed of 158 places in 301 ms of which 3 ms to minimize.
[2024-06-01 14:29:52] [INFO ] Deduced a trap composed of 165 places in 379 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 8)
(s1 2)
(s2 0)
(s3 0)
(s4 1)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/2032 variables, and 52 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/460 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 14/14 constraints]
After SMT, in 48304ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 48322ms
[2024-06-01 14:29:53] [INFO ] Redundant transitions in 15 ms returned []
Running 1600 sub problems to find dead transitions.
[2024-06-01 14:29:53] [INFO ] Flow matrix only has 1572 transitions (discarded 32 similar events)
[2024-06-01 14:29:53] [INFO ] Invariant cache hit.
[2024-06-01 14:29:53] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:30:12] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 2 ms to minimize.
[2024-06-01 14:30:12] [INFO ] Deduced a trap composed of 47 places in 123 ms of which 2 ms to minimize.
[2024-06-01 14:30:12] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 1 ms to minimize.
[2024-06-01 14:30:12] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 1 ms to minimize.
[2024-06-01 14:30:12] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 0 ms to minimize.
[2024-06-01 14:30:12] [INFO ] Deduced a trap composed of 46 places in 28 ms of which 0 ms to minimize.
[2024-06-01 14:30:12] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:30:13] [INFO ] Deduced a trap composed of 190 places in 270 ms of which 3 ms to minimize.
[2024-06-01 14:30:13] [INFO ] Deduced a trap composed of 191 places in 237 ms of which 2 ms to minimize.
[2024-06-01 14:30:14] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:30:29] [INFO ] Deduced a trap composed of 158 places in 324 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 456/2032 variables, and 49 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/460 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/456 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:30:38] [INFO ] Deduced a trap composed of 234 places in 320 ms of which 3 ms to minimize.
[2024-06-01 14:30:51] [INFO ] Deduced a trap composed of 42 places in 226 ms of which 2 ms to minimize.
[2024-06-01 14:30:57] [INFO ] Deduced a trap composed of 50 places in 242 ms of which 2 ms to minimize.
[2024-06-01 14:31:00] [INFO ] Deduced a trap composed of 73 places in 350 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10)
(s1 0)
(s2 1)
(s3 1)
(s4 1)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)timeout

(s74 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/2032 variables, and 53 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/460 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 15/15 constraints]
After SMT, in 67722ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 67735ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 116113 ms. Remains : 460/460 places, 1604/1604 transitions.
Support contains 2 out of 460 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 460/460 places, 1604/1604 transitions.
Applied a total of 0 rules in 8 ms. Remains 460 /460 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Running 1600 sub problems to find dead transitions.
[2024-06-01 14:31:00] [INFO ] Flow matrix only has 1572 transitions (discarded 32 similar events)
[2024-06-01 14:31:00] [INFO ] Invariant cache hit.
[2024-06-01 14:31:00] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:31:19] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 1 ms to minimize.
[2024-06-01 14:31:19] [INFO ] Deduced a trap composed of 47 places in 110 ms of which 1 ms to minimize.
[2024-06-01 14:31:20] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 2 ms to minimize.
[2024-06-01 14:31:20] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:31:20] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:31:20] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:31:20] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:31:20] [INFO ] Deduced a trap composed of 190 places in 251 ms of which 2 ms to minimize.
[2024-06-01 14:31:20] [INFO ] Deduced a trap composed of 191 places in 261 ms of which 2 ms to minimize.
[2024-06-01 14:31:21] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 456/2032 variables, and 48 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/460 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/456 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:31:31] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 1 ms to minimize.
[2024-06-01 14:31:33] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 1 ms to minimize.
[2024-06-01 14:31:44] [INFO ] Deduced a trap composed of 158 places in 224 ms of which 2 ms to minimize.
[2024-06-01 14:31:47] [INFO ] Deduced a trap composed of 165 places in 267 ms of which 3 ms to minimize.
[2024-06-01 14:31:48] [INFO ] Deduced a trap composed of 79 places in 225 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/2032 variables, and 53 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20065 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/460 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 15/15 constraints]
After SMT, in 48391ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 48408ms
[2024-06-01 14:31:49] [INFO ] Flow matrix only has 1572 transitions (discarded 32 similar events)
[2024-06-01 14:31:49] [INFO ] Invariant cache hit.
[2024-06-01 14:31:49] [INFO ] Implicit Places using invariants in 405 ms returned []
[2024-06-01 14:31:49] [INFO ] Flow matrix only has 1572 transitions (discarded 32 similar events)
[2024-06-01 14:31:49] [INFO ] Invariant cache hit.
[2024-06-01 14:31:50] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 14:31:58] [INFO ] Implicit Places using invariants and state equation in 8756 ms returned []
Implicit Place search using SMT with State Equation took 9163 ms to find 0 implicit places.
Running 1600 sub problems to find dead transitions.
[2024-06-01 14:31:58] [INFO ] Flow matrix only has 1572 transitions (discarded 32 similar events)
[2024-06-01 14:31:58] [INFO ] Invariant cache hit.
[2024-06-01 14:31:58] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:32:16] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 1 ms to minimize.
[2024-06-01 14:32:16] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 2 ms to minimize.
[2024-06-01 14:32:16] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 1 ms to minimize.
[2024-06-01 14:32:16] [INFO ] Deduced a trap composed of 46 places in 229 ms of which 1 ms to minimize.
[2024-06-01 14:32:16] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:32:16] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:32:16] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 0 ms to minimize.
[2024-06-01 14:32:17] [INFO ] Deduced a trap composed of 190 places in 380 ms of which 2 ms to minimize.
[2024-06-01 14:32:17] [INFO ] Deduced a trap composed of 191 places in 405 ms of which 3 ms to minimize.
[2024-06-01 14:32:18] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:32:34] [INFO ] Deduced a trap composed of 158 places in 321 ms of which 4 ms to minimize.
[2024-06-01 14:32:35] [INFO ] Deduced a trap composed of 170 places in 334 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 456/2032 variables, and 50 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/460 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/456 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:32:39] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 2 ms to minimize.
[2024-06-01 14:32:44] [INFO ] Deduced a trap composed of 234 places in 349 ms of which 3 ms to minimize.
[2024-06-01 14:33:06] [INFO ] Deduced a trap composed of 71 places in 343 ms of which 3 ms to minimize.
SMT process timed out in 67715ms, After SMT, problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 67731ms
Finished structural reductions in LTL mode , in 1 iterations and 125316 ms. Remains : 460/460 places, 1604/1604 transitions.
Treatment of property PolyORBLF-COL-S04J04T08-LTLCardinality-02 finished in 498112 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(((p1||F(G(p0))) U (p0&&(p1||F(G(p0))))))))))'
Found a Lengthening insensitive property : PolyORBLF-COL-S04J04T08-LTLCardinality-03
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 32 out of 700 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 700/700 places, 1844/1844 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 700 transition count 1780
Reduce places removed 64 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 72 rules applied. Total rules applied 136 place count 636 transition count 1772
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 144 place count 628 transition count 1772
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 144 place count 628 transition count 1692
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 304 place count 548 transition count 1692
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 312 place count 540 transition count 1684
Iterating global reduction 3 with 8 rules applied. Total rules applied 320 place count 540 transition count 1684
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 464 place count 468 transition count 1612
Applied a total of 464 rules in 92 ms. Remains 468 /700 variables (removed 232) and now considering 1612/1844 (removed 232) transitions.
Running 1608 sub problems to find dead transitions.
[2024-06-01 14:33:06] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
// Phase 1: matrix 1580 rows 468 cols
[2024-06-01 14:33:06] [INFO ] Computed 42 invariants in 25 ms
[2024-06-01 14:33:06] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-06-01 14:33:25] [INFO ] Deduced a trap composed of 47 places in 146 ms of which 2 ms to minimize.
[2024-06-01 14:33:25] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 2 ms to minimize.
[2024-06-01 14:33:25] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 1 ms to minimize.
[2024-06-01 14:33:25] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:33:25] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 0 ms to minimize.
[2024-06-01 14:33:25] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 0 ms to minimize.
[2024-06-01 14:33:25] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 0 ms to minimize.
[2024-06-01 14:33:26] [INFO ] Deduced a trap composed of 198 places in 268 ms of which 3 ms to minimize.
[2024-06-01 14:33:26] [INFO ] Deduced a trap composed of 199 places in 266 ms of which 4 ms to minimize.
[2024-06-01 14:33:26] [INFO ] Deduced a trap composed of 205 places in 279 ms of which 2 ms to minimize.
[2024-06-01 14:33:26] [INFO ] Deduced a trap composed of 262 places in 259 ms of which 2 ms to minimize.
[2024-06-01 14:33:27] [INFO ] Deduced a trap composed of 218 places in 311 ms of which 3 ms to minimize.
[2024-06-01 14:33:27] [INFO ] Deduced a trap composed of 206 places in 289 ms of which 2 ms to minimize.
[2024-06-01 14:33:28] [INFO ] Deduced a trap composed of 222 places in 369 ms of which 4 ms to minimize.
[2024-06-01 14:33:28] [INFO ] Deduced a trap composed of 215 places in 316 ms of which 3 ms to minimize.
[2024-06-01 14:33:28] [INFO ] Deduced a trap composed of 196 places in 319 ms of which 3 ms to minimize.
[2024-06-01 14:33:30] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:33:30] [INFO ] Deduced a trap composed of 79 places in 313 ms of which 2 ms to minimize.
[2024-06-01 14:33:32] [INFO ] Deduced a trap composed of 176 places in 235 ms of which 2 ms to minimize.
[2024-06-01 14:33:33] [INFO ] Deduced a trap composed of 183 places in 362 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/2048 variables, and 58 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-06-01 14:33:46] [INFO ] Deduced a trap composed of 33 places in 220 ms of which 2 ms to minimize.
[2024-06-01 14:33:51] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/2048 variables, and 60 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1608 constraints, Known Traps: 22/22 constraints]
After SMT, in 48123ms problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 48152ms
[2024-06-01 14:33:54] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-06-01 14:33:54] [INFO ] Invariant cache hit.
[2024-06-01 14:33:55] [INFO ] Implicit Places using invariants in 484 ms returned []
[2024-06-01 14:33:55] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-06-01 14:33:55] [INFO ] Invariant cache hit.
[2024-06-01 14:33:55] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 14:34:03] [INFO ] Implicit Places using invariants and state equation in 8144 ms returned []
Implicit Place search using SMT with State Equation took 8646 ms to find 0 implicit places.
Running 1608 sub problems to find dead transitions.
[2024-06-01 14:34:03] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-06-01 14:34:03] [INFO ] Invariant cache hit.
[2024-06-01 14:34:03] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-06-01 14:34:23] [INFO ] Deduced a trap composed of 47 places in 136 ms of which 3 ms to minimize.
[2024-06-01 14:34:23] [INFO ] Deduced a trap composed of 47 places in 119 ms of which 2 ms to minimize.
[2024-06-01 14:34:23] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 1 ms to minimize.
[2024-06-01 14:34:23] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:34:24] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:34:24] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:34:24] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 0 ms to minimize.
[2024-06-01 14:34:24] [INFO ] Deduced a trap composed of 199 places in 244 ms of which 2 ms to minimize.
[2024-06-01 14:34:24] [INFO ] Deduced a trap composed of 195 places in 253 ms of which 3 ms to minimize.
[2024-06-01 14:34:25] [INFO ] Deduced a trap composed of 198 places in 237 ms of which 2 ms to minimize.
[2024-06-01 14:34:26] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 0 ms to minimize.
[2024-06-01 14:34:40] [INFO ] Deduced a trap composed of 159 places in 325 ms of which 3 ms to minimize.
[2024-06-01 14:34:41] [INFO ] Deduced a trap composed of 154 places in 301 ms of which 3 ms to minimize.
[2024-06-01 14:34:42] [INFO ] Deduced a trap composed of 42 places in 357 ms of which 4 ms to minimize.
SMT process timed out in 39572ms, After SMT, problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 39601ms
Starting structural reductions in LI_LTL mode, iteration 1 : 468/700 places, 1612/1844 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 96501 ms. Remains : 468/700 places, 1612/1844 transitions.
Running random walk in product with property : PolyORBLF-COL-S04J04T08-LTLCardinality-03
Product exploration explored 100000 steps with 880 reset in 506 ms.
Product exploration explored 100000 steps with 881 reset in 468 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 p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 117 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 506 steps (0 resets) in 21 ms. (23 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 153 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 32 out of 468 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 468/468 places, 1612/1612 transitions.
Applied a total of 0 rules in 14 ms. Remains 468 /468 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
Running 1608 sub problems to find dead transitions.
[2024-06-01 14:34:44] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-06-01 14:34:44] [INFO ] Invariant cache hit.
[2024-06-01 14:34:44] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-06-01 14:35:05] [INFO ] Deduced a trap composed of 47 places in 146 ms of which 2 ms to minimize.
[2024-06-01 14:35:05] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 1 ms to minimize.
[2024-06-01 14:35:05] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 2 ms to minimize.
[2024-06-01 14:35:05] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 1 ms to minimize.
[2024-06-01 14:35:05] [INFO ] Deduced a trap composed of 47 places in 36 ms of which 0 ms to minimize.
[2024-06-01 14:35:05] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:35:05] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 0 ms to minimize.
[2024-06-01 14:35:06] [INFO ] Deduced a trap composed of 199 places in 304 ms of which 3 ms to minimize.
[2024-06-01 14:35:06] [INFO ] Deduced a trap composed of 195 places in 315 ms of which 2 ms to minimize.
[2024-06-01 14:35:07] [INFO ] Deduced a trap composed of 198 places in 382 ms of which 3 ms to minimize.
[2024-06-01 14:35:08] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/2048 variables, and 49 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-06-01 14:35:28] [INFO ] Deduced a trap composed of 178 places in 352 ms of which 3 ms to minimize.
[2024-06-01 14:35:32] [INFO ] Deduced a trap composed of 42 places in 210 ms of which 3 ms to minimize.
[2024-06-01 14:35:32] [INFO ] Deduced a trap composed of 41 places in 200 ms of which 3 ms to minimize.
[2024-06-01 14:35:34] [INFO ] Deduced a trap composed of 33 places in 352 ms of which 4 ms to minimize.
SMT process timed out in 49248ms, After SMT, problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 49276ms
[2024-06-01 14:35:34] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-06-01 14:35:34] [INFO ] Invariant cache hit.
[2024-06-01 14:35:34] [INFO ] Implicit Places using invariants in 416 ms returned []
[2024-06-01 14:35:34] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-06-01 14:35:34] [INFO ] Invariant cache hit.
[2024-06-01 14:35:34] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 14:35:42] [INFO ] Implicit Places using invariants and state equation in 7986 ms returned []
Implicit Place search using SMT with State Equation took 8404 ms to find 0 implicit places.
Running 1608 sub problems to find dead transitions.
[2024-06-01 14:35:42] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-06-01 14:35:42] [INFO ] Invariant cache hit.
[2024-06-01 14:35:42] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-06-01 14:36:04] [INFO ] Deduced a trap composed of 47 places in 124 ms of which 2 ms to minimize.
[2024-06-01 14:36:04] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 1 ms to minimize.
[2024-06-01 14:36:04] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 1 ms to minimize.
[2024-06-01 14:36:04] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:36:04] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:36:04] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 0 ms to minimize.
[2024-06-01 14:36:04] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 0 ms to minimize.
[2024-06-01 14:36:05] [INFO ] Deduced a trap composed of 199 places in 219 ms of which 3 ms to minimize.
[2024-06-01 14:36:05] [INFO ] Deduced a trap composed of 195 places in 230 ms of which 2 ms to minimize.
[2024-06-01 14:36:05] [INFO ] Deduced a trap composed of 198 places in 244 ms of which 2 ms to minimize.
[2024-06-01 14:36:06] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:36:19] [INFO ] Deduced a trap composed of 159 places in 263 ms of which 3 ms to minimize.
[2024-06-01 14:36:20] [INFO ] Deduced a trap composed of 154 places in 272 ms of which 3 ms to minimize.
[2024-06-01 14:36:21] [INFO ] Deduced a trap composed of 42 places in 278 ms of which 3 ms to minimize.
SMT process timed out in 38961ms, After SMT, problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 38984ms
Finished structural reductions in LTL mode , in 1 iterations and 96687 ms. Remains : 468/468 places, 1612/1612 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 p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 73 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1138 steps (0 resets) in 11 ms. (94 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 129 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 903 reset in 512 ms.
Product exploration explored 100000 steps with 852 reset in 402 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 32 out of 468 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 468/468 places, 1612/1612 transitions.
Applied a total of 0 rules in 27 ms. Remains 468 /468 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
Running 1608 sub problems to find dead transitions.
[2024-06-01 14:36:23] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-06-01 14:36:23] [INFO ] Invariant cache hit.
[2024-06-01 14:36:23] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-06-01 14:36:41] [INFO ] Deduced a trap composed of 47 places in 161 ms of which 2 ms to minimize.
[2024-06-01 14:36:41] [INFO ] Deduced a trap composed of 47 places in 110 ms of which 1 ms to minimize.
[2024-06-01 14:36:41] [INFO ] Deduced a trap composed of 47 places in 96 ms of which 2 ms to minimize.
[2024-06-01 14:36:41] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:36:41] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:36:41] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:36:42] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 0 ms to minimize.
[2024-06-01 14:36:42] [INFO ] Deduced a trap composed of 199 places in 314 ms of which 3 ms to minimize.
[2024-06-01 14:36:42] [INFO ] Deduced a trap composed of 195 places in 335 ms of which 3 ms to minimize.
[2024-06-01 14:36:43] [INFO ] Deduced a trap composed of 198 places in 296 ms of which 2 ms to minimize.
[2024-06-01 14:36:44] [INFO ] Deduced a trap composed of 47 places in 30 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/2048 variables, and 49 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-06-01 14:37:08] [INFO ] Deduced a trap composed of 178 places in 226 ms of which 4 ms to minimize.
[2024-06-01 14:37:11] [INFO ] Deduced a trap composed of 42 places in 261 ms of which 2 ms to minimize.
SMT process timed out in 48252ms, After SMT, problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 48271ms
[2024-06-01 14:37:11] [INFO ] Redundant transitions in 24 ms returned []
Running 1608 sub problems to find dead transitions.
[2024-06-01 14:37:11] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-06-01 14:37:11] [INFO ] Invariant cache hit.
[2024-06-01 14:37:11] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-06-01 14:37:33] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 3 ms to minimize.
[2024-06-01 14:37:33] [INFO ] Deduced a trap composed of 47 places in 110 ms of which 2 ms to minimize.
[2024-06-01 14:37:33] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 1 ms to minimize.
[2024-06-01 14:37:33] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:37:33] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:37:33] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:37:33] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:37:34] [INFO ] Deduced a trap composed of 199 places in 288 ms of which 2 ms to minimize.
[2024-06-01 14:37:34] [INFO ] Deduced a trap composed of 195 places in 253 ms of which 3 ms to minimize.
[2024-06-01 14:37:34] [INFO ] Deduced a trap composed of 198 places in 248 ms of which 2 ms to minimize.
[2024-06-01 14:37:35] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:37:47] [INFO ] Deduced a trap composed of 159 places in 260 ms of which 3 ms to minimize.
[2024-06-01 14:37:48] [INFO ] Deduced a trap composed of 154 places in 239 ms of which 3 ms to minimize.
[2024-06-01 14:37:49] [INFO ] Deduced a trap composed of 42 places in 222 ms of which 2 ms to minimize.
[2024-06-01 14:37:49] [INFO ] Deduced a trap composed of 135 places in 310 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/2048 variables, and 53 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-06-01 14:37:56] [INFO ] Deduced a trap composed of 235 places in 245 ms of which 2 ms to minimize.
[2024-06-01 14:37:57] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2024-06-01 14:38:13] [INFO ] Deduced a trap composed of 51 places in 235 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/464 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/2048 variables, and 56 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1608 constraints, Known Traps: 18/18 constraints]
After SMT, in 69782ms problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 69803ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 118140 ms. Remains : 468/468 places, 1612/1612 transitions.
Support contains 32 out of 468 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 468/468 places, 1612/1612 transitions.
Applied a total of 0 rules in 11 ms. Remains 468 /468 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
Running 1608 sub problems to find dead transitions.
[2024-06-01 14:38:21] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-06-01 14:38:21] [INFO ] Invariant cache hit.
[2024-06-01 14:38:21] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-06-01 14:38:39] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 1 ms to minimize.
[2024-06-01 14:38:39] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 1 ms to minimize.
[2024-06-01 14:38:39] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 1 ms to minimize.
[2024-06-01 14:38:39] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:38:39] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:38:39] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:38:40] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:38:40] [INFO ] Deduced a trap composed of 199 places in 369 ms of which 4 ms to minimize.
[2024-06-01 14:38:40] [INFO ] Deduced a trap composed of 195 places in 344 ms of which 4 ms to minimize.
[2024-06-01 14:38:41] [INFO ] Deduced a trap composed of 198 places in 319 ms of which 3 ms to minimize.
[2024-06-01 14:38:42] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/2048 variables, and 49 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-06-01 14:39:08] [INFO ] Deduced a trap composed of 178 places in 237 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/2048 variables, and 50 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1608 constraints, Known Traps: 12/12 constraints]
After SMT, in 48013ms problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 48033ms
[2024-06-01 14:39:09] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-06-01 14:39:09] [INFO ] Invariant cache hit.
[2024-06-01 14:39:10] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-06-01 14:39:10] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-06-01 14:39:10] [INFO ] Invariant cache hit.
[2024-06-01 14:39:10] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 14:39:17] [INFO ] Implicit Places using invariants and state equation in 7951 ms returned []
Implicit Place search using SMT with State Equation took 8341 ms to find 0 implicit places.
Running 1608 sub problems to find dead transitions.
[2024-06-01 14:39:18] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2024-06-01 14:39:18] [INFO ] Invariant cache hit.
[2024-06-01 14:39:18] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-06-01 14:39:36] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 2 ms to minimize.
[2024-06-01 14:39:37] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 2 ms to minimize.
[2024-06-01 14:39:37] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 1 ms to minimize.
[2024-06-01 14:39:37] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:39:37] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:39:37] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 0 ms to minimize.
[2024-06-01 14:39:37] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 0 ms to minimize.
[2024-06-01 14:39:37] [INFO ] Deduced a trap composed of 199 places in 228 ms of which 3 ms to minimize.
[2024-06-01 14:39:38] [INFO ] Deduced a trap composed of 195 places in 229 ms of which 3 ms to minimize.
[2024-06-01 14:39:38] [INFO ] Deduced a trap composed of 198 places in 262 ms of which 3 ms to minimize.
[2024-06-01 14:39:39] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:39:50] [INFO ] Deduced a trap composed of 159 places in 233 ms of which 3 ms to minimize.
[2024-06-01 14:39:51] [INFO ] Deduced a trap composed of 154 places in 240 ms of which 2 ms to minimize.
[2024-06-01 14:39:52] [INFO ] Deduced a trap composed of 42 places in 231 ms of which 2 ms to minimize.
[2024-06-01 14:39:52] [INFO ] Deduced a trap composed of 135 places in 248 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/2048 variables, and 53 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-06-01 14:40:01] [INFO ] Deduced a trap composed of 235 places in 224 ms of which 2 ms to minimize.
[2024-06-01 14:40:02] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 2 ms to minimize.
[2024-06-01 14:40:16] [INFO ] Deduced a trap composed of 51 places in 192 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/464 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-06-01 14:40:25] [INFO ] Deduced a trap composed of 202 places in 282 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/2048 variables, and 57 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1608 constraints, Known Traps: 19/19 constraints]
After SMT, in 68743ms problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 68755ms
Finished structural reductions in LTL mode , in 1 iterations and 125146 ms. Remains : 468/468 places, 1612/1612 transitions.
Treatment of property PolyORBLF-COL-S04J04T08-LTLCardinality-03 finished in 440595 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((F(p0) U X(p1)))))'
[2024-06-01 14:40:27] [INFO ] Flatten gal took : 78 ms
[2024-06-01 14:40:27] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 6 ms.
[2024-06-01 14:40:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 700 places, 1844 transitions and 9348 arcs took 27 ms.
Total runtime 2878030 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA PolyORBLF-COL-S04J04T08-LTLCardinality-02 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : PolyORBLF-COL-S04J04T08-LTLCardinality-03
Could not compute solution for formula : PolyORBLF-COL-S04J04T08-LTLCardinality-05

BK_STOP 1717253287585

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name PolyORBLF-COL-S04J04T08-LTLCardinality-02
ltl formula formula --ltl=/tmp/4366/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 700 places, 1844 transitions and 9348 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4366/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.500 real 0.070 user 0.110 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4366/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4366/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4366/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 721 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 701, there are 1848 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 29
pnml2lts-mc( 0/ 4): unique states count: 29
pnml2lts-mc( 0/ 4): unique transitions count: 48
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 20
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 32
pnml2lts-mc( 0/ 4): - cum. max stack depth: 7
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 32 states 64 transitions, fanout: 2.000
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 117.8 B/state, compr.: 4.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1874 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name PolyORBLF-COL-S04J04T08-LTLCardinality-03
ltl formula formula --ltl=/tmp/4366/ltl_1_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 700 places, 1844 transitions and 9348 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.220 real 0.030 user 0.050 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4366/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4366/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4366/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4366/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 720 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 701, there are 1853 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2354 levels ~10000 states ~19104 transitions
pnml2lts-mc( 0/ 4): ~4785 levels ~20000 states ~41256 transitions
pnml2lts-mc( 0/ 4): ~9416 levels ~40000 states ~82228 transitions
pnml2lts-mc( 0/ 4): ~18654 levels ~80000 states ~173612 transitions
pnml2lts-mc( 2/ 4): ~34060 levels ~160000 states ~304112 transitions
pnml2lts-mc( 2/ 4): ~62015 levels ~320000 states ~574052 transitions
pnml2lts-mc( 0/ 4): ~145002 levels ~640000 states ~1355244 transitions
pnml2lts-mc( 0/ 4): ~285504 levels ~1280000 states ~2710644 transitions
pnml2lts-mc( 2/ 4): ~535704 levels ~2560000 states ~5293112 transitions
pnml2lts-mc( 0/ 4): ~1069577 levels ~5120000 states ~10694764 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 83668
pnml2lts-mc( 0/ 4): unique states count: 5523072
pnml2lts-mc( 0/ 4): unique transitions count: 12076435
pnml2lts-mc( 0/ 4): - self-loop count: 1591
pnml2lts-mc( 0/ 4): - claim dead count: 13781
pnml2lts-mc( 0/ 4): - claim found count: 1473926
pnml2lts-mc( 0/ 4): - claim success count: 5523087
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4754196
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 5523095 states 12076506 transitions, fanout: 2.187
pnml2lts-mc( 0/ 4): Total exploration time 262.200 sec (262.190 sec minimum, 262.198 sec on average)
pnml2lts-mc( 0/ 4): States per second: 21064, Transitions per second: 46058
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 141.8MB, 14.6 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 30.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1874 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 141.8MB (~256.0MB paged-in)
ltl formula name PolyORBLF-COL-S04J04T08-LTLCardinality-05
ltl formula formula --ltl=/tmp/4366/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 700 places, 1844 transitions and 9348 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.300 real 0.080 user 0.090 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4366/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4366/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4366/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4366/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 720 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 701, there are 1853 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~1220 levels ~10000 states ~24904 transitions
pnml2lts-mc( 0/ 4): ~2427 levels ~20000 states ~50120 transitions
pnml2lts-mc( 0/ 4): ~4819 levels ~40000 states ~99732 transitions
pnml2lts-mc( 0/ 4): ~9579 levels ~80000 states ~197100 transitions
pnml2lts-mc( 0/ 4): ~19191 levels ~160000 states ~388076 transitions
pnml2lts-mc( 0/ 4): ~37920 levels ~320000 states ~758232 transitions
pnml2lts-mc( 2/ 4): ~68161 levels ~640000 states ~1246900 transitions
pnml2lts-mc( 2/ 4): ~138486 levels ~1280000 states ~2594736 transitions
pnml2lts-mc( 3/ 4): ~270751 levels ~2560000 states ~4967112 transitions
pnml2lts-mc( 1/ 4): ~541417 levels ~5120000 states ~11669192 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2846724
pnml2lts-mc( 0/ 4): unique states count: 5548690
pnml2lts-mc( 0/ 4): unique transitions count: 12278784
pnml2lts-mc( 0/ 4): - self-loop count: 929
pnml2lts-mc( 0/ 4): - claim dead count: 605878
pnml2lts-mc( 0/ 4): - claim found count: 513067
pnml2lts-mc( 0/ 4): - claim success count: 5548709
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2401513
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 5548716 states 12279027 transitions, fanout: 2.213
pnml2lts-mc( 0/ 4): Total exploration time 195.050 sec (195.010 sec minimum, 195.023 sec on average)
pnml2lts-mc( 0/ 4): States per second: 28448, Transitions per second: 62953
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 146.2MB, 14.2 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 32.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1874 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 146.2MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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