Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 9.2K Apr 13 01:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 13 01:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 13 01:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 13 01:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 13 01:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 13 01:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 01:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 13 01:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 39K May 18 16:42 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 BridgeAndVehicles-COL-V20P10N10-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717217821900

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V20P10N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:57:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 04:57:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:57:03] [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 04:57:03] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 04:57:04] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 946 ms
[2024-06-01 04:57:04] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 68 PT places and 19578.0 transition bindings in 40 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 04:57:04] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 8 ms.
[2024-06-01 04:57:04] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12 stabilizing places and 6 stable transitions
Graph (complete) has 51 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Remains 12 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
RANDOM walk for 40000 steps (8 resets) in 1318 ms. (30 steps per ms) remains 2/17 properties
BEST_FIRST walk for 40002 steps (8 resets) in 523 ms. (76 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 526 ms. (75 steps per ms) remains 1/2 properties
// Phase 1: matrix 10 rows 12 cols
[2024-06-01 04:57:05] [INFO ] Computed 4 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp0 is UNSAT
After SMT solving in domain Real declared 3/22 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 1/4 constraints, State Equation: 0/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 195ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
[2024-06-01 04:57:05] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-06-01 04:57:05] [INFO ] Flatten gal took : 16 ms
[2024-06-01 04:57:05] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 04:57:05] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD $cA 1) 21)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 21) 21) 21)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-06-01 04:57:05] [INFO ] Unfolded HLPN to a Petri net with 68 places and 548 transitions 4070 arcs in 34 ms.
[2024-06-01 04:57:05] [INFO ] Unfolded 6 HLPN properties in 1 ms.
Support contains 12 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Applied a total of 0 rules in 18 ms. Remains 68 /68 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Running 545 sub problems to find dead transitions.
[2024-06-01 04:57:06] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2024-06-01 04:57:06] [INFO ] Computed 7 invariants in 11 ms
[2024-06-01 04:57:06] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2024-06-01 04:57:08] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 9 ms to minimize.
[2024-06-01 04:57:09] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
[2024-06-01 04:57:10] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 4 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 3/8 constraints. Problems are: Problem set: 40 solved, 505 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 40 solved, 505 unsolved
At refinement iteration 3 (OVERLAPS) 2/68 variables, 2/10 constraints. Problems are: Problem set: 40 solved, 505 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/10 constraints. Problems are: Problem set: 40 solved, 505 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD65 is UNSAT
At refinement iteration 5 (OVERLAPS) 130/198 variables, 68/78 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 22/100 constraints. Problems are: Problem set: 42 solved, 503 unsolved
[2024-06-01 04:57:19] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 1/101 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/101 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 9 (OVERLAPS) 0/198 variables, 0/101 constraints. Problems are: Problem set: 42 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 101 constraints, problems are : Problem set: 42 solved, 503 unsolved in 18537 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 68/68 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 545/545 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 42 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 5/5 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 3/8 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 3 (OVERLAPS) 2/68 variables, 2/10 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/11 constraints. Problems are: Problem set: 42 solved, 503 unsolved
[2024-06-01 04:57:28] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 1/12 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/12 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 130/198 variables, 68/80 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 22/102 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 503/605 constraints. Problems are: Problem set: 42 solved, 503 unsolved
[2024-06-01 04:57:38] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 1/606 constraints. Problems are: Problem set: 42 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 198/198 variables, and 606 constraints, problems are : Problem set: 42 solved, 503 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 68/68 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 503/545 constraints, Known Traps: 6/6 constraints]
After SMT, in 40005ms problems are : Problem set: 42 solved, 503 unsolved
Search for dead transitions found 42 dead transitions in 40025ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 42 transitions.
[2024-06-01 04:57:46] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
// Phase 1: matrix 126 rows 68 cols
[2024-06-01 04:57:46] [INFO ] Computed 9 invariants in 4 ms
[2024-06-01 04:57:46] [INFO ] Implicit Places using invariants in 135 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 142 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 67/68 places, 506/548 transitions.
Applied a total of 0 rules in 13 ms. Remains 67 /67 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40217 ms. Remains : 67/68 places, 506/548 transitions.
Support contains 12 out of 67 places after structural reductions.
[2024-06-01 04:57:46] [INFO ] Flatten gal took : 68 ms
[2024-06-01 04:57:46] [INFO ] Flatten gal took : 51 ms
[2024-06-01 04:57:46] [INFO ] Input system was already deterministic with 506 transitions.
Support contains 11 out of 67 places (down from 12) after GAL structural reductions.
RANDOM walk for 40000 steps (224 resets) in 1144 ms. (34 steps per ms) remains 1/14 properties
BEST_FIRST walk for 666 steps (0 resets) in 4 ms. (133 steps per ms) remains 0/1 properties
Computed a total of 50 stabilizing places and 82 stable transitions
Graph (complete) has 1096 edges and 67 vertex of which 65 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 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(p0)||G(p1)) U (p2&&X(p3)&&F(p0)))))'
Support contains 8 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 506/506 transitions.
Applied a total of 0 rules in 5 ms. Remains 67 /67 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Running 503 sub problems to find dead transitions.
[2024-06-01 04:57:47] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
// Phase 1: matrix 126 rows 67 cols
[2024-06-01 04:57:47] [INFO ] Computed 8 invariants in 10 ms
[2024-06-01 04:57:47] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 04:57:49] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 04:57:53] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 1 ms to minimize.
[2024-06-01 04:57:53] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/78 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 04:57:57] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 99 constraints, problems are : Problem set: 0 solved, 503 unsolved in 15792 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 503/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 04:58:12] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 04:58:23] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 193/193 variables, and 604 constraints, problems are : Problem set: 0 solved, 503 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 6/6 constraints]
After SMT, in 36808ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 36814ms
[2024-06-01 04:58:23] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 04:58:23] [INFO ] Invariant cache hit.
[2024-06-01 04:58:24] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-01 04:58:24] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 04:58:24] [INFO ] Invariant cache hit.
[2024-06-01 04:58:24] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 04:58:24] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Running 503 sub problems to find dead transitions.
[2024-06-01 04:58:24] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 04:58:24] [INFO ] Invariant cache hit.
[2024-06-01 04:58:24] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 04:58:26] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 04:58:29] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 0 ms to minimize.
[2024-06-01 04:58:29] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/78 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 04:58:33] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 99 constraints, problems are : Problem set: 0 solved, 503 unsolved in 13272 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 503/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 04:58:51] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 04:58:58] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 193/193 variables, and 604 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 6/6 constraints]
After SMT, in 44174ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 44181ms
Finished structural reductions in LTL mode , in 1 iterations and 81320 ms. Remains : 67/67 places, 506/506 transitions.
Stuttering acceptance computed with spot in 604 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3)), true, (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N10-LTLCardinality-05
Product exploration explored 100000 steps with 30411 reset in 518 ms.
Product exploration explored 100000 steps with 30394 reset in 426 ms.
Computed a total of 50 stabilizing places and 82 stable transitions
Graph (complete) has 1096 edges and 67 vertex of which 65 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Computed a total of 50 stabilizing places and 82 stable transitions
Detected a total of 50/67 stabilizing places and 82/506 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0 p3), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X (AND p2 p1)), (X p0), (X p1), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p2 p1))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p2 p1 (NOT p3)))), (X (X (NOT (AND p2 p1 (NOT p3)))))]
Knowledge based reduction with 30 factoid took 1165 ms. Reduced automaton from 10 states, 25 edges and 4 AP (stutter sensitive) to 10 states, 25 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 430 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3)), true, (NOT p1)]
RANDOM walk for 40000 steps (224 resets) in 783 ms. (51 steps per ms) remains 8/21 properties
BEST_FIRST walk for 1175 steps (0 resets) in 13 ms. (83 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND p2 p1 p0 p3), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X (AND p2 p1)), (X p0), (X p1), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p2 p1))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p2 p1 (NOT p3)))), (X (X (NOT (AND p2 p1 (NOT p3))))), (F (NOT p2)), (F (NOT (OR p1 p2 p3))), (F (NOT (OR p2 p3))), (F (NOT (OR (NOT p2) p3))), (F (NOT (OR p1 p0))), (F (NOT (OR p1 (NOT p2) p3))), (F (NOT (OR p1 p2))), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p0 p3))), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT (OR (NOT p1) (NOT p2) p3))), (F (NOT p1)), (F (NOT p3)), (F (NOT p0)), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 p0 p3))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (AND p1 p2))), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR (NOT p1) p0 p3))), (F (NOT (OR (NOT p2) p0 p3)))]
Knowledge based reduction with 30 factoid took 3287 ms. Reduced automaton from 10 states, 25 edges and 4 AP (stutter sensitive) to 10 states, 25 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 402 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3)), true, (NOT p1)]
Stuttering acceptance computed with spot in 365 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3)), true, (NOT p1)]
Support contains 8 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 506/506 transitions.
Applied a total of 0 rules in 5 ms. Remains 67 /67 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Running 503 sub problems to find dead transitions.
[2024-06-01 04:59:16] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 04:59:16] [INFO ] Invariant cache hit.
[2024-06-01 04:59:16] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 04:59:18] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 04:59:21] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2024-06-01 04:59:21] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/78 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 04:59:25] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 99 constraints, problems are : Problem set: 0 solved, 503 unsolved in 14656 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 503/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 04:59:43] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 04:59:50] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 193/193 variables, and 604 constraints, problems are : Problem set: 0 solved, 503 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 6/6 constraints]
After SMT, in 35618ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 35625ms
[2024-06-01 04:59:51] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 04:59:51] [INFO ] Invariant cache hit.
[2024-06-01 04:59:51] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-01 04:59:51] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 04:59:51] [INFO ] Invariant cache hit.
[2024-06-01 04:59:51] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 04:59:51] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Running 503 sub problems to find dead transitions.
[2024-06-01 04:59:51] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 04:59:51] [INFO ] Invariant cache hit.
[2024-06-01 04:59:51] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 04:59:53] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 04:59:57] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
[2024-06-01 04:59:57] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/78 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:00:01] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 99 constraints, problems are : Problem set: 0 solved, 503 unsolved in 14017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 503/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:00:18] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:00:25] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 193/193 variables, and 604 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 6/6 constraints]
After SMT, in 44777ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 44782ms
Finished structural reductions in LTL mode , in 1 iterations and 80762 ms. Remains : 67/67 places, 506/506 transitions.
Computed a total of 50 stabilizing places and 82 stable transitions
Graph (complete) has 1096 edges and 67 vertex of which 65 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 50 stabilizing places and 82 stable transitions
Detected a total of 50/67 stabilizing places and 82/506 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0 p3), (X (AND p1 p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p2)))), (X p2), (X (NOT (AND p2 (NOT p0)))), (X p0), (X p1), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p1 p2 (NOT p3)))), (X (X (NOT (AND p1 p2 (NOT p3)))))]
Knowledge based reduction with 30 factoid took 949 ms. Reduced automaton from 10 states, 25 edges and 4 AP (stutter sensitive) to 10 states, 25 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 436 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3)), true, (NOT p1)]
RANDOM walk for 40000 steps (224 resets) in 617 ms. (64 steps per ms) remains 8/21 properties
BEST_FIRST walk for 1189 steps (0 resets) in 9 ms. (118 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND p2 p1 p0 p3), (X (AND p1 p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p2)))), (X p2), (X (NOT (AND p2 (NOT p0)))), (X p0), (X p1), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p1 p2 (NOT p3)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (F (NOT p2)), (F (NOT (OR p1 p2 p3))), (F (NOT (OR p2 p3))), (F (NOT (OR (NOT p2) p3))), (F (NOT (OR p1 p0))), (F (NOT (OR p1 (NOT p2) p3))), (F (NOT (OR p1 p2))), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p0 p3))), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT (OR (NOT p1) (NOT p2) p3))), (F (NOT p1)), (F (NOT p3)), (F (NOT p0)), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 p0 p3))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (AND p1 p2))), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR (NOT p1) p0 p3))), (F (NOT (OR (NOT p2) p0 p3)))]
Knowledge based reduction with 30 factoid took 3081 ms. Reduced automaton from 10 states, 25 edges and 4 AP (stutter sensitive) to 10 states, 25 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 475 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3)), true, (NOT p1)]
Stuttering acceptance computed with spot in 394 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3)), true, (NOT p1)]
Stuttering acceptance computed with spot in 409 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3)), true, (NOT p1)]
Product exploration explored 100000 steps with 30466 reset in 257 ms.
Product exploration explored 100000 steps with 30421 reset in 268 ms.
Applying partial POR strategy [false, false, true, true, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 408 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3)), true, (NOT p1)]
Support contains 8 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 506/506 transitions.
Applied a total of 0 rules in 40 ms. Remains 67 /67 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Running 503 sub problems to find dead transitions.
[2024-06-01 05:00:44] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:00:44] [INFO ] Invariant cache hit.
[2024-06-01 05:00:44] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:00:46] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:00:49] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2024-06-01 05:00:49] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 13 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/78 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:00:53] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 99 constraints, problems are : Problem set: 0 solved, 503 unsolved in 13801 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 503/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:01:10] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 13 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:01:17] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 193/193 variables, and 604 constraints, problems are : Problem set: 0 solved, 503 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 6/6 constraints]
After SMT, in 34622ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 34627ms
[2024-06-01 05:01:18] [INFO ] Redundant transitions in 43 ms returned []
Running 503 sub problems to find dead transitions.
[2024-06-01 05:01:18] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:01:18] [INFO ] Invariant cache hit.
[2024-06-01 05:01:18] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:01:20] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:01:24] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 0 ms to minimize.
[2024-06-01 05:01:24] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/78 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:01:27] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 99 constraints, problems are : Problem set: 0 solved, 503 unsolved in 13948 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 503/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:01:45] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:01:51] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 193/193 variables, and 604 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 6/6 constraints]
After SMT, in 44994ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 45002ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 79737 ms. Remains : 67/67 places, 506/506 transitions.
Support contains 8 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 506/506 transitions.
Applied a total of 0 rules in 5 ms. Remains 67 /67 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Running 503 sub problems to find dead transitions.
[2024-06-01 05:02:03] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:02:03] [INFO ] Invariant cache hit.
[2024-06-01 05:02:03] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:02:05] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:02:09] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 0 ms to minimize.
[2024-06-01 05:02:09] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/78 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:02:12] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 99 constraints, problems are : Problem set: 0 solved, 503 unsolved in 14057 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 503/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:02:30] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:02:37] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 193/193 variables, and 604 constraints, problems are : Problem set: 0 solved, 503 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 6/6 constraints]
After SMT, in 34869ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 34877ms
[2024-06-01 05:02:38] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:02:38] [INFO ] Invariant cache hit.
[2024-06-01 05:02:38] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 05:02:38] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:02:38] [INFO ] Invariant cache hit.
[2024-06-01 05:02:38] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:02:38] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 503 sub problems to find dead transitions.
[2024-06-01 05:02:38] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:02:38] [INFO ] Invariant cache hit.
[2024-06-01 05:02:38] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:02:41] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:02:45] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2024-06-01 05:02:45] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/78 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:02:49] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 99 constraints, problems are : Problem set: 0 solved, 503 unsolved in 15678 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 503/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:03:06] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:03:13] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 193/193 variables, and 604 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 6/6 constraints]
After SMT, in 46920ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 46925ms
Finished structural reductions in LTL mode , in 1 iterations and 82060 ms. Remains : 67/67 places, 506/506 transitions.
Treatment of property BridgeAndVehicles-COL-V20P10N10-LTLCardinality-05 finished in 338887 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)||F(p1)))'
Support contains 7 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 506/506 transitions.
Applied a total of 0 rules in 22 ms. Remains 67 /67 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Running 503 sub problems to find dead transitions.
[2024-06-01 05:03:25] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:03:25] [INFO ] Invariant cache hit.
[2024-06-01 05:03:25] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:03:27] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:03:31] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 1 ms to minimize.
[2024-06-01 05:03:31] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/78 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:03:35] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 99 constraints, problems are : Problem set: 0 solved, 503 unsolved in 14310 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 503/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:03:52] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:03:59] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 193/193 variables, and 604 constraints, problems are : Problem set: 0 solved, 503 unsolved in 20012 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 6/6 constraints]
After SMT, in 35180ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 35186ms
[2024-06-01 05:04:01] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:04:01] [INFO ] Invariant cache hit.
[2024-06-01 05:04:01] [INFO ] Implicit Places using invariants in 120 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 135 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/67 places, 506/506 transitions.
Applied a total of 0 rules in 14 ms. Remains 66 /66 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 35371 ms. Remains : 66/67 places, 506/506 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N10-LTLCardinality-06
Product exploration explored 100000 steps with 1414 reset in 350 ms.
Product exploration explored 100000 steps with 1425 reset in 212 ms.
Computed a total of 49 stabilizing places and 82 stable transitions
Graph (complete) has 1053 edges and 66 vertex of which 64 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 ms
Computed a total of 49 stabilizing places and 82 stable transitions
Detected a total of 49/66 stabilizing places and 82/506 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 149 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 283 steps (0 resets) in 6 ms. (40 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 254 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 51 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 7 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 506/506 transitions.
Applied a total of 0 rules in 13 ms. Remains 66 /66 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Running 503 sub problems to find dead transitions.
[2024-06-01 05:04:02] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
// Phase 1: matrix 126 rows 66 cols
[2024-06-01 05:04:02] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 05:04:02] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:04:04] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (OVERLAPS) 2/66 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:04:07] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2024-06-01 05:04:07] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:04:08] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/192 variables, 66/77 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:04:12] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/192 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 98 constraints, problems are : Problem set: 0 solved, 503 unsolved in 14012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (OVERLAPS) 2/66 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (OVERLAPS) 126/192 variables, 66/78 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 503/601 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:04:26] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 192/192 variables, and 602 constraints, problems are : Problem set: 0 solved, 503 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 6/6 constraints]
After SMT, in 34950ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 34954ms
[2024-06-01 05:04:37] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:04:37] [INFO ] Invariant cache hit.
[2024-06-01 05:04:37] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-01 05:04:37] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:04:37] [INFO ] Invariant cache hit.
[2024-06-01 05:04:37] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:04:37] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2024-06-01 05:04:37] [INFO ] Redundant transitions in 11 ms returned []
Running 503 sub problems to find dead transitions.
[2024-06-01 05:04:37] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:04:37] [INFO ] Invariant cache hit.
[2024-06-01 05:04:37] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:04:39] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (OVERLAPS) 2/66 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:04:42] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 2 ms to minimize.
[2024-06-01 05:04:43] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:04:44] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/192 variables, 66/77 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:04:48] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/192 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 98 constraints, problems are : Problem set: 0 solved, 503 unsolved in 15686 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (OVERLAPS) 2/66 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (OVERLAPS) 126/192 variables, 66/78 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 503/601 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:05:02] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/192 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 602 constraints, problems are : Problem set: 0 solved, 503 unsolved in 25815 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 6/6 constraints]
After SMT, in 42254ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 42261ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 77610 ms. Remains : 66/66 places, 506/506 transitions.
Computed a total of 49 stabilizing places and 82 stable transitions
Graph (complete) has 1053 edges and 66 vertex of which 64 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 49 stabilizing places and 82 stable transitions
Detected a total of 49/66 stabilizing places and 82/506 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 189 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 520 steps (2 resets) in 9 ms. (52 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 260 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1432 reset in 226 ms.
Product exploration explored 100000 steps with 1432 reset in 214 ms.
Support contains 7 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 506/506 transitions.
Applied a total of 0 rules in 29 ms. Remains 66 /66 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Running 503 sub problems to find dead transitions.
[2024-06-01 05:05:21] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:05:21] [INFO ] Invariant cache hit.
[2024-06-01 05:05:21] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:05:23] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (OVERLAPS) 2/66 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:05:26] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 0 ms to minimize.
[2024-06-01 05:05:26] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:05:27] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/192 variables, 66/77 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:05:30] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/192 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 98 constraints, problems are : Problem set: 0 solved, 503 unsolved in 13432 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (OVERLAPS) 2/66 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (OVERLAPS) 126/192 variables, 66/78 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 503/601 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:05:42] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 192/192 variables, and 602 constraints, problems are : Problem set: 0 solved, 503 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 6/6 constraints]
After SMT, in 34436ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 34447ms
[2024-06-01 05:05:55] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:05:55] [INFO ] Invariant cache hit.
[2024-06-01 05:05:55] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-01 05:05:55] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:05:55] [INFO ] Invariant cache hit.
[2024-06-01 05:05:56] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:05:56] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2024-06-01 05:05:56] [INFO ] Redundant transitions in 4 ms returned []
Running 503 sub problems to find dead transitions.
[2024-06-01 05:05:56] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:05:56] [INFO ] Invariant cache hit.
[2024-06-01 05:05:56] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:05:57] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (OVERLAPS) 2/66 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:06:00] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 1 ms to minimize.
[2024-06-01 05:06:01] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:06:02] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/192 variables, 66/77 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:06:05] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/192 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 98 constraints, problems are : Problem set: 0 solved, 503 unsolved in 14125 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (OVERLAPS) 2/66 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (OVERLAPS) 126/192 variables, 66/78 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 503/601 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:06:18] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/192 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 602 constraints, problems are : Problem set: 0 solved, 503 unsolved in 27899 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 6/6 constraints]
After SMT, in 42727ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 42732ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 77627 ms. Remains : 66/66 places, 506/506 transitions.
Treatment of property BridgeAndVehicles-COL-V20P10N10-LTLCardinality-06 finished in 193127 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((X(p0)&&(F(p0) U p1))) U G((!p1||X(p2)))))'
Support contains 6 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 506/506 transitions.
Applied a total of 0 rules in 2 ms. Remains 67 /67 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Running 503 sub problems to find dead transitions.
[2024-06-01 05:06:39] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
// Phase 1: matrix 126 rows 67 cols
[2024-06-01 05:06:39] [INFO ] Computed 8 invariants in 3 ms
[2024-06-01 05:06:39] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:06:41] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:06:44] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 0 ms to minimize.
[2024-06-01 05:06:44] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/78 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:06:49] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 99 constraints, problems are : Problem set: 0 solved, 503 unsolved in 15562 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 503/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:07:03] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:07:14] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 193/193 variables, and 604 constraints, problems are : Problem set: 0 solved, 503 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 6/6 constraints]
After SMT, in 36434ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 36439ms
[2024-06-01 05:07:15] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:07:15] [INFO ] Invariant cache hit.
[2024-06-01 05:07:15] [INFO ] Implicit Places using invariants in 141 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 143 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/67 places, 506/506 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 36591 ms. Remains : 66/67 places, 506/506 transitions.
Stuttering acceptance computed with spot in 344 ms :[(AND p1 (NOT p2)), false, (NOT p2), (AND p0 (NOT p2)), (AND p1 p0 (NOT p2)), true, (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N10-LTLCardinality-08
Product exploration explored 100000 steps with 25047 reset in 303 ms.
Entered a terminal (fully accepting) state of product in 22158 steps with 5493 reset in 69 ms.
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P10N10-LTLCardinality-08 finished in 37345 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 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 506/506 transitions.
Graph (complete) has 1096 edges and 67 vertex of which 65 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 64 transition count 505
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 64 transition count 505
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 62 transition count 504
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 60 transition count 502
Applied a total of 10 rules in 72 ms. Remains 60 /67 variables (removed 7) and now considering 502/506 (removed 4) transitions.
[2024-06-01 05:07:16] [INFO ] Flow matrix only has 122 transitions (discarded 380 similar events)
// Phase 1: matrix 122 rows 60 cols
[2024-06-01 05:07:16] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 05:07:16] [INFO ] Implicit Places using invariants in 200 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 204 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/67 places, 502/506 transitions.
Applied a total of 0 rules in 25 ms. Remains 59 /59 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 302 ms. Remains : 59/67 places, 502/506 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N10-LTLCardinality-10
Stuttering criterion allowed to conclude after 127 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P10N10-LTLCardinality-10 finished in 422 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&&G(p1)))))'
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 506/506 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 66 transition count 506
Applied a total of 1 rules in 6 ms. Remains 66 /67 variables (removed 1) and now considering 506/506 (removed 0) transitions.
Running 503 sub problems to find dead transitions.
[2024-06-01 05:07:16] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
// Phase 1: matrix 126 rows 66 cols
[2024-06-01 05:07:16] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 05:07:16] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:07:18] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 1/66 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:07:22] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/192 variables, 66/75 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 95 constraints, problems are : Problem set: 0 solved, 503 unsolved in 12098 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 1/66 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/192 variables, 66/75 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 503/598 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:07:37] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-06-01 05:07:39] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 2/600 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 192/192 variables, and 600 constraints, problems are : Problem set: 0 solved, 503 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
After SMT, in 33058ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 33077ms
[2024-06-01 05:07:49] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:07:49] [INFO ] Invariant cache hit.
[2024-06-01 05:07:50] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-06-01 05:07:50] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:07:50] [INFO ] Invariant cache hit.
[2024-06-01 05:07:50] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:07:50] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
Running 503 sub problems to find dead transitions.
[2024-06-01 05:07:50] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:07:50] [INFO ] Invariant cache hit.
[2024-06-01 05:07:50] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:07:52] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 1/66 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:07:55] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/192 variables, 66/75 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 95 constraints, problems are : Problem set: 0 solved, 503 unsolved in 11351 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 1/66 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/192 variables, 66/75 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 503/598 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:08:17] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2024-06-01 05:08:17] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/192 variables, 2/600 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 192/192 variables, and 600 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
After SMT, in 42219ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 42224ms
Starting structural reductions in LTL mode, iteration 1 : 66/67 places, 506/506 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75679 ms. Remains : 66/67 places, 506/506 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N10-LTLCardinality-13
Product exploration explored 100000 steps with 585 reset in 307 ms.
Product exploration explored 100000 steps with 586 reset in 314 ms.
Computed a total of 49 stabilizing places and 82 stable transitions
Graph (complete) has 1095 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 49 stabilizing places and 82 stable transitions
Detected a total of 49/66 stabilizing places and 82/506 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 358 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 501 steps (0 resets) in 9 ms. (50 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 541 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
[2024-06-01 05:08:34] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:08:34] [INFO ] Invariant cache hit.
[2024-06-01 05:08:34] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 05:08:34] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 05:08:34] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-06-01 05:08:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:08:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:08:35] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 05:08:35] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-06-01 05:08:35] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:08:35] [INFO ] [Nat]Added 20 Read/Feed constraints in 50 ms returned sat
[2024-06-01 05:08:35] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 1 ms to minimize.
[2024-06-01 05:08:35] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 1 ms to minimize.
[2024-06-01 05:08:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 303 ms
[2024-06-01 05:08:35] [INFO ] Computed and/alt/rep : 48/96/48 causal constraints (skipped 75 transitions) in 20 ms.
[2024-06-01 05:08:35] [INFO ] Added : 18 causal constraints over 6 iterations in 231 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 506/506 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 65 transition count 505
Applied a total of 2 rules in 28 ms. Remains 65 /66 variables (removed 1) and now considering 505/506 (removed 1) transitions.
Running 502 sub problems to find dead transitions.
[2024-06-01 05:08:35] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
// Phase 1: matrix 125 rows 65 cols
[2024-06-01 05:08:35] [INFO ] Computed 7 invariants in 3 ms
[2024-06-01 05:08:35] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:08:37] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:08:41] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-06-01 05:08:41] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:08:45] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-06-01 05:08:45] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 97 constraints, problems are : Problem set: 0 solved, 502 unsolved in 14514 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/77 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 502/599 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 599 constraints, problems are : Problem set: 0 solved, 502 unsolved in 20008 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 5/5 constraints]
After SMT, in 35452ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 35470ms
[2024-06-01 05:09:11] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-06-01 05:09:11] [INFO ] Invariant cache hit.
[2024-06-01 05:09:11] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-01 05:09:11] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-06-01 05:09:11] [INFO ] Invariant cache hit.
[2024-06-01 05:09:11] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:09:11] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2024-06-01 05:09:11] [INFO ] Redundant transitions in 2 ms returned []
Running 502 sub problems to find dead transitions.
[2024-06-01 05:09:11] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-06-01 05:09:11] [INFO ] Invariant cache hit.
[2024-06-01 05:09:11] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:09:13] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:09:16] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 05:09:16] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:09:21] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 96 constraints, problems are : Problem set: 0 solved, 502 unsolved in 14025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 502/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 598 constraints, problems are : Problem set: 0 solved, 502 unsolved in 24998 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
After SMT, in 39806ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 39812ms
Starting structural reductions in SI_LTL mode, iteration 1 : 65/66 places, 505/506 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75608 ms. Remains : 65/66 places, 505/506 transitions.
Computed a total of 48 stabilizing places and 81 stable transitions
Graph (complete) has 1093 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 48 stabilizing places and 81 stable transitions
Detected a total of 48/65 stabilizing places and 81/505 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 371 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 552 steps (0 resets) in 7 ms. (69 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 456 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
[2024-06-01 05:09:52] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-06-01 05:09:52] [INFO ] Invariant cache hit.
[2024-06-01 05:09:52] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-01 05:09:52] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 05:09:52] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-06-01 05:09:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:09:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 05:09:52] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 05:09:52] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-06-01 05:09:52] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:09:52] [INFO ] [Nat]Added 20 Read/Feed constraints in 13 ms returned sat
[2024-06-01 05:09:53] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2024-06-01 05:09:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2024-06-01 05:09:53] [INFO ] Computed and/alt/rep : 48/96/48 causal constraints (skipped 74 transitions) in 28 ms.
[2024-06-01 05:09:53] [INFO ] Added : 21 causal constraints over 6 iterations in 171 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Product exploration explored 100000 steps with 663 reset in 365 ms.
Product exploration explored 100000 steps with 663 reset in 374 ms.
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 505/505 transitions.
Applied a total of 0 rules in 16 ms. Remains 65 /65 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Running 502 sub problems to find dead transitions.
[2024-06-01 05:09:54] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-06-01 05:09:54] [INFO ] Invariant cache hit.
[2024-06-01 05:09:54] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:09:56] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:09:59] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-01 05:09:59] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:10:04] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 96 constraints, problems are : Problem set: 0 solved, 502 unsolved in 13966 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 502/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 190/190 variables, and 598 constraints, problems are : Problem set: 0 solved, 502 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
After SMT, in 34829ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 34836ms
[2024-06-01 05:10:28] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-06-01 05:10:28] [INFO ] Invariant cache hit.
[2024-06-01 05:10:29] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-01 05:10:29] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-06-01 05:10:29] [INFO ] Invariant cache hit.
[2024-06-01 05:10:29] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:10:29] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2024-06-01 05:10:29] [INFO ] Redundant transitions in 3 ms returned []
Running 502 sub problems to find dead transitions.
[2024-06-01 05:10:29] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-06-01 05:10:29] [INFO ] Invariant cache hit.
[2024-06-01 05:10:29] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:10:31] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:10:34] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-06-01 05:10:34] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:10:39] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 96 constraints, problems are : Problem set: 0 solved, 502 unsolved in 14738 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 502/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 598 constraints, problems are : Problem set: 0 solved, 502 unsolved in 25921 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
After SMT, in 41448ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 41454ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 76635 ms. Remains : 65/65 places, 505/505 transitions.
Treatment of property BridgeAndVehicles-COL-V20P10N10-LTLCardinality-13 finished in 233970 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||G(F(!p0)))))'
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 506/506 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 66 transition count 506
Applied a total of 1 rules in 3 ms. Remains 66 /67 variables (removed 1) and now considering 506/506 (removed 0) transitions.
Running 503 sub problems to find dead transitions.
[2024-06-01 05:11:10] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
// Phase 1: matrix 126 rows 66 cols
[2024-06-01 05:11:10] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 05:11:10] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:11:12] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 1/66 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:11:16] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/192 variables, 66/75 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 95 constraints, problems are : Problem set: 0 solved, 503 unsolved in 13072 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 1/66 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/192 variables, 66/75 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 503/598 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:11:32] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2024-06-01 05:11:34] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 2/600 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 192/192 variables, and 600 constraints, problems are : Problem set: 0 solved, 503 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
After SMT, in 33955ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 33961ms
[2024-06-01 05:11:44] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:11:44] [INFO ] Invariant cache hit.
[2024-06-01 05:11:44] [INFO ] Implicit Places using invariants in 116 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 120 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 65/67 places, 506/506 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34087 ms. Remains : 65/67 places, 506/506 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), p0, (AND (NOT p1) p0), p0]
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N10-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 293 ms.
Product exploration explored 100000 steps with 50000 reset in 259 ms.
Computed a total of 48 stabilizing places and 82 stable transitions
Graph (complete) has 1052 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 48 stabilizing places and 82 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 19 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V20P10N10-LTLCardinality-14 finished in 34848 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(p0)||G(p1)) U (p2&&X(p3)&&F(p0)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
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&&G(p1)))))'
Found a Shortening insensitive property : BridgeAndVehicles-COL-V20P10N10-LTLCardinality-13
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 67/67 places, 506/506 transitions.
Graph (complete) has 1096 edges and 67 vertex of which 66 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 65 transition count 505
Applied a total of 3 rules in 18 ms. Remains 65 /67 variables (removed 2) and now considering 505/506 (removed 1) transitions.
Running 502 sub problems to find dead transitions.
[2024-06-01 05:11:46] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
// Phase 1: matrix 125 rows 65 cols
[2024-06-01 05:11:46] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 05:11:46] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:11:48] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:11:51] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-06-01 05:11:51] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:11:55] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-01 05:11:55] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 97 constraints, problems are : Problem set: 0 solved, 502 unsolved in 14082 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/77 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 502/599 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 599 constraints, problems are : Problem set: 0 solved, 502 unsolved in 20011 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 5/5 constraints]
After SMT, in 34936ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 34944ms
[2024-06-01 05:12:21] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-06-01 05:12:21] [INFO ] Invariant cache hit.
[2024-06-01 05:12:21] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-06-01 05:12:21] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-06-01 05:12:21] [INFO ] Invariant cache hit.
[2024-06-01 05:12:21] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:12:21] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Running 502 sub problems to find dead transitions.
[2024-06-01 05:12:21] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-06-01 05:12:21] [INFO ] Invariant cache hit.
[2024-06-01 05:12:21] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:12:23] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:12:27] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-06-01 05:12:27] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:12:32] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 96 constraints, problems are : Problem set: 0 solved, 502 unsolved in 14495 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 502/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 598 constraints, problems are : Problem set: 0 solved, 502 unsolved in 26531 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
After SMT, in 42059ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 42067ms
Starting structural reductions in LI_LTL mode, iteration 1 : 65/67 places, 505/506 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 77374 ms. Remains : 65/67 places, 505/506 transitions.
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N10-LTLCardinality-13
Product exploration explored 100000 steps with 663 reset in 260 ms.
Product exploration explored 100000 steps with 663 reset in 390 ms.
Computed a total of 48 stabilizing places and 81 stable transitions
Graph (complete) has 1093 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 48 stabilizing places and 81 stable transitions
Detected a total of 48/65 stabilizing places and 81/505 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 459 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 553 steps (0 resets) in 6 ms. (79 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 659 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
[2024-06-01 05:13:05] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-06-01 05:13:05] [INFO ] Invariant cache hit.
[2024-06-01 05:13:06] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:13:06] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 3 ms returned sat
[2024-06-01 05:13:06] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-06-01 05:13:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:13:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:13:06] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 05:13:06] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-06-01 05:13:06] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:13:06] [INFO ] [Nat]Added 20 Read/Feed constraints in 18 ms returned sat
[2024-06-01 05:13:06] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-06-01 05:13:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2024-06-01 05:13:06] [INFO ] Computed and/alt/rep : 48/96/48 causal constraints (skipped 74 transitions) in 31 ms.
[2024-06-01 05:13:06] [INFO ] Added : 21 causal constraints over 6 iterations in 175 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 505/505 transitions.
Applied a total of 0 rules in 22 ms. Remains 65 /65 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Running 502 sub problems to find dead transitions.
[2024-06-01 05:13:06] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-06-01 05:13:06] [INFO ] Invariant cache hit.
[2024-06-01 05:13:06] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:13:08] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:13:11] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 05:13:11] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:13:17] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 96 constraints, problems are : Problem set: 0 solved, 502 unsolved in 13687 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 502/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 190/190 variables, and 598 constraints, problems are : Problem set: 0 solved, 502 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
After SMT, in 34744ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 34752ms
[2024-06-01 05:13:41] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-06-01 05:13:41] [INFO ] Invariant cache hit.
[2024-06-01 05:13:41] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-01 05:13:41] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-06-01 05:13:41] [INFO ] Invariant cache hit.
[2024-06-01 05:13:41] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:13:41] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2024-06-01 05:13:41] [INFO ] Redundant transitions in 2 ms returned []
Running 502 sub problems to find dead transitions.
[2024-06-01 05:13:41] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-06-01 05:13:41] [INFO ] Invariant cache hit.
[2024-06-01 05:13:41] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:13:43] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:13:47] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 05:13:47] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:13:51] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 96 constraints, problems are : Problem set: 0 solved, 502 unsolved in 13366 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 502/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 598 constraints, problems are : Problem set: 0 solved, 502 unsolved in 26054 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
After SMT, in 40258ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 40263ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 75365 ms. Remains : 65/65 places, 505/505 transitions.
Computed a total of 48 stabilizing places and 81 stable transitions
Graph (complete) has 1093 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 48 stabilizing places and 81 stable transitions
Detected a total of 48/65 stabilizing places and 81/505 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 285 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 247 steps (0 resets) in 6 ms. (35 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 444 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
[2024-06-01 05:14:23] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-06-01 05:14:23] [INFO ] Invariant cache hit.
[2024-06-01 05:14:23] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:14:23] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 05:14:23] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-06-01 05:14:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:14:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 05:14:23] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 05:14:23] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-06-01 05:14:23] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:14:23] [INFO ] [Nat]Added 20 Read/Feed constraints in 17 ms returned sat
[2024-06-01 05:14:23] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2024-06-01 05:14:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2024-06-01 05:14:23] [INFO ] Computed and/alt/rep : 48/96/48 causal constraints (skipped 74 transitions) in 28 ms.
[2024-06-01 05:14:23] [INFO ] Added : 21 causal constraints over 6 iterations in 120 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Product exploration explored 100000 steps with 663 reset in 288 ms.
Product exploration explored 100000 steps with 663 reset in 276 ms.
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 505/505 transitions.
Applied a total of 0 rules in 12 ms. Remains 65 /65 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Running 502 sub problems to find dead transitions.
[2024-06-01 05:14:24] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-06-01 05:14:24] [INFO ] Invariant cache hit.
[2024-06-01 05:14:24] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:14:26] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:14:29] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-06-01 05:14:29] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:14:35] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 96 constraints, problems are : Problem set: 0 solved, 502 unsolved in 14375 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 502/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 190/190 variables, and 598 constraints, problems are : Problem set: 0 solved, 502 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
After SMT, in 35275ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 35280ms
[2024-06-01 05:14:59] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-06-01 05:14:59] [INFO ] Invariant cache hit.
[2024-06-01 05:15:00] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-06-01 05:15:00] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-06-01 05:15:00] [INFO ] Invariant cache hit.
[2024-06-01 05:15:00] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:15:00] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2024-06-01 05:15:00] [INFO ] Redundant transitions in 2 ms returned []
Running 502 sub problems to find dead transitions.
[2024-06-01 05:15:00] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-06-01 05:15:00] [INFO ] Invariant cache hit.
[2024-06-01 05:15:00] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:15:02] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:15:05] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 05:15:05] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:15:09] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 96 constraints, problems are : Problem set: 0 solved, 502 unsolved in 12914 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 502/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 598 constraints, problems are : Problem set: 0 solved, 502 unsolved in 26592 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
After SMT, in 40304ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 40309ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 75964 ms. Remains : 65/65 places, 505/505 transitions.
Treatment of property BridgeAndVehicles-COL-V20P10N10-LTLCardinality-13 finished in 234712 ms.
[2024-06-01 05:15:40] [INFO ] Flatten gal took : 42 ms
[2024-06-01 05:15:40] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 05:15:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 67 places, 506 transitions and 3702 arcs took 11 ms.
Total runtime 1117446 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-13 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717219018432

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name BridgeAndVehicles-COL-V20P10N10-LTLCardinality-05
ltl formula formula --ltl=/tmp/2499/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 67 places, 506 transitions and 3702 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.070 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2499/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2499/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2499/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2499/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 15 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 68 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 68, there are 573 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~170!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 145
pnml2lts-mc( 0/ 4): unique states count: 642
pnml2lts-mc( 0/ 4): unique transitions count: 1530
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 72
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 656
pnml2lts-mc( 0/ 4): - cum. max stack depth: 524
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 656 states 1566 transitions, fanout: 2.387
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.000 sec minimum, 0.012 sec on average)
pnml2lts-mc( 0/ 4): States per second: 32800, Transitions per second: 78300
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 31.1 B/state, compr.: 11.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 518 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name BridgeAndVehicles-COL-V20P10N10-LTLCardinality-06
ltl formula formula --ltl=/tmp/2499/ltl_1_
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
pnml2lts-mc( 0/ 4): Petri net has 67 places, 506 transitions and 3702 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.130 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2499/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2499/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2499/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2499/ltl_1_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 68 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 68, there are 509 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~136 levels ~10000 states ~21628 transitions
pnml2lts-mc( 3/ 4): ~66 levels ~20000 states ~54712 transitions
pnml2lts-mc( 3/ 4): ~66 levels ~40000 states ~120968 transitions
pnml2lts-mc( 3/ 4): ~66 levels ~80000 states ~264696 transitions
pnml2lts-mc( 3/ 4): ~125 levels ~160000 states ~442484 transitions
pnml2lts-mc( 3/ 4): ~138 levels ~320000 states ~888060 transitions
pnml2lts-mc( 3/ 4): ~138 levels ~640000 states ~1768732 transitions
pnml2lts-mc( 3/ 4): ~138 levels ~1280000 states ~3715592 transitions
pnml2lts-mc( 3/ 4): ~138 levels ~2560000 states ~7813960 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4010072
pnml2lts-mc( 0/ 4): unique states count: 4010072
pnml2lts-mc( 0/ 4): unique transitions count: 13118601
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 9258529
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4104431
pnml2lts-mc( 0/ 4): - cum. max stack depth: 556
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4104431 states 13451433 transitions, fanout: 3.277
pnml2lts-mc( 0/ 4): Total exploration time 29.170 sec (29.150 sec minimum, 29.165 sec on average)
pnml2lts-mc( 0/ 4): States per second: 140707, Transitions per second: 461139
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 31.2MB, 8.2 B/state, compr.: 3.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 11.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 518 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 31.2MB (~256.0MB paged-in)
ltl formula name BridgeAndVehicles-COL-V20P10N10-LTLCardinality-13
ltl formula formula --ltl=/tmp/2499/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 67 places, 506 transitions and 3702 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2499/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2499/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.150 real 0.040 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2499/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2499/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 67 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 68, there are 512 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~170 levels ~10000 states ~26120 transitions
pnml2lts-mc( 0/ 4): ~174 levels ~20000 states ~52376 transitions
pnml2lts-mc( 0/ 4): ~174 levels ~40000 states ~104380 transitions
pnml2lts-mc( 0/ 4): ~174 levels ~80000 states ~209840 transitions
pnml2lts-mc( 0/ 4): ~174 levels ~160000 states ~421740 transitions
pnml2lts-mc( 0/ 4): ~174 levels ~320000 states ~915368 transitions
pnml2lts-mc( 0/ 4): ~174 levels ~640000 states ~1963032 transitions
pnml2lts-mc( 0/ 4): ~174 levels ~1280000 states ~4133632 transitions
pnml2lts-mc( 0/ 4): ~174 levels ~2560000 states ~8528168 transitions
pnml2lts-mc( 0/ 4): ~174 levels ~5120000 states ~17467176 transitions
pnml2lts-mc( 0/ 4): ~174 levels ~10240000 states ~36089276 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 7492931
pnml2lts-mc( 0/ 4): unique states count: 7492931
pnml2lts-mc( 0/ 4): unique transitions count: 30174567
pnml2lts-mc( 0/ 4): - self-loop count: 20
pnml2lts-mc( 0/ 4): - claim dead count: 22791661
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 7538191
pnml2lts-mc( 0/ 4): - cum. max stack depth: 705
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7538191 states 30416129 transitions, fanout: 4.035
pnml2lts-mc( 0/ 4): Total exploration time 46.770 sec (46.760 sec minimum, 46.765 sec on average)
pnml2lts-mc( 0/ 4): States per second: 161176, Transitions per second: 650334
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 57.8MB, 8.1 B/state, compr.: 3.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 22.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 518 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 57.8MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V20P10N10.tgz
mv BridgeAndVehicles-COL-V20P10N10 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;