Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r512-smll-171654407200228.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is Peterson-COL-5, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407200228
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 8.0K Apr 12 02:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 12 02:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 02:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 12 02:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 03:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 12 03:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 03:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 12 03:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 45K 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 Peterson-COL-5-LTLFireability-00
FORMULA_NAME Peterson-COL-5-LTLFireability-01
FORMULA_NAME Peterson-COL-5-LTLFireability-02
FORMULA_NAME Peterson-COL-5-LTLFireability-03
FORMULA_NAME Peterson-COL-5-LTLFireability-04
FORMULA_NAME Peterson-COL-5-LTLFireability-05
FORMULA_NAME Peterson-COL-5-LTLFireability-06
FORMULA_NAME Peterson-COL-5-LTLFireability-07
FORMULA_NAME Peterson-COL-5-LTLFireability-08
FORMULA_NAME Peterson-COL-5-LTLFireability-09
FORMULA_NAME Peterson-COL-5-LTLFireability-10
FORMULA_NAME Peterson-COL-5-LTLFireability-11
FORMULA_NAME Peterson-COL-5-LTLFireability-12
FORMULA_NAME Peterson-COL-5-LTLFireability-13
FORMULA_NAME Peterson-COL-5-LTLFireability-14
FORMULA_NAME Peterson-COL-5-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717261871044

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-5
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:11:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 17:11:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:11:13] [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 17:11:13] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 17:11:14] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1096 ms
[2024-06-01 17:11:14] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 864 PT places and 1398.0 transition bindings in 28 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 17:11:14] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 6 ms.
[2024-06-01 17:11:14] [INFO ] Skeletonized 16 HLPN properties in 9 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Peterson-COL-5-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-5-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-5-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 473 steps (0 resets) in 29 ms. (15 steps per ms) remains 0/10 properties
[2024-06-01 17:11:14] [INFO ] Flatten gal took : 21 ms
[2024-06-01 17:11:14] [INFO ] Flatten gal took : 4 ms
Domain [Process(6), Tour(5), Process(6)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 5)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-06-01 17:11:14] [INFO ] Unfolded HLPN to a Petri net with 864 places and 1302 transitions 4068 arcs in 107 ms.
[2024-06-01 17:11:14] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 30 places in 14 ms
Reduce places removed 30 places and 60 transitions.
FORMULA Peterson-COL-5-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 834 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 33 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-06-01 17:11:15] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2024-06-01 17:11:15] [INFO ] Computed 23 invariants in 47 ms
[2024-06-01 17:11:15] [INFO ] Implicit Places using invariants in 482 ms returned []
[2024-06-01 17:11:15] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-06-01 17:11:15] [INFO ] Invariant cache hit.
[2024-06-01 17:11:16] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 17:11:16] [INFO ] Implicit Places using invariants and state equation in 1001 ms returned []
Implicit Place search using SMT with State Equation took 1526 ms to find 0 implicit places.
Running 1236 sub problems to find dead transitions.
[2024-06-01 17:11:16] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-06-01 17:11:16] [INFO ] Invariant cache hit.
[2024-06-01 17:11:16] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 828/1956 variables, and 17 constraints, problems are : Problem set: 0 solved, 1236 unsolved in 30087 ms.
Refiners :[Positive P Invariants (semi-flows): 11/17 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/834 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 1236/1236 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
[2024-06-01 17:11:51] [INFO ] Deduced a trap composed of 30 places in 855 ms of which 73 ms to minimize.
[2024-06-01 17:11:51] [INFO ] Deduced a trap composed of 18 places in 573 ms of which 9 ms to minimize.
[2024-06-01 17:11:52] [INFO ] Deduced a trap composed of 41 places in 546 ms of which 8 ms to minimize.
[2024-06-01 17:11:52] [INFO ] Deduced a trap composed of 127 places in 553 ms of which 7 ms to minimize.
[2024-06-01 17:11:53] [INFO ] Deduced a trap composed of 43 places in 904 ms of which 11 ms to minimize.
[2024-06-01 17:11:54] [INFO ] Deduced a trap composed of 106 places in 736 ms of which 7 ms to minimize.
[2024-06-01 17:11:55] [INFO ] Deduced a trap composed of 57 places in 501 ms of which 7 ms to minimize.
[2024-06-01 17:11:55] [INFO ] Deduced a trap composed of 51 places in 511 ms of which 7 ms to minimize.
[2024-06-01 17:11:55] [INFO ] Deduced a trap composed of 27 places in 389 ms of which 6 ms to minimize.
[2024-06-01 17:11:56] [INFO ] Deduced a trap composed of 92 places in 574 ms of which 11 ms to minimize.
[2024-06-01 17:11:57] [INFO ] Deduced a trap composed of 115 places in 782 ms of which 11 ms to minimize.
[2024-06-01 17:11:58] [INFO ] Deduced a trap composed of 26 places in 670 ms of which 7 ms to minimize.
[2024-06-01 17:11:58] [INFO ] Deduced a trap composed of 51 places in 461 ms of which 6 ms to minimize.
[2024-06-01 17:11:59] [INFO ] Deduced a trap composed of 38 places in 554 ms of which 10 ms to minimize.
[2024-06-01 17:12:00] [INFO ] Deduced a trap composed of 35 places in 803 ms of which 11 ms to minimize.
[2024-06-01 17:12:00] [INFO ] Deduced a trap composed of 123 places in 587 ms of which 11 ms to minimize.
[2024-06-01 17:12:01] [INFO ] Deduced a trap composed of 97 places in 719 ms of which 11 ms to minimize.
[2024-06-01 17:12:02] [INFO ] Deduced a trap composed of 60 places in 670 ms of which 8 ms to minimize.
[2024-06-01 17:12:02] [INFO ] Deduced a trap composed of 30 places in 457 ms of which 6 ms to minimize.
[2024-06-01 17:12:03] [INFO ] Deduced a trap composed of 82 places in 496 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
[2024-06-01 17:12:04] [INFO ] Deduced a trap composed of 48 places in 490 ms of which 7 ms to minimize.
[2024-06-01 17:12:04] [INFO ] Deduced a trap composed of 64 places in 494 ms of which 7 ms to minimize.
[2024-06-01 17:12:05] [INFO ] Deduced a trap composed of 14 places in 265 ms of which 5 ms to minimize.
[2024-06-01 17:12:06] [INFO ] Deduced a trap composed of 103 places in 845 ms of which 10 ms to minimize.
[2024-06-01 17:12:07] [INFO ] Deduced a trap composed of 63 places in 900 ms of which 11 ms to minimize.
[2024-06-01 17:12:08] [INFO ] Deduced a trap composed of 76 places in 848 ms of which 11 ms to minimize.
[2024-06-01 17:12:09] [INFO ] Deduced a trap composed of 100 places in 849 ms of which 11 ms to minimize.
[2024-06-01 17:12:09] [INFO ] Deduced a trap composed of 141 places in 813 ms of which 11 ms to minimize.
[2024-06-01 17:12:10] [INFO ] Deduced a trap composed of 18 places in 702 ms of which 9 ms to minimize.
[2024-06-01 17:12:11] [INFO ] Deduced a trap composed of 22 places in 570 ms of which 6 ms to minimize.
[2024-06-01 17:12:11] [INFO ] Deduced a trap composed of 26 places in 564 ms of which 9 ms to minimize.
[2024-06-01 17:12:12] [INFO ] Deduced a trap composed of 40 places in 543 ms of which 7 ms to minimize.
[2024-06-01 17:12:13] [INFO ] Deduced a trap composed of 56 places in 528 ms of which 6 ms to minimize.
[2024-06-01 17:12:13] [INFO ] Deduced a trap composed of 52 places in 450 ms of which 5 ms to minimize.
[2024-06-01 17:12:14] [INFO ] Deduced a trap composed of 26 places in 726 ms of which 13 ms to minimize.
[2024-06-01 17:12:15] [INFO ] Deduced a trap composed of 30 places in 715 ms of which 10 ms to minimize.
[2024-06-01 17:12:16] [INFO ] Deduced a trap composed of 30 places in 750 ms of which 10 ms to minimize.
[2024-06-01 17:12:17] [INFO ] Deduced a trap composed of 50 places in 755 ms of which 10 ms to minimize.
[2024-06-01 17:12:18] [INFO ] Deduced a trap composed of 72 places in 795 ms of which 10 ms to minimize.
SMT process timed out in 61351ms, After SMT, problems are : Problem set: 0 solved, 1236 unsolved
Search for dead transitions found 0 dead transitions in 61425ms
Finished structural reductions in LTL mode , in 1 iterations and 63017 ms. Remains : 834/834 places, 1242/1242 transitions.
Support contains 834 out of 834 places after structural reductions.
[2024-06-01 17:12:18] [INFO ] Flatten gal took : 229 ms
[2024-06-01 17:12:18] [INFO ] Flatten gal took : 254 ms
[2024-06-01 17:12:19] [INFO ] Input system was already deterministic with 1242 transitions.
Reduction of identical properties reduced properties to check from 18 to 14
RANDOM walk for 40000 steps (8 resets) in 1338 ms. (29 steps per ms) remains 1/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 479 ms. (83 steps per ms) remains 1/1 properties
[2024-06-01 17:12:19] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-06-01 17:12:19] [INFO ] Invariant cache hit.
[2024-06-01 17:12:19] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 768/798 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/798 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/804 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/804 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1122/1926 variables, 804/822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1926 variables, 205/1027 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1926 variables, 0/1027 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/1956 variables, 30/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1956 variables, 5/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1956 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1956 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1956/1956 variables, and 1062 constraints, problems are : Problem set: 0 solved, 1 unsolved in 763 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 834/834 constraints, ReadFeed: 205/205 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/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 768/798 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/798 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/804 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/804 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1122/1926 variables, 804/822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1926 variables, 205/1027 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1926 variables, 1/1028 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1926 variables, 0/1028 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 30/1956 variables, 30/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1956 variables, 5/1063 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:12:22] [INFO ] Deduced a trap composed of 24 places in 620 ms of which 6 ms to minimize.
[2024-06-01 17:12:22] [INFO ] Deduced a trap composed of 22 places in 639 ms of which 7 ms to minimize.
[2024-06-01 17:12:23] [INFO ] Deduced a trap composed of 180 places in 802 ms of which 11 ms to minimize.
[2024-06-01 17:12:24] [INFO ] Deduced a trap composed of 45 places in 763 ms of which 10 ms to minimize.
[2024-06-01 17:12:25] [INFO ] Deduced a trap composed of 48 places in 663 ms of which 10 ms to minimize.
[2024-06-01 17:12:26] [INFO ] Deduced a trap composed of 11 places in 894 ms of which 11 ms to minimize.
SMT process timed out in 6482ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 834 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 834 transition count 892
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 484 transition count 892
Performed 185 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 185 Pre rules applied. Total rules applied 700 place count 484 transition count 707
Deduced a syphon composed of 185 places in 2 ms
Reduce places removed 185 places and 0 transitions.
Iterating global reduction 2 with 370 rules applied. Total rules applied 1070 place count 299 transition count 707
Applied a total of 1070 rules in 225 ms. Remains 299 /834 variables (removed 535) and now considering 707/1242 (removed 535) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 226 ms. Remains : 299/834 places, 707/1242 transitions.
RANDOM walk for 40000 steps (8 resets) in 528 ms. (75 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 295 ms. (135 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 61 steps, run visited all 1 properties in 8 ms. (steps per millisecond=7 )
Probabilistic random walk after 61 steps, saw 55 distinct states, run finished after 16 ms. (steps per millisecond=3 ) properties seen :1
FORMULA Peterson-COL-5-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (X(G(p0)) U p1)))'
Support contains 240 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 206 rules applied. Total rules applied 206 place count 834 transition count 1036
Reduce places removed 206 places and 0 transitions.
Iterating post reduction 1 with 206 rules applied. Total rules applied 412 place count 628 transition count 1036
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 412 place count 628 transition count 876
Deduced a syphon composed of 160 places in 2 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 732 place count 468 transition count 876
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 744 place count 462 transition count 870
Applied a total of 744 rules in 145 ms. Remains 462 /834 variables (removed 372) and now considering 870/1242 (removed 372) transitions.
[2024-06-01 17:12:27] [INFO ] Flow matrix only has 750 transitions (discarded 120 similar events)
// Phase 1: matrix 750 rows 462 cols
[2024-06-01 17:12:27] [INFO ] Computed 23 invariants in 9 ms
[2024-06-01 17:12:27] [INFO ] Implicit Places using invariants in 284 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 290 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 456/834 places, 870/1242 transitions.
Applied a total of 0 rules in 40 ms. Remains 456 /456 variables (removed 0) and now considering 870/870 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 477 ms. Remains : 456/834 places, 870/1242 transitions.
Stuttering acceptance computed with spot in 337 ms :[(NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-5-LTLFireability-00
Product exploration explored 100000 steps with 11522 reset in 1256 ms.
Stack based approach found an accepted trace after 1273 steps with 153 reset with depth 10 and stack size 10 in 17 ms.
FORMULA Peterson-COL-5-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLFireability-00 finished in 2179 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)))'
Support contains 24 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 356 transitions
Trivial Post-agglo rules discarded 356 transitions
Performed 356 trivial Post agglomeration. Transition count delta: 356
Iterating post reduction 0 with 356 rules applied. Total rules applied 356 place count 834 transition count 886
Reduce places removed 356 places and 0 transitions.
Iterating post reduction 1 with 356 rules applied. Total rules applied 712 place count 478 transition count 886
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 712 place count 478 transition count 726
Deduced a syphon composed of 160 places in 1 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 1032 place count 318 transition count 726
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1044 place count 312 transition count 720
Applied a total of 1044 rules in 61 ms. Remains 312 /834 variables (removed 522) and now considering 720/1242 (removed 522) transitions.
[2024-06-01 17:12:29] [INFO ] Flow matrix only has 600 transitions (discarded 120 similar events)
// Phase 1: matrix 600 rows 312 cols
[2024-06-01 17:12:29] [INFO ] Computed 23 invariants in 10 ms
[2024-06-01 17:12:29] [INFO ] Implicit Places using invariants in 493 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 496 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 306/834 places, 720/1242 transitions.
Applied a total of 0 rules in 27 ms. Remains 306 /306 variables (removed 0) and now considering 720/720 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 585 ms. Remains : 306/834 places, 720/1242 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-5-LTLFireability-01
Product exploration explored 100000 steps with 8492 reset in 643 ms.
Stack based approach found an accepted trace after 229 steps with 19 reset with depth 5 and stack size 5 in 2 ms.
FORMULA Peterson-COL-5-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLFireability-01 finished in 1348 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(F(((F(!p0) U p1)&&X(G(!p1)))))))'
Support contains 180 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 18 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-06-01 17:12:30] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2024-06-01 17:12:30] [INFO ] Computed 23 invariants in 12 ms
[2024-06-01 17:12:31] [INFO ] Implicit Places using invariants in 571 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 573 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 16 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 607 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 319 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Running random walk in product with property : Peterson-COL-5-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 593 ms.
Product exploration explored 100000 steps with 1 reset in 893 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 364 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
RANDOM walk for 40000 steps (8 resets) in 963 ms. (41 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 534 ms. (74 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1140 ms. (35 steps per ms) remains 2/2 properties
[2024-06-01 17:12:34] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2024-06-01 17:12:34] [INFO ] Computed 17 invariants in 5 ms
[2024-06-01 17:12:34] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 612/792 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/792 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/798 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/798 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1122/1920 variables, 798/810 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1920 variables, 205/1015 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1920 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 30/1950 variables, 30/1045 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1950 variables, 5/1050 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1950 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1950 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1950/1950 variables, and 1050 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1175 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 828/828 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 612/792 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 17:12:36] [INFO ] Deduced a trap composed of 79 places in 619 ms of which 10 ms to minimize.
[2024-06-01 17:12:37] [INFO ] Deduced a trap composed of 119 places in 592 ms of which 8 ms to minimize.
[2024-06-01 17:12:37] [INFO ] Deduced a trap composed of 207 places in 427 ms of which 6 ms to minimize.
[2024-06-01 17:12:37] [INFO ] Deduced a trap composed of 138 places in 245 ms of which 5 ms to minimize.
[2024-06-01 17:12:38] [INFO ] Deduced a trap composed of 159 places in 426 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/792 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 17:12:38] [INFO ] Deduced a trap composed of 179 places in 415 ms of which 8 ms to minimize.
[2024-06-01 17:12:39] [INFO ] Deduced a trap composed of 139 places in 601 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/792 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/792 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/798 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 17:12:40] [INFO ] Deduced a trap composed of 146 places in 370 ms of which 6 ms to minimize.
[2024-06-01 17:12:40] [INFO ] Deduced a trap composed of 144 places in 411 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/798 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 17:12:41] [INFO ] Deduced a trap composed of 207 places in 689 ms of which 9 ms to minimize.
SMT process timed out in 6935ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 180 out of 828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 828 transition count 1167
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 150 place count 753 transition count 1167
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 150 place count 753 transition count 1007
Deduced a syphon composed of 160 places in 1 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 470 place count 593 transition count 1007
Applied a total of 470 rules in 91 ms. Remains 593 /828 variables (removed 235) and now considering 1007/1242 (removed 235) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 593/828 places, 1007/1242 transitions.
RANDOM walk for 40000 steps (8 resets) in 775 ms. (51 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 379 ms. (105 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 419965 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :1 out of 2
Probabilistic random walk after 419965 steps, saw 141174 distinct states, run finished after 3013 ms. (steps per millisecond=139 ) properties seen :1
[2024-06-01 17:12:44] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
// Phase 1: matrix 887 rows 593 cols
[2024-06-01 17:12:44] [INFO ] Computed 17 invariants in 4 ms
[2024-06-01 17:12:45] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/563 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 887/1450 variables, 563/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1450 variables, 205/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1450 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/1480 variables, 30/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1480 variables, 5/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1480/1480 variables, and 815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 805 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 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/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:12:46] [INFO ] Deduced a trap composed of 114 places in 257 ms of which 5 ms to minimize.
[2024-06-01 17:12:46] [INFO ] Deduced a trap composed of 94 places in 158 ms of which 3 ms to minimize.
[2024-06-01 17:12:46] [INFO ] Deduced a trap composed of 156 places in 177 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:12:47] [INFO ] Deduced a trap composed of 103 places in 392 ms of which 6 ms to minimize.
[2024-06-01 17:12:47] [INFO ] Deduced a trap composed of 144 places in 287 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/563 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 887/1450 variables, 563/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1450 variables, 205/785 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1450 variables, 1/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1450 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 30/1480 variables, 30/816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1480 variables, 5/821 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:12:49] [INFO ] Deduced a trap composed of 16 places in 541 ms of which 8 ms to minimize.
[2024-06-01 17:12:50] [INFO ] Deduced a trap composed of 32 places in 572 ms of which 8 ms to minimize.
[2024-06-01 17:12:51] [INFO ] Deduced a trap composed of 20 places in 577 ms of which 8 ms to minimize.
[2024-06-01 17:12:51] [INFO ] Deduced a trap composed of 13 places in 579 ms of which 8 ms to minimize.
[2024-06-01 17:12:52] [INFO ] Deduced a trap composed of 60 places in 503 ms of which 7 ms to minimize.
[2024-06-01 17:12:53] [INFO ] Deduced a trap composed of 55 places in 571 ms of which 8 ms to minimize.
[2024-06-01 17:12:54] [INFO ] Deduced a trap composed of 55 places in 518 ms of which 8 ms to minimize.
[2024-06-01 17:12:54] [INFO ] Deduced a trap composed of 17 places in 531 ms of which 8 ms to minimize.
[2024-06-01 17:12:55] [INFO ] Deduced a trap composed of 47 places in 414 ms of which 6 ms to minimize.
[2024-06-01 17:12:55] [INFO ] Deduced a trap composed of 50 places in 440 ms of which 6 ms to minimize.
[2024-06-01 17:12:56] [INFO ] Deduced a trap composed of 126 places in 446 ms of which 7 ms to minimize.
[2024-06-01 17:12:57] [INFO ] Deduced a trap composed of 24 places in 447 ms of which 7 ms to minimize.
[2024-06-01 17:12:57] [INFO ] Deduced a trap composed of 66 places in 406 ms of which 6 ms to minimize.
[2024-06-01 17:12:58] [INFO ] Deduced a trap composed of 19 places in 523 ms of which 9 ms to minimize.
[2024-06-01 17:12:59] [INFO ] Deduced a trap composed of 41 places in 611 ms of which 8 ms to minimize.
[2024-06-01 17:13:00] [INFO ] Deduced a trap composed of 38 places in 613 ms of which 9 ms to minimize.
[2024-06-01 17:13:00] [INFO ] Deduced a trap composed of 42 places in 668 ms of which 9 ms to minimize.
[2024-06-01 17:13:01] [INFO ] Deduced a trap composed of 127 places in 428 ms of which 6 ms to minimize.
[2024-06-01 17:13:02] [INFO ] Deduced a trap composed of 80 places in 407 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1480 variables, 19/840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:13:03] [INFO ] Deduced a trap composed of 67 places in 475 ms of which 7 ms to minimize.
[2024-06-01 17:13:03] [INFO ] Deduced a trap composed of 33 places in 424 ms of which 7 ms to minimize.
[2024-06-01 17:13:04] [INFO ] Deduced a trap composed of 34 places in 484 ms of which 7 ms to minimize.
[2024-06-01 17:13:05] [INFO ] Deduced a trap composed of 16 places in 551 ms of which 7 ms to minimize.
[2024-06-01 17:13:05] [INFO ] Deduced a trap composed of 16 places in 515 ms of which 7 ms to minimize.
[2024-06-01 17:13:06] [INFO ] Deduced a trap composed of 90 places in 492 ms of which 7 ms to minimize.
[2024-06-01 17:13:07] [INFO ] Deduced a trap composed of 79 places in 396 ms of which 7 ms to minimize.
[2024-06-01 17:13:08] [INFO ] Deduced a trap composed of 35 places in 524 ms of which 7 ms to minimize.
[2024-06-01 17:13:08] [INFO ] Deduced a trap composed of 82 places in 389 ms of which 6 ms to minimize.
[2024-06-01 17:13:09] [INFO ] Deduced a trap composed of 88 places in 408 ms of which 6 ms to minimize.
[2024-06-01 17:13:10] [INFO ] Deduced a trap composed of 97 places in 467 ms of which 7 ms to minimize.
[2024-06-01 17:13:10] [INFO ] Deduced a trap composed of 83 places in 441 ms of which 7 ms to minimize.
[2024-06-01 17:13:11] [INFO ] Deduced a trap composed of 57 places in 435 ms of which 7 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1480 variables, 13/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1480 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1480 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1480/1480 variables, and 853 constraints, problems are : Problem set: 0 solved, 1 unsolved in 27504 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 37/37 constraints]
After SMT, in 28379ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 141 ms.
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 31 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 593/593 places, 1007/1007 transitions.
RANDOM walk for 40000 steps (8 resets) in 321 ms. (124 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 354 ms. (112 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 440762 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :0 out of 1
Probabilistic random walk after 440762 steps, saw 144329 distinct states, run finished after 3001 ms. (steps per millisecond=146 ) properties seen :0
[2024-06-01 17:13:16] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-06-01 17:13:16] [INFO ] Invariant cache hit.
[2024-06-01 17:13:16] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/563 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 887/1450 variables, 563/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1450 variables, 205/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1450 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/1480 variables, 30/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1480 variables, 5/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1480/1480 variables, and 815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 913 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 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/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:13:18] [INFO ] Deduced a trap composed of 84 places in 379 ms of which 6 ms to minimize.
[2024-06-01 17:13:18] [INFO ] Deduced a trap composed of 121 places in 158 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 6/563 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:13:18] [INFO ] Deduced a trap composed of 54 places in 372 ms of which 6 ms to minimize.
[2024-06-01 17:13:19] [INFO ] Deduced a trap composed of 106 places in 159 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:13:19] [INFO ] Deduced a trap composed of 89 places in 237 ms of which 3 ms to minimize.
[2024-06-01 17:13:19] [INFO ] Deduced a trap composed of 105 places in 144 ms of which 3 ms to minimize.
[2024-06-01 17:13:19] [INFO ] Deduced a trap composed of 117 places in 97 ms of which 2 ms to minimize.
[2024-06-01 17:13:19] [INFO ] Deduced a trap composed of 111 places in 95 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 887/1450 variables, 563/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1450 variables, 205/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1450 variables, 1/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1450 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 30/1480 variables, 30/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1480 variables, 5/824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:13:21] [INFO ] Deduced a trap composed of 47 places in 359 ms of which 7 ms to minimize.
[2024-06-01 17:13:22] [INFO ] Deduced a trap composed of 11 places in 498 ms of which 7 ms to minimize.
[2024-06-01 17:13:22] [INFO ] Deduced a trap composed of 30 places in 398 ms of which 6 ms to minimize.
[2024-06-01 17:13:23] [INFO ] Deduced a trap composed of 74 places in 328 ms of which 4 ms to minimize.
[2024-06-01 17:13:23] [INFO ] Deduced a trap composed of 65 places in 328 ms of which 7 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1480 variables, 5/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1480 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1480 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1480/1480 variables, and 829 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7000 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 7979ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 88 ms.
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 34 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 593/593 places, 1007/1007 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 32 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
[2024-06-01 17:13:24] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-06-01 17:13:24] [INFO ] Invariant cache hit.
[2024-06-01 17:13:25] [INFO ] Implicit Places using invariants in 643 ms returned []
[2024-06-01 17:13:25] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-06-01 17:13:25] [INFO ] Invariant cache hit.
[2024-06-01 17:13:26] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 17:13:27] [INFO ] Implicit Places using invariants and state equation in 1885 ms returned []
Implicit Place search using SMT with State Equation took 2530 ms to find 0 implicit places.
[2024-06-01 17:13:27] [INFO ] Redundant transitions in 68 ms returned []
Running 1001 sub problems to find dead transitions.
[2024-06-01 17:13:27] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-06-01 17:13:27] [INFO ] Invariant cache hit.
[2024-06-01 17:13:27] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-06-01 17:13:46] [INFO ] Deduced a trap composed of 74 places in 575 ms of which 8 ms to minimize.
[2024-06-01 17:13:46] [INFO ] Deduced a trap composed of 35 places in 523 ms of which 7 ms to minimize.
[2024-06-01 17:13:47] [INFO ] Deduced a trap composed of 41 places in 557 ms of which 8 ms to minimize.
[2024-06-01 17:13:48] [INFO ] Deduced a trap composed of 55 places in 576 ms of which 7 ms to minimize.
[2024-06-01 17:13:48] [INFO ] Deduced a trap composed of 38 places in 582 ms of which 8 ms to minimize.
[2024-06-01 17:13:49] [INFO ] Deduced a trap composed of 29 places in 567 ms of which 8 ms to minimize.
[2024-06-01 17:13:49] [INFO ] Deduced a trap composed of 17 places in 542 ms of which 7 ms to minimize.
[2024-06-01 17:13:50] [INFO ] Deduced a trap composed of 82 places in 509 ms of which 7 ms to minimize.
[2024-06-01 17:13:50] [INFO ] Deduced a trap composed of 53 places in 528 ms of which 7 ms to minimize.
[2024-06-01 17:13:51] [INFO ] Deduced a trap composed of 16 places in 494 ms of which 7 ms to minimize.
[2024-06-01 17:13:51] [INFO ] Deduced a trap composed of 29 places in 471 ms of which 6 ms to minimize.
[2024-06-01 17:13:52] [INFO ] Deduced a trap composed of 29 places in 501 ms of which 7 ms to minimize.
[2024-06-01 17:13:52] [INFO ] Deduced a trap composed of 16 places in 492 ms of which 7 ms to minimize.
[2024-06-01 17:13:53] [INFO ] Deduced a trap composed of 30 places in 520 ms of which 8 ms to minimize.
[2024-06-01 17:13:54] [INFO ] Deduced a trap composed of 24 places in 533 ms of which 8 ms to minimize.
[2024-06-01 17:13:54] [INFO ] Deduced a trap composed of 29 places in 530 ms of which 8 ms to minimize.
[2024-06-01 17:13:55] [INFO ] Deduced a trap composed of 29 places in 512 ms of which 8 ms to minimize.
[2024-06-01 17:13:55] [INFO ] Deduced a trap composed of 26 places in 538 ms of which 8 ms to minimize.
[2024-06-01 17:13:56] [INFO ] Deduced a trap composed of 32 places in 418 ms of which 5 ms to minimize.
[2024-06-01 17:13:56] [INFO ] Deduced a trap composed of 11 places in 396 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/593 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-06-01 17:13:57] [INFO ] Deduced a trap composed of 53 places in 390 ms of which 6 ms to minimize.
[2024-06-01 17:13:57] [INFO ] Deduced a trap composed of 14 places in 477 ms of which 7 ms to minimize.
SMT process timed out in 30421ms, After SMT, problems are : Problem set: 0 solved, 1001 unsolved
Search for dead transitions found 0 dead transitions in 30434ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33075 ms. Remains : 593/593 places, 1007/1007 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 593 transition count 887
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 1 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 1 with 250 rules applied. Total rules applied 370 place count 468 transition count 762
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -264
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 1 with 78 rules applied. Total rules applied 448 place count 426 transition count 1026
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 460 place count 420 transition count 1020
Graph (trivial) has 110 edges and 420 vertex of which 30 / 420 are part of one of the 6 SCC in 5 ms
Free SCC test removed 24 places
Iterating global reduction 1 with 1 rules applied. Total rules applied 461 place count 396 transition count 1020
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 491 place count 396 transition count 990
Drop transitions (Redundant composition of simpler transitions.) removed 300 transitions
Redundant transition composition rules discarded 300 transitions
Iterating global reduction 2 with 300 rules applied. Total rules applied 791 place count 396 transition count 690
Graph (complete) has 720 edges and 396 vertex of which 366 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 1 rules applied. Total rules applied 792 place count 366 transition count 690
Drop transitions (Empty/Sink Transition effects.) removed 150 transitions
Reduce isomorphic transitions removed 150 transitions.
Iterating post reduction 3 with 150 rules applied. Total rules applied 942 place count 366 transition count 540
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 947 place count 366 transition count 535
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 952 place count 361 transition count 535
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 5 with 25 rules applied. Total rules applied 977 place count 361 transition count 510
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 1002 place count 336 transition count 510
Applied a total of 1002 rules in 220 ms. Remains 336 /593 variables (removed 257) and now considering 510/1007 (removed 497) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 510 rows 336 cols
[2024-06-01 17:13:58] [INFO ] Computed 6 invariants in 3 ms
[2024-06-01 17:13:58] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-06-01 17:13:58] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 17:13:58] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-06-01 17:13:59] [INFO ] After 743ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 17:13:59] [INFO ] After 1206ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 17:14:00] [INFO ] After 1779ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 2230 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 2 factoid took 225 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 268 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
[2024-06-01 17:14:00] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2024-06-01 17:14:00] [INFO ] Computed 17 invariants in 4 ms
Proved EG true
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p0) p1))), true]
Knowledge based reduction with 2 factoid took 189 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Support contains 180 out of 828 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Applied a total of 0 rules in 12 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-06-01 17:14:02] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-06-01 17:14:02] [INFO ] Invariant cache hit.
[2024-06-01 17:14:02] [INFO ] Implicit Places using invariants in 535 ms returned []
[2024-06-01 17:14:02] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-06-01 17:14:02] [INFO ] Invariant cache hit.
[2024-06-01 17:14:03] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 17:14:05] [INFO ] Implicit Places using invariants and state equation in 2508 ms returned []
Implicit Place search using SMT with State Equation took 3043 ms to find 0 implicit places.
Running 1236 sub problems to find dead transitions.
[2024-06-01 17:14:05] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-06-01 17:14:05] [INFO ] Invariant cache hit.
[2024-06-01 17:14:05] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 828/1950 variables, and 17 constraints, problems are : Problem set: 0 solved, 1236 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/828 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 1236/1236 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
[2024-06-01 17:14:38] [INFO ] Deduced a trap composed of 41 places in 776 ms of which 9 ms to minimize.
[2024-06-01 17:14:39] [INFO ] Deduced a trap composed of 77 places in 611 ms of which 7 ms to minimize.
[2024-06-01 17:14:39] [INFO ] Deduced a trap composed of 51 places in 589 ms of which 7 ms to minimize.
[2024-06-01 17:14:40] [INFO ] Deduced a trap composed of 49 places in 736 ms of which 10 ms to minimize.
[2024-06-01 17:14:41] [INFO ] Deduced a trap composed of 45 places in 734 ms of which 10 ms to minimize.
[2024-06-01 17:14:42] [INFO ] Deduced a trap composed of 52 places in 831 ms of which 11 ms to minimize.
[2024-06-01 17:14:42] [INFO ] Deduced a trap composed of 22 places in 829 ms of which 10 ms to minimize.
[2024-06-01 17:14:43] [INFO ] Deduced a trap composed of 35 places in 763 ms of which 11 ms to minimize.
[2024-06-01 17:14:44] [INFO ] Deduced a trap composed of 20 places in 751 ms of which 9 ms to minimize.
[2024-06-01 17:14:45] [INFO ] Deduced a trap composed of 78 places in 707 ms of which 10 ms to minimize.
[2024-06-01 17:14:46] [INFO ] Deduced a trap composed of 63 places in 773 ms of which 10 ms to minimize.
[2024-06-01 17:14:46] [INFO ] Deduced a trap composed of 62 places in 692 ms of which 9 ms to minimize.
[2024-06-01 17:14:47] [INFO ] Deduced a trap composed of 119 places in 706 ms of which 9 ms to minimize.
[2024-06-01 17:14:48] [INFO ] Deduced a trap composed of 38 places in 744 ms of which 10 ms to minimize.
[2024-06-01 17:14:49] [INFO ] Deduced a trap composed of 35 places in 708 ms of which 9 ms to minimize.
[2024-06-01 17:14:49] [INFO ] Deduced a trap composed of 58 places in 642 ms of which 9 ms to minimize.
[2024-06-01 17:14:50] [INFO ] Deduced a trap composed of 34 places in 657 ms of which 9 ms to minimize.
[2024-06-01 17:14:51] [INFO ] Deduced a trap composed of 18 places in 649 ms of which 9 ms to minimize.
[2024-06-01 17:14:51] [INFO ] Deduced a trap composed of 51 places in 666 ms of which 9 ms to minimize.
[2024-06-01 17:14:52] [INFO ] Deduced a trap composed of 105 places in 787 ms of which 11 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
[2024-06-01 17:14:54] [INFO ] Deduced a trap composed of 72 places in 779 ms of which 10 ms to minimize.
[2024-06-01 17:14:54] [INFO ] Deduced a trap composed of 40 places in 744 ms of which 9 ms to minimize.
[2024-06-01 17:14:55] [INFO ] Deduced a trap composed of 16 places in 807 ms of which 10 ms to minimize.
[2024-06-01 17:14:56] [INFO ] Deduced a trap composed of 27 places in 735 ms of which 10 ms to minimize.
[2024-06-01 17:14:57] [INFO ] Deduced a trap composed of 38 places in 677 ms of which 8 ms to minimize.
[2024-06-01 17:14:57] [INFO ] Deduced a trap composed of 79 places in 750 ms of which 11 ms to minimize.
[2024-06-01 17:14:58] [INFO ] Deduced a trap composed of 47 places in 779 ms of which 10 ms to minimize.
[2024-06-01 17:14:59] [INFO ] Deduced a trap composed of 77 places in 751 ms of which 9 ms to minimize.
[2024-06-01 17:15:00] [INFO ] Deduced a trap composed of 50 places in 727 ms of which 9 ms to minimize.
[2024-06-01 17:15:00] [INFO ] Deduced a trap composed of 72 places in 567 ms of which 9 ms to minimize.
[2024-06-01 17:15:01] [INFO ] Deduced a trap composed of 14 places in 771 ms of which 10 ms to minimize.
[2024-06-01 17:15:02] [INFO ] Deduced a trap composed of 61 places in 694 ms of which 9 ms to minimize.
[2024-06-01 17:15:03] [INFO ] Deduced a trap composed of 26 places in 817 ms of which 10 ms to minimize.
[2024-06-01 17:15:03] [INFO ] Deduced a trap composed of 30 places in 225 ms of which 3 ms to minimize.
[2024-06-01 17:15:04] [INFO ] Deduced a trap composed of 64 places in 932 ms of which 11 ms to minimize.
[2024-06-01 17:15:05] [INFO ] Deduced a trap composed of 115 places in 907 ms of which 11 ms to minimize.
[2024-06-01 17:15:06] [INFO ] Deduced a trap composed of 35 places in 792 ms of which 7 ms to minimize.
SMT process timed out in 61023ms, After SMT, problems are : Problem set: 0 solved, 1236 unsolved
Search for dead transitions found 0 dead transitions in 61039ms
Finished structural reductions in LTL mode , in 1 iterations and 64099 ms. Remains : 828/828 places, 1242/1242 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 97 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
RANDOM walk for 40000 steps (8 resets) in 1337 ms. (29 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 325 ms. (122 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 443 ms. (90 steps per ms) remains 2/2 properties
[2024-06-01 17:15:07] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-06-01 17:15:07] [INFO ] Invariant cache hit.
[2024-06-01 17:15:07] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 612/792 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/792 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/798 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/798 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1122/1920 variables, 798/810 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1920 variables, 205/1015 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1920 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 30/1950 variables, 30/1045 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1950 variables, 5/1050 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1950 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1950 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1950/1950 variables, and 1050 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1136 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 828/828 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 612/792 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 17:15:09] [INFO ] Deduced a trap composed of 79 places in 725 ms of which 10 ms to minimize.
[2024-06-01 17:15:10] [INFO ] Deduced a trap composed of 163 places in 585 ms of which 8 ms to minimize.
[2024-06-01 17:15:10] [INFO ] Deduced a trap composed of 159 places in 561 ms of which 9 ms to minimize.
[2024-06-01 17:15:11] [INFO ] Deduced a trap composed of 119 places in 394 ms of which 7 ms to minimize.
[2024-06-01 17:15:11] [INFO ] Deduced a trap composed of 227 places in 304 ms of which 4 ms to minimize.
[2024-06-01 17:15:11] [INFO ] Deduced a trap composed of 255 places in 151 ms of which 3 ms to minimize.
[2024-06-01 17:15:11] [INFO ] Deduced a trap composed of 199 places in 166 ms of which 3 ms to minimize.
[2024-06-01 17:15:12] [INFO ] Deduced a trap composed of 139 places in 388 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/792 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 17:15:12] [INFO ] Deduced a trap composed of 99 places in 313 ms of which 5 ms to minimize.
[2024-06-01 17:15:12] [INFO ] Deduced a trap composed of 182 places in 193 ms of which 4 ms to minimize.
[2024-06-01 17:15:13] [INFO ] Deduced a trap composed of 162 places in 223 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/792 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 17:15:13] [INFO ] Deduced a trap composed of 146 places in 258 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/792 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s2 0)
(s4 0)
(s6 0)
(s8 0)
(s10 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 1)
(s39 0)
(s40 0)
(s41 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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 792/1950 variables, and 18 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 6/17 constraints, State Equation: 0/828 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 12/12 constraints]
After SMT, in 6219ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 180 out of 828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 828 transition count 1167
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 150 place count 753 transition count 1167
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 150 place count 753 transition count 1007
Deduced a syphon composed of 160 places in 1 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 470 place count 593 transition count 1007
Applied a total of 470 rules in 72 ms. Remains 593 /828 variables (removed 235) and now considering 1007/1242 (removed 235) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 593/828 places, 1007/1242 transitions.
RANDOM walk for 40000 steps (8 resets) in 1381 ms. (28 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 255 ms. (156 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 564 ms. (70 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 409549 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :1 out of 2
Probabilistic random walk after 409549 steps, saw 139950 distinct states, run finished after 3004 ms. (steps per millisecond=136 ) properties seen :1
[2024-06-01 17:15:17] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
// Phase 1: matrix 887 rows 593 cols
[2024-06-01 17:15:17] [INFO ] Computed 17 invariants in 4 ms
[2024-06-01 17:15:17] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/563 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 887/1450 variables, 563/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1450 variables, 205/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1450 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/1480 variables, 30/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1480 variables, 5/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1480/1480 variables, and 815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 734 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 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/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:15:18] [INFO ] Deduced a trap composed of 114 places in 272 ms of which 5 ms to minimize.
[2024-06-01 17:15:18] [INFO ] Deduced a trap composed of 94 places in 173 ms of which 4 ms to minimize.
[2024-06-01 17:15:19] [INFO ] Deduced a trap composed of 156 places in 178 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:15:19] [INFO ] Deduced a trap composed of 103 places in 365 ms of which 6 ms to minimize.
[2024-06-01 17:15:19] [INFO ] Deduced a trap composed of 144 places in 272 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/563 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 887/1450 variables, 563/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1450 variables, 205/785 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1450 variables, 1/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1450 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 30/1480 variables, 30/816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1480 variables, 5/821 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:15:22] [INFO ] Deduced a trap composed of 16 places in 533 ms of which 8 ms to minimize.
[2024-06-01 17:15:22] [INFO ] Deduced a trap composed of 32 places in 588 ms of which 8 ms to minimize.
[2024-06-01 17:15:23] [INFO ] Deduced a trap composed of 20 places in 549 ms of which 8 ms to minimize.
[2024-06-01 17:15:24] [INFO ] Deduced a trap composed of 13 places in 461 ms of which 8 ms to minimize.
[2024-06-01 17:15:24] [INFO ] Deduced a trap composed of 60 places in 423 ms of which 6 ms to minimize.
[2024-06-01 17:15:25] [INFO ] Deduced a trap composed of 55 places in 468 ms of which 7 ms to minimize.
[2024-06-01 17:15:26] [INFO ] Deduced a trap composed of 55 places in 520 ms of which 7 ms to minimize.
[2024-06-01 17:15:26] [INFO ] Deduced a trap composed of 17 places in 543 ms of which 8 ms to minimize.
[2024-06-01 17:15:27] [INFO ] Deduced a trap composed of 47 places in 423 ms of which 7 ms to minimize.
[2024-06-01 17:15:28] [INFO ] Deduced a trap composed of 50 places in 482 ms of which 7 ms to minimize.
[2024-06-01 17:15:28] [INFO ] Deduced a trap composed of 126 places in 488 ms of which 8 ms to minimize.
[2024-06-01 17:15:29] [INFO ] Deduced a trap composed of 24 places in 487 ms of which 7 ms to minimize.
[2024-06-01 17:15:29] [INFO ] Deduced a trap composed of 66 places in 387 ms of which 5 ms to minimize.
[2024-06-01 17:15:30] [INFO ] Deduced a trap composed of 19 places in 647 ms of which 9 ms to minimize.
[2024-06-01 17:15:31] [INFO ] Deduced a trap composed of 41 places in 633 ms of which 9 ms to minimize.
[2024-06-01 17:15:32] [INFO ] Deduced a trap composed of 38 places in 610 ms of which 9 ms to minimize.
[2024-06-01 17:15:33] [INFO ] Deduced a trap composed of 42 places in 580 ms of which 9 ms to minimize.
[2024-06-01 17:15:33] [INFO ] Deduced a trap composed of 127 places in 410 ms of which 6 ms to minimize.
[2024-06-01 17:15:34] [INFO ] Deduced a trap composed of 80 places in 359 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1480 variables, 19/840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:15:35] [INFO ] Deduced a trap composed of 67 places in 297 ms of which 4 ms to minimize.
[2024-06-01 17:15:35] [INFO ] Deduced a trap composed of 33 places in 297 ms of which 5 ms to minimize.
[2024-06-01 17:15:35] [INFO ] Deduced a trap composed of 34 places in 355 ms of which 5 ms to minimize.
[2024-06-01 17:15:36] [INFO ] Deduced a trap composed of 16 places in 335 ms of which 4 ms to minimize.
[2024-06-01 17:15:36] [INFO ] Deduced a trap composed of 16 places in 319 ms of which 5 ms to minimize.
[2024-06-01 17:15:37] [INFO ] Deduced a trap composed of 90 places in 308 ms of which 5 ms to minimize.
[2024-06-01 17:15:37] [INFO ] Deduced a trap composed of 79 places in 237 ms of which 3 ms to minimize.
[2024-06-01 17:15:38] [INFO ] Deduced a trap composed of 35 places in 287 ms of which 4 ms to minimize.
[2024-06-01 17:15:38] [INFO ] Deduced a trap composed of 82 places in 237 ms of which 4 ms to minimize.
[2024-06-01 17:15:38] [INFO ] Deduced a trap composed of 88 places in 233 ms of which 4 ms to minimize.
[2024-06-01 17:15:39] [INFO ] Deduced a trap composed of 97 places in 290 ms of which 5 ms to minimize.
[2024-06-01 17:15:39] [INFO ] Deduced a trap composed of 83 places in 278 ms of which 4 ms to minimize.
[2024-06-01 17:15:40] [INFO ] Deduced a trap composed of 57 places in 285 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1480 variables, 13/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1480 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1480 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1480/1480 variables, and 853 constraints, problems are : Problem set: 0 solved, 1 unsolved in 23223 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 37/37 constraints]
After SMT, in 24011ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 68 ms.
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 18 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 593/593 places, 1007/1007 transitions.
RANDOM walk for 40000 steps (8 resets) in 334 ms. (119 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 343 ms. (116 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 419629 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :0 out of 1
Probabilistic random walk after 419629 steps, saw 141027 distinct states, run finished after 3001 ms. (steps per millisecond=139 ) properties seen :0
[2024-06-01 17:15:44] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-06-01 17:15:44] [INFO ] Invariant cache hit.
[2024-06-01 17:15:44] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/563 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 887/1450 variables, 563/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1450 variables, 205/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1450 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/1480 variables, 30/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1480 variables, 5/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1480/1480 variables, and 815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 636 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 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/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:15:45] [INFO ] Deduced a trap composed of 84 places in 304 ms of which 6 ms to minimize.
[2024-06-01 17:15:46] [INFO ] Deduced a trap composed of 121 places in 122 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 6/563 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:15:46] [INFO ] Deduced a trap composed of 54 places in 310 ms of which 6 ms to minimize.
[2024-06-01 17:15:46] [INFO ] Deduced a trap composed of 106 places in 163 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:15:47] [INFO ] Deduced a trap composed of 89 places in 257 ms of which 5 ms to minimize.
[2024-06-01 17:15:47] [INFO ] Deduced a trap composed of 105 places in 269 ms of which 4 ms to minimize.
[2024-06-01 17:15:47] [INFO ] Deduced a trap composed of 117 places in 193 ms of which 3 ms to minimize.
[2024-06-01 17:15:47] [INFO ] Deduced a trap composed of 111 places in 171 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 887/1450 variables, 563/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1450 variables, 205/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1450 variables, 1/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1450 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 30/1480 variables, 30/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1480 variables, 5/824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:15:49] [INFO ] Deduced a trap composed of 47 places in 408 ms of which 7 ms to minimize.
[2024-06-01 17:15:50] [INFO ] Deduced a trap composed of 11 places in 442 ms of which 7 ms to minimize.
[2024-06-01 17:15:50] [INFO ] Deduced a trap composed of 30 places in 425 ms of which 7 ms to minimize.
[2024-06-01 17:15:51] [INFO ] Deduced a trap composed of 74 places in 435 ms of which 7 ms to minimize.
[2024-06-01 17:15:52] [INFO ] Deduced a trap composed of 65 places in 514 ms of which 7 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1480 variables, 5/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1480 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1480 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1480/1480 variables, and 829 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7885 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 8586ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 92 ms.
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 30 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 593/593 places, 1007/1007 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 26 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
[2024-06-01 17:15:53] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-06-01 17:15:53] [INFO ] Invariant cache hit.
[2024-06-01 17:15:54] [INFO ] Implicit Places using invariants in 534 ms returned []
[2024-06-01 17:15:54] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-06-01 17:15:54] [INFO ] Invariant cache hit.
[2024-06-01 17:15:54] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 17:15:56] [INFO ] Implicit Places using invariants and state equation in 2444 ms returned []
Implicit Place search using SMT with State Equation took 2982 ms to find 0 implicit places.
[2024-06-01 17:15:56] [INFO ] Redundant transitions in 66 ms returned []
Running 1001 sub problems to find dead transitions.
[2024-06-01 17:15:56] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-06-01 17:15:56] [INFO ] Invariant cache hit.
[2024-06-01 17:15:56] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-06-01 17:16:14] [INFO ] Deduced a trap composed of 74 places in 567 ms of which 8 ms to minimize.
[2024-06-01 17:16:14] [INFO ] Deduced a trap composed of 35 places in 558 ms of which 7 ms to minimize.
[2024-06-01 17:16:15] [INFO ] Deduced a trap composed of 41 places in 565 ms of which 8 ms to minimize.
[2024-06-01 17:16:16] [INFO ] Deduced a trap composed of 55 places in 555 ms of which 7 ms to minimize.
[2024-06-01 17:16:16] [INFO ] Deduced a trap composed of 38 places in 564 ms of which 7 ms to minimize.
[2024-06-01 17:16:17] [INFO ] Deduced a trap composed of 29 places in 619 ms of which 9 ms to minimize.
[2024-06-01 17:16:17] [INFO ] Deduced a trap composed of 17 places in 560 ms of which 8 ms to minimize.
[2024-06-01 17:16:18] [INFO ] Deduced a trap composed of 82 places in 523 ms of which 7 ms to minimize.
[2024-06-01 17:16:19] [INFO ] Deduced a trap composed of 53 places in 561 ms of which 7 ms to minimize.
[2024-06-01 17:16:19] [INFO ] Deduced a trap composed of 16 places in 427 ms of which 5 ms to minimize.
[2024-06-01 17:16:19] [INFO ] Deduced a trap composed of 29 places in 281 ms of which 4 ms to minimize.
[2024-06-01 17:16:20] [INFO ] Deduced a trap composed of 29 places in 297 ms of which 5 ms to minimize.
[2024-06-01 17:16:20] [INFO ] Deduced a trap composed of 16 places in 299 ms of which 4 ms to minimize.
[2024-06-01 17:16:20] [INFO ] Deduced a trap composed of 30 places in 335 ms of which 5 ms to minimize.
[2024-06-01 17:16:21] [INFO ] Deduced a trap composed of 24 places in 318 ms of which 5 ms to minimize.
[2024-06-01 17:16:21] [INFO ] Deduced a trap composed of 29 places in 341 ms of which 8 ms to minimize.
[2024-06-01 17:16:22] [INFO ] Deduced a trap composed of 29 places in 511 ms of which 7 ms to minimize.
[2024-06-01 17:16:22] [INFO ] Deduced a trap composed of 26 places in 511 ms of which 7 ms to minimize.
[2024-06-01 17:16:22] [INFO ] Deduced a trap composed of 32 places in 392 ms of which 6 ms to minimize.
[2024-06-01 17:16:23] [INFO ] Deduced a trap composed of 11 places in 398 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/593 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-06-01 17:16:24] [INFO ] Deduced a trap composed of 53 places in 232 ms of which 3 ms to minimize.
[2024-06-01 17:16:24] [INFO ] Deduced a trap composed of 14 places in 307 ms of which 8 ms to minimize.
[2024-06-01 17:16:25] [INFO ] Deduced a trap composed of 20 places in 521 ms of which 8 ms to minimize.
[2024-06-01 17:16:25] [INFO ] Deduced a trap composed of 105 places in 407 ms of which 6 ms to minimize.
[2024-06-01 17:16:26] [INFO ] Deduced a trap composed of 44 places in 551 ms of which 7 ms to minimize.
[2024-06-01 17:16:26] [INFO ] Deduced a trap composed of 14 places in 551 ms of which 7 ms to minimize.
[2024-06-01 17:16:27] [INFO ] Deduced a trap composed of 85 places in 285 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 593/1480 variables, and 44 constraints, problems are : Problem set: 0 solved, 1001 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/593 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 1001/1001 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1001 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/593 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-06-01 17:16:29] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 2 ms to minimize.
[2024-06-01 17:16:29] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-06-01 17:16:29] [INFO ] Deduced a trap composed of 89 places in 408 ms of which 8 ms to minimize.
[2024-06-01 17:16:30] [INFO ] Deduced a trap composed of 147 places in 461 ms of which 7 ms to minimize.
[2024-06-01 17:16:30] [INFO ] Deduced a trap composed of 42 places in 384 ms of which 7 ms to minimize.
[2024-06-01 17:16:31] [INFO ] Deduced a trap composed of 125 places in 430 ms of which 4 ms to minimize.
[2024-06-01 17:16:31] [INFO ] Deduced a trap composed of 77 places in 294 ms of which 4 ms to minimize.
[2024-06-01 17:16:31] [INFO ] Deduced a trap composed of 23 places in 548 ms of which 8 ms to minimize.
[2024-06-01 17:16:32] [INFO ] Deduced a trap composed of 20 places in 603 ms of which 8 ms to minimize.
[2024-06-01 17:16:33] [INFO ] Deduced a trap composed of 35 places in 475 ms of which 5 ms to minimize.
[2024-06-01 17:16:33] [INFO ] Deduced a trap composed of 17 places in 335 ms of which 5 ms to minimize.
[2024-06-01 17:16:33] [INFO ] Deduced a trap composed of 34 places in 408 ms of which 6 ms to minimize.
[2024-06-01 17:16:34] [INFO ] Deduced a trap composed of 91 places in 483 ms of which 7 ms to minimize.
[2024-06-01 17:16:34] [INFO ] Deduced a trap composed of 62 places in 443 ms of which 7 ms to minimize.
[2024-06-01 17:16:35] [INFO ] Deduced a trap composed of 42 places in 447 ms of which 7 ms to minimize.
[2024-06-01 17:16:35] [INFO ] Deduced a trap composed of 20 places in 452 ms of which 6 ms to minimize.
[2024-06-01 17:16:36] [INFO ] Deduced a trap composed of 23 places in 403 ms of which 6 ms to minimize.
[2024-06-01 17:16:36] [INFO ] Deduced a trap composed of 42 places in 219 ms of which 4 ms to minimize.
[2024-06-01 17:16:36] [INFO ] Deduced a trap composed of 42 places in 224 ms of which 4 ms to minimize.
[2024-06-01 17:16:36] [INFO ] Deduced a trap composed of 61 places in 234 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-06-01 17:16:38] [INFO ] Deduced a trap composed of 53 places in 330 ms of which 5 ms to minimize.
[2024-06-01 17:16:38] [INFO ] Deduced a trap composed of 62 places in 422 ms of which 7 ms to minimize.
[2024-06-01 17:16:39] [INFO ] Deduced a trap composed of 50 places in 417 ms of which 6 ms to minimize.
[2024-06-01 17:16:39] [INFO ] Deduced a trap composed of 61 places in 426 ms of which 6 ms to minimize.
[2024-06-01 17:16:40] [INFO ] Deduced a trap composed of 50 places in 423 ms of which 6 ms to minimize.
[2024-06-01 17:16:40] [INFO ] Deduced a trap composed of 104 places in 291 ms of which 5 ms to minimize.
[2024-06-01 17:16:41] [INFO ] Deduced a trap composed of 17 places in 562 ms of which 8 ms to minimize.
[2024-06-01 17:16:41] [INFO ] Deduced a trap composed of 104 places in 530 ms of which 7 ms to minimize.
[2024-06-01 17:16:42] [INFO ] Deduced a trap composed of 100 places in 479 ms of which 8 ms to minimize.
[2024-06-01 17:16:42] [INFO ] Deduced a trap composed of 94 places in 471 ms of which 7 ms to minimize.
[2024-06-01 17:16:43] [INFO ] Deduced a trap composed of 59 places in 469 ms of which 6 ms to minimize.
[2024-06-01 17:16:44] [INFO ] Deduced a trap composed of 23 places in 511 ms of which 8 ms to minimize.
[2024-06-01 17:16:44] [INFO ] Deduced a trap composed of 118 places in 520 ms of which 7 ms to minimize.
[2024-06-01 17:16:45] [INFO ] Deduced a trap composed of 23 places in 516 ms of which 8 ms to minimize.
[2024-06-01 17:16:46] [INFO ] Deduced a trap composed of 26 places in 421 ms of which 6 ms to minimize.
[2024-06-01 17:16:46] [INFO ] Deduced a trap composed of 26 places in 315 ms of which 5 ms to minimize.
[2024-06-01 17:16:47] [INFO ] Deduced a trap composed of 14 places in 264 ms of which 4 ms to minimize.
[2024-06-01 17:16:47] [INFO ] Deduced a trap composed of 59 places in 408 ms of which 6 ms to minimize.
[2024-06-01 17:16:48] [INFO ] Deduced a trap composed of 62 places in 361 ms of which 6 ms to minimize.
[2024-06-01 17:16:48] [INFO ] Deduced a trap composed of 36 places in 440 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/593 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-06-01 17:16:50] [INFO ] Deduced a trap composed of 77 places in 374 ms of which 6 ms to minimize.
[2024-06-01 17:16:50] [INFO ] Deduced a trap composed of 71 places in 395 ms of which 6 ms to minimize.
[2024-06-01 17:16:50] [INFO ] Deduced a trap composed of 94 places in 400 ms of which 6 ms to minimize.
[2024-06-01 17:16:51] [INFO ] Deduced a trap composed of 56 places in 207 ms of which 4 ms to minimize.
[2024-06-01 17:16:51] [INFO ] Deduced a trap composed of 83 places in 472 ms of which 7 ms to minimize.
[2024-06-01 17:16:52] [INFO ] Deduced a trap composed of 82 places in 396 ms of which 7 ms to minimize.
[2024-06-01 17:16:52] [INFO ] Deduced a trap composed of 83 places in 486 ms of which 7 ms to minimize.
[2024-06-01 17:16:53] [INFO ] Deduced a trap composed of 92 places in 489 ms of which 7 ms to minimize.
[2024-06-01 17:16:53] [INFO ] Deduced a trap composed of 61 places in 333 ms of which 6 ms to minimize.
[2024-06-01 17:16:54] [INFO ] Deduced a trap composed of 61 places in 460 ms of which 6 ms to minimize.
[2024-06-01 17:16:54] [INFO ] Deduced a trap composed of 93 places in 482 ms of which 7 ms to minimize.
[2024-06-01 17:16:55] [INFO ] Deduced a trap composed of 40 places in 558 ms of which 8 ms to minimize.
[2024-06-01 17:16:56] [INFO ] Deduced a trap composed of 26 places in 557 ms of which 8 ms to minimize.
[2024-06-01 17:16:56] [INFO ] Deduced a trap composed of 40 places in 468 ms of which 6 ms to minimize.
[2024-06-01 17:16:56] [INFO ] Deduced a trap composed of 26 places in 455 ms of which 7 ms to minimize.
[2024-06-01 17:16:57] [INFO ] Deduced a trap composed of 20 places in 557 ms of which 8 ms to minimize.
SMT process timed out in 61018ms, After SMT, problems are : Problem set: 0 solved, 1001 unsolved
Search for dead transitions found 0 dead transitions in 61038ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64126 ms. Remains : 593/593 places, 1007/1007 transitions.
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 217 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 421 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 343 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
[2024-06-01 17:16:58] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2024-06-01 17:16:58] [INFO ] Computed 17 invariants in 7 ms
Proved EG true
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p0) p1))), true]
Knowledge based reduction with 1 factoid took 240 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 365 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 352 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Product exploration explored 100000 steps with 0 reset in 628 ms.
Product exploration explored 100000 steps with 0 reset in 905 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 290 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Support contains 180 out of 828 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 828 transition count 1242
Performed 161 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 161 Pre rules applied. Total rules applied 50 place count 828 transition count 1242
Deduced a syphon composed of 211 places in 1 ms
Iterating global reduction 1 with 161 rules applied. Total rules applied 211 place count 828 transition count 1242
Discarding 75 places :
Symmetric choice reduction at 1 with 75 rule applications. Total rules 286 place count 753 transition count 1167
Deduced a syphon composed of 136 places in 1 ms
Iterating global reduction 1 with 75 rules applied. Total rules applied 361 place count 753 transition count 1167
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 160 places in 1 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 385 place count 753 transition count 1167
Deduced a syphon composed of 160 places in 0 ms
Applied a total of 385 rules in 99 ms. Remains 753 /828 variables (removed 75) and now considering 1167/1242 (removed 75) transitions.
[2024-06-01 17:17:03] [INFO ] Redundant transitions in 25 ms returned []
Running 1161 sub problems to find dead transitions.
[2024-06-01 17:17:03] [INFO ] Flow matrix only has 1047 transitions (discarded 120 similar events)
// Phase 1: matrix 1047 rows 753 cols
[2024-06-01 17:17:03] [INFO ] Computed 17 invariants in 3 ms
[2024-06-01 17:17:03] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/753 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1161 unsolved
[2024-06-01 17:17:28] [INFO ] Deduced a trap composed of 35 places in 764 ms of which 11 ms to minimize.
[2024-06-01 17:17:29] [INFO ] Deduced a trap composed of 55 places in 786 ms of which 11 ms to minimize.
[2024-06-01 17:17:30] [INFO ] Deduced a trap composed of 29 places in 781 ms of which 10 ms to minimize.
[2024-06-01 17:17:30] [INFO ] Deduced a trap composed of 16 places in 666 ms of which 9 ms to minimize.
[2024-06-01 17:17:31] [INFO ] Deduced a trap composed of 16 places in 656 ms of which 9 ms to minimize.
[2024-06-01 17:17:32] [INFO ] Deduced a trap composed of 16 places in 650 ms of which 9 ms to minimize.
[2024-06-01 17:17:32] [INFO ] Deduced a trap composed of 29 places in 789 ms of which 9 ms to minimize.
[2024-06-01 17:17:33] [INFO ] Deduced a trap composed of 29 places in 717 ms of which 10 ms to minimize.
SMT process timed out in 30496ms, After SMT, problems are : Problem set: 0 solved, 1161 unsolved
Search for dead transitions found 0 dead transitions in 30513ms
Starting structural reductions in SI_LTL mode, iteration 1 : 753/828 places, 1167/1242 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30648 ms. Remains : 753/828 places, 1167/1242 transitions.
Support contains 180 out of 828 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Applied a total of 0 rules in 21 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-06-01 17:17:33] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2024-06-01 17:17:33] [INFO ] Computed 17 invariants in 6 ms
[2024-06-01 17:17:34] [INFO ] Implicit Places using invariants in 697 ms returned []
[2024-06-01 17:17:34] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-06-01 17:17:34] [INFO ] Invariant cache hit.
[2024-06-01 17:17:35] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 17:17:37] [INFO ] Implicit Places using invariants and state equation in 2994 ms returned []
Implicit Place search using SMT with State Equation took 3693 ms to find 0 implicit places.
Running 1236 sub problems to find dead transitions.
[2024-06-01 17:17:37] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-06-01 17:17:37] [INFO ] Invariant cache hit.
[2024-06-01 17:17:37] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
[2024-06-01 17:18:08] [INFO ] Deduced a trap composed of 41 places in 1009 ms of which 12 ms to minimize.
SMT process timed out in 30924ms, After SMT, problems are : Problem set: 0 solved, 1236 unsolved
Search for dead transitions found 0 dead transitions in 30940ms
Finished structural reductions in LTL mode , in 1 iterations and 34659 ms. Remains : 828/828 places, 1242/1242 transitions.
Treatment of property Peterson-COL-5-LTLFireability-02 finished in 337994 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(F(p0))||G(p1)||(F(G(p3))&&p2))))'
Support contains 192 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 26 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-06-01 17:18:08] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2024-06-01 17:18:08] [INFO ] Computed 23 invariants in 8 ms
[2024-06-01 17:18:09] [INFO ] Implicit Places using invariants in 350 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 352 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 14 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 395 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 322 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p1))]
Running random walk in product with property : Peterson-COL-5-LTLFireability-03
Product exploration explored 100000 steps with 110 reset in 333 ms.
Product exploration explored 100000 steps with 116 reset in 370 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 p2 p3), (X p2), (X p3), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND p1 (NOT p2)))), (X (AND p1 p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X p0), (X p1), (X (X p3)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 18 factoid took 125 ms. Reduced automaton from 8 states, 20 edges and 4 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
RANDOM walk for 5238 steps (0 resets) in 83 ms. (62 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p1 p2 p3), (X p2), (X p3), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND p1 (NOT p2)))), (X (AND p1 p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X p0), (X p1), (X (X p3)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p3)))), (F (NOT p1)), (F (NOT p3)), (F (NOT (OR p0 p1 p3))), (F (NOT (OR p0 p3)))]
Knowledge based reduction with 18 factoid took 433 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 192 out of 828 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 828 transition count 1117
Reduce places removed 125 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 1 with 155 rules applied. Total rules applied 280 place count 703 transition count 1087
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 310 place count 673 transition count 1087
Performed 174 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 174 Pre rules applied. Total rules applied 310 place count 673 transition count 913
Deduced a syphon composed of 174 places in 1 ms
Reduce places removed 174 places and 0 transitions.
Iterating global reduction 3 with 348 rules applied. Total rules applied 658 place count 499 transition count 913
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 708 place count 474 transition count 888
Applied a total of 708 rules in 85 ms. Remains 474 /828 variables (removed 354) and now considering 888/1242 (removed 354) transitions.
[2024-06-01 17:18:11] [INFO ] Flow matrix only has 768 transitions (discarded 120 similar events)
// Phase 1: matrix 768 rows 474 cols
[2024-06-01 17:18:11] [INFO ] Computed 17 invariants in 4 ms
[2024-06-01 17:18:11] [INFO ] Implicit Places using invariants in 309 ms returned []
[2024-06-01 17:18:11] [INFO ] Flow matrix only has 768 transitions (discarded 120 similar events)
[2024-06-01 17:18:11] [INFO ] Invariant cache hit.
[2024-06-01 17:18:12] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 17:18:12] [INFO ] Implicit Places using invariants and state equation in 897 ms returned []
Implicit Place search using SMT with State Equation took 1210 ms to find 0 implicit places.
[2024-06-01 17:18:12] [INFO ] Redundant transitions in 16 ms returned []
Running 882 sub problems to find dead transitions.
[2024-06-01 17:18:12] [INFO ] Flow matrix only has 768 transitions (discarded 120 similar events)
[2024-06-01 17:18:12] [INFO ] Invariant cache hit.
[2024-06-01 17:18:12] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-06-01 17:18:26] [INFO ] Deduced a trap composed of 16 places in 325 ms of which 6 ms to minimize.
[2024-06-01 17:18:26] [INFO ] Deduced a trap composed of 36 places in 469 ms of which 7 ms to minimize.
[2024-06-01 17:18:27] [INFO ] Deduced a trap composed of 46 places in 429 ms of which 6 ms to minimize.
[2024-06-01 17:18:27] [INFO ] Deduced a trap composed of 18 places in 398 ms of which 7 ms to minimize.
[2024-06-01 17:18:28] [INFO ] Deduced a trap composed of 26 places in 444 ms of which 7 ms to minimize.
[2024-06-01 17:18:28] [INFO ] Deduced a trap composed of 28 places in 461 ms of which 6 ms to minimize.
[2024-06-01 17:18:29] [INFO ] Deduced a trap composed of 26 places in 463 ms of which 7 ms to minimize.
[2024-06-01 17:18:29] [INFO ] Deduced a trap composed of 26 places in 479 ms of which 6 ms to minimize.
[2024-06-01 17:18:30] [INFO ] Deduced a trap composed of 12 places in 454 ms of which 7 ms to minimize.
[2024-06-01 17:18:30] [INFO ] Deduced a trap composed of 39 places in 435 ms of which 6 ms to minimize.
[2024-06-01 17:18:31] [INFO ] Deduced a trap composed of 38 places in 447 ms of which 6 ms to minimize.
[2024-06-01 17:18:31] [INFO ] Deduced a trap composed of 28 places in 241 ms of which 4 ms to minimize.
[2024-06-01 17:18:31] [INFO ] Deduced a trap composed of 14 places in 342 ms of which 5 ms to minimize.
[2024-06-01 17:18:32] [INFO ] Deduced a trap composed of 32 places in 434 ms of which 6 ms to minimize.
[2024-06-01 17:18:32] [INFO ] Deduced a trap composed of 45 places in 477 ms of which 7 ms to minimize.
[2024-06-01 17:18:33] [INFO ] Deduced a trap composed of 65 places in 325 ms of which 5 ms to minimize.
[2024-06-01 17:18:33] [INFO ] Deduced a trap composed of 46 places in 350 ms of which 5 ms to minimize.
[2024-06-01 17:18:33] [INFO ] Deduced a trap composed of 46 places in 339 ms of which 5 ms to minimize.
[2024-06-01 17:18:34] [INFO ] Deduced a trap composed of 46 places in 294 ms of which 5 ms to minimize.
[2024-06-01 17:18:34] [INFO ] Deduced a trap composed of 60 places in 230 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-06-01 17:18:35] [INFO ] Deduced a trap composed of 44 places in 328 ms of which 5 ms to minimize.
[2024-06-01 17:18:35] [INFO ] Deduced a trap composed of 63 places in 460 ms of which 8 ms to minimize.
[2024-06-01 17:18:36] [INFO ] Deduced a trap composed of 42 places in 527 ms of which 7 ms to minimize.
[2024-06-01 17:18:36] [INFO ] Deduced a trap composed of 16 places in 482 ms of which 7 ms to minimize.
[2024-06-01 17:18:37] [INFO ] Deduced a trap composed of 44 places in 444 ms of which 6 ms to minimize.
[2024-06-01 17:18:37] [INFO ] Deduced a trap composed of 65 places in 333 ms of which 9 ms to minimize.
[2024-06-01 17:18:37] [INFO ] Deduced a trap composed of 48 places in 295 ms of which 4 ms to minimize.
[2024-06-01 17:18:38] [INFO ] Deduced a trap composed of 34 places in 328 ms of which 6 ms to minimize.
[2024-06-01 17:18:38] [INFO ] Deduced a trap composed of 34 places in 415 ms of which 6 ms to minimize.
[2024-06-01 17:18:39] [INFO ] Deduced a trap composed of 34 places in 424 ms of which 6 ms to minimize.
[2024-06-01 17:18:39] [INFO ] Deduced a trap composed of 20 places in 410 ms of which 6 ms to minimize.
[2024-06-01 17:18:40] [INFO ] Deduced a trap composed of 34 places in 420 ms of which 5 ms to minimize.
[2024-06-01 17:18:40] [INFO ] Deduced a trap composed of 34 places in 414 ms of which 6 ms to minimize.
[2024-06-01 17:18:40] [INFO ] Deduced a trap composed of 31 places in 429 ms of which 6 ms to minimize.
[2024-06-01 17:18:41] [INFO ] Deduced a trap composed of 45 places in 414 ms of which 6 ms to minimize.
[2024-06-01 17:18:42] [INFO ] Deduced a trap composed of 12 places in 430 ms of which 6 ms to minimize.
[2024-06-01 17:18:42] [INFO ] Deduced a trap composed of 26 places in 358 ms of which 6 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 474/1242 variables, and 54 constraints, problems are : Problem set: 0 solved, 882 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/474 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 882/882 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 882 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-06-01 17:18:45] [INFO ] Deduced a trap composed of 64 places in 394 ms of which 6 ms to minimize.
[2024-06-01 17:18:45] [INFO ] Deduced a trap composed of 32 places in 470 ms of which 6 ms to minimize.
[2024-06-01 17:18:46] [INFO ] Deduced a trap composed of 46 places in 387 ms of which 5 ms to minimize.
[2024-06-01 17:18:46] [INFO ] Deduced a trap composed of 60 places in 305 ms of which 5 ms to minimize.
[2024-06-01 17:18:46] [INFO ] Deduced a trap composed of 18 places in 381 ms of which 6 ms to minimize.
[2024-06-01 17:18:47] [INFO ] Deduced a trap composed of 14 places in 443 ms of which 6 ms to minimize.
[2024-06-01 17:18:47] [INFO ] Deduced a trap composed of 16 places in 432 ms of which 6 ms to minimize.
[2024-06-01 17:18:48] [INFO ] Deduced a trap composed of 30 places in 361 ms of which 5 ms to minimize.
[2024-06-01 17:18:48] [INFO ] Deduced a trap composed of 16 places in 323 ms of which 5 ms to minimize.
[2024-06-01 17:18:49] [INFO ] Deduced a trap composed of 30 places in 363 ms of which 5 ms to minimize.
[2024-06-01 17:18:49] [INFO ] Deduced a trap composed of 48 places in 370 ms of which 5 ms to minimize.
[2024-06-01 17:18:49] [INFO ] Deduced a trap composed of 30 places in 352 ms of which 5 ms to minimize.
[2024-06-01 17:18:50] [INFO ] Deduced a trap composed of 52 places in 371 ms of which 5 ms to minimize.
[2024-06-01 17:18:50] [INFO ] Deduced a trap composed of 18 places in 373 ms of which 5 ms to minimize.
[2024-06-01 17:18:50] [INFO ] Deduced a trap composed of 32 places in 365 ms of which 5 ms to minimize.
[2024-06-01 17:18:51] [INFO ] Deduced a trap composed of 18 places in 453 ms of which 6 ms to minimize.
[2024-06-01 17:18:52] [INFO ] Deduced a trap composed of 22 places in 359 ms of which 5 ms to minimize.
[2024-06-01 17:18:53] [INFO ] Deduced a trap composed of 22 places in 333 ms of which 5 ms to minimize.
[2024-06-01 17:18:53] [INFO ] Deduced a trap composed of 61 places in 370 ms of which 5 ms to minimize.
[2024-06-01 17:18:53] [INFO ] Deduced a trap composed of 18 places in 308 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/474 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-06-01 17:18:54] [INFO ] Deduced a trap composed of 32 places in 261 ms of which 4 ms to minimize.
[2024-06-01 17:18:55] [INFO ] Deduced a trap composed of 60 places in 225 ms of which 6 ms to minimize.
[2024-06-01 17:18:55] [INFO ] Deduced a trap composed of 60 places in 311 ms of which 5 ms to minimize.
[2024-06-01 17:18:55] [INFO ] Deduced a trap composed of 60 places in 316 ms of which 5 ms to minimize.
[2024-06-01 17:18:55] [INFO ] Deduced a trap composed of 90 places in 298 ms of which 5 ms to minimize.
[2024-06-01 17:18:56] [INFO ] Deduced a trap composed of 74 places in 318 ms of which 5 ms to minimize.
[2024-06-01 17:18:56] [INFO ] Deduced a trap composed of 74 places in 310 ms of which 4 ms to minimize.
[2024-06-01 17:18:57] [INFO ] Deduced a trap composed of 79 places in 330 ms of which 5 ms to minimize.
[2024-06-01 17:18:57] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
[2024-06-01 17:18:58] [INFO ] Deduced a trap composed of 24 places in 371 ms of which 6 ms to minimize.
[2024-06-01 17:18:58] [INFO ] Deduced a trap composed of 20 places in 391 ms of which 6 ms to minimize.
[2024-06-01 17:18:58] [INFO ] Deduced a trap composed of 14 places in 430 ms of which 6 ms to minimize.
[2024-06-01 17:18:59] [INFO ] Deduced a trap composed of 12 places in 446 ms of which 6 ms to minimize.
[2024-06-01 17:18:59] [INFO ] Deduced a trap composed of 52 places in 452 ms of which 6 ms to minimize.
[2024-06-01 17:19:00] [INFO ] Deduced a trap composed of 26 places in 471 ms of which 6 ms to minimize.
[2024-06-01 17:19:00] [INFO ] Deduced a trap composed of 14 places in 495 ms of which 6 ms to minimize.
[2024-06-01 17:19:01] [INFO ] Deduced a trap composed of 62 places in 481 ms of which 6 ms to minimize.
[2024-06-01 17:19:01] [INFO ] Deduced a trap composed of 28 places in 443 ms of which 7 ms to minimize.
[2024-06-01 17:19:02] [INFO ] Deduced a trap composed of 10 places in 321 ms of which 5 ms to minimize.
[2024-06-01 17:19:03] [INFO ] Deduced a trap composed of 56 places in 226 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/474 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 882 unsolved
[2024-06-01 17:19:04] [INFO ] Deduced a trap composed of 40 places in 345 ms of which 5 ms to minimize.
[2024-06-01 17:19:05] [INFO ] Deduced a trap composed of 74 places in 298 ms of which 5 ms to minimize.
[2024-06-01 17:19:05] [INFO ] Deduced a trap composed of 28 places in 358 ms of which 5 ms to minimize.
[2024-06-01 17:19:06] [INFO ] Deduced a trap composed of 96 places in 427 ms of which 7 ms to minimize.
[2024-06-01 17:19:06] [INFO ] Deduced a trap composed of 36 places in 450 ms of which 6 ms to minimize.
[2024-06-01 17:19:07] [INFO ] Deduced a trap composed of 12 places in 272 ms of which 5 ms to minimize.
[2024-06-01 17:19:08] [INFO ] Deduced a trap composed of 30 places in 366 ms of which 5 ms to minimize.
[2024-06-01 17:19:08] [INFO ] Deduced a trap composed of 16 places in 366 ms of which 5 ms to minimize.
[2024-06-01 17:19:09] [INFO ] Deduced a trap composed of 18 places in 360 ms of which 5 ms to minimize.
[2024-06-01 17:19:09] [INFO ] Deduced a trap composed of 10 places in 365 ms of which 6 ms to minimize.
[2024-06-01 17:19:09] [INFO ] Deduced a trap composed of 30 places in 373 ms of which 6 ms to minimize.
[2024-06-01 17:19:10] [INFO ] Deduced a trap composed of 24 places in 319 ms of which 5 ms to minimize.
[2024-06-01 17:19:10] [INFO ] Deduced a trap composed of 24 places in 287 ms of which 5 ms to minimize.
[2024-06-01 17:19:10] [INFO ] Deduced a trap composed of 12 places in 288 ms of which 4 ms to minimize.
[2024-06-01 17:19:11] [INFO ] Deduced a trap composed of 40 places in 294 ms of which 5 ms to minimize.
[2024-06-01 17:19:11] [INFO ] Deduced a trap composed of 56 places in 322 ms of which 5 ms to minimize.
[2024-06-01 17:19:11] [INFO ] Deduced a trap composed of 34 places in 224 ms of which 4 ms to minimize.
[2024-06-01 17:19:12] [INFO ] Deduced a trap composed of 22 places in 220 ms of which 4 ms to minimize.
[2024-06-01 17:19:12] [INFO ] Deduced a trap composed of 38 places in 196 ms of which 3 ms to minimize.
[2024-06-01 17:19:12] [INFO ] Deduced a trap composed of 56 places in 187 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 882 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 474/1242 variables, and 114 constraints, problems are : Problem set: 0 solved, 882 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/474 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 0/882 constraints, Known Traps: 97/97 constraints]
After SMT, in 60475ms problems are : Problem set: 0 solved, 882 unsolved
Search for dead transitions found 0 dead transitions in 60492ms
Starting structural reductions in SI_LTL mode, iteration 1 : 474/828 places, 888/1242 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61815 ms. Remains : 474/828 places, 888/1242 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 p1 p0 p3), (X p3), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) p3))), (X p0), (X p1), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 222 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
RANDOM walk for 1584 steps (0 resets) in 52 ms. (29 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p1 p0 p3), (X p3), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) p3))), (X p0), (X p1), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p3 p0 p1))), (F (NOT p1)), (F (NOT (OR p3 p0))), (F (NOT (OR (NOT p3) p0))), (F (NOT p3))]
Knowledge based reduction with 13 factoid took 581 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
Product exploration explored 100000 steps with 242 reset in 654 ms.
Stack based approach found an accepted trace after 1148 steps with 1 reset with depth 833 and stack size 811 in 7 ms.
FORMULA Peterson-COL-5-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLFireability-03 finished in 66563 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 18 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 31 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-06-01 17:19:15] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2024-06-01 17:19:15] [INFO ] Computed 23 invariants in 9 ms
[2024-06-01 17:19:16] [INFO ] Implicit Places using invariants in 744 ms returned []
[2024-06-01 17:19:16] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-06-01 17:19:16] [INFO ] Invariant cache hit.
[2024-06-01 17:19:16] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 17:19:19] [INFO ] Implicit Places using invariants and state equation in 3212 ms returned []
Implicit Place search using SMT with State Equation took 3959 ms to find 0 implicit places.
Running 1236 sub problems to find dead transitions.
[2024-06-01 17:19:19] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-06-01 17:19:19] [INFO ] Invariant cache hit.
[2024-06-01 17:19:19] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
[2024-06-01 17:19:49] [INFO ] Deduced a trap composed of 30 places in 957 ms of which 12 ms to minimize.
[2024-06-01 17:19:50] [INFO ] Deduced a trap composed of 18 places in 863 ms of which 11 ms to minimize.
SMT process timed out in 30724ms, After SMT, problems are : Problem set: 0 solved, 1236 unsolved
Search for dead transitions found 0 dead transitions in 30743ms
Finished structural reductions in LTL mode , in 1 iterations and 34737 ms. Remains : 834/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-5-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 622 ms.
Product exploration explored 100000 steps with 50000 reset in 683 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 p1 (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 21 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-COL-5-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-5-LTLFireability-04 finished in 36258 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)))'
Support contains 180 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 19 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-06-01 17:19:51] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-06-01 17:19:51] [INFO ] Invariant cache hit.
[2024-06-01 17:19:52] [INFO ] Implicit Places using invariants in 762 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 763 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 18 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 807 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-5-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-5-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-5-LTLFireability-07 finished in 949 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 150 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 834 transition count 1082
Reduce places removed 160 places and 0 transitions.
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Iterating post reduction 1 with 310 rules applied. Total rules applied 470 place count 674 transition count 932
Reduce places removed 150 places and 0 transitions.
Iterating post reduction 2 with 150 rules applied. Total rules applied 620 place count 524 transition count 932
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 620 place count 524 transition count 872
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 740 place count 464 transition count 872
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 790 place count 439 transition count 847
Applied a total of 790 rules in 73 ms. Remains 439 /834 variables (removed 395) and now considering 847/1242 (removed 395) transitions.
[2024-06-01 17:19:52] [INFO ] Flow matrix only has 727 transitions (discarded 120 similar events)
// Phase 1: matrix 727 rows 439 cols
[2024-06-01 17:19:52] [INFO ] Computed 23 invariants in 5 ms
[2024-06-01 17:19:53] [INFO ] Implicit Places using invariants in 659 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 662 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 433/834 places, 847/1242 transitions.
Applied a total of 0 rules in 18 ms. Remains 433 /433 variables (removed 0) and now considering 847/847 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 754 ms. Remains : 433/834 places, 847/1242 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : Peterson-COL-5-LTLFireability-10
Product exploration explored 100000 steps with 3287 reset in 946 ms.
Stack based approach found an accepted trace after 49 steps with 1 reset with depth 30 and stack size 30 in 2 ms.
FORMULA Peterson-COL-5-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLFireability-10 finished in 1771 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)||X((F(p2)||p1)))))'
Support contains 186 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 23 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-06-01 17:19:54] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2024-06-01 17:19:54] [INFO ] Computed 23 invariants in 7 ms
[2024-06-01 17:19:54] [INFO ] Implicit Places using invariants in 522 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 524 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 25 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 574 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 218 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : Peterson-COL-5-LTLFireability-11
Product exploration explored 100000 steps with 33333 reset in 1248 ms.
Product exploration explored 100000 steps with 33333 reset in 896 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 (NOT p1) p2), (X p0), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 14 ms. Reduced automaton from 4 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-COL-5-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-5-LTLFireability-11 finished in 2985 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 60 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 360 transitions
Trivial Post-agglo rules discarded 360 transitions
Performed 360 trivial Post agglomeration. Transition count delta: 360
Iterating post reduction 0 with 360 rules applied. Total rules applied 360 place count 834 transition count 882
Reduce places removed 360 places and 0 transitions.
Iterating post reduction 1 with 360 rules applied. Total rules applied 720 place count 474 transition count 882
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 180 Pre rules applied. Total rules applied 720 place count 474 transition count 702
Deduced a syphon composed of 180 places in 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 1080 place count 294 transition count 702
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 1140 place count 264 transition count 672
Applied a total of 1140 rules in 37 ms. Remains 264 /834 variables (removed 570) and now considering 672/1242 (removed 570) transitions.
[2024-06-01 17:19:57] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 264 cols
[2024-06-01 17:19:57] [INFO ] Computed 23 invariants in 1 ms
[2024-06-01 17:19:57] [INFO ] Implicit Places using invariants in 297 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 299 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 258/834 places, 672/1242 transitions.
Applied a total of 0 rules in 9 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 348 ms. Remains : 258/834 places, 672/1242 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : Peterson-COL-5-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 355 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 0 ms.
FORMULA Peterson-COL-5-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLFireability-13 finished in 756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X((!p0 U !p1)))))'
Support contains 192 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 10 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-06-01 17:19:57] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2024-06-01 17:19:58] [INFO ] Computed 23 invariants in 4 ms
[2024-06-01 17:19:58] [INFO ] Implicit Places using invariants in 557 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 560 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 18 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 590 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : Peterson-COL-5-LTLFireability-14
Product exploration explored 100000 steps with 119 reset in 1312 ms.
Stack based approach found an accepted trace after 4852 steps with 12 reset with depth 117 and stack size 117 in 86 ms.
FORMULA Peterson-COL-5-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLFireability-14 finished in 2168 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((F(((p2 U G(p3))||p1))&&p0))))'
Support contains 270 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 15 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-06-01 17:20:00] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-06-01 17:20:00] [INFO ] Invariant cache hit.
[2024-06-01 17:20:00] [INFO ] Implicit Places using invariants in 528 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 529 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 16 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 561 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), true, (AND (NOT p1) (NOT p3))]
Running random walk in product with property : Peterson-COL-5-LTLFireability-15
Product exploration explored 100000 steps with 2372 reset in 1657 ms.
Product exploration explored 100000 steps with 2459 reset in 1246 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 (NOT p1) (NOT p3)), (X p3), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p1) p3))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 442 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), true, (AND (NOT p3) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 284 ms. (140 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 1/1 properties
[2024-06-01 17:20:04] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2024-06-01 17:20:04] [INFO ] Computed 17 invariants in 5 ms
[2024-06-01 17:20:04] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 762/792 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/792 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/798 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/798 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1122/1920 variables, 798/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1920 variables, 205/1015 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1920 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/1950 variables, 30/1045 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1950 variables, 5/1050 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1950 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1950 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1950/1950 variables, and 1050 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1168 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 828/828 constraints, ReadFeed: 205/205 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/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 762/792 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:20:06] [INFO ] Deduced a trap composed of 119 places in 657 ms of which 9 ms to minimize.
[2024-06-01 17:20:07] [INFO ] Deduced a trap composed of 155 places in 532 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/792 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:20:07] [INFO ] Deduced a trap composed of 99 places in 538 ms of which 9 ms to minimize.
[2024-06-01 17:20:08] [INFO ] Deduced a trap composed of 79 places in 554 ms of which 8 ms to minimize.
[2024-06-01 17:20:08] [INFO ] Deduced a trap composed of 160 places in 234 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/792 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/792 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/798 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:20:09] [INFO ] Deduced a trap composed of 202 places in 266 ms of which 5 ms to minimize.
[2024-06-01 17:20:09] [INFO ] Deduced a trap composed of 179 places in 252 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/798 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/798 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1122/1920 variables, 798/817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1920 variables, 205/1022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1920 variables, 1/1023 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1920 variables, 0/1023 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 30/1950 variables, 30/1053 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1950 variables, 5/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:20:10] [INFO ] Deduced a trap composed of 31 places in 665 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1950/1950 variables, and 1059 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 828/828 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 6201ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 828 transition count 892
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 478 transition count 892
Performed 185 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 185 Pre rules applied. Total rules applied 700 place count 478 transition count 707
Deduced a syphon composed of 185 places in 0 ms
Reduce places removed 185 places and 0 transitions.
Iterating global reduction 2 with 370 rules applied. Total rules applied 1070 place count 293 transition count 707
Applied a total of 1070 rules in 45 ms. Remains 293 /828 variables (removed 535) and now considering 707/1242 (removed 535) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 293/828 places, 707/1242 transitions.
RANDOM walk for 40000 steps (8 resets) in 218 ms. (182 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 61 steps, run visited all 1 properties in 5 ms. (steps per millisecond=12 )
Probabilistic random walk after 61 steps, saw 55 distinct states, run finished after 6 ms. (steps per millisecond=10 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3)), (X p3), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p1) p3)))), (F (NOT (AND (NOT p3) (NOT p1)))), (F (NOT p0)), (F p1), (F (NOT (AND (NOT p3) p0 (NOT p1)))), (F (NOT (OR (NOT p3) p1))), (F p3)]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 7 factoid took 549 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Peterson-COL-5-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-5-LTLFireability-15 finished in 11337 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(F(((F(!p0) U p1)&&X(G(!p1)))))))'
Found a Shortening insensitive property : Peterson-COL-5-LTLFireability-02
Stuttering acceptance computed with spot in 362 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Support contains 180 out of 834 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 834 transition count 1167
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 150 place count 759 transition count 1167
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 150 place count 759 transition count 1007
Deduced a syphon composed of 160 places in 1 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 470 place count 599 transition count 1007
Applied a total of 470 rules in 61 ms. Remains 599 /834 variables (removed 235) and now considering 1007/1242 (removed 235) transitions.
[2024-06-01 17:20:12] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
// Phase 1: matrix 887 rows 599 cols
[2024-06-01 17:20:12] [INFO ] Computed 23 invariants in 5 ms
[2024-06-01 17:20:12] [INFO ] Implicit Places using invariants in 700 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 702 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 593/834 places, 1007/1242 transitions.
Applied a total of 0 rules in 17 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 782 ms. Remains : 593/834 places, 1007/1242 transitions.
Running random walk in product with property : Peterson-COL-5-LTLFireability-02
Product exploration explored 100000 steps with 3 reset in 589 ms.
Product exploration explored 100000 steps with 1 reset in 423 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
RANDOM walk for 40000 steps (8 resets) in 476 ms. (83 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 588 ms. (67 steps per ms) remains 2/2 properties
[2024-06-01 17:20:14] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
// Phase 1: matrix 887 rows 593 cols
[2024-06-01 17:20:14] [INFO ] Computed 17 invariants in 4 ms
[2024-06-01 17:20:14] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/563 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 887/1450 variables, 563/575 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1450 variables, 205/780 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1450 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 30/1480 variables, 30/810 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1480 variables, 5/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1480/1480 variables, and 815 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1294 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 17:20:16] [INFO ] Deduced a trap composed of 114 places in 447 ms of which 7 ms to minimize.
[2024-06-01 17:20:17] [INFO ] Deduced a trap composed of 140 places in 334 ms of which 6 ms to minimize.
[2024-06-01 17:20:17] [INFO ] Deduced a trap composed of 131 places in 480 ms of which 7 ms to minimize.
[2024-06-01 17:20:18] [INFO ] Deduced a trap composed of 54 places in 490 ms of which 7 ms to minimize.
[2024-06-01 17:20:18] [INFO ] Deduced a trap composed of 112 places in 372 ms of which 6 ms to minimize.
[2024-06-01 17:20:18] [INFO ] Deduced a trap composed of 129 places in 389 ms of which 6 ms to minimize.
[2024-06-01 17:20:19] [INFO ] Deduced a trap composed of 84 places in 298 ms of which 6 ms to minimize.
[2024-06-01 17:20:19] [INFO ] Deduced a trap composed of 99 places in 279 ms of which 4 ms to minimize.
[2024-06-01 17:20:19] [INFO ] Deduced a trap composed of 160 places in 185 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 6/563 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 887/1450 variables, 563/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1450 variables, 205/789 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1450 variables, 2/791 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1450/1480 variables, and 791 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 12/17 constraints, State Equation: 563/593 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints]
After SMT, in 6387ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 24 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 593/593 places, 1007/1007 transitions.
RANDOM walk for 40000 steps (8 resets) in 1259 ms. (31 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 281 ms. (141 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 576 ms. (69 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 371112 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :1 out of 2
Probabilistic random walk after 371112 steps, saw 134189 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :1
[2024-06-01 17:20:24] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-06-01 17:20:24] [INFO ] Invariant cache hit.
[2024-06-01 17:20:24] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/563 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 887/1450 variables, 563/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1450 variables, 205/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1450 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/1480 variables, 30/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1480 variables, 5/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1480/1480 variables, and 815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 998 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 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/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:20:26] [INFO ] Deduced a trap composed of 84 places in 484 ms of which 7 ms to minimize.
[2024-06-01 17:20:26] [INFO ] Deduced a trap composed of 121 places in 160 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 6/563 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:20:27] [INFO ] Deduced a trap composed of 54 places in 377 ms of which 6 ms to minimize.
[2024-06-01 17:20:27] [INFO ] Deduced a trap composed of 106 places in 156 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:20:27] [INFO ] Deduced a trap composed of 89 places in 257 ms of which 4 ms to minimize.
[2024-06-01 17:20:27] [INFO ] Deduced a trap composed of 105 places in 257 ms of which 4 ms to minimize.
[2024-06-01 17:20:28] [INFO ] Deduced a trap composed of 117 places in 167 ms of which 4 ms to minimize.
[2024-06-01 17:20:28] [INFO ] Deduced a trap composed of 111 places in 153 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 887/1450 variables, 563/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1450 variables, 205/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1450 variables, 1/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1450 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 30/1480 variables, 30/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1480 variables, 5/824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:20:30] [INFO ] Deduced a trap composed of 47 places in 444 ms of which 7 ms to minimize.
[2024-06-01 17:20:31] [INFO ] Deduced a trap composed of 11 places in 478 ms of which 7 ms to minimize.
[2024-06-01 17:20:31] [INFO ] Deduced a trap composed of 30 places in 407 ms of which 7 ms to minimize.
[2024-06-01 17:20:32] [INFO ] Deduced a trap composed of 74 places in 461 ms of which 7 ms to minimize.
[2024-06-01 17:20:33] [INFO ] Deduced a trap composed of 65 places in 552 ms of which 7 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1480 variables, 5/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1480 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1480 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1480/1480 variables, and 829 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8270 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 9318ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 78 ms.
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 18 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 593/593 places, 1007/1007 transitions.
RANDOM walk for 40000 steps (8 resets) in 463 ms. (86 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 527 ms. (75 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 388640 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :0 out of 1
Probabilistic random walk after 388640 steps, saw 136702 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
[2024-06-01 17:20:37] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-06-01 17:20:37] [INFO ] Invariant cache hit.
[2024-06-01 17:20:37] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/563 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 887/1450 variables, 563/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1450 variables, 205/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1450 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/1480 variables, 30/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1480 variables, 5/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1480/1480 variables, and 815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 851 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 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/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:20:39] [INFO ] Deduced a trap composed of 84 places in 456 ms of which 7 ms to minimize.
[2024-06-01 17:20:39] [INFO ] Deduced a trap composed of 121 places in 165 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 6/563 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:20:39] [INFO ] Deduced a trap composed of 54 places in 400 ms of which 6 ms to minimize.
[2024-06-01 17:20:39] [INFO ] Deduced a trap composed of 106 places in 161 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:20:40] [INFO ] Deduced a trap composed of 89 places in 261 ms of which 4 ms to minimize.
[2024-06-01 17:20:40] [INFO ] Deduced a trap composed of 105 places in 263 ms of which 5 ms to minimize.
[2024-06-01 17:20:40] [INFO ] Deduced a trap composed of 117 places in 170 ms of which 3 ms to minimize.
[2024-06-01 17:20:40] [INFO ] Deduced a trap composed of 111 places in 185 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 887/1450 variables, 563/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1450 variables, 205/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1450 variables, 1/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1450 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 30/1480 variables, 30/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1480 variables, 5/824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:20:43] [INFO ] Deduced a trap composed of 47 places in 531 ms of which 7 ms to minimize.
[2024-06-01 17:20:44] [INFO ] Deduced a trap composed of 11 places in 515 ms of which 7 ms to minimize.
[2024-06-01 17:20:44] [INFO ] Deduced a trap composed of 30 places in 441 ms of which 6 ms to minimize.
[2024-06-01 17:20:45] [INFO ] Deduced a trap composed of 74 places in 439 ms of which 6 ms to minimize.
[2024-06-01 17:20:45] [INFO ] Deduced a trap composed of 65 places in 527 ms of which 7 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1480 variables, 5/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1480 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1480 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1480/1480 variables, and 829 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8809 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 9705ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 79 ms.
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 18 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 593/593 places, 1007/1007 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 17 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
[2024-06-01 17:20:47] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-06-01 17:20:47] [INFO ] Invariant cache hit.
[2024-06-01 17:20:47] [INFO ] Implicit Places using invariants in 613 ms returned []
[2024-06-01 17:20:47] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-06-01 17:20:47] [INFO ] Invariant cache hit.
[2024-06-01 17:20:48] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 17:20:50] [INFO ] Implicit Places using invariants and state equation in 2388 ms returned []
Implicit Place search using SMT with State Equation took 3005 ms to find 0 implicit places.
[2024-06-01 17:20:50] [INFO ] Redundant transitions in 15 ms returned []
Running 1001 sub problems to find dead transitions.
[2024-06-01 17:20:50] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-06-01 17:20:50] [INFO ] Invariant cache hit.
[2024-06-01 17:20:50] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-06-01 17:21:09] [INFO ] Deduced a trap composed of 74 places in 584 ms of which 8 ms to minimize.
[2024-06-01 17:21:10] [INFO ] Deduced a trap composed of 35 places in 520 ms of which 7 ms to minimize.
[2024-06-01 17:21:10] [INFO ] Deduced a trap composed of 41 places in 540 ms of which 7 ms to minimize.
[2024-06-01 17:21:11] [INFO ] Deduced a trap composed of 55 places in 553 ms of which 8 ms to minimize.
[2024-06-01 17:21:11] [INFO ] Deduced a trap composed of 38 places in 533 ms of which 7 ms to minimize.
[2024-06-01 17:21:12] [INFO ] Deduced a trap composed of 29 places in 501 ms of which 7 ms to minimize.
[2024-06-01 17:21:12] [INFO ] Deduced a trap composed of 17 places in 472 ms of which 7 ms to minimize.
[2024-06-01 17:21:13] [INFO ] Deduced a trap composed of 82 places in 452 ms of which 7 ms to minimize.
[2024-06-01 17:21:13] [INFO ] Deduced a trap composed of 53 places in 486 ms of which 7 ms to minimize.
[2024-06-01 17:21:14] [INFO ] Deduced a trap composed of 16 places in 409 ms of which 6 ms to minimize.
[2024-06-01 17:21:14] [INFO ] Deduced a trap composed of 29 places in 439 ms of which 6 ms to minimize.
[2024-06-01 17:21:15] [INFO ] Deduced a trap composed of 29 places in 432 ms of which 6 ms to minimize.
[2024-06-01 17:21:15] [INFO ] Deduced a trap composed of 16 places in 412 ms of which 6 ms to minimize.
[2024-06-01 17:21:16] [INFO ] Deduced a trap composed of 30 places in 465 ms of which 7 ms to minimize.
[2024-06-01 17:21:16] [INFO ] Deduced a trap composed of 24 places in 554 ms of which 8 ms to minimize.
[2024-06-01 17:21:17] [INFO ] Deduced a trap composed of 29 places in 525 ms of which 7 ms to minimize.
[2024-06-01 17:21:17] [INFO ] Deduced a trap composed of 29 places in 541 ms of which 7 ms to minimize.
[2024-06-01 17:21:18] [INFO ] Deduced a trap composed of 26 places in 529 ms of which 8 ms to minimize.
[2024-06-01 17:21:18] [INFO ] Deduced a trap composed of 32 places in 392 ms of which 6 ms to minimize.
[2024-06-01 17:21:19] [INFO ] Deduced a trap composed of 11 places in 390 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/593 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-06-01 17:21:20] [INFO ] Deduced a trap composed of 53 places in 409 ms of which 6 ms to minimize.
[2024-06-01 17:21:20] [INFO ] Deduced a trap composed of 14 places in 486 ms of which 7 ms to minimize.
[2024-06-01 17:21:21] [INFO ] Deduced a trap composed of 20 places in 551 ms of which 7 ms to minimize.
SMT process timed out in 30938ms, After SMT, problems are : Problem set: 0 solved, 1001 unsolved
Search for dead transitions found 0 dead transitions in 30954ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34002 ms. Remains : 593/593 places, 1007/1007 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 593 transition count 887
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 1 with 250 rules applied. Total rules applied 370 place count 468 transition count 762
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -264
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 1 with 78 rules applied. Total rules applied 448 place count 426 transition count 1026
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 460 place count 420 transition count 1020
Graph (trivial) has 110 edges and 420 vertex of which 30 / 420 are part of one of the 6 SCC in 0 ms
Free SCC test removed 24 places
Iterating global reduction 1 with 1 rules applied. Total rules applied 461 place count 396 transition count 1020
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 491 place count 396 transition count 990
Drop transitions (Redundant composition of simpler transitions.) removed 300 transitions
Redundant transition composition rules discarded 300 transitions
Iterating global reduction 2 with 300 rules applied. Total rules applied 791 place count 396 transition count 690
Graph (complete) has 720 edges and 396 vertex of which 366 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 1 rules applied. Total rules applied 792 place count 366 transition count 690
Drop transitions (Empty/Sink Transition effects.) removed 150 transitions
Reduce isomorphic transitions removed 150 transitions.
Iterating post reduction 3 with 150 rules applied. Total rules applied 942 place count 366 transition count 540
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 947 place count 366 transition count 535
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 952 place count 361 transition count 535
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 5 with 25 rules applied. Total rules applied 977 place count 361 transition count 510
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 1002 place count 336 transition count 510
Applied a total of 1002 rules in 114 ms. Remains 336 /593 variables (removed 257) and now considering 510/1007 (removed 497) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 510 rows 336 cols
[2024-06-01 17:21:21] [INFO ] Computed 6 invariants in 3 ms
[2024-06-01 17:21:21] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-06-01 17:21:21] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 17:21:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-06-01 17:21:22] [INFO ] After 500ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 17:21:22] [INFO ] After 805ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 17:21:22] [INFO ] After 1248ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1576 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 2 factoid took 170 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 350 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
[2024-06-01 17:21:23] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
// Phase 1: matrix 887 rows 593 cols
[2024-06-01 17:21:23] [INFO ] Computed 17 invariants in 4 ms
Proved EG true
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p0) p1))), true]
Knowledge based reduction with 2 factoid took 165 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 325 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 8 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
[2024-06-01 17:21:25] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-06-01 17:21:25] [INFO ] Invariant cache hit.
[2024-06-01 17:21:25] [INFO ] Implicit Places using invariants in 611 ms returned []
[2024-06-01 17:21:25] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-06-01 17:21:25] [INFO ] Invariant cache hit.
[2024-06-01 17:21:26] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 17:21:27] [INFO ] Implicit Places using invariants and state equation in 2199 ms returned []
Implicit Place search using SMT with State Equation took 2812 ms to find 0 implicit places.
Running 1001 sub problems to find dead transitions.
[2024-06-01 17:21:27] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-06-01 17:21:27] [INFO ] Invariant cache hit.
[2024-06-01 17:21:28] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-06-01 17:21:46] [INFO ] Deduced a trap composed of 74 places in 533 ms of which 8 ms to minimize.
[2024-06-01 17:21:46] [INFO ] Deduced a trap composed of 35 places in 510 ms of which 7 ms to minimize.
[2024-06-01 17:21:47] [INFO ] Deduced a trap composed of 41 places in 532 ms of which 8 ms to minimize.
[2024-06-01 17:21:47] [INFO ] Deduced a trap composed of 55 places in 521 ms of which 8 ms to minimize.
[2024-06-01 17:21:48] [INFO ] Deduced a trap composed of 38 places in 523 ms of which 7 ms to minimize.
[2024-06-01 17:21:48] [INFO ] Deduced a trap composed of 29 places in 556 ms of which 7 ms to minimize.
[2024-06-01 17:21:49] [INFO ] Deduced a trap composed of 17 places in 483 ms of which 7 ms to minimize.
[2024-06-01 17:21:49] [INFO ] Deduced a trap composed of 82 places in 454 ms of which 7 ms to minimize.
[2024-06-01 17:21:50] [INFO ] Deduced a trap composed of 53 places in 480 ms of which 7 ms to minimize.
[2024-06-01 17:21:50] [INFO ] Deduced a trap composed of 16 places in 431 ms of which 6 ms to minimize.
[2024-06-01 17:21:51] [INFO ] Deduced a trap composed of 29 places in 417 ms of which 7 ms to minimize.
[2024-06-01 17:21:51] [INFO ] Deduced a trap composed of 29 places in 434 ms of which 7 ms to minimize.
[2024-06-01 17:21:52] [INFO ] Deduced a trap composed of 16 places in 418 ms of which 6 ms to minimize.
[2024-06-01 17:21:52] [INFO ] Deduced a trap composed of 30 places in 442 ms of which 6 ms to minimize.
[2024-06-01 17:21:53] [INFO ] Deduced a trap composed of 24 places in 454 ms of which 7 ms to minimize.
[2024-06-01 17:21:53] [INFO ] Deduced a trap composed of 29 places in 483 ms of which 8 ms to minimize.
[2024-06-01 17:21:54] [INFO ] Deduced a trap composed of 29 places in 511 ms of which 7 ms to minimize.
[2024-06-01 17:21:54] [INFO ] Deduced a trap composed of 26 places in 525 ms of which 8 ms to minimize.
[2024-06-01 17:21:55] [INFO ] Deduced a trap composed of 32 places in 410 ms of which 6 ms to minimize.
[2024-06-01 17:21:55] [INFO ] Deduced a trap composed of 11 places in 381 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/593 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-06-01 17:21:56] [INFO ] Deduced a trap composed of 53 places in 393 ms of which 6 ms to minimize.
[2024-06-01 17:21:56] [INFO ] Deduced a trap composed of 14 places in 475 ms of which 7 ms to minimize.
[2024-06-01 17:21:57] [INFO ] Deduced a trap composed of 20 places in 501 ms of which 7 ms to minimize.
[2024-06-01 17:21:57] [INFO ] Deduced a trap composed of 105 places in 386 ms of which 6 ms to minimize.
[2024-06-01 17:21:58] [INFO ] Deduced a trap composed of 44 places in 434 ms of which 7 ms to minimize.
SMT process timed out in 30373ms, After SMT, problems are : Problem set: 0 solved, 1001 unsolved
Search for dead transitions found 0 dead transitions in 30385ms
Finished structural reductions in LTL mode , in 1 iterations and 33210 ms. Remains : 593/593 places, 1007/1007 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 116 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 348 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
RANDOM walk for 40000 steps (8 resets) in 1208 ms. (33 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 280 ms. (142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 602 ms. (66 steps per ms) remains 2/2 properties
[2024-06-01 17:21:59] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-06-01 17:21:59] [INFO ] Invariant cache hit.
[2024-06-01 17:21:59] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/563 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 887/1450 variables, 563/575 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1450 variables, 205/780 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1450 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 30/1480 variables, 30/810 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1480 variables, 5/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1480/1480 variables, and 815 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1193 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 17:22:01] [INFO ] Deduced a trap composed of 84 places in 532 ms of which 9 ms to minimize.
[2024-06-01 17:22:02] [INFO ] Deduced a trap composed of 105 places in 471 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 6/563 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 887/1450 variables, 563/577 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1450 variables, 205/782 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1450 variables, 2/784 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1450 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 30/1480 variables, 30/814 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1480 variables, 5/819 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 17:22:04] [INFO ] Deduced a trap composed of 50 places in 376 ms of which 5 ms to minimize.
[2024-06-01 17:22:04] [INFO ] Deduced a trap composed of 68 places in 412 ms of which 6 ms to minimize.
[2024-06-01 17:22:05] [INFO ] Deduced a trap composed of 29 places in 433 ms of which 7 ms to minimize.
[2024-06-01 17:22:05] [INFO ] Deduced a trap composed of 58 places in 459 ms of which 6 ms to minimize.
[2024-06-01 17:22:06] [INFO ] Deduced a trap composed of 53 places in 427 ms of which 7 ms to minimize.
SMT process timed out in 6504ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 20 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 593/593 places, 1007/1007 transitions.
RANDOM walk for 40000 steps (8 resets) in 1309 ms. (30 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 300 ms. (132 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 633 ms. (63 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 455630 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :1 out of 2
Probabilistic random walk after 455630 steps, saw 146225 distinct states, run finished after 3001 ms. (steps per millisecond=151 ) properties seen :1
[2024-06-01 17:22:09] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-06-01 17:22:09] [INFO ] Invariant cache hit.
[2024-06-01 17:22:09] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/563 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 887/1450 variables, 563/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1450 variables, 205/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1450 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/1480 variables, 30/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1480 variables, 5/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1480/1480 variables, and 815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 793 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 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/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:22:11] [INFO ] Deduced a trap composed of 84 places in 299 ms of which 4 ms to minimize.
[2024-06-01 17:22:11] [INFO ] Deduced a trap composed of 121 places in 92 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 6/563 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:22:11] [INFO ] Deduced a trap composed of 54 places in 321 ms of which 6 ms to minimize.
[2024-06-01 17:22:11] [INFO ] Deduced a trap composed of 106 places in 125 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:22:12] [INFO ] Deduced a trap composed of 89 places in 147 ms of which 3 ms to minimize.
[2024-06-01 17:22:12] [INFO ] Deduced a trap composed of 105 places in 147 ms of which 3 ms to minimize.
[2024-06-01 17:22:12] [INFO ] Deduced a trap composed of 117 places in 100 ms of which 2 ms to minimize.
[2024-06-01 17:22:12] [INFO ] Deduced a trap composed of 111 places in 103 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 887/1450 variables, 563/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1450 variables, 205/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1450 variables, 1/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1450 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 30/1480 variables, 30/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1480 variables, 5/824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:22:14] [INFO ] Deduced a trap composed of 47 places in 467 ms of which 8 ms to minimize.
[2024-06-01 17:22:14] [INFO ] Deduced a trap composed of 11 places in 474 ms of which 7 ms to minimize.
[2024-06-01 17:22:15] [INFO ] Deduced a trap composed of 30 places in 398 ms of which 6 ms to minimize.
[2024-06-01 17:22:15] [INFO ] Deduced a trap composed of 74 places in 345 ms of which 4 ms to minimize.
[2024-06-01 17:22:16] [INFO ] Deduced a trap composed of 65 places in 291 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1480 variables, 5/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1480 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1480 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1480/1480 variables, and 829 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6413 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 7252ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 50 ms.
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 11 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 593/593 places, 1007/1007 transitions.
RANDOM walk for 40000 steps (8 resets) in 313 ms. (127 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 323 ms. (123 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 459424 steps, run timeout after 3001 ms. (steps per millisecond=153 ) properties seen :0 out of 1
Probabilistic random walk after 459424 steps, saw 147028 distinct states, run finished after 3001 ms. (steps per millisecond=153 ) properties seen :0
[2024-06-01 17:22:20] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-06-01 17:22:20] [INFO ] Invariant cache hit.
[2024-06-01 17:22:20] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/563 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 887/1450 variables, 563/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1450 variables, 205/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1450 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/1480 variables, 30/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1480 variables, 5/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1480 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1480/1480 variables, and 815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 812 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 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/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:22:21] [INFO ] Deduced a trap composed of 84 places in 427 ms of which 7 ms to minimize.
[2024-06-01 17:22:22] [INFO ] Deduced a trap composed of 121 places in 143 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 6/563 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:22:22] [INFO ] Deduced a trap composed of 54 places in 293 ms of which 5 ms to minimize.
[2024-06-01 17:22:22] [INFO ] Deduced a trap composed of 106 places in 123 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:22:22] [INFO ] Deduced a trap composed of 89 places in 199 ms of which 3 ms to minimize.
[2024-06-01 17:22:23] [INFO ] Deduced a trap composed of 105 places in 199 ms of which 3 ms to minimize.
[2024-06-01 17:22:23] [INFO ] Deduced a trap composed of 117 places in 114 ms of which 3 ms to minimize.
[2024-06-01 17:22:23] [INFO ] Deduced a trap composed of 111 places in 113 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 887/1450 variables, 563/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1450 variables, 205/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1450 variables, 1/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1450 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 30/1480 variables, 30/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1480 variables, 5/824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:22:25] [INFO ] Deduced a trap composed of 47 places in 427 ms of which 7 ms to minimize.
[2024-06-01 17:22:26] [INFO ] Deduced a trap composed of 11 places in 457 ms of which 6 ms to minimize.
[2024-06-01 17:22:26] [INFO ] Deduced a trap composed of 30 places in 382 ms of which 6 ms to minimize.
[2024-06-01 17:22:27] [INFO ] Deduced a trap composed of 74 places in 413 ms of which 6 ms to minimize.
[2024-06-01 17:22:27] [INFO ] Deduced a trap composed of 65 places in 486 ms of which 7 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1480 variables, 5/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1480 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1480 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1480/1480 variables, and 829 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7755 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 593/593 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 8611ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 76 ms.
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 16 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 593/593 places, 1007/1007 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 16 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
[2024-06-01 17:22:29] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-06-01 17:22:29] [INFO ] Invariant cache hit.
[2024-06-01 17:22:29] [INFO ] Implicit Places using invariants in 434 ms returned []
[2024-06-01 17:22:29] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-06-01 17:22:29] [INFO ] Invariant cache hit.
[2024-06-01 17:22:30] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 17:22:31] [INFO ] Implicit Places using invariants and state equation in 1597 ms returned []
Implicit Place search using SMT with State Equation took 2033 ms to find 0 implicit places.
[2024-06-01 17:22:31] [INFO ] Redundant transitions in 10 ms returned []
Running 1001 sub problems to find dead transitions.
[2024-06-01 17:22:31] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-06-01 17:22:31] [INFO ] Invariant cache hit.
[2024-06-01 17:22:31] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-06-01 17:22:47] [INFO ] Deduced a trap composed of 74 places in 608 ms of which 8 ms to minimize.
[2024-06-01 17:22:47] [INFO ] Deduced a trap composed of 35 places in 523 ms of which 7 ms to minimize.
[2024-06-01 17:22:48] [INFO ] Deduced a trap composed of 41 places in 540 ms of which 7 ms to minimize.
[2024-06-01 17:22:48] [INFO ] Deduced a trap composed of 55 places in 564 ms of which 8 ms to minimize.
[2024-06-01 17:22:49] [INFO ] Deduced a trap composed of 38 places in 543 ms of which 8 ms to minimize.
[2024-06-01 17:22:50] [INFO ] Deduced a trap composed of 29 places in 548 ms of which 8 ms to minimize.
[2024-06-01 17:22:50] [INFO ] Deduced a trap composed of 17 places in 528 ms of which 8 ms to minimize.
[2024-06-01 17:22:51] [INFO ] Deduced a trap composed of 82 places in 491 ms of which 7 ms to minimize.
[2024-06-01 17:22:51] [INFO ] Deduced a trap composed of 53 places in 505 ms of which 7 ms to minimize.
[2024-06-01 17:22:52] [INFO ] Deduced a trap composed of 16 places in 484 ms of which 7 ms to minimize.
[2024-06-01 17:22:52] [INFO ] Deduced a trap composed of 29 places in 461 ms of which 6 ms to minimize.
[2024-06-01 17:22:53] [INFO ] Deduced a trap composed of 29 places in 481 ms of which 7 ms to minimize.
[2024-06-01 17:22:53] [INFO ] Deduced a trap composed of 16 places in 483 ms of which 7 ms to minimize.
[2024-06-01 17:22:54] [INFO ] Deduced a trap composed of 30 places in 514 ms of which 7 ms to minimize.
[2024-06-01 17:22:54] [INFO ] Deduced a trap composed of 24 places in 493 ms of which 8 ms to minimize.
[2024-06-01 17:22:55] [INFO ] Deduced a trap composed of 29 places in 453 ms of which 7 ms to minimize.
[2024-06-01 17:22:55] [INFO ] Deduced a trap composed of 29 places in 483 ms of which 7 ms to minimize.
[2024-06-01 17:22:56] [INFO ] Deduced a trap composed of 26 places in 513 ms of which 7 ms to minimize.
[2024-06-01 17:22:56] [INFO ] Deduced a trap composed of 32 places in 354 ms of which 5 ms to minimize.
[2024-06-01 17:22:56] [INFO ] Deduced a trap composed of 11 places in 386 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/593 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-06-01 17:22:57] [INFO ] Deduced a trap composed of 53 places in 426 ms of which 6 ms to minimize.
[2024-06-01 17:22:58] [INFO ] Deduced a trap composed of 14 places in 408 ms of which 6 ms to minimize.
[2024-06-01 17:22:58] [INFO ] Deduced a trap composed of 20 places in 482 ms of which 7 ms to minimize.
[2024-06-01 17:22:59] [INFO ] Deduced a trap composed of 105 places in 367 ms of which 5 ms to minimize.
[2024-06-01 17:22:59] [INFO ] Deduced a trap composed of 44 places in 521 ms of which 7 ms to minimize.
[2024-06-01 17:23:00] [INFO ] Deduced a trap composed of 14 places in 479 ms of which 7 ms to minimize.
[2024-06-01 17:23:00] [INFO ] Deduced a trap composed of 85 places in 304 ms of which 4 ms to minimize.
[2024-06-01 17:23:01] [INFO ] Deduced a trap composed of 105 places in 412 ms of which 7 ms to minimize.
[2024-06-01 17:23:01] [INFO ] Deduced a trap composed of 59 places in 431 ms of which 6 ms to minimize.
SMT process timed out in 30453ms, After SMT, problems are : Problem set: 0 solved, 1001 unsolved
Search for dead transitions found 0 dead transitions in 30464ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32532 ms. Remains : 593/593 places, 1007/1007 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 593 transition count 887
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 1 with 250 rules applied. Total rules applied 370 place count 468 transition count 762
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -264
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 1 with 78 rules applied. Total rules applied 448 place count 426 transition count 1026
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 460 place count 420 transition count 1020
Graph (trivial) has 110 edges and 420 vertex of which 30 / 420 are part of one of the 6 SCC in 0 ms
Free SCC test removed 24 places
Iterating global reduction 1 with 1 rules applied. Total rules applied 461 place count 396 transition count 1020
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 491 place count 396 transition count 990
Drop transitions (Redundant composition of simpler transitions.) removed 300 transitions
Redundant transition composition rules discarded 300 transitions
Iterating global reduction 2 with 300 rules applied. Total rules applied 791 place count 396 transition count 690
Graph (complete) has 720 edges and 396 vertex of which 366 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 1 rules applied. Total rules applied 792 place count 366 transition count 690
Drop transitions (Empty/Sink Transition effects.) removed 150 transitions
Reduce isomorphic transitions removed 150 transitions.
Iterating post reduction 3 with 150 rules applied. Total rules applied 942 place count 366 transition count 540
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 947 place count 366 transition count 535
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 952 place count 361 transition count 535
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 5 with 25 rules applied. Total rules applied 977 place count 361 transition count 510
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 1002 place count 336 transition count 510
Applied a total of 1002 rules in 100 ms. Remains 336 /593 variables (removed 257) and now considering 510/1007 (removed 497) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 510 rows 336 cols
[2024-06-01 17:23:01] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 17:23:01] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-06-01 17:23:02] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 17:23:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-01 17:23:02] [INFO ] After 722ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 17:23:03] [INFO ] After 1182ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 17:23:03] [INFO ] After 1758ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 2059 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 210 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 348 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 312 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
[2024-06-01 17:23:04] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
// Phase 1: matrix 887 rows 593 cols
[2024-06-01 17:23:04] [INFO ] Computed 17 invariants in 7 ms
Proved EG true
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p0) p1))), true]
Knowledge based reduction with 1 factoid took 244 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 428 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 348 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Product exploration explored 100000 steps with 1 reset in 613 ms.
Product exploration explored 100000 steps with 4 reset in 609 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 237 ms :[true, true, true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 10 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
[2024-06-01 17:23:08] [INFO ] Redundant transitions in 17 ms returned []
Running 1001 sub problems to find dead transitions.
[2024-06-01 17:23:08] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-06-01 17:23:08] [INFO ] Invariant cache hit.
[2024-06-01 17:23:08] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-06-01 17:23:27] [INFO ] Deduced a trap composed of 74 places in 582 ms of which 8 ms to minimize.
[2024-06-01 17:23:28] [INFO ] Deduced a trap composed of 35 places in 531 ms of which 7 ms to minimize.
[2024-06-01 17:23:28] [INFO ] Deduced a trap composed of 41 places in 578 ms of which 7 ms to minimize.
[2024-06-01 17:23:29] [INFO ] Deduced a trap composed of 55 places in 569 ms of which 8 ms to minimize.
[2024-06-01 17:23:29] [INFO ] Deduced a trap composed of 38 places in 566 ms of which 8 ms to minimize.
[2024-06-01 17:23:30] [INFO ] Deduced a trap composed of 29 places in 581 ms of which 8 ms to minimize.
[2024-06-01 17:23:30] [INFO ] Deduced a trap composed of 17 places in 349 ms of which 5 ms to minimize.
[2024-06-01 17:23:31] [INFO ] Deduced a trap composed of 82 places in 320 ms of which 5 ms to minimize.
[2024-06-01 17:23:31] [INFO ] Deduced a trap composed of 53 places in 249 ms of which 5 ms to minimize.
[2024-06-01 17:23:31] [INFO ] Deduced a trap composed of 16 places in 363 ms of which 6 ms to minimize.
[2024-06-01 17:23:32] [INFO ] Deduced a trap composed of 29 places in 380 ms of which 5 ms to minimize.
[2024-06-01 17:23:32] [INFO ] Deduced a trap composed of 29 places in 380 ms of which 4 ms to minimize.
[2024-06-01 17:23:32] [INFO ] Deduced a trap composed of 16 places in 338 ms of which 4 ms to minimize.
[2024-06-01 17:23:33] [INFO ] Deduced a trap composed of 30 places in 361 ms of which 4 ms to minimize.
[2024-06-01 17:23:33] [INFO ] Deduced a trap composed of 24 places in 361 ms of which 5 ms to minimize.
[2024-06-01 17:23:33] [INFO ] Deduced a trap composed of 29 places in 386 ms of which 7 ms to minimize.
[2024-06-01 17:23:34] [INFO ] Deduced a trap composed of 29 places in 461 ms of which 7 ms to minimize.
[2024-06-01 17:23:34] [INFO ] Deduced a trap composed of 26 places in 374 ms of which 5 ms to minimize.
[2024-06-01 17:23:35] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 4 ms to minimize.
[2024-06-01 17:23:35] [INFO ] Deduced a trap composed of 11 places in 239 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/593 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-06-01 17:23:36] [INFO ] Deduced a trap composed of 53 places in 255 ms of which 3 ms to minimize.
[2024-06-01 17:23:36] [INFO ] Deduced a trap composed of 14 places in 319 ms of which 4 ms to minimize.
[2024-06-01 17:23:36] [INFO ] Deduced a trap composed of 20 places in 339 ms of which 5 ms to minimize.
[2024-06-01 17:23:37] [INFO ] Deduced a trap composed of 105 places in 363 ms of which 6 ms to minimize.
[2024-06-01 17:23:37] [INFO ] Deduced a trap composed of 44 places in 375 ms of which 5 ms to minimize.
[2024-06-01 17:23:38] [INFO ] Deduced a trap composed of 14 places in 331 ms of which 5 ms to minimize.
[2024-06-01 17:23:38] [INFO ] Deduced a trap composed of 85 places in 168 ms of which 3 ms to minimize.
[2024-06-01 17:23:38] [INFO ] Deduced a trap composed of 105 places in 251 ms of which 4 ms to minimize.
[2024-06-01 17:23:38] [INFO ] Deduced a trap composed of 59 places in 262 ms of which 4 ms to minimize.
[2024-06-01 17:23:39] [INFO ] Deduced a trap composed of 95 places in 213 ms of which 3 ms to minimize.
SMT process timed out in 30622ms, After SMT, problems are : Problem set: 0 solved, 1001 unsolved
Search for dead transitions found 0 dead transitions in 30642ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30678 ms. Remains : 593/593 places, 1007/1007 transitions.
Support contains 180 out of 593 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 593/593 places, 1007/1007 transitions.
Applied a total of 0 rules in 5 ms. Remains 593 /593 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
[2024-06-01 17:23:39] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-06-01 17:23:39] [INFO ] Invariant cache hit.
[2024-06-01 17:23:39] [INFO ] Implicit Places using invariants in 377 ms returned []
[2024-06-01 17:23:39] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-06-01 17:23:39] [INFO ] Invariant cache hit.
[2024-06-01 17:23:39] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 17:23:41] [INFO ] Implicit Places using invariants and state equation in 1622 ms returned []
Implicit Place search using SMT with State Equation took 2003 ms to find 0 implicit places.
Running 1001 sub problems to find dead transitions.
[2024-06-01 17:23:41] [INFO ] Flow matrix only has 887 transitions (discarded 120 similar events)
[2024-06-01 17:23:41] [INFO ] Invariant cache hit.
[2024-06-01 17:23:41] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-06-01 17:23:58] [INFO ] Deduced a trap composed of 74 places in 544 ms of which 8 ms to minimize.
[2024-06-01 17:23:58] [INFO ] Deduced a trap composed of 35 places in 541 ms of which 8 ms to minimize.
[2024-06-01 17:23:59] [INFO ] Deduced a trap composed of 41 places in 544 ms of which 7 ms to minimize.
[2024-06-01 17:23:59] [INFO ] Deduced a trap composed of 55 places in 588 ms of which 7 ms to minimize.
[2024-06-01 17:24:00] [INFO ] Deduced a trap composed of 38 places in 537 ms of which 7 ms to minimize.
[2024-06-01 17:24:01] [INFO ] Deduced a trap composed of 29 places in 568 ms of which 9 ms to minimize.
[2024-06-01 17:24:01] [INFO ] Deduced a trap composed of 17 places in 529 ms of which 8 ms to minimize.
[2024-06-01 17:24:02] [INFO ] Deduced a trap composed of 82 places in 498 ms of which 7 ms to minimize.
[2024-06-01 17:24:02] [INFO ] Deduced a trap composed of 53 places in 513 ms of which 7 ms to minimize.
[2024-06-01 17:24:03] [INFO ] Deduced a trap composed of 16 places in 484 ms of which 7 ms to minimize.
[2024-06-01 17:24:03] [INFO ] Deduced a trap composed of 29 places in 545 ms of which 7 ms to minimize.
[2024-06-01 17:24:04] [INFO ] Deduced a trap composed of 29 places in 486 ms of which 7 ms to minimize.
[2024-06-01 17:24:04] [INFO ] Deduced a trap composed of 16 places in 488 ms of which 7 ms to minimize.
[2024-06-01 17:24:05] [INFO ] Deduced a trap composed of 30 places in 530 ms of which 7 ms to minimize.
[2024-06-01 17:24:05] [INFO ] Deduced a trap composed of 24 places in 577 ms of which 7 ms to minimize.
[2024-06-01 17:24:06] [INFO ] Deduced a trap composed of 29 places in 503 ms of which 8 ms to minimize.
[2024-06-01 17:24:07] [INFO ] Deduced a trap composed of 29 places in 552 ms of which 8 ms to minimize.
[2024-06-01 17:24:07] [INFO ] Deduced a trap composed of 26 places in 444 ms of which 7 ms to minimize.
[2024-06-01 17:24:07] [INFO ] Deduced a trap composed of 32 places in 408 ms of which 6 ms to minimize.
[2024-06-01 17:24:08] [INFO ] Deduced a trap composed of 11 places in 381 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/593 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-06-01 17:24:09] [INFO ] Deduced a trap composed of 53 places in 242 ms of which 4 ms to minimize.
[2024-06-01 17:24:09] [INFO ] Deduced a trap composed of 14 places in 347 ms of which 7 ms to minimize.
[2024-06-01 17:24:10] [INFO ] Deduced a trap composed of 20 places in 548 ms of which 7 ms to minimize.
[2024-06-01 17:24:10] [INFO ] Deduced a trap composed of 105 places in 428 ms of which 7 ms to minimize.
[2024-06-01 17:24:11] [INFO ] Deduced a trap composed of 44 places in 548 ms of which 7 ms to minimize.
[2024-06-01 17:24:11] [INFO ] Deduced a trap composed of 14 places in 527 ms of which 7 ms to minimize.
SMT process timed out in 30771ms, After SMT, problems are : Problem set: 0 solved, 1001 unsolved
Search for dead transitions found 0 dead transitions in 30782ms
Finished structural reductions in LTL mode , in 1 iterations and 32792 ms. Remains : 593/593 places, 1007/1007 transitions.
Treatment of property Peterson-COL-5-LTLFireability-02 finished in 240463 ms.
[2024-06-01 17:24:12] [INFO ] Flatten gal took : 100 ms
[2024-06-01 17:24:12] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 6 ms.
[2024-06-01 17:24:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 834 places, 1242 transitions and 3828 arcs took 17 ms.
Total runtime 779193 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : Peterson-COL-5-LTLFireability-02

BK_STOP 1717262653446

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name Peterson-COL-5-LTLFireability-02
ltl formula formula --ltl=/tmp/3888/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 834 places, 1242 transitions and 3828 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.210 real 0.040 user 0.080 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3888/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3888/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3888/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3888/ltl_0_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size

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="Peterson-COL-5"
export BK_EXAMINATION="LTLFireability"
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 Peterson-COL-5, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r512-smll-171654407200228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-5.tgz
mv Peterson-COL-5 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;