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-171620398800091.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-V50P50N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620398800091
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 8.4K Apr 13 02:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 13 02:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 13 02:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 13 02:25 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 3.9K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 13 02:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Apr 13 02:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 13 02:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 13 02:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:30 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 42K 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-V50P50N10-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717218707220

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-V50P50N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:11:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 05:11:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:11:48] [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 05:11:48] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 05:11:49] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 554 ms
[2024-06-01 05:11:49] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 128 PT places and 114798.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 05:11:49] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 3 ms.
[2024-06-01 05:11:49] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-14 TRUE 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.10 ms
Remains 13 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.
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.0 ms
RANDOM walk for 40000 steps (8 resets) in 1075 ms. (37 steps per ms) remains 3/21 properties
BEST_FIRST walk for 40003 steps (8 resets) in 276 ms. (144 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 280 ms. (142 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 187 ms. (212 steps per ms) remains 3/3 properties
// Phase 1: matrix 10 rows 12 cols
[2024-06-01 05:11:49] [INFO ] Computed 4 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/12 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/22 variables, 12/16 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/22 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 16 constraints, problems are : Problem set: 1 solved, 2 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/9 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 9/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/21 variables, 2/14 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 2/16 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/21 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/22 variables, 1/17 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/22 variables, 1/18 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/22 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/22 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 18 constraints, problems are : Problem set: 1 solved, 2 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 360ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 196 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=49 )
Parikh walk visited 2 properties in 9 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2024-06-01 05:11:50] [INFO ] Flatten gal took : 13 ms
[2024-06-01 05:11:50] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD $cA 1) 51)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 51) 51) 51)]] 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 05:11:50] [INFO ] Unfolded HLPN to a Petri net with 128 places and 1328 transitions 10010 arcs in 56 ms.
[2024-06-01 05:11:50] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Support contains 15 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Applied a total of 0 rules in 57 ms. Remains 128 /128 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Running 1325 sub problems to find dead transitions.
[2024-06-01 05:11:50] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2024-06-01 05:11:50] [INFO ] Computed 7 invariants in 20 ms
[2024-06-01 05:11:50] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1325 unsolved
[2024-06-01 05:12:03] [INFO ] Deduced a trap composed of 5 places in 221 ms of which 9 ms to minimize.
[2024-06-01 05:12:08] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 8 ms to minimize.
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
[2024-06-01 05:12:11] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 1 ms to minimize.
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 3/8 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/378 variables, and 8 constraints, problems are : Problem set: 100 solved, 1225 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/128 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1325/1325 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 100 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 3/8 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
At refinement iteration 3 (OVERLAPS) 2/128 variables, 2/10 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
[2024-06-01 05:12:29] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 1/11 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 128/378 variables, and 11 constraints, problems are : Problem set: 100 solved, 1225 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/128 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/1325 constraints, Known Traps: 4/4 constraints]
After SMT, in 47351ms problems are : Problem set: 100 solved, 1225 unsolved
Search for dead transitions found 100 dead transitions in 47411ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 100 transitions.
[2024-06-01 05:12:38] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
// Phase 1: matrix 248 rows 128 cols
[2024-06-01 05:12:38] [INFO ] Computed 7 invariants in 9 ms
[2024-06-01 05:12:38] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-06-01 05:12:38] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2024-06-01 05:12:38] [INFO ] Invariant cache hit.
[2024-06-01 05:12:38] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:12:38] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 128/128 places, 1228/1328 transitions.
Applied a total of 0 rules in 12 ms. Remains 128 /128 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48021 ms. Remains : 128/128 places, 1228/1328 transitions.
Support contains 15 out of 128 places after structural reductions.
[2024-06-01 05:12:38] [INFO ] Flatten gal took : 87 ms
[2024-06-01 05:12:38] [INFO ] Flatten gal took : 82 ms
[2024-06-01 05:12:38] [INFO ] Input system was already deterministic with 1228 transitions.
RANDOM walk for 40000 steps (88 resets) in 1247 ms. (32 steps per ms) remains 1/19 properties
BEST_FIRST walk for 40002 steps (32 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
[2024-06-01 05:12:39] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2024-06-01 05:12:39] [INFO ] Invariant cache hit.
[2024-06-01 05:12:39] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/213 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 150/363 variables, 106/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/365 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/365 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/376 variables, 11/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/376 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/376 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/376 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 195 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/213 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 150/363 variables, 106/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/363 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/365 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/365 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/365 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/376 variables, 11/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/376 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/376 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/376 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 156 constraints, problems are : Problem set: 0 solved, 1 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 515ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 105 ms.
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 1220 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 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 125 transition count 1227
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 125 transition count 1227
Applied a total of 3 rules in 125 ms. Remains 125 /128 variables (removed 3) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2024-06-01 05:12:40] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 125 cols
[2024-06-01 05:12:40] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 05:12:40] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 05:12:48] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/372 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 3 (OVERLAPS) 247/372 variables, 125/131 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 20/151 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 1373 constraints, problems are : Problem set: 2 solved, 1222 unsolved in 21377 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1224 constraints, Known Traps: 1/1 constraints]
After SMT, in 45555ms problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 45568ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 125/128 places, 1225/1228 transitions.
Applied a total of 0 rules in 51 ms. Remains 125 /125 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45750 ms. Remains : 125/128 places, 1225/1228 transitions.
RANDOM walk for 40000 steps (88 resets) in 366 ms. (108 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40011 steps (32 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 527461 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :0 out of 1
Probabilistic random walk after 527461 steps, saw 143836 distinct states, run finished after 3007 ms. (steps per millisecond=175 ) properties seen :0
[2024-06-01 05:13:28] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 125 cols
[2024-06-01 05:13:28] [INFO ] Computed 7 invariants in 6 ms
[2024-06-01 05:13:28] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 252/355 variables, 108/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/357 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/370 variables, 13/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/370 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/370 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 252/355 variables, 108/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/357 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/357 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 13/370 variables, 13/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/370 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/370 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 153 constraints, problems are : Problem set: 0 solved, 1 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 667ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 87 ms.
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1225/1225 transitions.
Applied a total of 0 rules in 48 ms. Remains 125 /125 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 125/125 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1225/1225 transitions.
Applied a total of 0 rules in 47 ms. Remains 125 /125 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2024-06-01 05:13:29] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:13:29] [INFO ] Invariant cache hit.
[2024-06-01 05:13:30] [INFO ] Implicit Places using invariants in 480 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 483 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 123/125 places, 1225/1225 transitions.
Applied a total of 0 rules in 59 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 589 ms. Remains : 123/125 places, 1225/1225 transitions.
RANDOM walk for 40000 steps (88 resets) in 466 ms. (85 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (32 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 490323 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :0 out of 1
Probabilistic random walk after 490323 steps, saw 133840 distinct states, run finished after 3001 ms. (steps per millisecond=163 ) properties seen :0
[2024-06-01 05:13:33] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 123 cols
[2024-06-01 05:13:33] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 05:13:33] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 250/353 variables, 106/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/355 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 13/368 variables, 13/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/368 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/368 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/368 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 250/353 variables, 106/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/355 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/368 variables, 13/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/368 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/368 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/368 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 149 constraints, problems are : Problem set: 0 solved, 1 unsolved in 379 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 583ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 161 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 59 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 123/123 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 58 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2024-06-01 05:13:34] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:13:34] [INFO ] Invariant cache hit.
[2024-06-01 05:13:34] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-06-01 05:13:34] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:13:34] [INFO ] Invariant cache hit.
[2024-06-01 05:13:34] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:13:35] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 753 ms to find 0 implicit places.
[2024-06-01 05:13:35] [INFO ] Redundant transitions in 85 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:13:35] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:13:35] [INFO ] Invariant cache hit.
[2024-06-01 05:13:35] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:13:42] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 368/368 variables, and 149 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 1222/1371 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 63885ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 63902ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64817 ms. Remains : 123/123 places, 1225/1225 transitions.
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 111 stabilizing places and 204 stable transitions
Graph (complete) has 2645 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 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))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 1228
Applied a total of 2 rules in 13 ms. Remains 126 /128 variables (removed 2) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2024-06-01 05:14:39] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
// Phase 1: matrix 248 rows 126 cols
[2024-06-01 05:14:39] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 05:14:39] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
[2024-06-01 05:14:48] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/374 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 3 (OVERLAPS) 248/374 variables, 126/132 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 20/152 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/374 variables, and 1375 constraints, problems are : Problem set: 2 solved, 1223 unsolved in 20519 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1225 constraints, Known Traps: 1/1 constraints]
After SMT, in 44811ms problems are : Problem set: 2 solved, 1223 unsolved
Search for dead transitions found 2 dead transitions in 44829ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-06-01 05:15:24] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 126 cols
[2024-06-01 05:15:24] [INFO ] Computed 7 invariants in 4 ms
[2024-06-01 05:15:24] [INFO ] Implicit Places using invariants in 237 ms returned [107]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 240 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/128 places, 1226/1228 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45092 ms. Remains : 125/128 places, 1226/1228 transitions.
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 3 steps with 1 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-01 finished in 45374 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) U G(p1)))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 2645 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 126 transition count 1227
Applied a total of 3 rules in 293 ms. Remains 126 /128 variables (removed 2) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2024-06-01 05:15:25] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 126 cols
[2024-06-01 05:15:25] [INFO ] Computed 6 invariants in 4 ms
[2024-06-01 05:15:25] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 05:15:33] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/373 variables, and 7 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 5 (OVERLAPS) 247/373 variables, 126/133 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 20/153 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 373/373 variables, and 1375 constraints, problems are : Problem set: 2 solved, 1222 unsolved in 21612 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1224 constraints, Known Traps: 1/1 constraints]
After SMT, in 46553ms problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 46569ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-06-01 05:16:11] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 126 cols
[2024-06-01 05:16:11] [INFO ] Computed 8 invariants in 6 ms
[2024-06-01 05:16:11] [INFO ] Implicit Places using invariants in 221 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 225 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/128 places, 1225/1228 transitions.
Applied a total of 0 rules in 84 ms. Remains 125 /125 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 47177 ms. Remains : 125/128 places, 1225/1228 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 162 steps with 0 reset in 7 ms.
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-02 finished in 47426 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 2645 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 79 ms. Remains 127 /128 variables (removed 1) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2024-06-01 05:16:12] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
// Phase 1: matrix 248 rows 127 cols
[2024-06-01 05:16:12] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 05:16:12] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
[2024-06-01 05:16:21] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/375 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/127 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 3 (OVERLAPS) 1/127 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 5 (OVERLAPS) 248/375 variables, 127/134 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 20/154 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 375/375 variables, and 1377 constraints, problems are : Problem set: 2 solved, 1223 unsolved in 21606 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 127/127 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1225 constraints, Known Traps: 1/1 constraints]
After SMT, in 46755ms problems are : Problem set: 2 solved, 1223 unsolved
Search for dead transitions found 2 dead transitions in 46774ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-06-01 05:16:59] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 127 cols
[2024-06-01 05:16:59] [INFO ] Computed 8 invariants in 6 ms
[2024-06-01 05:16:59] [INFO ] Implicit Places using invariants in 205 ms returned [54, 108]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 207 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/128 places, 1226/1228 transitions.
Applied a total of 0 rules in 53 ms. Remains 125 /125 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 47118 ms. Remains : 125/128 places, 1226/1228 transitions.
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-04
Stuttering criterion allowed to conclude after 421 steps with 0 reset in 6 ms.
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-04 finished in 47187 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 U (p1||G(p0))))))'
Support contains 5 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 2645 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 126 transition count 1227
Applied a total of 3 rules in 91 ms. Remains 126 /128 variables (removed 2) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2024-06-01 05:16:59] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 126 cols
[2024-06-01 05:16:59] [INFO ] Computed 6 invariants in 5 ms
[2024-06-01 05:16:59] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 05:17:07] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/373 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 05:17:34] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 126/373 variables, and 8 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/1224 constraints, Known Traps: 2/2 constraints]
After SMT, in 44998ms problems are : Problem set: 0 solved, 1224 unsolved
Search for dead transitions found 0 dead transitions in 45011ms
[2024-06-01 05:17:44] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2024-06-01 05:17:44] [INFO ] Invariant cache hit.
[2024-06-01 05:17:44] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-06-01 05:17:44] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2024-06-01 05:17:44] [INFO ] Invariant cache hit.
[2024-06-01 05:17:44] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:17:45] [INFO ] Implicit Places using invariants and state equation in 519 ms returned [54, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 722 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/128 places, 1227/1228 transitions.
Applied a total of 0 rules in 59 ms. Remains 124 /124 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 45888 ms. Remains : 124/128 places, 1227/1228 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-05
Product exploration explored 100000 steps with 3876 reset in 588 ms.
Product exploration explored 100000 steps with 3988 reset in 456 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Graph (complete) has 2434 edges and 124 vertex of which 123 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.20 ms
Computed a total of 107 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 303 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 28 steps (0 resets) in 7 ms. (3 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 378 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1227/1227 transitions.
Applied a total of 0 rules in 59 ms. Remains 124 /124 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
Running 1224 sub problems to find dead transitions.
[2024-06-01 05:17:47] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 124 cols
[2024-06-01 05:17:47] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 05:17:47] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 05:17:55] [INFO ] Deduced a trap composed of 5 places in 614 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD104 is UNSAT
At refinement iteration 3 (OVERLAPS) 247/370 variables, 123/129 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
SMT process timed out in 24458ms, After SMT, problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 24471ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-06-01 05:18:11] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 124 cols
[2024-06-01 05:18:11] [INFO ] Computed 6 invariants in 5 ms
[2024-06-01 05:18:12] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-06-01 05:18:12] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:18:12] [INFO ] Invariant cache hit.
[2024-06-01 05:18:12] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:18:12] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
[2024-06-01 05:18:12] [INFO ] Redundant transitions in 20 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 124/124 places, 1225/1227 transitions.
Applied a total of 0 rules in 70 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25102 ms. Remains : 124/124 places, 1225/1227 transitions.
Computed a total of 107 stabilizing places and 201 stable transitions
Graph (complete) has 2430 edges and 124 vertex of which 123 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 107 stabilizing places and 201 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 274 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 43 steps (0 resets) in 5 ms. (7 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 337 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3881 reset in 357 ms.
Product exploration explored 100000 steps with 3927 reset in 359 ms.
Support contains 5 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1225/1225 transitions.
Applied a total of 0 rules in 57 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:18:14] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:18:14] [INFO ] Invariant cache hit.
[2024-06-01 05:18:14] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:18:22] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/369 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 1/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:18:50] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 124/369 variables, and 8 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/1222 constraints, Known Traps: 2/2 constraints]
After SMT, in 45036ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 45048ms
[2024-06-01 05:18:59] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:18:59] [INFO ] Invariant cache hit.
[2024-06-01 05:18:59] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-06-01 05:18:59] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:18:59] [INFO ] Invariant cache hit.
[2024-06-01 05:18:59] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:18:59] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
[2024-06-01 05:18:59] [INFO ] Redundant transitions in 12 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:18:59] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:18:59] [INFO ] Invariant cache hit.
[2024-06-01 05:18:59] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:19:07] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 1/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:19:34] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/369 variables, and 8 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 1/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 6 (OVERLAPS) 245/369 variables, 124/132 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 1374 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 2/2 constraints]
After SMT, in 64757ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 64769ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 110348 ms. Remains : 124/124 places, 1225/1225 transitions.
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-05 finished in 185267 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 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 2645 edges and 128 vertex of which 126 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 125 transition count 1227
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 125 transition count 1227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 1226
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 121 transition count 1224
Applied a total of 10 rules in 100 ms. Remains 121 /128 variables (removed 7) and now considering 1224/1228 (removed 4) transitions.
[2024-06-01 05:20:04] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
// Phase 1: matrix 244 rows 121 cols
[2024-06-01 05:20:04] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 05:20:05] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-06-01 05:20:05] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
[2024-06-01 05:20:05] [INFO ] Invariant cache hit.
[2024-06-01 05:20:05] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:20:05] [INFO ] Implicit Places using invariants and state equation in 577 ms returned [52, 104]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 792 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/128 places, 1224/1228 transitions.
Applied a total of 0 rules in 50 ms. Remains 119 /119 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 942 ms. Remains : 119/128 places, 1224/1228 transitions.
Stuttering acceptance computed with spot in 61 ms :[p0, p0]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-06
Product exploration explored 100000 steps with 682 reset in 314 ms.
Product exploration explored 100000 steps with 684 reset in 290 ms.
Computed a total of 104 stabilizing places and 202 stable transitions
Computed a total of 104 stabilizing places and 202 stable transitions
Detected a total of 104/119 stabilizing places and 202/1224 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[p0, p0]
RANDOM walk for 567 steps (0 resets) in 10 ms. (51 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[p0, p0]
Stuttering acceptance computed with spot in 55 ms :[p0, p0]
[2024-06-01 05:20:06] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
// Phase 1: matrix 244 rows 119 cols
[2024-06-01 05:20:06] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 05:20:07] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 05:20:07] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2024-06-01 05:20:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:20:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 05:20:07] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2024-06-01 05:20:07] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:20:07] [INFO ] [Nat]Added 20 Read/Feed constraints in 44 ms returned sat
[2024-06-01 05:20:07] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2024-06-01 05:20:08] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 0 ms to minimize.
[2024-06-01 05:20:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 507 ms
[2024-06-01 05:20:08] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 131 transitions) in 88 ms.
[2024-06-01 05:20:08] [INFO ] Added : 12 causal constraints over 4 iterations in 229 ms. Result :sat
Could not prove EG p0
Support contains 1 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 1224/1224 transitions.
Applied a total of 0 rules in 54 ms. Remains 119 /119 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2024-06-01 05:20:08] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
[2024-06-01 05:20:08] [INFO ] Invariant cache hit.
[2024-06-01 05:20:08] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-06-01 05:20:08] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
[2024-06-01 05:20:08] [INFO ] Invariant cache hit.
[2024-06-01 05:20:08] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:20:09] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
[2024-06-01 05:20:09] [INFO ] Redundant transitions in 12 ms returned []
Running 1221 sub problems to find dead transitions.
[2024-06-01 05:20:09] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
[2024-06-01 05:20:09] [INFO ] Invariant cache hit.
[2024-06-01 05:20:09] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1221 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD101 is UNSAT
At refinement iteration 2 (OVERLAPS) 244/363 variables, 119/123 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 20/143 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
[2024-06-01 05:20:40] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 1/144 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 363/363 variables, and 144 constraints, problems are : Problem set: 2 solved, 1219 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1221/1221 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 1/5 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
At refinement iteration 3 (OVERLAPS) 244/363 variables, 119/124 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 20/144 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 1219/1363 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 363/363 variables, and 1363 constraints, problems are : Problem set: 2 solved, 1219 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1219/1221 constraints, Known Traps: 1/1 constraints]
After SMT, in 65579ms problems are : Problem set: 2 solved, 1219 unsolved
Search for dead transitions found 2 dead transitions in 65593ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 119/119 places, 1222/1224 transitions.
Applied a total of 0 rules in 80 ms. Remains 119 /119 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
[2024-06-01 05:21:14] [INFO ] Redundant transitions in 17 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 66385 ms. Remains : 119/119 places, 1222/1224 transitions.
Computed a total of 104 stabilizing places and 200 stable transitions
Computed a total of 104 stabilizing places and 200 stable transitions
Detected a total of 104/119 stabilizing places and 200/1222 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[p0, p0]
RANDOM walk for 581 steps (0 resets) in 7 ms. (72 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[p0, p0]
Stuttering acceptance computed with spot in 63 ms :[p0, p0]
[2024-06-01 05:21:15] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
// Phase 1: matrix 242 rows 119 cols
[2024-06-01 05:21:15] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 05:21:15] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-06-01 05:21:15] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2024-06-01 05:21:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:21:15] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 05:21:16] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-06-01 05:21:16] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:21:16] [INFO ] [Nat]Added 20 Read/Feed constraints in 19 ms returned sat
[2024-06-01 05:21:16] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 1 ms to minimize.
[2024-06-01 05:21:16] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 1 ms to minimize.
[2024-06-01 05:21:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 292 ms
[2024-06-01 05:21:16] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 131 transitions) in 37 ms.
[2024-06-01 05:21:16] [INFO ] Added : 12 causal constraints over 3 iterations in 111 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 47 ms :[p0, p0]
Product exploration explored 100000 steps with 682 reset in 279 ms.
Product exploration explored 100000 steps with 676 reset in 283 ms.
Support contains 1 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 1222/1222 transitions.
Applied a total of 0 rules in 44 ms. Remains 119 /119 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
[2024-06-01 05:21:17] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-06-01 05:21:17] [INFO ] Invariant cache hit.
[2024-06-01 05:21:17] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-06-01 05:21:17] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-06-01 05:21:17] [INFO ] Invariant cache hit.
[2024-06-01 05:21:17] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:21:17] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
[2024-06-01 05:21:17] [INFO ] Redundant transitions in 12 ms returned []
Running 1219 sub problems to find dead transitions.
[2024-06-01 05:21:17] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-06-01 05:21:17] [INFO ] Invariant cache hit.
[2024-06-01 05:21:17] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 2 (OVERLAPS) 242/361 variables, 119/123 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/361 variables, and 143 constraints, problems are : Problem set: 0 solved, 1219 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1219/1219 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 2 (OVERLAPS) 242/361 variables, 119/123 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 1219/1362 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/361 variables, and 1362 constraints, problems are : Problem set: 0 solved, 1219 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1219/1219 constraints, Known Traps: 0/0 constraints]
After SMT, in 65072ms problems are : Problem set: 0 solved, 1219 unsolved
Search for dead transitions found 0 dead transitions in 65085ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65735 ms. Remains : 119/119 places, 1222/1222 transitions.
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-06 finished in 138206 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 2645 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 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 125 transition count 1227
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 125 transition count 1227
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 1226
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 121 transition count 1224
Applied a total of 10 rules in 99 ms. Remains 121 /128 variables (removed 7) and now considering 1224/1228 (removed 4) transitions.
[2024-06-01 05:22:23] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
// Phase 1: matrix 244 rows 121 cols
[2024-06-01 05:22:23] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 05:22:23] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-06-01 05:22:23] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
[2024-06-01 05:22:23] [INFO ] Invariant cache hit.
[2024-06-01 05:22:23] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:22:23] [INFO ] Implicit Places using invariants and state equation in 496 ms returned [52, 104]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 670 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/128 places, 1224/1228 transitions.
Applied a total of 0 rules in 56 ms. Remains 119 /119 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 825 ms. Remains : 119/128 places, 1224/1228 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-08
Product exploration explored 100000 steps with 688 reset in 285 ms.
Product exploration explored 100000 steps with 687 reset in 325 ms.
Computed a total of 104 stabilizing places and 202 stable transitions
Computed a total of 104 stabilizing places and 202 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
RANDOM walk for 574 steps (0 resets) in 7 ms. (71 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2024-06-01 05:22:24] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
// Phase 1: matrix 244 rows 119 cols
[2024-06-01 05:22:24] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 05:22:24] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 05:22:25] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2024-06-01 05:22:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:22:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 05:22:25] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-06-01 05:22:25] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:22:25] [INFO ] [Nat]Added 20 Read/Feed constraints in 166 ms returned sat
[2024-06-01 05:22:25] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 131 transitions) in 69 ms.
[2024-06-01 05:22:25] [INFO ] Added : 10 causal constraints over 5 iterations in 162 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 1224/1224 transitions.
Applied a total of 0 rules in 69 ms. Remains 119 /119 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2024-06-01 05:22:25] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
[2024-06-01 05:22:25] [INFO ] Invariant cache hit.
[2024-06-01 05:22:25] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-06-01 05:22:25] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
[2024-06-01 05:22:25] [INFO ] Invariant cache hit.
[2024-06-01 05:22:25] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:22:26] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
[2024-06-01 05:22:26] [INFO ] Redundant transitions in 17 ms returned []
Running 1221 sub problems to find dead transitions.
[2024-06-01 05:22:26] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
[2024-06-01 05:22:26] [INFO ] Invariant cache hit.
[2024-06-01 05:22:26] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1221 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD101 is UNSAT
At refinement iteration 2 (OVERLAPS) 244/363 variables, 119/123 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 20/143 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
[2024-06-01 05:22:57] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 1/144 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 363/363 variables, and 144 constraints, problems are : Problem set: 2 solved, 1219 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1221/1221 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 1/5 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
At refinement iteration 3 (OVERLAPS) 244/363 variables, 119/124 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 20/144 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 1219/1363 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 363/363 variables, and 1363 constraints, problems are : Problem set: 2 solved, 1219 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1219/1221 constraints, Known Traps: 1/1 constraints]
After SMT, in 65578ms problems are : Problem set: 2 solved, 1219 unsolved
Search for dead transitions found 2 dead transitions in 65593ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 119/119 places, 1222/1224 transitions.
Applied a total of 0 rules in 100 ms. Remains 119 /119 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
[2024-06-01 05:23:32] [INFO ] Redundant transitions in 32 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 66504 ms. Remains : 119/119 places, 1222/1224 transitions.
Computed a total of 104 stabilizing places and 200 stable transitions
Computed a total of 104 stabilizing places and 200 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 576 steps (0 resets) in 7 ms. (72 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2024-06-01 05:23:32] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
// Phase 1: matrix 242 rows 119 cols
[2024-06-01 05:23:32] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 05:23:32] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 05:23:32] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2024-06-01 05:23:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:23:33] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 05:23:33] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2024-06-01 05:23:33] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:23:33] [INFO ] [Nat]Added 20 Read/Feed constraints in 21 ms returned sat
[2024-06-01 05:23:33] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 131 transitions) in 34 ms.
[2024-06-01 05:23:33] [INFO ] Added : 11 causal constraints over 3 iterations in 173 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Product exploration explored 100000 steps with 688 reset in 390 ms.
Product exploration explored 100000 steps with 695 reset in 378 ms.
Support contains 3 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 1222/1222 transitions.
Applied a total of 0 rules in 70 ms. Remains 119 /119 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
[2024-06-01 05:23:34] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-06-01 05:23:34] [INFO ] Invariant cache hit.
[2024-06-01 05:23:34] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-06-01 05:23:34] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-06-01 05:23:34] [INFO ] Invariant cache hit.
[2024-06-01 05:23:34] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:23:34] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2024-06-01 05:23:34] [INFO ] Redundant transitions in 24 ms returned []
Running 1219 sub problems to find dead transitions.
[2024-06-01 05:23:34] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-06-01 05:23:34] [INFO ] Invariant cache hit.
[2024-06-01 05:23:34] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 2 (OVERLAPS) 242/361 variables, 119/123 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/361 variables, and 143 constraints, problems are : Problem set: 0 solved, 1219 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1219/1219 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 2 (OVERLAPS) 242/361 variables, 119/123 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 1219/1362 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/361 variables, and 1362 constraints, problems are : Problem set: 0 solved, 1219 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1219/1219 constraints, Known Traps: 0/0 constraints]
After SMT, in 65352ms problems are : Problem set: 0 solved, 1219 unsolved
Search for dead transitions found 0 dead transitions in 65369ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65959 ms. Remains : 119/119 places, 1222/1222 transitions.
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-08 finished in 137361 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(G(p0))&&F(p1))))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 2645 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 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 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 125 transition count 1227
Applied a total of 3 rules in 81 ms. Remains 125 /128 variables (removed 3) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2024-06-01 05:24:40] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 125 cols
[2024-06-01 05:24:40] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 05:24:40] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 05:24:49] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/372 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD104 is UNSAT
At refinement iteration 3 (OVERLAPS) 247/372 variables, 125/131 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 20/151 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 1373 constraints, problems are : Problem set: 2 solved, 1222 unsolved in 21591 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1224 constraints, Known Traps: 1/1 constraints]
After SMT, in 46755ms problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 46770ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-06-01 05:25:27] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 125 cols
[2024-06-01 05:25:27] [INFO ] Computed 7 invariants in 4 ms
[2024-06-01 05:25:27] [INFO ] Implicit Places using invariants in 187 ms returned [106]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 190 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/128 places, 1225/1228 transitions.
Applied a total of 0 rules in 61 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 47105 ms. Remains : 124/128 places, 1225/1228 transitions.
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-09
Product exploration explored 100000 steps with 464 reset in 542 ms.
Product exploration explored 100000 steps with 469 reset in 481 ms.
Computed a total of 107 stabilizing places and 201 stable transitions
Computed a total of 107 stabilizing places and 201 stable transitions
Detected a total of 107/124 stabilizing places and 201/1225 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 260 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 609 steps (0 resets) in 8 ms. (67 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 275 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1225/1225 transitions.
Applied a total of 0 rules in 55 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:25:29] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 124 cols
[2024-06-01 05:25:29] [INFO ] Computed 6 invariants in 3 ms
[2024-06-01 05:25:29] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:25:38] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/369 variables, and 7 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/369 variables, 124/131 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 1373 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20196 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 46048ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 46060ms
[2024-06-01 05:26:15] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:26:15] [INFO ] Invariant cache hit.
[2024-06-01 05:26:15] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-06-01 05:26:15] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:26:15] [INFO ] Invariant cache hit.
[2024-06-01 05:26:15] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:26:16] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
[2024-06-01 05:26:16] [INFO ] Redundant transitions in 17 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:26:16] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:26:16] [INFO ] Invariant cache hit.
[2024-06-01 05:26:16] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:26:24] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/369 variables, 124/131 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:26:51] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 369/369 variables, and 152 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/369 variables, 124/132 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 1222/1374 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 1374 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 2/2 constraints]
After SMT, in 65187ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 65201ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 112002 ms. Remains : 124/124 places, 1225/1225 transitions.
Computed a total of 107 stabilizing places and 201 stable transitions
Computed a total of 107 stabilizing places and 201 stable transitions
Detected a total of 107/124 stabilizing places and 201/1225 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 213 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 1195 steps (0 resets) in 13 ms. (85 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 211 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 490 reset in 542 ms.
Product exploration explored 100000 steps with 471 reset in 500 ms.
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1225/1225 transitions.
Applied a total of 0 rules in 55 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:27:23] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:27:23] [INFO ] Invariant cache hit.
[2024-06-01 05:27:23] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:27:32] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/369 variables, and 7 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/369 variables, 124/131 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 1373 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20094 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 45461ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 45473ms
[2024-06-01 05:28:08] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:28:08] [INFO ] Invariant cache hit.
[2024-06-01 05:28:08] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-06-01 05:28:09] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:28:09] [INFO ] Invariant cache hit.
[2024-06-01 05:28:09] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:28:09] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 648 ms to find 0 implicit places.
[2024-06-01 05:28:09] [INFO ] Redundant transitions in 13 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:28:09] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:28:09] [INFO ] Invariant cache hit.
[2024-06-01 05:28:09] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:28:17] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/369 variables, 124/131 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:28:43] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 369/369 variables, and 152 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/369 variables, 124/132 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 1222/1374 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 1374 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 2/2 constraints]
After SMT, in 65028ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 65040ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 111240 ms. Remains : 124/124 places, 1225/1225 transitions.
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-09 finished in 274275 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((G(F(p1))||(p2&&F(p1))))))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 2645 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 49 ms. Remains 126 /128 variables (removed 2) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2024-06-01 05:29:14] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
// Phase 1: matrix 248 rows 126 cols
[2024-06-01 05:29:14] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 05:29:14] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
[2024-06-01 05:29:23] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/374 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 3 (OVERLAPS) 248/374 variables, 126/132 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 20/152 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/374 variables, and 1375 constraints, problems are : Problem set: 2 solved, 1223 unsolved in 20754 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1225 constraints, Known Traps: 1/1 constraints]
After SMT, in 45804ms problems are : Problem set: 2 solved, 1223 unsolved
Search for dead transitions found 2 dead transitions in 45816ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-06-01 05:30:00] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 126 cols
[2024-06-01 05:30:00] [INFO ] Computed 7 invariants in 3 ms
[2024-06-01 05:30:00] [INFO ] Implicit Places using invariants in 264 ms returned [53, 107]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 266 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/128 places, 1226/1228 transitions.
Applied a total of 0 rules in 45 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 46181 ms. Remains : 124/128 places, 1226/1228 transitions.
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-10
Product exploration explored 100000 steps with 903 reset in 515 ms.
Product exploration explored 100000 steps with 881 reset in 469 ms.
Computed a total of 107 stabilizing places and 202 stable transitions
Computed a total of 107 stabilizing places and 202 stable transitions
Detected a total of 107/124 stabilizing places and 202/1226 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 483 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 8 to 6
RANDOM walk for 40001 steps (88 resets) in 489 ms. (81 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40002 steps (32 resets) in 292 ms. (136 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (32 resets) in 871 ms. (45 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (29 resets) in 558 ms. (71 steps per ms) remains 3/3 properties
[2024-06-01 05:30:03] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 124 cols
[2024-06-01 05:30:03] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 05:30:03] [INFO ] State equation strengthened by 20 read => feed constraints.
Problem apf2 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 152/156 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 200/356 variables, 106/111 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 2/113 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 20/133 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 0/133 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/358 variables, 1/134 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 2/136 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 12/370 variables, 12/148 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/370 variables, 1/149 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/370 variables, 0/149 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/370 variables, 0/149 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 149 constraints, problems are : Problem set: 1 solved, 2 unsolved in 134 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 102/105 variables, 3/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 250/355 variables, 106/110 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 2/112 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 20/132 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 2/134 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/357 variables, 1/135 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 2/137 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/370 variables, 13/150 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/370 variables, 1/151 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 0/151 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/370 variables, 0/151 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 151 constraints, problems are : Problem set: 1 solved, 2 unsolved in 455 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 636ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 259 ms.
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Applied a total of 0 rules in 63 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Running 1223 sub problems to find dead transitions.
[2024-06-01 05:30:04] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-06-01 05:30:04] [INFO ] Invariant cache hit.
[2024-06-01 05:30:04] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-06-01 05:30:12] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/370 variables, and 6 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1373 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20359 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
After SMT, in 45144ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 45161ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45228 ms. Remains : 124/124 places, 1226/1226 transitions.
RANDOM walk for 40000 steps (88 resets) in 853 ms. (46 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (32 resets) in 202 ms. (197 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (28 resets) in 230 ms. (173 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 446991 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :0 out of 2
Probabilistic random walk after 446991 steps, saw 122072 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :0
[2024-06-01 05:30:52] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-06-01 05:30:52] [INFO ] Invariant cache hit.
[2024-06-01 05:30:52] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 102/105 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 250/355 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/357 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 13/370 variables, 13/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/370 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/370 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/370 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 149 constraints, problems are : Problem set: 0 solved, 2 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 102/105 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 250/355 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/357 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/370 variables, 13/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/370 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/370 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 151 constraints, problems are : Problem set: 0 solved, 2 unsolved in 645 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 879ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 318 ms.
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Applied a total of 0 rules in 67 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 124/124 places, 1226/1226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Applied a total of 0 rules in 73 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
[2024-06-01 05:30:54] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-06-01 05:30:54] [INFO ] Invariant cache hit.
[2024-06-01 05:30:54] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-06-01 05:30:54] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-06-01 05:30:54] [INFO ] Invariant cache hit.
[2024-06-01 05:30:54] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:30:54] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 755 ms to find 0 implicit places.
[2024-06-01 05:30:54] [INFO ] Redundant transitions in 16 ms returned []
Running 1223 sub problems to find dead transitions.
[2024-06-01 05:30:54] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-06-01 05:30:54] [INFO ] Invariant cache hit.
[2024-06-01 05:30:54] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-06-01 05:31:04] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/370 variables, and 150 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 1223/1373 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1373 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
After SMT, in 66046ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 66060ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66913 ms. Remains : 124/124 places, 1226/1226 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2))), (F p1), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 21 factoid took 1176 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Applied a total of 0 rules in 61 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Running 1223 sub problems to find dead transitions.
[2024-06-01 05:32:02] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-06-01 05:32:02] [INFO ] Invariant cache hit.
[2024-06-01 05:32:02] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-06-01 05:32:11] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 49.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 1.0)
(s55 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/370 variables, and 6 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 1223/1373 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1373 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
After SMT, in 45323ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 45337ms
[2024-06-01 05:32:47] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-06-01 05:32:47] [INFO ] Invariant cache hit.
[2024-06-01 05:32:48] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-06-01 05:32:48] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-06-01 05:32:48] [INFO ] Invariant cache hit.
[2024-06-01 05:32:48] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:32:48] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
[2024-06-01 05:32:48] [INFO ] Redundant transitions in 11 ms returned []
Running 1223 sub problems to find dead transitions.
[2024-06-01 05:32:48] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-06-01 05:32:48] [INFO ] Invariant cache hit.
[2024-06-01 05:32:48] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-06-01 05:32:57] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/370 variables, and 150 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 1223/1373 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1373 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
After SMT, in 65310ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 65321ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 111482 ms. Remains : 124/124 places, 1226/1226 transitions.
Computed a total of 107 stabilizing places and 202 stable transitions
Computed a total of 107 stabilizing places and 202 stable transitions
Detected a total of 107/124 stabilizing places and 202/1226 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 882 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (88 resets) in 1018 ms. (39 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40014 steps (32 resets) in 246 ms. (162 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (32 resets) in 383 ms. (104 steps per ms) remains 2/2 properties
[2024-06-01 05:33:55] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-06-01 05:33:55] [INFO ] Invariant cache hit.
[2024-06-01 05:33:55] [INFO ] State equation strengthened by 20 read => feed constraints.
Problem apf1 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 152/156 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 200/356 variables, 106/111 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 2/113 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 20/133 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 0/133 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/358 variables, 1/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 2/136 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/370 variables, 12/148 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/370 variables, 1/149 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/370 variables, 0/149 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/370 variables, 0/149 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 149 constraints, problems are : Problem set: 1 solved, 1 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 102/105 variables, 3/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 250/355 variables, 106/110 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 2/112 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 20/132 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 1/133 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/133 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/357 variables, 1/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 2/136 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/370 variables, 13/149 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/370 variables, 1/150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 0/150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/370 variables, 0/150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 150 constraints, problems are : Problem set: 1 solved, 1 unsolved in 409 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 597ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 42 ms.
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 123 transition count 1225
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 123 transition count 1225
Applied a total of 2 rules in 68 ms. Remains 123 /124 variables (removed 1) and now considering 1225/1226 (removed 1) transitions.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:33:56] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 123 cols
[2024-06-01 05:33:56] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 05:33:56] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:34:05] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 44769ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 44784ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44855 ms. Remains : 123/124 places, 1225/1226 transitions.
RANDOM walk for 40000 steps (88 resets) in 255 ms. (156 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (32 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 577468 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :0 out of 1
Probabilistic random walk after 577468 steps, saw 157397 distinct states, run finished after 3001 ms. (steps per millisecond=192 ) properties seen :0
[2024-06-01 05:34:44] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:34:44] [INFO ] Invariant cache hit.
[2024-06-01 05:34:44] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 250/353 variables, 106/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/355 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 13/368 variables, 13/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/368 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/368 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/368 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 250/353 variables, 106/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/355 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/368 variables, 13/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/368 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/368 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/368 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 149 constraints, problems are : Problem set: 0 solved, 1 unsolved in 325 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 489ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 234 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 59 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 123/123 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 56 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2024-06-01 05:34:44] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:34:44] [INFO ] Invariant cache hit.
[2024-06-01 05:34:45] [INFO ] Implicit Places using invariants in 254 ms returned []
[2024-06-01 05:34:45] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:34:45] [INFO ] Invariant cache hit.
[2024-06-01 05:34:45] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:34:45] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
[2024-06-01 05:34:45] [INFO ] Redundant transitions in 17 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:34:45] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:34:45] [INFO ] Invariant cache hit.
[2024-06-01 05:34:45] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:34:54] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 368/368 variables, and 149 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 1222/1371 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 65526ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 65540ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66275 ms. Remains : 123/123 places, 1225/1225 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p2 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p2)))), (F p1), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 17 factoid took 1621 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 870 reset in 467 ms.
Product exploration explored 100000 steps with 888 reset in 410 ms.
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Applied a total of 0 rules in 51 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Running 1223 sub problems to find dead transitions.
[2024-06-01 05:35:54] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 124 cols
[2024-06-01 05:35:54] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 05:35:54] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-06-01 05:36:03] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 13 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/370 variables, and 6 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1373 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20427 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
After SMT, in 45924ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 45938ms
[2024-06-01 05:36:39] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-06-01 05:36:39] [INFO ] Invariant cache hit.
[2024-06-01 05:36:40] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-06-01 05:36:40] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-06-01 05:36:40] [INFO ] Invariant cache hit.
[2024-06-01 05:36:40] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:36:40] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
[2024-06-01 05:36:40] [INFO ] Redundant transitions in 23 ms returned []
Running 1223 sub problems to find dead transitions.
[2024-06-01 05:36:40] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-06-01 05:36:40] [INFO ] Invariant cache hit.
[2024-06-01 05:36:40] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-06-01 05:36:49] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/370 variables, and 150 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 1223/1373 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1373 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
After SMT, in 65468ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 65485ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 112229 ms. Remains : 124/124 places, 1226/1226 transitions.
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-10 finished in 511775 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))||F(p1)))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 127 transition count 1228
Applied a total of 1 rules in 10 ms. Remains 127 /128 variables (removed 1) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2024-06-01 05:37:46] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
// Phase 1: matrix 248 rows 127 cols
[2024-06-01 05:37:46] [INFO ] Computed 6 invariants in 3 ms
[2024-06-01 05:37:46] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
[2024-06-01 05:37:55] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/375 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/127 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 3 (OVERLAPS) 1/127 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 5 (OVERLAPS) 248/375 variables, 127/134 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 20/154 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 375/375 variables, and 1377 constraints, problems are : Problem set: 2 solved, 1223 unsolved in 21461 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 127/127 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1225 constraints, Known Traps: 1/1 constraints]
After SMT, in 46878ms problems are : Problem set: 2 solved, 1223 unsolved
Search for dead transitions found 2 dead transitions in 46897ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-06-01 05:38:33] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 127 cols
[2024-06-01 05:38:33] [INFO ] Computed 8 invariants in 5 ms
[2024-06-01 05:38:33] [INFO ] Implicit Places using invariants in 301 ms returned [53, 107]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 303 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/128 places, 1226/1228 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47219 ms. Remains : 125/128 places, 1226/1228 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-11
Product exploration explored 100000 steps with 1514 reset in 343 ms.
Product exploration explored 100000 steps with 1522 reset in 350 ms.
Computed a total of 108 stabilizing places and 202 stable transitions
Graph (complete) has 2432 edges and 125 vertex of which 124 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 108 stabilizing places and 202 stable transitions
Detected a total of 108/125 stabilizing places and 202/1226 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 209 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 206 steps (0 resets) in 8 ms. (22 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 8 factoid took 420 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 1226/1226 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Running 1223 sub problems to find dead transitions.
[2024-06-01 05:38:35] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 125 cols
[2024-06-01 05:38:35] [INFO ] Computed 6 invariants in 4 ms
[2024-06-01 05:38:35] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-06-01 05:38:44] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/371 variables, and 6 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 1/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-06-01 05:39:12] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 0 ms to minimize.
[2024-06-01 05:39:12] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 125/371 variables, and 9 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/1223 constraints, Known Traps: 3/3 constraints]
After SMT, in 45039ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 45053ms
[2024-06-01 05:39:20] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-06-01 05:39:20] [INFO ] Invariant cache hit.
[2024-06-01 05:39:20] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-06-01 05:39:20] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-06-01 05:39:20] [INFO ] Invariant cache hit.
[2024-06-01 05:39:20] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:39:20] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
Running 1223 sub problems to find dead transitions.
[2024-06-01 05:39:20] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-06-01 05:39:20] [INFO ] Invariant cache hit.
[2024-06-01 05:39:20] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-06-01 05:39:30] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 1/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-06-01 05:39:52] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/371 variables, and 8 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 1/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 6 (OVERLAPS) 246/371 variables, 125/133 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 371/371 variables, and 1376 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30168 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 2/2 constraints]
After SMT, in 65206ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 65218ms
Finished structural reductions in LTL mode , in 1 iterations and 110832 ms. Remains : 125/125 places, 1226/1226 transitions.
Computed a total of 108 stabilizing places and 202 stable transitions
Graph (complete) has 2432 edges and 125 vertex of which 124 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 108 stabilizing places and 202 stable transitions
Detected a total of 108/125 stabilizing places and 202/1226 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 190 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 338 steps (0 resets) in 5 ms. (56 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 296 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1470 reset in 322 ms.
Product exploration explored 100000 steps with 1496 reset in 341 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 1226/1226 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 125 transition count 1226
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 76 ms. Remains 125 /125 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Running 1223 sub problems to find dead transitions.
[2024-06-01 05:40:28] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 125 cols
[2024-06-01 05:40:28] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 05:40:28] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-06-01 05:40:37] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 49.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)timeout

