Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.0K Apr 13 02:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Apr 13 02:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 02:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 13 02:04 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.9K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K 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 18K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 03:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 13 03:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 13 03:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K Apr 13 03:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 42K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716324408613

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-V50P50N20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202405141337
[2024-05-21 20:46:50] [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:46:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:46:50] [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:46:50] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 20:46:50] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 625 ms
[2024-05-21 20:46:50] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 138 PT places and 218878.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2024-05-21 20:46:50] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2024-05-21 20:46:50] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-13 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.3 ms
Remains 12 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
RANDOM walk for 40000 steps (8 resets) in 1562 ms. (25 steps per ms) remains 6/23 properties
BEST_FIRST walk for 40001 steps (8 resets) in 278 ms. (143 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 141 ms. (281 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 107 ms. (370 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 112 ms. (353 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 88 ms. (449 steps per ms) remains 4/4 properties
// Phase 1: matrix 10 rows 12 cols
[2024-05-21 20:46:51] [INFO ] Computed 4 invariants in 4 ms
Problem AtomicPropp11 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp19 is UNSAT
At refinement iteration 1 (OVERLAPS) 6/12 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 10/22 variables, 12/16 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/16 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/22 variables, 0/16 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 16 constraints, problems are : Problem set: 3 solved, 1 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 9/12 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/21 variables, 2/14 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 1/15 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/21 variables, 0/15 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/22 variables, 1/16 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/22 variables, 1/17 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/22 variables, 0/17 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/22 variables, 0/17 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 17 constraints, problems are : Problem set: 3 solved, 1 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 300ms problems are : Problem set: 3 solved, 1 unsolved
Finished Parikh walk after 147 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=147 )
Parikh walk visited 1 properties in 8 ms.
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 20:46:52] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-21 20:46:52] [INFO ] Flatten gal took : 16 ms
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 20:46:52] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD $cA 1) 51)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 51) 51) 51)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 21)]] 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:46:52] [INFO ] Unfolded HLPN to a Petri net with 138 places and 2348 transitions 18090 arcs in 109 ms.
[2024-05-21 20:46:52] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Support contains 15 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 44 ms. Remains 138 /138 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Running 2345 sub problems to find dead transitions.
[2024-05-21 20:46:52] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2024-05-21 20:46:52] [INFO ] Computed 7 invariants in 19 ms
[2024-05-21 20:46:52] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-05-21 20:47:20] [INFO ] Deduced a trap composed of 5 places in 373 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/428 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20060 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/138 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2345/2345 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/428 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20095 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/138 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2345 constraints, Known Traps: 1/1 constraints]
After SMT, in 58263ms problems are : Problem set: 0 solved, 2345 unsolved
Search for dead transitions found 0 dead transitions in 58311ms
[2024-05-21 20:47:50] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 20:47:50] [INFO ] Invariant cache hit.
[2024-05-21 20:47:51] [INFO ] Implicit Places using invariants in 536 ms returned []
[2024-05-21 20:47:51] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 20:47:51] [INFO ] Invariant cache hit.
[2024-05-21 20:47:51] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 20:47:52] [INFO ] Implicit Places using invariants and state equation in 1174 ms returned []
Implicit Place search using SMT with State Equation took 1734 ms to find 0 implicit places.
Running 2345 sub problems to find dead transitions.
[2024-05-21 20:47:52] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 20:47:52] [INFO ] Invariant cache hit.
[2024-05-21 20:47:52] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-05-21 20:48:19] [INFO ] Deduced a trap composed of 5 places in 292 ms of which 2 ms to minimize.
[2024-05-21 20:48:36] [INFO ] Deduced a trap composed of 25 places in 237 ms of which 2 ms to minimize.
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/428 variables, and 7 constraints, problems are : Problem set: 50 solved, 2295 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/138 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2345/2345 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 50 solved, 2295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 50 solved, 2295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 2/7 constraints. Problems are: Problem set: 50 solved, 2295 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/428 variables, and 7 constraints, problems are : Problem set: 50 solved, 2295 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/138 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2345 constraints, Known Traps: 2/2 constraints]
After SMT, in 78809ms problems are : Problem set: 50 solved, 2295 unsolved
Search for dead transitions found 50 dead transitions in 78887ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 138/138 places, 2298/2348 transitions.
Applied a total of 0 rules in 16 ms. Remains 138 /138 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 139037 ms. Remains : 138/138 places, 2298/2348 transitions.
Support contains 15 out of 138 places after structural reductions.
[2024-05-21 20:49:11] [INFO ] Flatten gal took : 146 ms
[2024-05-21 20:49:11] [INFO ] Flatten gal took : 134 ms
[2024-05-21 20:49:11] [INFO ] Input system was already deterministic with 2298 transitions.
Support contains 13 out of 138 places (down from 15) after GAL structural reductions.
RANDOM walk for 40000 steps (92 resets) in 3128 ms. (12 steps per ms) remains 3/18 properties
BEST_FIRST walk for 40002 steps (32 resets) in 231 ms. (172 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (32 resets) in 198 ms. (201 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (36 resets) in 307 ms. (129 steps per ms) remains 3/3 properties
[2024-05-21 20:49:13] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
// Phase 1: matrix 289 rows 138 cols
[2024-05-21 20:49:13] [INFO ] Computed 7 invariants in 7 ms
[2024-05-21 20:49:13] [INFO ] State equation strengthened by 41 read => feed constraints.
Problem AtomicPropp10 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp14 is UNSAT
At refinement iteration 1 (OVERLAPS) 10/15 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 289/304 variables, 15/19 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 41/60 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 0/60 constraints. Problems are: Problem set: 2 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 123/427 variables, 123/183 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/427 variables, 3/186 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 0/186 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/427 variables, 0/186 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 186 constraints, problems are : Problem set: 2 solved, 1 unsolved in 187 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/213 variables, 9/12 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 191/404 variables, 106/118 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 2/120 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/404 variables, 41/161 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 1/162 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/404 variables, 0/162 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/406 variables, 1/163 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 2/165 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 0/165 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 21/427 variables, 21/186 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/427 variables, 1/187 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/427 variables, 0/187 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/427 variables, 0/187 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 427/427 variables, and 187 constraints, problems are : Problem set: 2 solved, 1 unsolved in 367 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 629ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 426 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 2298/2298 transitions.
Graph (complete) has 1301 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 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 135 transition count 2297
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 135 transition count 2297
Applied a total of 3 rules in 491 ms. Remains 135 /138 variables (removed 3) and now considering 2297/2298 (removed 1) transitions.
Running 2294 sub problems to find dead transitions.
[2024-05-21 20:49:14] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
// Phase 1: matrix 288 rows 135 cols
[2024-05-21 20:49:14] [INFO ] Computed 5 invariants in 9 ms
[2024-05-21 20:49:14] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-05-21 20:49:43] [INFO ] Deduced a trap composed of 5 places in 303 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 60370ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 60408ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60913 ms. Remains : 135/138 places, 2297/2298 transitions.
RANDOM walk for 40001 steps (92 resets) in 723 ms. (55 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40006 steps (32 resets) in 248 ms. (160 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 331437 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 1
Probabilistic random walk after 331437 steps, saw 88294 distinct states, run finished after 3004 ms. (steps per millisecond=110 ) properties seen :0
[2024-05-21 20:50:18] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 20:50:18] [INFO ] Invariant cache hit.
[2024-05-21 20:50:18] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 295/398 variables, 108/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 41/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/400 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 23/423 variables, 23/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/423 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 181 constraints, problems are : Problem set: 0 solved, 1 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 135/135 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 295/398 variables, 108/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 41/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/400 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/400 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 23/423 variables, 23/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/423 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 182 constraints, problems are : Problem set: 0 solved, 1 unsolved in 530 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 135/135 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 780ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 195 ms.
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 2297/2297 transitions.
Applied a total of 0 rules in 273 ms. Remains 135 /135 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 273 ms. Remains : 135/135 places, 2297/2297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 2297/2297 transitions.
Applied a total of 0 rules in 211 ms. Remains 135 /135 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
[2024-05-21 20:50:19] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 20:50:19] [INFO ] Invariant cache hit.
[2024-05-21 20:50:20] [INFO ] Implicit Places using invariants in 500 ms returned []
[2024-05-21 20:50:20] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 20:50:20] [INFO ] Invariant cache hit.
[2024-05-21 20:50:20] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 20:50:21] [INFO ] Implicit Places using invariants and state equation in 1057 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1570 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 133/135 places, 2297/2297 transitions.
Applied a total of 0 rules in 185 ms. Remains 133 /133 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1966 ms. Remains : 133/135 places, 2297/2297 transitions.
RANDOM walk for 40000 steps (92 resets) in 526 ms. (75 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (32 resets) in 273 ms. (145 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 297030 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :0 out of 1
Probabilistic random walk after 297030 steps, saw 79372 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
[2024-05-21 20:50:24] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
// Phase 1: matrix 288 rows 133 cols
[2024-05-21 20:50:24] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 20:50:24] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 293/396 variables, 106/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/398 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 23/421 variables, 23/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/421 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/421 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/421 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 421/421 variables, and 179 constraints, problems are : Problem set: 0 solved, 1 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 293/396 variables, 106/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/398 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/398 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 23/421 variables, 23/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/421 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/421 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/421 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 421/421 variables, and 180 constraints, problems are : Problem set: 0 solved, 1 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 599ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2297/2297 transitions.
Applied a total of 0 rules in 185 ms. Remains 133 /133 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 133/133 places, 2297/2297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2297/2297 transitions.
Applied a total of 0 rules in 172 ms. Remains 133 /133 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
[2024-05-21 20:50:25] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 20:50:25] [INFO ] Invariant cache hit.
[2024-05-21 20:50:26] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-05-21 20:50:26] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 20:50:26] [INFO ] Invariant cache hit.
[2024-05-21 20:50:26] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 20:50:27] [INFO ] Implicit Places using invariants and state equation in 720 ms returned []
Implicit Place search using SMT with State Equation took 1109 ms to find 0 implicit places.
[2024-05-21 20:50:27] [INFO ] Redundant transitions in 130 ms returned []
Running 2294 sub problems to find dead transitions.
[2024-05-21 20:50:27] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 20:50:27] [INFO ] Invariant cache hit.
[2024-05-21 20:50:27] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-05-21 20:50:54] [INFO ] Deduced a trap composed of 5 places in 274 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved

BK_STOP 1716324690166

--------------------
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-V50P50N20"
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-V50P50N20, 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-171620398800099"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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