Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.8K Apr 13 01:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 13 01:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 13 00:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.4K 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.8K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 13 01:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 13 01:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 01:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Apr 13 01:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 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-V80P50N10-CTLCardinality-2024-00
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-01
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-02
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-03
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-04
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-05
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-06
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-07
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-08
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-09
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-10
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-11
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-12
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-13
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-14
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717219301478

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V80P50N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:21:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 05:21:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:21:42] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 05:21:43] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 05:21:43] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 740 ms
[2024-06-01 05:21:43] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 188 PT places and 289218.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 57 ms.
[2024-06-01 05:21:43] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 9 ms.
[2024-06-01 05:21:43] [INFO ] Skeletonized 16 HLPN properties in 4 ms.
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.8 ms
Remains 16 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
RANDOM walk for 40000 steps (8 resets) in 2140 ms. (18 steps per ms) remains 28/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 69 ms. (57 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 95 ms. (41 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 85 ms. (46 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
// Phase 1: matrix 10 rows 12 cols
[2024-06-01 05:21:45] [INFO ] Computed 4 invariants in 4 ms
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp56 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 3/3 constraints. Problems are: Problem set: 19 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 19 solved, 9 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/12 variables, 1/4 constraints. Problems are: Problem set: 22 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 22 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 10/22 variables, 12/16 constraints. Problems are: Problem set: 22 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/16 constraints. Problems are: Problem set: 22 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/22 variables, 0/16 constraints. Problems are: Problem set: 22 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 16 constraints, problems are : Problem set: 22 solved, 6 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 22 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 22 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 22 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 4/9 variables, 2/3 constraints. Problems are: Problem set: 22 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 22 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 6/15 variables, 9/12 constraints. Problems are: Problem set: 22 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 22 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 6/21 variables, 2/14 constraints. Problems are: Problem set: 22 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 6/20 constraints. Problems are: Problem set: 22 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/20 constraints. Problems are: Problem set: 22 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1/22 variables, 1/21 constraints. Problems are: Problem set: 22 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/22 variables, 1/22 constraints. Problems are: Problem set: 22 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 22 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/22 variables, 0/22 constraints. Problems are: Problem set: 22 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 22 constraints, problems are : Problem set: 22 solved, 6 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 6/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 458ms problems are : Problem set: 22 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Finished Parikh walk after 347 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=347 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 435 ms.
Successfully simplified 22 atomic propositions for a total of 14 simplifications.
FORMULA BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:21:46] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2024-06-01 05:21:46] [INFO ] Flatten gal took : 25 ms
[2024-06-01 05:21:46] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:21:46] [INFO ] Flatten gal took : 3 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-06-01 05:21:46] [INFO ] Unfolded HLPN to a Petri net with 188 places and 2108 transitions 15950 arcs in 112 ms.
[2024-06-01 05:21:46] [INFO ] Unfolded 6 HLPN properties in 1 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 67 ms. Remains 188 /188 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Running 2105 sub problems to find dead transitions.
[2024-06-01 05:21:46] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2024-06-01 05:21:46] [INFO ] Computed 7 invariants in 46 ms
[2024-06-01 05:21:46] [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-06-01 05:22:13] [INFO ] Deduced a trap composed of 5 places in 302 ms of which 9 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 20075 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 20066 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 55697ms problems are : Problem set: 0 solved, 2105 unsolved
Search for dead transitions found 0 dead transitions in 55744ms
[2024-06-01 05:22:42] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-06-01 05:22:42] [INFO ] Invariant cache hit.
[2024-06-01 05:22:42] [INFO ] Implicit Places using invariants in 348 ms returned []
[2024-06-01 05:22:42] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-06-01 05:22:42] [INFO ] Invariant cache hit.
[2024-06-01 05:22:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 05:22:44] [INFO ] Implicit Places using invariants and state equation in 1894 ms returned []
Implicit Place search using SMT with State Equation took 2250 ms to find 0 implicit places.
Running 2105 sub problems to find dead transitions.
[2024-06-01 05:22:44] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-06-01 05:22:44] [INFO ] Invariant cache hit.
[2024-06-01 05:22:44] [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-06-01 05:23:09] [INFO ] Deduced a trap composed of 5 places in 251 ms of which 2 ms to minimize.
[2024-06-01 05:23:25] [INFO ] Deduced a trap composed of 15 places in 237 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
Error getting values : (error "ParserException while parsing response: ((s0 49.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.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)
(s83 1.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30043 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 75743ms problems are : Problem set: 80 solved, 2025 unsolved
Search for dead transitions found 80 dead transitions in 75781ms
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 33 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 133914 ms. Remains : 188/188 places, 2028/2108 transitions.
Support contains 15 out of 188 places after structural reductions.
[2024-06-01 05:24:00] [INFO ] Flatten gal took : 198 ms
[2024-06-01 05:24:00] [INFO ] Flatten gal took : 165 ms
[2024-06-01 05:24:00] [INFO ] Input system was already deterministic with 2028 transitions.
RANDOM walk for 40000 steps (56 resets) in 1919 ms. (20 steps per ms) remains 10/24 properties
BEST_FIRST walk for 40003 steps (20 resets) in 186 ms. (213 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (24 resets) in 260 ms. (153 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (20 resets) in 198 ms. (201 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (20 resets) in 336 ms. (118 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (24 resets) in 358 ms. (111 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40005 steps (20 resets) in 216 ms. (184 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (20 resets) in 280 ms. (142 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (24 resets) in 311 ms. (128 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (20 resets) in 212 ms. (187 steps per ms) remains 9/10 properties
[2024-06-01 05:24:02] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
// Phase 1: matrix 369 rows 188 cols
[2024-06-01 05:24:02] [INFO ] Computed 7 invariants in 10 ms
[2024-06-01 05:24:02] [INFO ] State equation strengthened by 21 read => feed constraints.
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 4 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp12 is UNSAT
At refinement iteration 2 (OVERLAPS) 9/15 variables, 3/4 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 369/384 variables, 15/19 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 21/40 constraints. Problems are: Problem set: 7 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 0/40 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 173/557 variables, 173/213 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 3/216 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/557 variables, 0/216 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/557 variables, 0/216 constraints. Problems are: Problem set: 7 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 216 constraints, problems are : Problem set: 7 solved, 2 unsolved in 460 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 188/188 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/9 variables, 1/3 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 324/333 variables, 9/12 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/12 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 211/544 variables, 166/178 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/544 variables, 2/180 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/544 variables, 21/201 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/544 variables, 2/203 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/544 variables, 0/203 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/546 variables, 1/204 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/546 variables, 2/206 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/546 variables, 0/206 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 11/557 variables, 11/217 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/557 variables, 1/218 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/557 variables, 0/218 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/557 variables, 0/218 constraints. Problems are: Problem set: 7 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 218 constraints, problems are : Problem set: 7 solved, 2 unsolved in 770 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 188/188 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 1298ms problems are : Problem set: 7 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 259 ms.
Support contains 2 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.8 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 272 ms. Remains 186 /188 variables (removed 2) and now considering 2028/2028 (removed 0) transitions.
Running 2025 sub problems to find dead transitions.
[2024-06-01 05:24:04] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
// Phase 1: matrix 369 rows 186 cols
[2024-06-01 05:24:04] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 05:24:04] [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-06-01 05:24:29] [INFO ] Deduced a trap composed of 5 places in 218 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 20046 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 20043 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 55396ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 55430ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55709 ms. Remains : 186/188 places, 2028/2028 transitions.
RANDOM walk for 40000 steps (56 resets) in 462 ms. (86 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (20 resets) in 136 ms. (291 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40005 steps (20 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 236779 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 2
Probabilistic random walk after 236779 steps, saw 65551 distinct states, run finished after 3005 ms. (steps per millisecond=78 ) properties seen :0
[2024-06-01 05:25:02] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 05:25:02] [INFO ] Invariant cache hit.
[2024-06-01 05:25:02] [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) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 162/165 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 375/540 variables, 168/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 21/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/542 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/542 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/542 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 13/555 variables, 13/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/555 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/555 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/555 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 212 constraints, problems are : Problem set: 0 solved, 2 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 186/186 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) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 162/165 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 375/540 variables, 168/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 21/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/542 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/542 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/542 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/555 variables, 13/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/555 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/555 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/555 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 214 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1013 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 186/186 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1326ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 96 ms.
Support contains 2 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2028/2028 transitions.
Applied a total of 0 rules in 268 ms. Remains 186 /186 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 268 ms. Remains : 186/186 places, 2028/2028 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2028/2028 transitions.
Applied a total of 0 rules in 233 ms. Remains 186 /186 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
[2024-06-01 05:25:04] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 05:25:04] [INFO ] Invariant cache hit.
[2024-06-01 05:25:05] [INFO ] Implicit Places using invariants in 410 ms returned []
[2024-06-01 05:25:05] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 05:25:05] [INFO ] Invariant cache hit.
[2024-06-01 05:25:05] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 05:25:06] [INFO ] Implicit Places using invariants and state equation in 1472 ms returned [83, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1893 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 184/186 places, 2028/2028 transitions.
Applied a total of 0 rules in 159 ms. Remains 184 /184 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2285 ms. Remains : 184/186 places, 2028/2028 transitions.
RANDOM walk for 40000 steps (56 resets) in 607 ms. (65 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (20 resets) in 168 ms. (236 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40011 steps (20 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 305249 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :0 out of 2
Probabilistic random walk after 305249 steps, saw 83695 distinct states, run finished after 3001 ms. (steps per millisecond=101 ) properties seen :0
[2024-06-01 05:25:10] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
// Phase 1: matrix 369 rows 184 cols
[2024-06-01 05:25:10] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 05:25:10] [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) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 162/165 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 373/538 variables, 166/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 21/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/540 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 13/553 variables, 13/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/553 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/553 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/553 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 210 constraints, problems are : Problem set: 0 solved, 2 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 184/184 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) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 162/165 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 373/538 variables, 166/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 21/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/540 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/553 variables, 13/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/553 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/553 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/553 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 212 constraints, problems are : Problem set: 0 solved, 2 unsolved in 908 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1214ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 130 ms.
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2028/2028 transitions.
Applied a total of 0 rules in 169 ms. Remains 184 /184 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 184/184 places, 2028/2028 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2028/2028 transitions.
Applied a total of 0 rules in 161 ms. Remains 184 /184 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
[2024-06-01 05:25:11] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 05:25:11] [INFO ] Invariant cache hit.
[2024-06-01 05:25:12] [INFO ] Implicit Places using invariants in 400 ms returned []
[2024-06-01 05:25:12] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 05:25:12] [INFO ] Invariant cache hit.
[2024-06-01 05:25:12] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 05:25:13] [INFO ] Implicit Places using invariants and state equation in 803 ms returned []
Implicit Place search using SMT with State Equation took 1207 ms to find 0 implicit places.
[2024-06-01 05:25:13] [INFO ] Redundant transitions in 135 ms returned []
Running 2025 sub problems to find dead transitions.
[2024-06-01 05:25:13] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 05:25:13] [INFO ] Invariant cache hit.
[2024-06-01 05:25: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-06-01 05:25:41] [INFO ] Deduced a trap composed of 5 places in 235 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/553 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/184 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/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 78762ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 78797ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80316 ms. Remains : 184/184 places, 2028/2028 transitions.
Successfully simplified 7 atomic propositions for a total of 5 simplifications.
[2024-06-01 05:26:32] [INFO ] Flatten gal took : 110 ms
[2024-06-01 05:26:32] [INFO ] Flatten gal took : 112 ms
[2024-06-01 05:26:32] [INFO ] Input system was already deterministic with 2028 transitions.
Support contains 12 out of 188 places (down from 13) after GAL structural reductions.
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.17 ms
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 61 ms. Remains 185 /188 variables (removed 3) and now considering 2027/2028 (removed 1) transitions.
Running 2024 sub problems to find dead transitions.
[2024-06-01 05:26:32] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
// Phase 1: matrix 368 rows 185 cols
[2024-06-01 05:26:32] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 05:26:32] [INFO ] State equation strengthened by 21 read => feed constraints.
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-00
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-01
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-02
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-03
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-04
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-05
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-06
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-07
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-08
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-09
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-10
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-11
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-12
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-13
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-14
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-15

BK_STOP 1717219607718

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/631/ctl_0_
ctl formula name BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/631/ctl_1_
ctl formula name BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/631/ctl_2_
ctl formula name BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/631/ctl_3_
ctl formula name BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/631/ctl_4_
ctl formula name BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/631/ctl_5_
ctl formula name BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/631/ctl_6_
ctl formula name BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/631/ctl_7_
ctl formula name BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/631/ctl_8_
ctl formula name BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/631/ctl_9_
ctl formula name BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/631/ctl_10_
ctl formula name BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/631/ctl_11_
ctl formula name BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/631/ctl_12_
ctl formula name BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/631/ctl_13_
ctl formula name BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/631/ctl_14_
ctl formula name BridgeAndVehicles-COL-V80P50N10-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/631/ctl_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-V80P50N10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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