Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.1M
-rw-r--r-- 1 mcc users 19K Apr 13 02:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 13 02:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 72K Apr 13 02:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 298K Apr 13 02:05 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 17K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 65K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 209K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Apr 13 03:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 13 03:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Apr 13 03:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.0M Apr 13 03:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.8K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.0M 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-PT-V50P50N20-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716329954959

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P50N20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-21 22:19:16] [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 22:19:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:19:16] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2024-05-21 22:19:16] [INFO ] Transformed 138 places.
[2024-05-21 22:19:16] [INFO ] Transformed 2348 transitions.
[2024-05-21 22:19:16] [INFO ] Parsed PT model containing 138 places and 2348 transitions and 18090 arcs in 346 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 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 54 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 22:19:16] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2024-05-21 22:19:17] [INFO ] Computed 7 invariants in 24 ms
[2024-05-21 22:19:17] [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 22:19:43] [INFO ] Deduced a trap composed of 5 places in 358 ms of which 14 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 20169 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
[2024-05-21 22:20:14] [INFO ] Deduced a trap composed of 25 places in 226 ms of which 1 ms to minimize.
SMT process timed out in 57343ms, After SMT, problems are : Problem set: 0 solved, 2345 unsolved
Search for dead transitions found 0 dead transitions in 57401ms
[2024-05-21 22:20:14] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 22:20:14] [INFO ] Invariant cache hit.
[2024-05-21 22:20:14] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-21 22:20:14] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 22:20:14] [INFO ] Invariant cache hit.
[2024-05-21 22:20:14] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 22:20:15] [INFO ] Implicit Places using invariants and state equation in 660 ms returned []
Implicit Place search using SMT with State Equation took 948 ms to find 0 implicit places.
Running 2345 sub problems to find dead transitions.
[2024-05-21 22:20:15] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 22:20:15] [INFO ] Invariant cache hit.
[2024-05-21 22:20:15] [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 22:20:40] [INFO ] Deduced a trap composed of 5 places in 296 ms of which 1 ms to minimize.
[2024-05-21 22:20:56] [INFO ] Deduced a trap composed of 25 places in 256 ms of which 1 ms to minimize.
Problem TDEAD1248 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1605 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1647 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/428 variables, and 7 constraints, problems are : Problem set: 20 solved, 2325 unsolved in 30059 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: 20 solved, 2325 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 20 solved, 2325 unsolved
Problem TDEAD1668 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1710 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1773 is UNSAT
Problem TDEAD1794 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1836 is UNSAT
Problem TDEAD1857 is UNSAT
Problem TDEAD1878 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1920 is UNSAT
Problem TDEAD1941 is UNSAT
Problem TDEAD1962 is UNSAT
Problem TDEAD1983 is UNSAT
Problem TDEAD2004 is UNSAT
Problem TDEAD2025 is UNSAT
Problem TDEAD2046 is UNSAT
Problem TDEAD2067 is UNSAT
Problem TDEAD2088 is UNSAT
Problem TDEAD2109 is UNSAT
Problem TDEAD2130 is UNSAT
Problem TDEAD2151 is UNSAT
Problem TDEAD2172 is UNSAT
Problem TDEAD2193 is UNSAT
Problem TDEAD2214 is UNSAT
Problem TDEAD2235 is UNSAT
Problem TDEAD2256 is UNSAT
Problem TDEAD2277 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 2/7 constraints. Problems are: Problem set: 50 solved, 2295 unsolved
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 30045 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 76786ms problems are : Problem set: 50 solved, 2295 unsolved
Search for dead transitions found 50 dead transitions in 76821ms
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 34 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 135322 ms. Remains : 138/138 places, 2298/2348 transitions.
Support contains 22 out of 138 places after structural reductions.
[2024-05-21 22:21:32] [INFO ] Flatten gal took : 228 ms
[2024-05-21 22:21:32] [INFO ] Flatten gal took : 167 ms
[2024-05-21 22:21:33] [INFO ] Input system was already deterministic with 2298 transitions.
RANDOM walk for 40000 steps (92 resets) in 4716 ms. (8 steps per ms) remains 8/29 properties
BEST_FIRST walk for 40003 steps (44 resets) in 342 ms. (116 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (32 resets) in 166 ms. (239 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40019 steps (32 resets) in 196 ms. (203 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (32 resets) in 248 ms. (160 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (28 resets) in 200 ms. (199 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (32 resets) in 185 ms. (215 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (28 resets) in 206 ms. (193 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (36 resets) in 238 ms. (167 steps per ms) remains 8/8 properties
[2024-05-21 22:21:35] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
// Phase 1: matrix 289 rows 138 cols
[2024-05-21 22:21:35] [INFO ] Computed 7 invariants in 4 ms
[2024-05-21 22:21:35] [INFO ] State equation strengthened by 41 read => feed constraints.
Problem AtomicPropp11 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp28 is UNSAT
At refinement iteration 1 (OVERLAPS) 76/87 variables, 6/6 constraints. Problems are: Problem set: 5 solved, 3 unsolved
[2024-05-21 22:21:35] [INFO ] Deduced a trap composed of 6 places in 246 ms of which 1 ms to minimize.
[2024-05-21 22:21:35] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 2/8 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/8 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 289/376 variables, 87/95 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 41/136 constraints. Problems are: Problem set: 5 solved, 3 unsolved
[2024-05-21 22:21:36] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 1/137 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 0/137 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 51/427 variables, 51/188 constraints. Problems are: Problem set: 5 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 1/189 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/427 variables, 0/189 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/427 variables, 0/189 constraints. Problems are: Problem set: 5 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 189 constraints, problems are : Problem set: 5 solved, 3 unsolved in 1101 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 5 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 27/30 variables, 3/3 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 2/5 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 6/36 variables, 2/7 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 1/8 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 289/325 variables, 36/44 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 41/85 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 0/85 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 102/427 variables, 102/187 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/427 variables, 2/189 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/427 variables, 3/192 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/427 variables, 0/192 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/427 variables, 0/192 constraints. Problems are: Problem set: 5 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 427/427 variables, and 192 constraints, problems are : Problem set: 5 solved, 3 unsolved in 848 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 3/8 constraints, Known Traps: 3/3 constraints]
After SMT, in 2034ms problems are : Problem set: 5 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1683 ms.
Support contains 3 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.23 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 506 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 22:21:39] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
// Phase 1: matrix 288 rows 135 cols
[2024-05-21 22:21:39] [INFO ] Computed 5 invariants in 6 ms
[2024-05-21 22:21:39] [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 22:22:07] [INFO ] Deduced a trap composed of 5 places in 262 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 20063 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 20039 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 60201ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 60238ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60755 ms. Remains : 135/138 places, 2297/2298 transitions.
RANDOM walk for 40000 steps (92 resets) in 703 ms. (56 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (32 resets) in 206 ms. (193 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40009 steps (32 resets) in 187 ms. (212 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (32 resets) in 205 ms. (194 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 251583 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 3
Probabilistic random walk after 251583 steps, saw 67428 distinct states, run finished after 3008 ms. (steps per millisecond=83 ) properties seen :0
[2024-05-21 22:22:43] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 22:22:43] [INFO ] Invariant cache hit.
[2024-05-21 22:22:43] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 26/29 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 186/215 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 206/421 variables, 104/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 41/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/423 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/423 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 181 constraints, problems are : Problem set: 0 solved, 3 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 135/135 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 26/29 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 22:22:43] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 186/215 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 206/421 variables, 104/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 41/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 3/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/423 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/423 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 185 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1099 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 135/135 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 1413ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1389 ms.
Support contains 3 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 188 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 188 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 310 ms. Remains 135 /135 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
[2024-05-21 22:22:46] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 22:22:46] [INFO ] Invariant cache hit.
[2024-05-21 22:22:47] [INFO ] Implicit Places using invariants in 362 ms returned []
[2024-05-21 22:22:47] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 22:22:47] [INFO ] Invariant cache hit.
[2024-05-21 22:22:47] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 22:22:48] [INFO ] Implicit Places using invariants and state equation in 1108 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1495 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 235 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 2041 ms. Remains : 133/135 places, 2297/2297 transitions.
RANDOM walk for 40000 steps (92 resets) in 543 ms. (73 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (32 resets) in 135 ms. (294 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (32 resets) in 167 ms. (238 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (32 resets) in 198 ms. (201 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 270312 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 3
Probabilistic random walk after 270312 steps, saw 72339 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
[2024-05-21 22:22:51] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
// Phase 1: matrix 288 rows 133 cols
[2024-05-21 22:22:51] [INFO ] Computed 5 invariants in 12 ms
[2024-05-21 22:22:51] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 26/29 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 186/215 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 22:22:52] [INFO ] Deduced a trap composed of 5 places in 378 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 204/419 variables, 102/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 41/178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/421 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/421 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/421 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 421/421 variables, and 180 constraints, problems are : Problem set: 0 solved, 3 unsolved in 758 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 26/29 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 186/215 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 204/419 variables, 102/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 41/178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/421 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/421 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/421 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 421/421 variables, and 183 constraints, problems are : Problem set: 0 solved, 3 unsolved in 973 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 1784ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 799 ms.
Support contains 3 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 189 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 189 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 156 ms. Remains 133 /133 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
[2024-05-21 22:22:54] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 22:22:54] [INFO ] Invariant cache hit.
[2024-05-21 22:22:55] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-05-21 22:22:55] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 22:22:55] [INFO ] Invariant cache hit.
[2024-05-21 22:22:55] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 22:22:55] [INFO ] Implicit Places using invariants and state equation in 735 ms returned []
Implicit Place search using SMT with State Equation took 1080 ms to find 0 implicit places.
[2024-05-21 22:22:55] [INFO ] Redundant transitions in 155 ms returned []
Running 2294 sub problems to find dead transitions.
[2024-05-21 22:22:55] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 22:22:55] [INFO ] Invariant cache hit.
[2024-05-21 22:22:56] [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 22:23:21] [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 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30035 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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 77491ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 77518ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78922 ms. Remains : 133/133 places, 2297/2297 transitions.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 12 simplifications.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 111 stabilizing places and 204 stable transitions
Graph (complete) has 3798 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.18 ms
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p0)||X(X(F((!p0&&X(p1))))))))))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 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 137 transition count 2298
Applied a total of 1 rules in 15 ms. Remains 137 /138 variables (removed 1) and now considering 2298/2298 (removed 0) transitions.
Running 2295 sub problems to find dead transitions.
[2024-05-21 22:24:13] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
// Phase 1: matrix 289 rows 137 cols
[2024-05-21 22:24:13] [INFO ] Computed 6 invariants in 7 ms
[2024-05-21 22:24:14] [INFO ] State equation strengthened by 41 read => feed constraints.

BK_STOP 1716330259308

--------------------
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-PT-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-PT-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-171620399100259"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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