Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620398800115.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 itstools
Input is BridgeAndVehicles-COL-V80P20N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620398800115
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.4K Apr 13 01:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 13 01:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 13 00:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 13 00:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 13K Apr 13 01:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 13 01:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 01:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 13 01:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 45K 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-V80P20N10-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716324706399

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V80P20N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202405141337
[2024-05-21 20:51:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 20:51:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:51:47] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-21 20:51:48] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 20:51:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 529 ms
[2024-05-21 20:51:48] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 188 PT places and 289218.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2024-05-21 20:51:48] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2024-05-21 20:51:48] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-10 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.4 ms
Remains 12 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
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 979 ms. (40 steps per ms) remains 2/22 properties
BEST_FIRST walk for 40002 steps (8 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 174 ms. (228 steps per ms) remains 2/2 properties
// Phase 1: matrix 10 rows 12 cols
[2024-05-21 20:51:49] [INFO ] Computed 4 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp10 is UNSAT
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 3/12 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/22 variables, 12/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/22 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 16 constraints, problems are : Problem set: 1 solved, 1 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 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) 6/9 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 9/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/21 variables, 2/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 1/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/21 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/22 variables, 1/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/22 variables, 1/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/22 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/22 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 17 constraints, problems are : Problem set: 1 solved, 1 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 298ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 78 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=78 )
Parikh walk visited 1 properties in 18 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2024-05-21 20:51:49] [INFO ] Flatten gal took : 12 ms
[2024-05-21 20:51:49] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD $cA 1) 81)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 81) 81) 81)]] 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-05-21 20:51:49] [INFO ] Unfolded HLPN to a Petri net with 188 places and 2108 transitions 15950 arcs in 117 ms.
[2024-05-21 20:51:49] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Support contains 15 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 56 ms. Remains 188 /188 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Running 2105 sub problems to find dead transitions.
[2024-05-21 20:51:49] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2024-05-21 20:51:49] [INFO ] Computed 7 invariants in 27 ms
[2024-05-21 20:51:49] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
[2024-05-21 20:52:16] [INFO ] Deduced a trap composed of 5 places in 333 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/558 variables, and 6 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20056 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/188 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2105/2105 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/558 variables, and 6 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/188 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2105 constraints, Known Traps: 1/1 constraints]
After SMT, in 56666ms problems are : Problem set: 0 solved, 2105 unsolved
Search for dead transitions found 0 dead transitions in 56723ms
[2024-05-21 20:52:46] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 20:52:46] [INFO ] Invariant cache hit.
[2024-05-21 20:52:46] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-05-21 20:52:46] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 20:52:46] [INFO ] Invariant cache hit.
[2024-05-21 20:52:46] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 20:52:49] [INFO ] Implicit Places using invariants and state equation in 2706 ms returned []
Implicit Place search using SMT with State Equation took 3034 ms to find 0 implicit places.
Running 2105 sub problems to find dead transitions.
[2024-05-21 20:52:49] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 20:52:49] [INFO ] Invariant cache hit.
[2024-05-21 20:52:49] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
[2024-05-21 20:53:15] [INFO ] Deduced a trap composed of 5 places in 255 ms of which 2 ms to minimize.
[2024-05-21 20:53:31] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 2 ms to minimize.
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/558 variables, and 7 constraints, problems are : Problem set: 80 solved, 2025 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/188 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2105/2105 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 80 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 80 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 2/7 constraints. Problems are: Problem set: 80 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/558 variables, and 7 constraints, problems are : Problem set: 80 solved, 2025 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/188 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2105 constraints, Known Traps: 2/2 constraints]
After SMT, in 75222ms problems are : Problem set: 80 solved, 2025 unsolved
Search for dead transitions found 80 dead transitions in 75266ms
Found 80 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 80 transitions
Dead transitions reduction (with SMT) removed 80 transitions
Starting structural reductions in LTL mode, iteration 1 : 188/188 places, 2028/2108 transitions.
Applied a total of 0 rules in 14 ms. Remains 188 /188 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 135143 ms. Remains : 188/188 places, 2028/2108 transitions.
Support contains 15 out of 188 places after structural reductions.
[2024-05-21 20:54:05] [INFO ] Flatten gal took : 181 ms
[2024-05-21 20:54:05] [INFO ] Flatten gal took : 163 ms
[2024-05-21 20:54:05] [INFO ] Input system was already deterministic with 2028 transitions.
RANDOM walk for 40000 steps (56 resets) in 1741 ms. (22 steps per ms) remains 2/22 properties
BEST_FIRST walk for 40002 steps (20 resets) in 260 ms. (153 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (20 resets) in 196 ms. (203 steps per ms) remains 2/2 properties
[2024-05-21 20:54:06] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
// Phase 1: matrix 369 rows 188 cols
[2024-05-21 20:54:06] [INFO ] Computed 7 invariants in 11 ms
[2024-05-21 20:54:06] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp10 is UNSAT
At refinement iteration 1 (OVERLAPS) 8/12 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 20:54:06] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3/15 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 369/384 variables, 15/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 21/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 173/557 variables, 173/214 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/557 variables, 3/217 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/557 variables, 0/217 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/557 variables, 0/217 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 217 constraints, problems are : Problem set: 1 solved, 1 unsolved in 344 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 188/188 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 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) 6/9 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 324/333 variables, 9/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 211/544 variables, 166/178 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/544 variables, 2/180 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/544 variables, 21/201 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/544 variables, 1/202 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/544 variables, 0/202 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/546 variables, 1/203 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/546 variables, 2/205 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/546 variables, 1/206 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/546 variables, 0/206 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 11/557 variables, 11/217 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/557 variables, 1/218 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/557 variables, 0/218 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/557 variables, 0/218 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 218 constraints, problems are : Problem set: 1 solved, 1 unsolved in 644 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 188/188 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1034ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 47 ms.
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 2028/2028 transitions.
Graph (complete) has 1881 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 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 185 transition count 2027
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 185 transition count 2027
Applied a total of 3 rules in 332 ms. Remains 185 /188 variables (removed 3) and now considering 2027/2028 (removed 1) transitions.
Running 2024 sub problems to find dead transitions.
[2024-05-21 20:54:07] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
// Phase 1: matrix 368 rows 185 cols
[2024-05-21 20:54:07] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 20:54:07] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-05-21 20:54:31] [INFO ] Deduced a trap composed of 5 places in 266 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 53483ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 53508ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53846 ms. Remains : 185/188 places, 2027/2028 transitions.
RANDOM walk for 40000 steps (56 resets) in 460 ms. (86 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (20 resets) in 206 ms. (193 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 398162 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :0 out of 1
Probabilistic random walk after 398162 steps, saw 108938 distinct states, run finished after 3004 ms. (steps per millisecond=132 ) properties seen :0
[2024-05-21 20:55:04] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 20:55:04] [INFO ] Invariant cache hit.
[2024-05-21 20:55:04] [INFO ] State equation strengthened by 21 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
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 161/163 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 375/538 variables, 168/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 21/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/540 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 13/553 variables, 13/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/553 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/553 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/553 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 211 constraints, problems are : Problem set: 0 solved, 1 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 185/185 constraints, ReadFeed: 21/21 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) 161/163 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 375/538 variables, 168/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 21/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/540 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/553 variables, 13/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/553 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/553 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/553 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 212 constraints, problems are : Problem set: 0 solved, 1 unsolved in 766 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 185/185 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 947ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 111 ms.
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2027/2027 transitions.
Applied a total of 0 rules in 183 ms. Remains 185 /185 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 185/185 places, 2027/2027 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2027/2027 transitions.
Applied a total of 0 rules in 158 ms. Remains 185 /185 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
[2024-05-21 20:55:05] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 20:55:05] [INFO ] Invariant cache hit.
[2024-05-21 20:55:06] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-05-21 20:55:06] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 20:55:06] [INFO ] Invariant cache hit.
[2024-05-21 20:55:06] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 20:55:07] [INFO ] Implicit Places using invariants and state equation in 1358 ms returned [83, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1795 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 183/185 places, 2027/2027 transitions.
Applied a total of 0 rules in 119 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2072 ms. Remains : 183/185 places, 2027/2027 transitions.
RANDOM walk for 40000 steps (56 resets) in 421 ms. (94 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (20 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 461655 steps, run timeout after 3001 ms. (steps per millisecond=153 ) properties seen :0 out of 1
Probabilistic random walk after 461655 steps, saw 125925 distinct states, run finished after 3001 ms. (steps per millisecond=153 ) properties seen :0
[2024-05-21 20:55:10] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
// Phase 1: matrix 368 rows 183 cols
[2024-05-21 20:55:10] [INFO ] Computed 5 invariants in 6 ms
[2024-05-21 20:55:10] [INFO ] State equation strengthened by 21 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
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 161/163 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 373/536 variables, 166/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 21/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/538 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/538 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 13/551 variables, 13/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/551 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/551 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/551 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 209 constraints, problems are : Problem set: 0 solved, 1 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 21/21 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) 161/163 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 373/536 variables, 166/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 21/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/538 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/538 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/538 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/551 variables, 13/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/551 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/551 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/551 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 551/551 variables, and 210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 525 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 725ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 183 ms.
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Applied a total of 0 rules in 171 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 183/183 places, 2027/2027 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Applied a total of 0 rules in 171 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
[2024-05-21 20:55:12] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 20:55:12] [INFO ] Invariant cache hit.
[2024-05-21 20:55:12] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-05-21 20:55:12] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 20:55:12] [INFO ] Invariant cache hit.
[2024-05-21 20:55:12] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 20:55:13] [INFO ] Implicit Places using invariants and state equation in 816 ms returned []
Implicit Place search using SMT with State Equation took 1179 ms to find 0 implicit places.
[2024-05-21 20:55:13] [INFO ] Redundant transitions in 120 ms returned []
Running 2024 sub problems to find dead transitions.
[2024-05-21 20:55:13] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 20:55:13] [INFO ] Invariant cache hit.
[2024-05-21 20:55:13] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-05-21 20:55:36] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 20.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 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.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 1.0)
(s83 0.0)
timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 72744ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 72769ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74252 ms. Remains : 183/183 places, 2027/2027 transitions.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 171 stabilizing places and 324 stable transitions
Graph (complete) has 4228 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.16 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2028/2028 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2028
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 185 transition count 2027
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 185 transition count 2027
Applied a total of 4 rules in 20 ms. Remains 185 /188 variables (removed 3) and now considering 2027/2028 (removed 1) transitions.
Running 2024 sub problems to find dead transitions.
[2024-05-21 20:56:26] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
// Phase 1: matrix 368 rows 185 cols
[2024-05-21 20:56:26] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 20:56:26] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-05-21 20:56:50] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 53913ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 53934ms
[2024-05-21 20:57:20] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 20:57:20] [INFO ] Invariant cache hit.
[2024-05-21 20:57:20] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-05-21 20:57:20] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 20:57:20] [INFO ] Invariant cache hit.
[2024-05-21 20:57:20] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 20:57:21] [INFO ] Implicit Places using invariants and state equation in 889 ms returned [166]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1173 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/188 places, 2027/2028 transitions.
Applied a total of 0 rules in 12 ms. Remains 184 /184 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55146 ms. Remains : 184/188 places, 2027/2028 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 842 ms.
Product exploration explored 100000 steps with 50000 reset in 652 ms.
Computed a total of 167 stabilizing places and 323 stable transitions
Computed a total of 167 stabilizing places and 323 stable transitions
Detected a total of 167/184 stabilizing places and 323/2027 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 : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 45 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLCardinality-00 finished in 56964 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)))))'
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2028/2028 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2028
Applied a total of 2 rules in 11 ms. Remains 186 /188 variables (removed 2) and now considering 2028/2028 (removed 0) transitions.
Running 2025 sub problems to find dead transitions.
[2024-05-21 20:57:23] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
// Phase 1: matrix 369 rows 186 cols
[2024-05-21 20:57:23] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 20:57:23] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-05-21 20:57:46] [INFO ] Deduced a trap composed of 5 places in 270 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/555 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/555 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 53520ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 53540ms
[2024-05-21 20:58:17] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 20:58:17] [INFO ] Invariant cache hit.
[2024-05-21 20:58:17] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-21 20:58:17] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 20:58:17] [INFO ] Invariant cache hit.
[2024-05-21 20:58:17] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 20:58:18] [INFO ] Implicit Places using invariants and state equation in 1255 ms returned [83, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1589 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/188 places, 2028/2028 transitions.
Applied a total of 0 rules in 12 ms. Remains 184 /184 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55169 ms. Remains : 184/188 places, 2028/2028 transitions.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 836 ms.
Product exploration explored 100000 steps with 50000 reset in 730 ms.
Computed a total of 167 stabilizing places and 324 stable transitions
Computed a total of 167 stabilizing places and 324 stable transitions
Detected a total of 167/184 stabilizing places and 324/2028 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 18 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLCardinality-01 finished in 56941 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X((X(F(p0))||F(p1)))))))'
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2028/2028 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2028
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 185 transition count 2027
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 185 transition count 2027
Applied a total of 4 rules in 31 ms. Remains 185 /188 variables (removed 3) and now considering 2027/2028 (removed 1) transitions.
Running 2024 sub problems to find dead transitions.
[2024-05-21 20:58:20] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
// Phase 1: matrix 368 rows 185 cols
[2024-05-21 20:58:20] [INFO ] Computed 5 invariants in 5 ms
[2024-05-21 20:58:20] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-05-21 20:58:44] [INFO ] Deduced a trap composed of 5 places in 270 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 54687ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 54714ms
[2024-05-21 20:59:15] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 20:59:15] [INFO ] Invariant cache hit.
[2024-05-21 20:59:15] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-05-21 20:59:15] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 20:59:15] [INFO ] Invariant cache hit.
[2024-05-21 20:59:15] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 20:59:16] [INFO ] Implicit Places using invariants and state equation in 999 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1283 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/188 places, 2027/2028 transitions.
Applied a total of 0 rules in 13 ms. Remains 184 /184 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56048 ms. Remains : 184/188 places, 2027/2028 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-02
Product exploration explored 100000 steps with 33333 reset in 735 ms.
Product exploration explored 100000 steps with 33333 reset in 652 ms.
Computed a total of 167 stabilizing places and 323 stable transitions
Computed a total of 167 stabilizing places and 323 stable transitions
Detected a total of 167/184 stabilizing places and 323/2027 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 12 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLCardinality-02 finished in 57605 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)&&G((!p0||(p1 U (p2||G(p1)))))) U p3))'
Support contains 5 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 2028/2028 transitions.
Graph (complete) has 4228 edges and 188 vertex of which 187 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.22 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 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 186 transition count 2027
Applied a total of 3 rules in 848 ms. Remains 186 /188 variables (removed 2) and now considering 2027/2028 (removed 1) transitions.
Running 2024 sub problems to find dead transitions.
[2024-05-21 20:59:18] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
// Phase 1: matrix 368 rows 186 cols
[2024-05-21 20:59:18] [INFO ] Computed 6 invariants in 4 ms
[2024-05-21 20:59:19] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-05-21 20:59:43] [INFO ] Deduced a trap composed of 5 places in 246 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 19.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 1.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 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/186 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/186 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 53459ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 53479ms
[2024-05-21 21:00:12] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 21:00:12] [INFO ] Invariant cache hit.
[2024-05-21 21:00:12] [INFO ] Implicit Places using invariants in 369 ms returned []
[2024-05-21 21:00:12] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 21:00:12] [INFO ] Invariant cache hit.
[2024-05-21 21:00:12] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 21:00:14] [INFO ] Implicit Places using invariants and state equation in 1258 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1634 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 185/188 places, 2027/2028 transitions.
Applied a total of 0 rules in 188 ms. Remains 185 /185 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 56159 ms. Remains : 185/188 places, 2027/2028 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p3), true, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 5 steps with 1 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLCardinality-06 finished in 56375 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 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2028/2028 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 187 transition count 2028
Applied a total of 1 rules in 25 ms. Remains 187 /188 variables (removed 1) and now considering 2028/2028 (removed 0) transitions.
Running 2025 sub problems to find dead transitions.
[2024-05-21 21:00:14] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
// Phase 1: matrix 369 rows 187 cols
[2024-05-21 21:00:14] [INFO ] Computed 6 invariants in 2 ms
[2024-05-21 21:00:14] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-05-21 21:00:39] [INFO ] Deduced a trap composed of 5 places in 263 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/187 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/187 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 55688ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 55711ms
[2024-05-21 21:01:10] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 21:01:10] [INFO ] Invariant cache hit.
[2024-05-21 21:01:10] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-05-21 21:01:10] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 21:01:10] [INFO ] Invariant cache hit.
[2024-05-21 21:01:10] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 21:01:11] [INFO ] Implicit Places using invariants and state equation in 1277 ms returned [84, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1652 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/188 places, 2028/2028 transitions.
Applied a total of 0 rules in 14 ms. Remains 185 /185 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57408 ms. Remains : 185/188 places, 2028/2028 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLCardinality-07 finished in 57527 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' '!((p0 U (G(p0)||(p0&&(X(p1) U (X(G(p1))||(p1&&X(p1))))))))'
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2028/2028 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2028
Applied a total of 2 rules in 21 ms. Remains 186 /188 variables (removed 2) and now considering 2028/2028 (removed 0) transitions.
Running 2025 sub problems to find dead transitions.
[2024-05-21 21:01:12] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
// Phase 1: matrix 369 rows 186 cols
[2024-05-21 21:01:12] [INFO ] Computed 5 invariants in 5 ms
[2024-05-21 21:01:12] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-05-21 21:01:39] [INFO ] Deduced a trap composed of 5 places in 268 ms of which 1 ms to minimize.
(s113 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 19.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/555 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/555 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 57083ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 57106ms
[2024-05-21 21:02:09] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 21:02:09] [INFO ] Invariant cache hit.
[2024-05-21 21:02:09] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-05-21 21:02:09] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 21:02:09] [INFO ] Invariant cache hit.
[2024-05-21 21:02:09] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 21:02:10] [INFO ] Implicit Places using invariants and state equation in 1123 ms returned [83, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1486 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/188 places, 2028/2028 transitions.
Applied a total of 0 rules in 14 ms. Remains 184 /184 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58634 ms. Remains : 184/188 places, 2028/2028 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 673 ms.
Product exploration explored 100000 steps with 50000 reset in 680 ms.
Computed a total of 167 stabilizing places and 324 stable transitions
Computed a total of 167 stabilizing places and 324 stable transitions
Detected a total of 167/184 stabilizing places and 324/2028 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p1 p0)), (X (NOT (AND p1 p0))), (X p0), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 24 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLCardinality-08 finished in 60221 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||G(p1))))'
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 2028/2028 transitions.
Graph (complete) has 4228 edges and 188 vertex of which 187 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 196 ms. Remains 187 /188 variables (removed 1) and now considering 2028/2028 (removed 0) transitions.
Running 2025 sub problems to find dead transitions.
[2024-05-21 21:02:12] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
// Phase 1: matrix 369 rows 187 cols
[2024-05-21 21:02:12] [INFO ] Computed 6 invariants in 17 ms
[2024-05-21 21:02:12] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-05-21 21:02:36] [INFO ] Deduced a trap composed of 5 places in 265 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20060 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/187 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/187 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 54175ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 54194ms
[2024-05-21 21:03:06] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 21:03:06] [INFO ] Invariant cache hit.
[2024-05-21 21:03:06] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-05-21 21:03:06] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 21:03:06] [INFO ] Invariant cache hit.
[2024-05-21 21:03:07] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 21:03:10] [INFO ] Implicit Places using invariants and state equation in 3520 ms returned [83, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3878 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 185/188 places, 2028/2028 transitions.
Applied a total of 0 rules in 179 ms. Remains 185 /185 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 58452 ms. Remains : 185/188 places, 2028/2028 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09
Product exploration explored 100000 steps with 1285 reset in 654 ms.
Product exploration explored 100000 steps with 1261 reset in 537 ms.
Computed a total of 168 stabilizing places and 324 stable transitions
Graph (complete) has 3899 edges and 185 vertex of which 184 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Computed a total of 168 stabilizing places and 324 stable transitions
Detected a total of 168/185 stabilizing places and 324/2028 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (AND p1 (NOT p0))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 352 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (56 resets) in 431 ms. (92 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40001 steps (20 resets) in 240 ms. (165 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (20 resets) in 271 ms. (147 steps per ms) remains 2/2 properties
[2024-05-21 21:03:12] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
// Phase 1: matrix 369 rows 185 cols
[2024-05-21 21:03:12] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 21:03:12] [INFO ] State equation strengthened by 21 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) 2/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 162/166 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 373/539 variables, 166/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 21/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/541 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 13/554 variables, 13/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/554 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/554 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/554 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 554/554 variables, and 211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 185/185 constraints, ReadFeed: 21/21 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) 2/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 162/166 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 373/539 variables, 166/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 21/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/541 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/554 variables, 13/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/554 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/554 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/554 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 554/554 variables, and 213 constraints, problems are : Problem set: 0 solved, 2 unsolved in 945 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 185/185 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1236ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 161 ms.
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2028/2028 transitions.
Applied a total of 0 rules in 172 ms. Remains 185 /185 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Running 2025 sub problems to find dead transitions.
[2024-05-21 21:03:14] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 21:03:14] [INFO ] Invariant cache hit.
[2024-05-21 21:03:14] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-05-21 21:03:36] [INFO ] Deduced a trap composed of 5 places in 236 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20059 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 53326ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 53350ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53528 ms. Remains : 185/185 places, 2028/2028 transitions.
RANDOM walk for 40000 steps (56 resets) in 771 ms. (51 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40007 steps (20 resets) in 141 ms. (281 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (20 resets) in 153 ms. (259 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 270575 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 2
Probabilistic random walk after 270575 steps, saw 74492 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
[2024-05-21 21:04:11] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 21:04:11] [INFO ] Invariant cache hit.
[2024-05-21 21:04:11] [INFO ] State equation strengthened by 21 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) 2/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 162/166 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 373/539 variables, 166/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 21/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/541 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 13/554 variables, 13/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/554 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/554 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/554 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 554/554 variables, and 211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 185/185 constraints, ReadFeed: 21/21 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) 2/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 162/166 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 373/539 variables, 166/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 21/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/541 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/554 variables, 13/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/554 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/554 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/554 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 554/554 variables, and 213 constraints, problems are : Problem set: 0 solved, 2 unsolved in 950 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 185/185 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1189ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 157 ms.
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2028/2028 transitions.
Applied a total of 0 rules in 171 ms. Remains 185 /185 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 185/185 places, 2028/2028 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2028/2028 transitions.
Applied a total of 0 rules in 159 ms. Remains 185 /185 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
[2024-05-21 21:04:12] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 21:04:12] [INFO ] Invariant cache hit.
[2024-05-21 21:04:13] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-05-21 21:04:13] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 21:04:13] [INFO ] Invariant cache hit.
[2024-05-21 21:04:13] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 21:04:13] [INFO ] Implicit Places using invariants and state equation in 731 ms returned []
Implicit Place search using SMT with State Equation took 1100 ms to find 0 implicit places.
[2024-05-21 21:04:13] [INFO ] Redundant transitions in 52 ms returned []
Running 2025 sub problems to find dead transitions.
[2024-05-21 21:04:13] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 21:04:13] [INFO ] Invariant cache hit.
[2024-05-21 21:04:13] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-05-21 21:04:37] [INFO ] Deduced a trap composed of 5 places in 256 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 73487ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 73513ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74839 ms. Remains : 185/185 places, 2028/2028 transitions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (AND p1 (NOT p0))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F p0)]
Knowledge based reduction with 11 factoid took 416 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p1) (NOT p0))]
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 2028/2028 transitions.
Applied a total of 0 rules in 164 ms. Remains 185 /185 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Running 2025 sub problems to find dead transitions.
[2024-05-21 21:05:28] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 21:05:28] [INFO ] Invariant cache hit.
[2024-05-21 21:05:28] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-05-21 21:05:49] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20070 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 52927ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 52950ms
[2024-05-21 21:06:20] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 21:06:20] [INFO ] Invariant cache hit.
[2024-05-21 21:06:21] [INFO ] Implicit Places using invariants in 308 ms returned []
[2024-05-21 21:06:21] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 21:06:21] [INFO ] Invariant cache hit.
[2024-05-21 21:06:21] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 21:06:22] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1205 ms to find 0 implicit places.
[2024-05-21 21:06:22] [INFO ] Redundant transitions in 133 ms returned []
Running 2025 sub problems to find dead transitions.
[2024-05-21 21:06:22] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 21:06:22] [INFO ] Invariant cache hit.
[2024-05-21 21:06:22] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-05-21 21:06:43] [INFO ] Deduced a trap composed of 5 places in 223 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 73010ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 73034ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 127507 ms. Remains : 185/185 places, 2028/2028 transitions.
Computed a total of 168 stabilizing places and 324 stable transitions
Graph (complete) has 3899 edges and 185 vertex of which 184 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 168 stabilizing places and 324 stable transitions
Detected a total of 168/185 stabilizing places and 324/2028 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (AND p1 (NOT p0))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 298 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (56 resets) in 428 ms. (93 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (20 resets) in 128 ms. (310 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40005 steps (20 resets) in 167 ms. (238 steps per ms) remains 2/2 properties
[2024-05-21 21:07:36] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 21:07:36] [INFO ] Invariant cache hit.
[2024-05-21 21:07:36] [INFO ] State equation strengthened by 21 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) 2/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 162/166 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 373/539 variables, 166/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 21/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/541 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 13/554 variables, 13/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/554 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/554 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/554 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 554/554 variables, and 211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 260 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 185/185 constraints, ReadFeed: 21/21 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) 2/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 162/166 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 373/539 variables, 166/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 21/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/541 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/554 variables, 13/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/554 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/554 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/554 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 554/554 variables, and 213 constraints, problems are : Problem set: 0 solved, 2 unsolved in 921 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 185/185 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1201ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 134 ms.
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2028/2028 transitions.
Applied a total of 0 rules in 137 ms. Remains 185 /185 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Running 2025 sub problems to find dead transitions.
[2024-05-21 21:07:37] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 21:07:37] [INFO ] Invariant cache hit.
[2024-05-21 21:07:37] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-05-21 21:07:59] [INFO ] Deduced a trap composed of 5 places in 239 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 53010ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 53029ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53173 ms. Remains : 185/185 places, 2028/2028 transitions.
RANDOM walk for 40000 steps (56 resets) in 443 ms. (90 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (20 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40009 steps (20 resets) in 117 ms. (339 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 275641 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :0 out of 2
Probabilistic random walk after 275641 steps, saw 75818 distinct states, run finished after 3002 ms. (steps per millisecond=91 ) properties seen :0
[2024-05-21 21:08:33] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 21:08:33] [INFO ] Invariant cache hit.
[2024-05-21 21:08:33] [INFO ] State equation strengthened by 21 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) 2/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 162/166 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 373/539 variables, 166/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 21/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/541 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 13/554 variables, 13/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/554 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/554 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/554 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 554/554 variables, and 211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 260 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 185/185 constraints, ReadFeed: 21/21 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) 2/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 162/166 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 373/539 variables, 166/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 21/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/541 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/554 variables, 13/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/554 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/554 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/554 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 554/554 variables, and 213 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1067 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 185/185 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1348ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 140 ms.
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2028/2028 transitions.
Applied a total of 0 rules in 183 ms. Remains 185 /185 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 185/185 places, 2028/2028 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2028/2028 transitions.
Applied a total of 0 rules in 142 ms. Remains 185 /185 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
[2024-05-21 21:08:35] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 21:08:35] [INFO ] Invariant cache hit.
[2024-05-21 21:08:35] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-21 21:08:35] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 21:08:35] [INFO ] Invariant cache hit.
[2024-05-21 21:08:36] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 21:08:36] [INFO ] Implicit Places using invariants and state equation in 933 ms returned []
Implicit Place search using SMT with State Equation took 1313 ms to find 0 implicit places.
[2024-05-21 21:08:36] [INFO ] Redundant transitions in 83 ms returned []
Running 2025 sub problems to find dead transitions.
[2024-05-21 21:08:37] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 21:08:37] [INFO ] Invariant cache hit.
[2024-05-21 21:08:37] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-05-21 21:08:59] [INFO ] Deduced a trap composed of 5 places in 238 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 73507ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 73534ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75086 ms. Remains : 185/185 places, 2028/2028 transitions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (AND p1 (NOT p0))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F p0)]
Knowledge based reduction with 11 factoid took 578 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1263 reset in 594 ms.
Product exploration explored 100000 steps with 1237 reset in 467 ms.
Built C files in :
/tmp/ltsmin5184851650746497252
[2024-05-21 21:09:52] [INFO ] Too many transitions (2028) to apply POR reductions. Disabling POR matrices.
[2024-05-21 21:09:52] [INFO ] Built C files in 92ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5184851650746497252
Running compilation step : cd /tmp/ltsmin5184851650746497252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5184851650746497252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5184851650746497252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 2028/2028 transitions.
Applied a total of 0 rules in 192 ms. Remains 185 /185 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Running 2025 sub problems to find dead transitions.
[2024-05-21 21:09:55] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 21:09:55] [INFO ] Invariant cache hit.
[2024-05-21 21:09:55] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-05-21 21:10:18] [INFO ] Deduced a trap composed of 5 places in 270 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 52728ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 52751ms
[2024-05-21 21:10:48] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 21:10:48] [INFO ] Invariant cache hit.
[2024-05-21 21:10:48] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-05-21 21:10:48] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 21:10:48] [INFO ] Invariant cache hit.
[2024-05-21 21:10:48] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 21:10:49] [INFO ] Implicit Places using invariants and state equation in 897 ms returned []
Implicit Place search using SMT with State Equation took 1242 ms to find 0 implicit places.
[2024-05-21 21:10:49] [INFO ] Redundant transitions in 48 ms returned []
Running 2025 sub problems to find dead transitions.
[2024-05-21 21:10:49] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 21:10:49] [INFO ] Invariant cache hit.
[2024-05-21 21:10:49] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-05-21 21:11:14] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 74396ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 74419ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 128668 ms. Remains : 185/185 places, 2028/2028 transitions.
Built C files in :
/tmp/ltsmin10568476978781311860
[2024-05-21 21:12:04] [INFO ] Too many transitions (2028) to apply POR reductions. Disabling POR matrices.
[2024-05-21 21:12:04] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10568476978781311860
Running compilation step : cd /tmp/ltsmin10568476978781311860;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10568476978781311860;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10568476978781311860;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-21 21:12:07] [INFO ] Flatten gal took : 89 ms
[2024-05-21 21:12:07] [INFO ] Flatten gal took : 90 ms
[2024-05-21 21:12:07] [INFO ] Time to serialize gal into /tmp/LTL6387378408484728112.gal : 30 ms
[2024-05-21 21:12:07] [INFO ] Time to serialize properties into /tmp/LTL16488682452443559957.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6387378408484728112.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2658378317796830478.hoa' '-atoms' '/tmp/LTL16488682452443559957.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16488682452443559957.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2658378317796830478.hoa
Detected timeout of ITS tools.
[2024-05-21 21:12:22] [INFO ] Flatten gal took : 82 ms
[2024-05-21 21:12:22] [INFO ] Flatten gal took : 80 ms
[2024-05-21 21:12:22] [INFO ] Time to serialize gal into /tmp/LTL11760079265400148891.gal : 19 ms
[2024-05-21 21:12:22] [INFO ] Time to serialize properties into /tmp/LTL13469395544955394321.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11760079265400148891.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13469395544955394321.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(("(SORTI_B>=2)")||(G("(CAPACITE>=1)")))))
Formula 0 simplified : G(!"(SORTI_B>=2)" & F!"(CAPACITE>=1)")
Detected timeout of ITS tools.
[2024-05-21 21:12:38] [INFO ] Flatten gal took : 86 ms
[2024-05-21 21:12:38] [INFO ] Applying decomposition
[2024-05-21 21:12:38] [INFO ] Flatten gal took : 74 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13254202650069786246.txt' '-o' '/tmp/graph13254202650069786246.bin' '-w' '/tmp/graph13254202650069786246.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13254202650069786246.bin' '-l' '-1' '-v' '-w' '/tmp/graph13254202650069786246.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:12:38] [INFO ] Decomposing Gal with order
[2024-05-21 21:12:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:12:39] [INFO ] Removed a total of 5301 redundant transitions.
[2024-05-21 21:12:39] [INFO ] Flatten gal took : 441 ms
[2024-05-21 21:12:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 599 labels/synchronizations in 43 ms.
[2024-05-21 21:12:39] [INFO ] Time to serialize gal into /tmp/LTL1981200376997152129.gal : 5 ms
[2024-05-21 21:12:39] [INFO ] Time to serialize properties into /tmp/LTL16330748318335709131.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1981200376997152129.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16330748318335709131.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(("(i2.u33.SORTI_B>=2)")||(G("(i2.u33.CAPACITE>=1)")))))
Formula 0 simplified : G(!"(i2.u33.SORTI_B>=2)" & F!"(i2.u33.CAPACITE>=1)")
Detected timeout of ITS tools.
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLCardinality-09 finished in 642008 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)&&G(F((!p1||G(p2))))))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 2028/2028 transitions.
Graph (complete) has 4228 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 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 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 185 transition count 2027
Applied a total of 3 rules in 194 ms. Remains 185 /188 variables (removed 3) and now considering 2027/2028 (removed 1) transitions.
Running 2024 sub problems to find dead transitions.
[2024-05-21 21:12:54] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
// Phase 1: matrix 368 rows 185 cols
[2024-05-21 21:12:54] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 21:12:54] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-05-21 21:13:19] [INFO ] Deduced a trap composed of 5 places in 287 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 53523ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 53562ms
[2024-05-21 21:13:47] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 21:13:48] [INFO ] Invariant cache hit.
[2024-05-21 21:13:48] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-05-21 21:13:48] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 21:13:48] [INFO ] Invariant cache hit.
[2024-05-21 21:13:48] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 21:13:49] [INFO ] Implicit Places using invariants and state equation in 960 ms returned [83, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1348 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 183/188 places, 2027/2028 transitions.
Applied a total of 0 rules in 213 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 55325 ms. Remains : 183/188 places, 2027/2028 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-11
Stuttering criterion allowed to conclude after 2481 steps with 5 reset in 20 ms.
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLCardinality-11 finished in 55558 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U ((F(p0) U p1) U !p2)))'
Support contains 5 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 2028/2028 transitions.
Graph (complete) has 4228 edges and 188 vertex of which 187 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 252 ms. Remains 187 /188 variables (removed 1) and now considering 2028/2028 (removed 0) transitions.
Running 2025 sub problems to find dead transitions.
[2024-05-21 21:13:50] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
// Phase 1: matrix 369 rows 187 cols
[2024-05-21 21:13:50] [INFO ] Computed 6 invariants in 3 ms
[2024-05-21 21:13:50] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-05-21 21:14:12] [INFO ] Deduced a trap composed of 5 places in 263 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/187 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/187 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 53493ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 53522ms
[2024-05-21 21:14:43] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 21:14:43] [INFO ] Invariant cache hit.
[2024-05-21 21:14:43] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-21 21:14:43] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 21:14:43] [INFO ] Invariant cache hit.
[2024-05-21 21:14:43] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 21:14:44] [INFO ] Implicit Places using invariants and state equation in 897 ms returned [83, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1156 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 185/188 places, 2028/2028 transitions.
Applied a total of 0 rules in 151 ms. Remains 185 /185 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 55087 ms. Remains : 185/188 places, 2028/2028 transitions.
Stuttering acceptance computed with spot in 108 ms :[p2, (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-12
Product exploration explored 100000 steps with 374 reset in 426 ms.
Product exploration explored 100000 steps with 375 reset in 485 ms.
Computed a total of 168 stabilizing places and 324 stable transitions
Graph (complete) has 3899 edges and 185 vertex of which 184 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 168 stabilizing places and 324 stable transitions
Detected a total of 168/185 stabilizing places and 324/2028 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 9 factoid took 415 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[p2, (NOT p0)]
RANDOM walk for 40000 steps (56 resets) in 457 ms. (87 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (20 resets) in 195 ms. (204 steps per ms) remains 1/1 properties
[2024-05-21 21:14:46] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
// Phase 1: matrix 369 rows 185 cols
[2024-05-21 21:14:46] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 21:14:46] [INFO ] State equation strengthened by 21 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 288/299 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 254/553 variables, 173/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 11/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/554 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/554 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/554 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 554/554 variables, and 211 constraints, problems are : Problem set: 0 solved, 1 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 185/185 constraints, ReadFeed: 21/21 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 11/554 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 19 ms.
Refiners :[Positive P Invariants (semi-flows): 2/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 220ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 (NOT p2) p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT p2)), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 809 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[p2]
Stuttering acceptance computed with spot in 46 ms :[p2]
[2024-05-21 21:14:47] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 21:14:47] [INFO ] Invariant cache hit.
[2024-05-21 21:14:48] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 21:14:48] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2024-05-21 21:14:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:14:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 21:14:49] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-05-21 21:14:49] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 21:14:49] [INFO ] [Nat]Added 21 Read/Feed constraints in 49 ms returned sat
[2024-05-21 21:14:49] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 105 ms.
[2024-05-21 21:14:49] [INFO ] Added : 12 causal constraints over 3 iterations in 211 ms. Result :sat
Could not prove EG p2
Support contains 1 out of 185 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 2028/2028 transitions.
Applied a total of 0 rules in 141 ms. Remains 185 /185 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Running 2025 sub problems to find dead transitions.
[2024-05-21 21:14:49] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 21:14:49] [INFO ] Invariant cache hit.
[2024-05-21 21:14:49] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-05-21 21:15:12] [INFO ] Deduced a trap composed of 5 places in 237 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 53152ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 53172ms
[2024-05-21 21:15:43] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 21:15:43] [INFO ] Invariant cache hit.
[2024-05-21 21:15:43] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-21 21:15:43] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 21:15:43] [INFO ] Invariant cache hit.
[2024-05-21 21:15:43] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 21:15:44] [INFO ] Implicit Places using invariants and state equation in 733 ms returned []
Implicit Place search using SMT with State Equation took 1056 ms to find 0 implicit places.
[2024-05-21 21:15:44] [INFO ] Redundant transitions in 51 ms returned []
Running 2025 sub problems to find dead transitions.
[2024-05-21 21:15:44] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 21:15:44] [INFO ] Invariant cache hit.
[2024-05-21 21:15:44] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-05-21 21:16:08] [INFO ] Deduced a trap composed of 5 places in 289 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 73121ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 73144ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 127579 ms. Remains : 185/185 places, 2028/2028 transitions.
Computed a total of 168 stabilizing places and 324 stable transitions
Graph (complete) has 3899 edges and 185 vertex of which 184 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 168 stabilizing places and 324 stable transitions
Detected a total of 168/185 stabilizing places and 324/2028 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p2, (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 99 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 31 ms :[p2]
RANDOM walk for 1038 steps (0 resets) in 11 ms. (86 steps per ms) remains 0/1 properties
Knowledge obtained : [p2, (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 4 factoid took 96 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 27 ms :[p2]
Stuttering acceptance computed with spot in 30 ms :[p2]
[2024-05-21 21:16:57] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 21:16:57] [INFO ] Invariant cache hit.
[2024-05-21 21:16:58] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 21:16:58] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2024-05-21 21:16:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:16:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 21:16:59] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-05-21 21:16:59] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 21:16:59] [INFO ] [Nat]Added 21 Read/Feed constraints in 42 ms returned sat
[2024-05-21 21:16:59] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 142 ms.
[2024-05-21 21:16:59] [INFO ] Added : 12 causal constraints over 3 iterations in 266 ms. Result :sat
Could not prove EG p2
Stuttering acceptance computed with spot in 29 ms :[p2]
Product exploration explored 100000 steps with 372 reset in 453 ms.
Product exploration explored 100000 steps with 373 reset in 449 ms.
Built C files in :
/tmp/ltsmin4861717748044493258
[2024-05-21 21:17:00] [INFO ] Too many transitions (2028) to apply POR reductions. Disabling POR matrices.
[2024-05-21 21:17:00] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4861717748044493258
Running compilation step : cd /tmp/ltsmin4861717748044493258;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4861717748044493258;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4861717748044493258;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 2028/2028 transitions.
Graph (complete) has 3899 edges and 185 vertex of which 184 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 183 transition count 2027
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 183 transition count 2027
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 181 transition count 2026
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 179 transition count 2024
Applied a total of 10 rules in 256 ms. Remains 179 /185 variables (removed 6) and now considering 2024/2028 (removed 4) transitions.
[2024-05-21 21:17:03] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
// Phase 1: matrix 365 rows 179 cols
[2024-05-21 21:17:03] [INFO ] Computed 4 invariants in 3 ms
[2024-05-21 21:17:04] [INFO ] Implicit Places using invariants in 392 ms returned []
[2024-05-21 21:17:04] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
[2024-05-21 21:17:04] [INFO ] Invariant cache hit.
[2024-05-21 21:17:04] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 21:17:04] [INFO ] Implicit Places using invariants and state equation in 908 ms returned []
Implicit Place search using SMT with State Equation took 1303 ms to find 0 implicit places.
[2024-05-21 21:17:05] [INFO ] Redundant transitions in 68 ms returned []
Running 2021 sub problems to find dead transitions.
[2024-05-21 21:17:05] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
[2024-05-21 21:17:05] [INFO ] Invariant cache hit.
[2024-05-21 21:17:05] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2021 unsolved
[2024-05-21 21:17:44] [INFO ] Deduced a trap composed of 12 places in 190 ms of which 1 ms to minimize.
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 179/544 variables, and 5 constraints, problems are : Problem set: 80 solved, 1941 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/179 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2021/2021 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 80 solved, 1941 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 4/4 constraints. Problems are: Problem set: 80 solved, 1941 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 1/5 constraints. Problems are: Problem set: 80 solved, 1941 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 179/544 variables, and 5 constraints, problems are : Problem set: 80 solved, 1941 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/179 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2021 constraints, Known Traps: 1/1 constraints]
After SMT, in 73192ms problems are : Problem set: 80 solved, 1941 unsolved
Search for dead transitions found 80 dead transitions in 73215ms
Found 80 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 80 transitions
Dead transitions reduction (with SMT) removed 80 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 179/185 places, 1944/2028 transitions.
Applied a total of 0 rules in 106 ms. Remains 179 /179 variables (removed 0) and now considering 1944/1944 (removed 0) transitions.
[2024-05-21 21:18:18] [INFO ] Redundant transitions in 32 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 75005 ms. Remains : 179/185 places, 1944/2028 transitions.
Built C files in :
/tmp/ltsmin7964422927050738322
[2024-05-21 21:18:18] [INFO ] Too many transitions (1944) to apply POR reductions. Disabling POR matrices.
[2024-05-21 21:18:18] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7964422927050738322
Running compilation step : cd /tmp/ltsmin7964422927050738322;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7964422927050738322;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7964422927050738322;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-21 21:18:21] [INFO ] Flatten gal took : 45 ms
[2024-05-21 21:18:21] [INFO ] Flatten gal took : 44 ms
[2024-05-21 21:18:21] [INFO ] Time to serialize gal into /tmp/LTL12909176123675863995.gal : 8 ms
[2024-05-21 21:18:21] [INFO ] Time to serialize properties into /tmp/LTL9184281038366168974.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12909176123675863995.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17166157625348562741.hoa' '-atoms' '/tmp/LTL9184281038366168974.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL9184281038366168974.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17166157625348562741.hoa
Detected timeout of ITS tools.
[2024-05-21 21:18:36] [INFO ] Flatten gal took : 47 ms
[2024-05-21 21:18:36] [INFO ] Flatten gal took : 47 ms
[2024-05-21 21:18:36] [INFO ] Time to serialize gal into /tmp/LTL5140657593271598735.gal : 9 ms
[2024-05-21 21:18:36] [INFO ] Time to serialize properties into /tmp/LTL5876757378983817509.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5140657593271598735.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5876757378983817509.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((F("((CONTROLEUR_0+CONTROLEUR_1)<=SUR_PONT_A)"))U(((F("((CONTROLEUR_0+CONTROLEUR_1)<=SUR_PONT_A)"))U("(SUR_PONT_A<=SORTI_B)"))U("(R...169
Formula 0 simplified : G!"((CONTROLEUR_0+CONTROLEUR_1)<=SUR_PONT_A)" R ((G!"((CONTROLEUR_0+CONTROLEUR_1)<=SUR_PONT_A)" R !"(SUR_PONT_A<=SORTI_B)") R !"(ROU...164
Detected timeout of ITS tools.
[2024-05-21 21:18:51] [INFO ] Flatten gal took : 56 ms
[2024-05-21 21:18:51] [INFO ] Applying decomposition
[2024-05-21 21:18:51] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph346152388409227892.txt' '-o' '/tmp/graph346152388409227892.bin' '-w' '/tmp/graph346152388409227892.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph346152388409227892.bin' '-l' '-1' '-v' '-w' '/tmp/graph346152388409227892.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:18:52] [INFO ] Decomposing Gal with order
[2024-05-21 21:18:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:18:53] [INFO ] Removed a total of 3535 redundant transitions.
[2024-05-21 21:18:53] [INFO ] Flatten gal took : 891 ms
[2024-05-21 21:18:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 2296 labels/synchronizations in 99 ms.
[2024-05-21 21:18:53] [INFO ] Time to serialize gal into /tmp/LTL9078321436988273302.gal : 5 ms
[2024-05-21 21:18:53] [INFO ] Time to serialize properties into /tmp/LTL2539634514853848519.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9078321436988273302.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2539634514853848519.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((F("((gu2.CONTROLEUR_0+gu2.CONTROLEUR_1)<=gu2.SUR_PONT_A)"))U(((F("((gu2.CONTROLEUR_0+gu2.CONTROLEUR_1)<=gu2.SUR_PONT_A)"))U("(gu2....209
Formula 0 simplified : G!"((gu2.CONTROLEUR_0+gu2.CONTROLEUR_1)<=gu2.SUR_PONT_A)" R ((G!"((gu2.CONTROLEUR_0+gu2.CONTROLEUR_1)<=gu2.SUR_PONT_A)" R !"(gu2.SUR...204
Detected timeout of ITS tools.
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLCardinality-12 finished in 318643 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((p0 U G(!p0)))))))'
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2028/2028 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2028
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 185 transition count 2027
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 185 transition count 2027
Applied a total of 4 rules in 40 ms. Remains 185 /188 variables (removed 3) and now considering 2027/2028 (removed 1) transitions.
Running 2024 sub problems to find dead transitions.
[2024-05-21 21:19:08] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
// Phase 1: matrix 368 rows 185 cols
[2024-05-21 21:19:08] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 21:19:08] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-05-21 21:19:30] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 52868ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 52897ms
[2024-05-21 21:20:01] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 21:20:01] [INFO ] Invariant cache hit.
[2024-05-21 21:20:01] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-21 21:20:01] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 21:20:01] [INFO ] Invariant cache hit.
[2024-05-21 21:20:01] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 21:20:02] [INFO ] Implicit Places using invariants and state equation in 1105 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1459 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/188 places, 2027/2028 transitions.
Applied a total of 0 rules in 15 ms. Remains 184 /184 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 54419 ms. Remains : 184/188 places, 2027/2028 transitions.
Stuttering acceptance computed with spot in 256 ms :[p0, p0, p0, p0, p0, true, p0]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 688 steps with 1 reset in 7 ms.
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLCardinality-13 finished in 54705 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 2028/2028 transitions.
Graph (complete) has 4228 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 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 185 transition count 2027
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 185 transition count 2027
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 183 transition count 2026
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 181 transition count 2024
Applied a total of 10 rules in 200 ms. Remains 181 /188 variables (removed 7) and now considering 2024/2028 (removed 4) transitions.
[2024-05-21 21:20:03] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
// Phase 1: matrix 365 rows 181 cols
[2024-05-21 21:20:03] [INFO ] Computed 4 invariants in 4 ms
[2024-05-21 21:20:03] [INFO ] Implicit Places using invariants in 380 ms returned []
[2024-05-21 21:20:03] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
[2024-05-21 21:20:03] [INFO ] Invariant cache hit.
[2024-05-21 21:20:03] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 21:20:04] [INFO ] Implicit Places using invariants and state equation in 1056 ms returned [82, 164]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1441 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 179/188 places, 2024/2028 transitions.
Applied a total of 0 rules in 147 ms. Remains 179 /179 variables (removed 0) and now considering 2024/2024 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1789 ms. Remains : 179/188 places, 2024/2028 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-14
Stuttering criterion allowed to conclude after 497 steps with 0 reset in 9 ms.
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLCardinality-14 finished in 1877 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2028/2028 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2028
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 185 transition count 2027
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 185 transition count 2027
Applied a total of 4 rules in 37 ms. Remains 185 /188 variables (removed 3) and now considering 2027/2028 (removed 1) transitions.
Running 2024 sub problems to find dead transitions.
[2024-05-21 21:20:05] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
// Phase 1: matrix 368 rows 185 cols
[2024-05-21 21:20:05] [INFO ] Computed 5 invariants in 5 ms
[2024-05-21 21:20:05] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-05-21 21:20:26] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 53044ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 53073ms
[2024-05-21 21:20:58] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 21:20:58] [INFO ] Invariant cache hit.
[2024-05-21 21:20:58] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-05-21 21:20:58] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 21:20:58] [INFO ] Invariant cache hit.
[2024-05-21 21:20:58] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 21:20:59] [INFO ] Implicit Places using invariants and state equation in 1301 ms returned [83, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1667 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 183/188 places, 2027/2028 transitions.
Applied a total of 0 rules in 16 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 54800 ms. Remains : 183/188 places, 2027/2028 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 285 steps with 0 reset in 3 ms.
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLCardinality-15 finished in 54946 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||G(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' '!((F(p0) U ((F(p0) U p1) U !p2)))'
[2024-05-21 21:21:00] [INFO ] Flatten gal took : 163 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1206135451505250433
[2024-05-21 21:21:00] [INFO ] Too many transitions (2028) to apply POR reductions. Disabling POR matrices.
[2024-05-21 21:21:00] [INFO ] Applying decomposition
[2024-05-21 21:21:00] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1206135451505250433
Running compilation step : cd /tmp/ltsmin1206135451505250433;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-21 21:21:00] [INFO ] Flatten gal took : 102 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9822948052817836180.txt' '-o' '/tmp/graph9822948052817836180.bin' '-w' '/tmp/graph9822948052817836180.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9822948052817836180.bin' '-l' '-1' '-v' '-w' '/tmp/graph9822948052817836180.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:21:00] [INFO ] Decomposing Gal with order
[2024-05-21 21:21:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:21:01] [INFO ] Removed a total of 3613 redundant transitions.
[2024-05-21 21:21:01] [INFO ] Flatten gal took : 767 ms
[2024-05-21 21:21:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 2138 labels/synchronizations in 48 ms.
[2024-05-21 21:21:01] [INFO ] Time to serialize gal into /tmp/LTLCardinality7012198581601812010.gal : 6 ms
[2024-05-21 21:21:01] [INFO ] Time to serialize properties into /tmp/LTLCardinality8814290719855824150.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7012198581601812010.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8814290719855824150.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 2 LTL properties
Checking formula 0 : !((F(("(gu2.SORTI_B>=2)")||(G("(gi0.gu0.CAPACITE>=1)")))))
Formula 0 simplified : G(!"(gu2.SORTI_B>=2)" & F!"(gi0.gu0.CAPACITE>=1)")
Compilation finished in 5588 ms.
Running link step : cd /tmp/ltsmin1206135451505250433;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 91 ms.
Running LTSmin : cd /tmp/ltsmin1206135451505250433;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(((LTLAPp0==true)||[]((LTLAPp1==true))))' '--buchi-type=spotba'

BK_STOP 1716327193542

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-V80P20N10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BridgeAndVehicles-COL-V80P20N10, 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 r048-tajo-171620398800115"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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