(s40 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/371 variables, and 6 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 1/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-06-01 05:41:07] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 1 ms to minimize.
[2024-06-01 05:41:07] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 125/371 variables, and 9 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/1223 constraints, Known Traps: 3/3 constraints]
After SMT, in 45480ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 45495ms
[2024-06-01 05:41:13] [INFO ] Redundant transitions in 13 ms returned []
Running 1223 sub problems to find dead transitions.
[2024-06-01 05:41:13] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-06-01 05:41:13] [INFO ] Invariant cache hit.
[2024-06-01 05:41:13] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-06-01 05:41:22] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 1/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-06-01 05:41:45] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/371 variables, and 8 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 1/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Problem TDEAD50 is UNSAT
At refinement iteration 6 (OVERLAPS) 246/371 variables, 125/133 constraints. Problems are: Problem set: 1 solved, 1222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 20/153 constraints. Problems are: Problem set: 1 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 371/371 variables, and 1375 constraints, problems are : Problem set: 1 solved, 1222 unsolved in 30369 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1223 constraints, Known Traps: 2/2 constraints]
After SMT, in 65104ms problems are : Problem set: 1 solved, 1222 unsolved
Search for dead transitions found 1 dead transitions in 65117ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 125/125 places, 1225/1226 transitions.
Graph (complete) has 2430 edges and 125 vertex of which 124 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 58 ms. Remains 124 /125 variables (removed 1) and now considering 1225/1225 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 124/125 places, 1225/1226 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 110768 ms. Remains : 124/125 places, 1225/1226 transitions.
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 1226/1226 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Running 1223 sub problems to find dead transitions.
[2024-06-01 05:42:18] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 125 cols
[2024-06-01 05:42:18] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 05:42:18] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-06-01 05:42:27] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/371 variables, and 6 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 1/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-06-01 05:42:57] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 1 ms to minimize.
[2024-06-01 05:42:58] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 50)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 1)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 1)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 125/371 variables, and 9 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/1223 constraints, Known Traps: 3/3 constraints]
After SMT, in 45342ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 45356ms
[2024-06-01 05:43:04] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-06-01 05:43:04] [INFO ] Invariant cache hit.
[2024-06-01 05:43:04] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-06-01 05:43:04] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-06-01 05:43:04] [INFO ] Invariant cache hit.
[2024-06-01 05:43:04] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:43:04] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
Running 1223 sub problems to find dead transitions.
[2024-06-01 05:43:04] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-06-01 05:43:04] [INFO ] Invariant cache hit.
[2024-06-01 05:43:04] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-06-01 05:43:14] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 1/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-06-01 05:43:38] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/371 variables, and 8 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 1/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 6 (OVERLAPS) 246/371 variables, 125/133 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1223/1376 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 371/371 variables, and 1376 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 2/2 constraints]
After SMT, in 65389ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 65401ms
Finished structural reductions in LTL mode , in 1 iterations and 111325 ms. Remains : 125/125 places, 1226/1226 transitions.
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-11 finished in 384053 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||G(!p1)))&&F(p2)))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 2645 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 83 ms. Remains 127 /128 variables (removed 1) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2024-06-01 05:44:10] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
// Phase 1: matrix 248 rows 127 cols
[2024-06-01 05:44:10] [INFO ] Computed 6 invariants in 3 ms
[2024-06-01 05:44:10] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
[2024-06-01 05:44:19] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/375 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/127 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 3 (OVERLAPS) 1/127 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 5 (OVERLAPS) 248/375 variables, 127/134 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 20/154 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 375/375 variables, and 1377 constraints, problems are : Problem set: 2 solved, 1223 unsolved in 21400 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 127/127 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1225 constraints, Known Traps: 1/1 constraints]
After SMT, in 45541ms problems are : Problem set: 2 solved, 1223 unsolved
Search for dead transitions found 2 dead transitions in 45557ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-06-01 05:44:56] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 127 cols
[2024-06-01 05:44:56] [INFO ] Computed 8 invariants in 3 ms
[2024-06-01 05:44:56] [INFO ] Implicit Places using invariants in 301 ms returned [54, 108]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 302 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/128 places, 1226/1228 transitions.
Applied a total of 0 rules in 58 ms. Remains 125 /125 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 46005 ms. Remains : 125/128 places, 1226/1228 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (OR (NOT p2) p1), p1, (AND p1 (NOT p0)), (OR (NOT p2) (AND (NOT p0) p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 87 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-12 finished in 46159 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||G(p1))))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 2645 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 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 125 transition count 1227
Applied a total of 3 rules in 71 ms. Remains 125 /128 variables (removed 3) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2024-06-01 05:44:56] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 125 cols
[2024-06-01 05:44:56] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 05:44:56] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 05:45:04] [INFO ] Deduced a trap composed of 5 places in 167 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 50.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/372 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD104 is UNSAT
At refinement iteration 3 (OVERLAPS) 247/372 variables, 125/131 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 20/151 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 1373 constraints, problems are : Problem set: 2 solved, 1222 unsolved in 21378 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1224 constraints, Known Traps: 1/1 constraints]
After SMT, in 45340ms problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 45354ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-06-01 05:45:41] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 125 cols
[2024-06-01 05:45:41] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 05:45:42] [INFO ] Implicit Places using invariants in 243 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 246 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/128 places, 1225/1228 transitions.
Applied a total of 0 rules in 59 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 45733 ms. Remains : 123/128 places, 1225/1228 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-13 finished in 45827 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 2645 edges and 128 vertex of which 126 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 125 transition count 1227
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 125 transition count 1227
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 1226
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 121 transition count 1224
Applied a total of 10 rules in 87 ms. Remains 121 /128 variables (removed 7) and now considering 1224/1228 (removed 4) transitions.
[2024-06-01 05:45:42] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
// Phase 1: matrix 244 rows 121 cols
[2024-06-01 05:45:42] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 05:45:42] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-06-01 05:45:42] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
[2024-06-01 05:45:42] [INFO ] Invariant cache hit.
[2024-06-01 05:45:42] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:45:43] [INFO ] Implicit Places using invariants and state equation in 414 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 653 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/128 places, 1224/1228 transitions.
Applied a total of 0 rules in 62 ms. Remains 120 /120 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 802 ms. Remains : 120/128 places, 1224/1228 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-15
Product exploration explored 100000 steps with 14428 reset in 430 ms.
Product exploration explored 100000 steps with 14372 reset in 360 ms.
Computed a total of 105 stabilizing places and 202 stable transitions
Computed a total of 105 stabilizing places and 202 stable transitions
Detected a total of 105/120 stabilizing places and 202/1224 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 20 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2024-06-01 05:45:44] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
// Phase 1: matrix 244 rows 120 cols
[2024-06-01 05:45:44] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 05:45:44] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-06-01 05:45:44] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-06-01 05:45:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:45:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 05:45:45] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-06-01 05:45:45] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:45:45] [INFO ] [Nat]Added 20 Read/Feed constraints in 29 ms returned sat
[2024-06-01 05:45:45] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 0 ms to minimize.
[2024-06-01 05:45:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 104 ms
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-15 finished in 3305 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 U (p1||G(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(F(!p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(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((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' '!((G(p0)||F((G(F(p1))||(p2&&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(X(G(p0)))||F(p1)))'
Found a Lengthening insensitive property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-11
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 2645 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 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 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 126 transition count 1227
Applied a total of 3 rules in 32 ms. Remains 126 /128 variables (removed 2) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2024-06-01 05:45:46] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 126 cols
[2024-06-01 05:45:46] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 05:45:46] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 05:45:55] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/373 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 5 (OVERLAPS) 247/373 variables, 126/133 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 20/153 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 373/373 variables, and 1375 constraints, problems are : Problem set: 2 solved, 1222 unsolved in 21763 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1224 constraints, Known Traps: 1/1 constraints]
After SMT, in 47023ms problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 47040ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-06-01 05:46:33] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 126 cols
[2024-06-01 05:46:33] [INFO ] Computed 8 invariants in 3 ms
[2024-06-01 05:46:33] [INFO ] Implicit Places using invariants in 280 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 296 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 124/128 places, 1225/1228 transitions.
Applied a total of 0 rules in 38 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 47409 ms. Remains : 124/128 places, 1225/1228 transitions.
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-11
Product exploration explored 100000 steps with 1701 reset in 444 ms.
Product exploration explored 100000 steps with 1700 reset in 335 ms.
Computed a total of 107 stabilizing places and 201 stable transitions
Graph (complete) has 2430 edges and 124 vertex of which 123 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 107 stabilizing places and 201 stable transitions
Detected a total of 107/124 stabilizing places and 201/1225 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 242 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 239 steps (0 resets) in 8 ms. (26 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 8 factoid took 412 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 1225/1225 transitions.
Applied a total of 0 rules in 5 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:46:35] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 124 cols
[2024-06-01 05:46:35] [INFO ] Computed 6 invariants in 3 ms
[2024-06-01 05:46:35] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:46:44] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/369 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 1/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:47:12] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 124/369 variables, and 8 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/1222 constraints, Known Traps: 2/2 constraints]
After SMT, in 45044ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 45058ms
[2024-06-01 05:47:20] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:47:20] [INFO ] Invariant cache hit.
[2024-06-01 05:47:21] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-06-01 05:47:21] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:47:21] [INFO ] Invariant cache hit.
[2024-06-01 05:47:21] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:47:21] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:47:21] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:47:21] [INFO ] Invariant cache hit.
[2024-06-01 05:47:21] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:47:30] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 1/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:47:54] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/369 variables, and 8 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 1/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 6 (OVERLAPS) 245/369 variables, 124/132 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 1374 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30502 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 2/2 constraints]
After SMT, in 65274ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 65288ms
Finished structural reductions in LTL mode , in 1 iterations and 110910 ms. Remains : 124/124 places, 1225/1225 transitions.
Computed a total of 107 stabilizing places and 201 stable transitions
Graph (complete) has 2430 edges and 124 vertex of which 123 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 107 stabilizing places and 201 stable transitions
Detected a total of 107/124 stabilizing places and 201/1225 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 178 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 332 steps (0 resets) in 4 ms. (66 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 333 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1710 reset in 313 ms.
Product exploration explored 100000 steps with 1706 reset in 332 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1225/1225 transitions.
Applied a total of 0 rules in 59 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:48:28] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:48:28] [INFO ] Invariant cache hit.
[2024-06-01 05:48:28] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:48:37] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 49.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 1.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/369 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 1/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:49:06] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 124/369 variables, and 8 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/1222 constraints, Known Traps: 2/2 constraints]
After SMT, in 45427ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 45442ms
[2024-06-01 05:49:14] [INFO ] Redundant transitions in 25 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:49:14] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:49:14] [INFO ] Invariant cache hit.
[2024-06-01 05:49:14] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:49:23] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 1/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:49:48] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/369 variables, and 8 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 1/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 6 (OVERLAPS) 245/369 variables, 124/132 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 1374 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30830 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 2/2 constraints]
After SMT, in 65995ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 66012ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 111550 ms. Remains : 124/124 places, 1225/1225 transitions.
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 1225/1225 transitions.
Applied a total of 0 rules in 4 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:50:20] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:50:20] [INFO ] Invariant cache hit.
[2024-06-01 05:50:20] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:50:29] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/369 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 1/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:50:58] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 124/369 variables, and 8 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/1222 constraints, Known Traps: 2/2 constraints]
After SMT, in 45299ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 45311ms
[2024-06-01 05:51:05] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:51:05] [INFO ] Invariant cache hit.
[2024-06-01 05:51:05] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-06-01 05:51:05] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:51:05] [INFO ] Invariant cache hit.
[2024-06-01 05:51:05] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:51:06] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
Running 1222 sub problems to find dead transitions.
[2024-06-01 05:51:06] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-06-01 05:51:06] [INFO ] Invariant cache hit.
[2024-06-01 05:51:06] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:51:15] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 1/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 05:51:39] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/369 variables, and 8 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 1/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 6 (OVERLAPS) 245/369 variables, 124/132 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 1374 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 31039 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 2/2 constraints]
After SMT, in 66731ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 66746ms
Finished structural reductions in LTL mode , in 1 iterations and 112649 ms. Remains : 124/124 places, 1225/1225 transitions.
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-11 finished in 386644 ms.
[2024-06-01 05:52:12] [INFO ] Flatten gal took : 51 ms
[2024-06-01 05:52:12] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-06-01 05:52:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 128 places, 1228 transitions and 9210 arcs took 16 ms.
Total runtime 2424550 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-08 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-09 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717222069984

