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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 8.4K Apr 13 00:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 13 00:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 13 00:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 13 00:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Apr 13 01:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 13 01:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 01:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 13 01:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 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-V50P20N20-CTLCardinality-2024-00
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-CTLCardinality-2024-01
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-CTLCardinality-2024-02
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-CTLCardinality-2024-03
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-CTLCardinality-2024-04
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-CTLCardinality-2024-05
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-CTLCardinality-2024-06
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-CTLCardinality-2024-07
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-CTLCardinality-2024-08
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-CTLCardinality-2024-09
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-CTLCardinality-2024-10
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-CTLCardinality-2024-11
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-CTLCardinality-2024-12
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-CTLCardinality-2024-13
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-CTLCardinality-2024-14
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717218458972

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-V50P20N20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:07:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 05:07:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:07:40] [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:07:40] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 05:07:40] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 487 ms
[2024-06-01 05:07:40] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 138 PT places and 218878.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
[2024-06-01 05:07:40] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2024-06-01 05:07:40] [INFO ] Skeletonized 16 HLPN properties in 2 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.3 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-V50P20N20-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
RANDOM walk for 40000 steps (8 resets) in 1655 ms. (24 steps per ms) remains 43/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (8 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 42/43 properties
// Phase 1: matrix 10 rows 12 cols
[2024-06-01 05:07:41] [INFO ] Computed 4 invariants in 3 ms
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp65 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 4/4 constraints. Problems are: Problem set: 39 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 39 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 10/22 variables, 12/16 constraints. Problems are: Problem set: 39 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/16 constraints. Problems are: Problem set: 39 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 0/22 variables, 0/16 constraints. Problems are: Problem set: 39 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 16 constraints, problems are : Problem set: 39 solved, 3 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 39 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 39 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 39 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 39 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 2/4 constraints. Problems are: Problem set: 39 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 39 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 10/22 variables, 12/16 constraints. Problems are: Problem set: 39 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 3/19 constraints. Problems are: Problem set: 39 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 0/19 constraints. Problems are: Problem set: 39 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/22 variables, 0/19 constraints. Problems are: Problem set: 39 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 19 constraints, problems are : Problem set: 39 solved, 3 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 3/42 constraints, Known Traps: 0/0 constraints]
After SMT, in 307ms problems are : Problem set: 39 solved, 3 unsolved
Finished Parikh walk after 64 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=21 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 7 ms.
Successfully simplified 39 atomic propositions for a total of 15 simplifications.
FORMULA BridgeAndVehicles-COL-V50P20N20-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N20-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N20-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N20-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N20-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N20-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:07:42] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-01 05:07:42] [INFO ] Flatten gal took : 12 ms
[2024-06-01 05:07:42] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V50P20N20-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N20-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N20-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N20-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:07:42] [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-06-01 05:07:42] [INFO ] Unfolded HLPN to a Petri net with 138 places and 2348 transitions 18090 arcs in 78 ms.
[2024-06-01 05:07:42] [INFO ] Unfolded 5 HLPN properties in 0 ms.
Support contains 12 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 2348
Applied a total of 1 rules in 51 ms. Remains 137 /138 variables (removed 1) and now considering 2348/2348 (removed 0) transitions.
Running 2345 sub problems to find dead transitions.
[2024-06-01 05:07:42] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 137 cols
[2024-06-01 05:07:42] [INFO ] Computed 6 invariants in 13 ms
[2024-06-01 05:07:42] [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-06-01 05:08:08] [INFO ] Deduced a trap composed of 5 places in 334 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/427 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20108 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/137 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
[2024-06-01 05:08:38] [INFO ] Deduced a trap composed of 25 places in 210 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 Int declared 136/427 variables, and 7 constraints, problems are : Problem set: 50 solved, 2295 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/137 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2345 constraints, Known Traps: 2/2 constraints]
After SMT, in 57399ms problems are : Problem set: 50 solved, 2295 unsolved
Search for dead transitions found 50 dead transitions in 57434ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 50 transitions.
[2024-06-01 05:08:39] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
// Phase 1: matrix 289 rows 137 cols
[2024-06-01 05:08:39] [INFO ] Computed 6 invariants in 5 ms
[2024-06-01 05:08:40] [INFO ] Implicit Places using invariants in 350 ms returned []
[2024-06-01 05:08:40] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 05:08:40] [INFO ] Invariant cache hit.
[2024-06-01 05:08:40] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 05:08:40] [INFO ] Implicit Places using invariants and state equation in 927 ms returned []
Implicit Place search using SMT with State Equation took 1286 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 137/138 places, 2298/2348 transitions.
Applied a total of 0 rules in 26 ms. Remains 137 /137 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58819 ms. Remains : 137/138 places, 2298/2348 transitions.
Support contains 12 out of 137 places after structural reductions.
[2024-06-01 05:08:41] [INFO ] Flatten gal took : 190 ms
[2024-06-01 05:08:41] [INFO ] Flatten gal took : 174 ms
[2024-06-01 05:08:41] [INFO ] Input system was already deterministic with 2298 transitions.
RANDOM walk for 40000 steps (92 resets) in 2216 ms. (18 steps per ms) remains 11/22 properties
BEST_FIRST walk for 40002 steps (38 resets) in 268 ms. (148 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (44 resets) in 373 ms. (106 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (38 resets) in 275 ms. (144 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (32 resets) in 210 ms. (189 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40001 steps (44 resets) in 199 ms. (200 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (36 resets) in 198 ms. (201 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (32 resets) in 276 ms. (144 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (24 resets) in 232 ms. (171 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (32 resets) in 197 ms. (202 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (40 resets) in 214 ms. (186 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (32 resets) in 145 ms. (273 steps per ms) remains 10/10 properties
[2024-06-01 05:08:43] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 05:08:43] [INFO ] Invariant cache hit.
[2024-06-01 05:08:43] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 1 (OVERLAPS) 3/13 variables, 3/3 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 289/302 variables, 13/16 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 41/57 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 0/57 constraints. Problems are: Problem set: 8 solved, 2 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp8 is UNSAT
After SMT solving in domain Real declared 426/426 variables, and 181 constraints, problems are : Problem set: 10 solved, 0 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 3/6 constraints, State Equation: 137/137 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 205ms problems are : Problem set: 10 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 10 atomic propositions for a total of 5 simplifications.
[2024-06-01 05:08:43] [INFO ] Flatten gal took : 92 ms
[2024-06-01 05:08:43] [INFO ] Flatten gal took : 128 ms
[2024-06-01 05:08:44] [INFO ] Input system was already deterministic with 2298 transitions.
Support contains 8 out of 137 places (down from 9) after GAL structural reductions.
FORMULA BridgeAndVehicles-COL-V50P20N20-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 110 stabilizing places and 204 stable transitions
Graph (complete) has 3797 edges and 137 vertex of which 136 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.29 ms
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 2298/2298 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 136 transition count 2298
Applied a total of 1 rules in 17 ms. Remains 136 /137 variables (removed 1) and now considering 2298/2298 (removed 0) transitions.
Running 2295 sub problems to find dead transitions.
[2024-06-01 05:08:44] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
// Phase 1: matrix 289 rows 136 cols
[2024-06-01 05:08:44] [INFO ] Computed 5 invariants in 10 ms
[2024-06-01 05:08:44] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
[2024-06-01 05:09:07] [INFO ] Deduced a trap composed of 5 places in 264 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/425 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2295/2295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/425 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2295 constraints, Known Traps: 1/1 constraints]
After SMT, in 55464ms problems are : Problem set: 0 solved, 2295 unsolved
Search for dead transitions found 0 dead transitions in 55496ms
Finished structural reductions in LTL mode , in 1 iterations and 55521 ms. Remains : 136/137 places, 2298/2298 transitions.
[2024-06-01 05:09:39] [INFO ] Flatten gal took : 98 ms
[2024-06-01 05:09:39] [INFO ] Flatten gal took : 84 ms
[2024-06-01 05:09:39] [INFO ] Input system was already deterministic with 2298 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 137/137 places, 2298/2298 transitions.
Graph (complete) has 3797 edges and 137 vertex of which 136 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 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 439 ms. Remains 135 /137 variables (removed 2) and now considering 2297/2298 (removed 1) transitions.
Running 2294 sub problems to find dead transitions.
[2024-06-01 05:09:40] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
// Phase 1: matrix 288 rows 135 cols
[2024-06-01 05:09:40] [INFO ] Computed 5 invariants in 11 ms
[2024-06-01 05:09:40] [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-06-01 05:10:05] [INFO ] Deduced a trap composed of 5 places in 324 ms of which 3 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 20071 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 20033 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 56239ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 56263ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 56711 ms. Remains : 135/137 places, 2297/2298 transitions.
[2024-06-01 05:10:36] [INFO ] Flatten gal took : 59 ms
[2024-06-01 05:10:36] [INFO ] Flatten gal took : 60 ms
[2024-06-01 05:10:36] [INFO ] Input system was already deterministic with 2297 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 2298/2298 transitions.
Applied a total of 0 rules in 14 ms. Remains 137 /137 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Running 2295 sub problems to find dead transitions.
[2024-06-01 05:10:37] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
// Phase 1: matrix 289 rows 137 cols
[2024-06-01 05:10:37] [INFO ] Computed 6 invariants in 20 ms
[2024-06-01 05:10:37] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
[2024-06-01 05:11:01] [INFO ] Deduced a trap composed of 5 places in 227 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/137 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2295/2295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/137 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2295 constraints, Known Traps: 1/1 constraints]
After SMT, in 56320ms problems are : Problem set: 0 solved, 2295 unsolved
Search for dead transitions found 0 dead transitions in 56343ms
Finished structural reductions in LTL mode , in 1 iterations and 56362 ms. Remains : 137/137 places, 2298/2298 transitions.
[2024-06-01 05:11:33] [INFO ] Flatten gal took : 49 ms
[2024-06-01 05:11:33] [INFO ] Flatten gal took : 54 ms
[2024-06-01 05:11:33] [INFO ] Input system was already deterministic with 2298 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 137/137 places, 2298/2298 transitions.
Graph (complete) has 3797 edges and 137 vertex of which 136 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 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 268 ms. Remains 135 /137 variables (removed 2) and now considering 2297/2298 (removed 1) transitions.
Running 2294 sub problems to find dead transitions.
[2024-06-01 05:11:33] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
// Phase 1: matrix 288 rows 135 cols
[2024-06-01 05:11:33] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 05:11:33] [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-06-01 05:11:57] [INFO ] Deduced a trap composed of 5 places in 295 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 20031 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 20053 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 55698ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 55723ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 55996 ms. Remains : 135/137 places, 2297/2298 transitions.
[2024-06-01 05:12:29] [INFO ] Flatten gal took : 79 ms
[2024-06-01 05:12:29] [INFO ] Flatten gal took : 75 ms
[2024-06-01 05:12:29] [INFO ] Input system was already deterministic with 2297 transitions.
[2024-06-01 05:12:29] [INFO ] Flatten gal took : 71 ms
[2024-06-01 05:12:30] [INFO ] Flatten gal took : 72 ms
[2024-06-01 05:12:30] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2024-06-01 05:12:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 137 places, 2298 transitions and 17689 arcs took 36 ms.
Total runtime 289945 ms.
There are residual formulas that ITS could not solve within timeout
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-V50P20N20-CTLCardinality-2024-03
Could not compute solution for formula : BridgeAndVehicles-COL-V50P20N20-CTLCardinality-2024-10
Could not compute solution for formula : BridgeAndVehicles-COL-V50P20N20-CTLCardinality-2024-11
Could not compute solution for formula : BridgeAndVehicles-COL-V50P20N20-CTLCardinality-2024-13

BK_STOP 1717218750469

--------------------
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-V50P20N20-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/607/ctl_0_
ctl formula name BridgeAndVehicles-COL-V50P20N20-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/607/ctl_1_
ctl formula name BridgeAndVehicles-COL-V50P20N20-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/607/ctl_2_
ctl formula name BridgeAndVehicles-COL-V50P20N20-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/607/ctl_3_
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-V50P20N20"
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-V50P20N20, 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-171620398700073"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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