--------------------
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-V50P50N10-LTLCardinality-05
ltl formula formula --ltl=/tmp/2679/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 128 places, 1228 transitions and 9210 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.360 real 0.060 user 0.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2679/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2679/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2679/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2679/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 128 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 129, there are 1234 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): ~165 levels ~10000 states ~21608 transitions
pnml2lts-mc( 2/ 4): ~164 levels ~20000 states ~39464 transitions
pnml2lts-mc( 2/ 4): ~164 levels ~40000 states ~91536 transitions
pnml2lts-mc( 2/ 4): ~164 levels ~80000 states ~213092 transitions
pnml2lts-mc( 2/ 4): ~164 levels ~160000 states ~465024 transitions
pnml2lts-mc( 2/ 4): ~164 levels ~320000 states ~972152 transitions
pnml2lts-mc( 2/ 4): ~164 levels ~640000 states ~1987372 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~423!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 764760
pnml2lts-mc( 0/ 4): unique states count: 765395
pnml2lts-mc( 0/ 4): unique transitions count: 2069338
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 1302941
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 765554
pnml2lts-mc( 0/ 4): - cum. max stack depth: 879
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 765554 states 2069934 transitions, fanout: 2.704
pnml2lts-mc( 0/ 4): Total exploration time 8.740 sec (8.730 sec minimum, 8.737 sec on average)
pnml2lts-mc( 0/ 4): States per second: 87592, Transitions per second: 236835
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 6.6MB, 9.0 B/state, compr.: 1.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 2.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 1258 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 6.6MB (~256.0MB paged-in)
ltl formula name BridgeAndVehicles-COL-V50P50N10-LTLCardinality-06
ltl formula formula --ltl=/tmp/2679/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
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 128 places, 1228 transitions and 9210 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.300 real 0.030 user 0.080 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2679/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2679/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2679/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2679/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 129 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 129, there are 1231 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): ~421 levels ~10000 states ~19516 transitions
pnml2lts-mc( 0/ 4): ~424 levels ~20000 states ~48580 transitions
pnml2lts-mc( 0/ 4): ~424 levels ~40000 states ~99724 transitions
pnml2lts-mc( 0/ 4): ~424 levels ~80000 states ~197232 transitions
pnml2lts-mc( 0/ 4): ~424 levels ~160000 states ~399776 transitions
pnml2lts-mc( 0/ 4): ~424 levels ~320000 states ~817188 transitions
pnml2lts-mc( 3/ 4): ~424 levels ~640000 states ~1909508 transitions
pnml2lts-mc( 3/ 4): ~424 levels ~1280000 states ~3937968 transitions
pnml2lts-mc( 3/ 4): ~424 levels ~2560000 states ~7975724 transitions
pnml2lts-mc( 3/ 4): ~424 levels ~5120000 states ~16416664 transitions
pnml2lts-mc( 3/ 4): ~424 levels ~10240000 states ~33626864 transitions
pnml2lts-mc( 1/ 4): ~403 levels ~20480000 states ~70564492 transitions
pnml2lts-mc( 1/ 4): ~403 levels ~40960000 states ~143174532 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33551756
pnml2lts-mc( 0/ 4): unique states count: 33552704
pnml2lts-mc( 0/ 4): unique transitions count: 114765306
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 81941205
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33913774
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1671
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33913774 states 116054034 transitions, fanout: 3.422
pnml2lts-mc( 0/ 4): Total exploration time 349.450 sec (349.440 sec minimum, 349.443 sec on average)
pnml2lts-mc( 0/ 4): States per second: 97049, Transitions per second: 332105
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 259.6MB, 8.1 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/5.0%
pnml2lts-mc( 0/ 4): Stored 1258 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 259.6MB (~256.0MB paged-in)
ltl formula name BridgeAndVehicles-COL-V50P50N10-LTLCardinality-08
ltl formula formula --ltl=/tmp/2679/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 128 places, 1228 transitions and 9210 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.170 real 0.050 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2679/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2679/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2679/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2679/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 129 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 129, there are 1229 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): ~131 levels ~10000 states ~13040 transitions
pnml2lts-mc( 0/ 4): ~154 levels ~20000 states ~26300 transitions
pnml2lts-mc( 0/ 4): ~204 levels ~40000 states ~52316 transitions
pnml2lts-mc( 0/ 4): ~334 levels ~80000 states ~103372 transitions
pnml2lts-mc( 2/ 4): ~441 levels ~160000 states ~345536 transitions
pnml2lts-mc( 2/ 4): ~441 levels ~320000 states ~697856 transitions
pnml2lts-mc( 2/ 4): ~441 levels ~640000 states ~1416696 transitions
pnml2lts-mc( 2/ 4): ~441 levels ~1280000 states ~2867928 transitions
pnml2lts-mc( 1/ 4): ~437 levels ~2560000 states ~7696872 transitions
pnml2lts-mc( 0/ 4): ~436 levels ~5120000 states ~11538760 transitions
pnml2lts-mc( 0/ 4): ~436 levels ~10240000 states ~29895836 transitions
pnml2lts-mc( 0/ 4): ~436 levels ~20480000 states ~66520568 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33551553
pnml2lts-mc( 0/ 4): unique states count: 33552591
pnml2lts-mc( 0/ 4): unique transitions count: 109304128
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 75854428
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33604252
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1761
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33604252 states 109493726 transitions, fanout: 3.258
pnml2lts-mc( 0/ 4): Total exploration time 276.480 sec (276.470 sec minimum, 276.473 sec on average)
pnml2lts-mc( 0/ 4): States per second: 121543, Transitions per second: 396028
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 262.4MB, 8.2 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/9.0%
pnml2lts-mc( 0/ 4): Stored 1258 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 262.4MB (~256.0MB paged-in)
ltl formula name BridgeAndVehicles-COL-V50P50N10-LTLCardinality-09
ltl formula formula --ltl=/tmp/2679/ltl_3_
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 128 places, 1228 transitions and 9210 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2679/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2679/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2679/ltl_3_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.200 real 0.040 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2679/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 128 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 129, there are 1236 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): ~420 levels ~10000 states ~26648 transitions
pnml2lts-mc( 1/ 4): ~420 levels ~20000 states ~53384 transitions
pnml2lts-mc( 1/ 4): ~420 levels ~40000 states ~116056 transitions
pnml2lts-mc( 1/ 4): ~420 levels ~80000 states ~261668 transitions
pnml2lts-mc( 1/ 4): ~420 levels ~160000 states ~543932 transitions
pnml2lts-mc( 1/ 4): ~420 levels ~320000 states ~1118088 transitions
pnml2lts-mc( 1/ 4): ~420 levels ~640000 states ~2280848 transitions
pnml2lts-mc( 2/ 4): ~385 levels ~1280000 states ~3413740 transitions
pnml2lts-mc( 2/ 4): ~385 levels ~2560000 states ~7310304 transitions
pnml2lts-mc( 0/ 4): ~418 levels ~5120000 states ~18482392 transitions
pnml2lts-mc( 0/ 4): ~418 levels ~10240000 states ~37238152 transitions
pnml2lts-mc( 0/ 4): ~421 levels ~20480000 states ~74573660 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33551213
pnml2lts-mc( 0/ 4): unique states count: 33552464
pnml2lts-mc( 0/ 4): unique transitions count: 133571975
pnml2lts-mc( 0/ 4): - self-loop count: 40
pnml2lts-mc( 0/ 4): - claim dead count: 101745808
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 34356393
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1706
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 34356393 states 136495545 transitions, fanout: 3.973
pnml2lts-mc( 0/ 4): Total exploration time 283.390 sec (283.380 sec minimum, 283.385 sec on average)
pnml2lts-mc( 0/ 4): States per second: 121234, Transitions per second: 481653
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 264.2MB, 8.3 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/12.0%
pnml2lts-mc( 0/ 4): Stored 1258 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 264.2MB (~256.0MB paged-in)
ltl formula name BridgeAndVehicles-COL-V50P50N10-LTLCardinality-10
ltl formula formula --ltl=/tmp/2679/ltl_4_
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 128 places, 1228 transitions and 9210 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.180 real 0.030 user 0.050 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2679/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2679/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2679/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2679/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 129 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 129, there are 1234 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 ~422!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 266
pnml2lts-mc( 0/ 4): unique states count: 1826
pnml2lts-mc( 0/ 4): unique transitions count: 5488
pnml2lts-mc( 0/ 4): - self-loop count: 3
pnml2lts-mc( 0/ 4): - claim dead count: 588
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 1832
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1594
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1832 states 5510 transitions, fanout: 3.008
pnml2lts-mc( 0/ 4): Total exploration time 0.050 sec (0.050 sec minimum, 0.050 sec on average)
pnml2lts-mc( 0/ 4): States per second: 36640, Transitions per second: 110200
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 31.8 B/state, compr.: 6.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1258 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name BridgeAndVehicles-COL-V50P50N10-LTLCardinality-11
ltl formula formula --ltl=/tmp/2679/ltl_5_
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 128 places, 1228 transitions and 9210 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.130 real 0.040 user 0.060 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2679/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2679/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2679/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2679/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 129 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 129, there are 1233 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): ~132 levels ~10000 states ~17720 transitions
pnml2lts-mc( 0/ 4): ~132 levels ~20000 states ~45708 transitions
pnml2lts-mc( 0/ 4): ~132 levels ~40000 states ~110664 transitions
pnml2lts-mc( 3/ 4): ~133 levels ~80000 states ~289820 transitions
pnml2lts-mc( 2/ 4): ~135 levels ~160000 states ~450160 transitions
pnml2lts-mc( 2/ 4): ~135 levels ~320000 states ~898804 transitions
pnml2lts-mc( 2/ 4): ~135 levels ~640000 states ~1766504 transitions
pnml2lts-mc( 2/ 4): ~191 levels ~1280000 states ~3911316 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: 1361412
pnml2lts-mc( 0/ 4): unique states count: 1361412
pnml2lts-mc( 0/ 4): unique transitions count: 4426611
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 3347303
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 1521913
pnml2lts-mc( 0/ 4): - cum. max stack depth: 864
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1521913 states 4939045 transitions, fanout: 3.245
pnml2lts-mc( 0/ 4): Total exploration time 12.790 sec (12.790 sec minimum, 12.790 sec on average)
pnml2lts-mc( 0/ 4): States per second: 118992, Transitions per second: 386165
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 12.2MB, 9.4 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 4.0%/2.0%
pnml2lts-mc( 0/ 4): Stored 1258 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 12.2MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-COL-V50P50N10"
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-V50P50N10, 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-171620398800091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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