Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M 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 BugTracking-PT-q8m004-LTLCardinality-00
FORMULA_NAME BugTracking-PT-q8m004-LTLCardinality-01
FORMULA_NAME BugTracking-PT-q8m004-LTLCardinality-02
FORMULA_NAME BugTracking-PT-q8m004-LTLCardinality-03
FORMULA_NAME BugTracking-PT-q8m004-LTLCardinality-04
FORMULA_NAME BugTracking-PT-q8m004-LTLCardinality-05
FORMULA_NAME BugTracking-PT-q8m004-LTLCardinality-06
FORMULA_NAME BugTracking-PT-q8m004-LTLCardinality-07
FORMULA_NAME BugTracking-PT-q8m004-LTLCardinality-08
FORMULA_NAME BugTracking-PT-q8m004-LTLCardinality-09
FORMULA_NAME BugTracking-PT-q8m004-LTLCardinality-10
FORMULA_NAME BugTracking-PT-q8m004-LTLCardinality-11
FORMULA_NAME BugTracking-PT-q8m004-LTLCardinality-12
FORMULA_NAME BugTracking-PT-q8m004-LTLCardinality-13
FORMULA_NAME BugTracking-PT-q8m004-LTLCardinality-14
FORMULA_NAME BugTracking-PT-q8m004-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716332676751

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m004
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-21 23:04:38] [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 23:04:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:04:39] [INFO ] Load time of PNML (sax parser for PT used): 821 ms
[2024-05-21 23:04:39] [INFO ] Transformed 754 places.
[2024-05-21 23:04:39] [INFO ] Transformed 27370 transitions.
[2024-05-21 23:04:39] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1049 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 474 places in 109 ms
Reduce places removed 474 places and 23466 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BugTracking-PT-q8m004-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 278 transition count 3904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 277 transition count 3871
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 277 transition count 3871
Applied a total of 4 rules in 98 ms. Remains 277 /280 variables (removed 3) and now considering 3871/3904 (removed 33) transitions.
[2024-05-21 23:04:39] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2024-05-21 23:04:39] [INFO ] Computed 8 invariants in 98 ms
[2024-05-21 23:04:40] [INFO ] Implicit Places using invariants in 918 ms returned []
[2024-05-21 23:04:40] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-21 23:04:40] [INFO ] Invariant cache hit.
[2024-05-21 23:04:41] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-05-21 23:04:43] [INFO ] Implicit Places using invariants and state equation in 2486 ms returned []
Implicit Place search using SMT with State Equation took 3458 ms to find 0 implicit places.
Running 3869 sub problems to find dead transitions.
[2024-05-21 23:04:43] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-21 23:04:43] [INFO ] Invariant cache hit.
[2024-05-21 23:04:43] [INFO ] State equation strengthened by 282 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3869 unsolved
[2024-05-21 23:05:43] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 17 ms to minimize.
[2024-05-21 23:05:43] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 1 ms to minimize.
[2024-05-21 23:05:43] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 1 ms to minimize.
[2024-05-21 23:05:52] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 2 ms to minimize.
Problem TDEAD784 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 276/3984 variables, and 12 constraints, problems are : Problem set: 14 solved, 3855 unsolved in 30110 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/277 constraints, ReadFeed: 0/282 constraints, PredecessorRefiner: 3869/2672 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 14 solved, 3855 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 8/8 constraints. Problems are: Problem set: 14 solved, 3855 unsolved
Problem TDEAD2706 is UNSAT
Problem TDEAD2715 is UNSAT
Problem TDEAD2727 is UNSAT
Problem TDEAD2731 is UNSAT
Problem TDEAD2740 is UNSAT
Problem TDEAD2752 is UNSAT
Problem TDEAD2756 is UNSAT
Problem TDEAD2765 is UNSAT
Problem TDEAD2777 is UNSAT
Problem TDEAD2781 is UNSAT
Problem TDEAD2782 is UNSAT
Problem TDEAD2783 is UNSAT
Problem TDEAD2784 is UNSAT
Problem TDEAD2785 is UNSAT
Problem TDEAD2786 is UNSAT
Problem TDEAD2787 is UNSAT
Problem TDEAD2788 is UNSAT
Problem TDEAD2789 is UNSAT
Problem TDEAD2790 is UNSAT
Problem TDEAD2794 is UNSAT
Problem TDEAD2795 is UNSAT
Problem TDEAD2796 is UNSAT
Problem TDEAD2797 is UNSAT
Problem TDEAD2798 is UNSAT
Problem TDEAD2799 is UNSAT
Problem TDEAD2800 is UNSAT
Problem TDEAD2801 is UNSAT
Problem TDEAD2802 is UNSAT
Problem TDEAD2803 is UNSAT
Problem TDEAD2804 is UNSAT
Problem TDEAD2805 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 4/12 constraints. Problems are: Problem set: 45 solved, 3824 unsolved
[2024-05-21 23:06:22] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 0 ms to minimize.
Problem TDEAD2716 is UNSAT
Problem TDEAD2728 is UNSAT
[2024-05-21 23:06:22] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 1 ms to minimize.
Problem TDEAD2732 is UNSAT
Problem TDEAD2733 is UNSAT
Problem TDEAD2734 is UNSAT
Problem TDEAD2735 is UNSAT
Problem TDEAD2736 is UNSAT
Problem TDEAD2737 is UNSAT
Problem TDEAD2738 is UNSAT
Problem TDEAD2739 is UNSAT
[2024-05-21 23:06:22] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 1 ms to minimize.
Problem TDEAD2741 is UNSAT
[2024-05-21 23:06:22] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
Problem TDEAD2742 is UNSAT
Problem TDEAD2743 is UNSAT
Problem TDEAD2744 is UNSAT
Problem TDEAD2745 is UNSAT
Problem TDEAD2746 is UNSAT
Problem TDEAD2747 is UNSAT
Problem TDEAD2748 is UNSAT
Problem TDEAD2749 is UNSAT
Problem TDEAD2750 is UNSAT
Problem TDEAD2751 is UNSAT
Problem TDEAD2766 is UNSAT
Problem TDEAD2778 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 276/3984 variables, and 16 constraints, problems are : Problem set: 68 solved, 3801 unsolved in 30092 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/277 constraints, ReadFeed: 0/282 constraints, PredecessorRefiner: 1197/2672 constraints, Known Traps: 8/8 constraints]
After SMT, in 103313ms problems are : Problem set: 68 solved, 3801 unsolved
Search for dead transitions found 68 dead transitions in 103400ms
Found 68 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 68 transitions
Dead transitions reduction (with SMT) removed 68 transitions
Starting structural reductions in LTL mode, iteration 1 : 277/280 places, 3803/3904 transitions.
Reduce places removed 17 places and 565 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 260 transition count 3238
Reduce places removed 10 places and 278 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 27 place count 250 transition count 2960
Reduce places removed 12 places and 336 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 39 place count 238 transition count 2624
Reduce places removed 8 places and 184 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 47 place count 230 transition count 2440
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 48 place count 229 transition count 2420
Deduced a syphon composed of 1 places in 2 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 49 place count 229 transition count 2420
Deduced a syphon composed of 1 places in 3 ms
Applied a total of 49 rules in 43 ms. Remains 229 /277 variables (removed 48) and now considering 2420/3803 (removed 1383) transitions.
[2024-05-21 23:06:26] [INFO ] Flow matrix only has 2318 transitions (discarded 102 similar events)
// Phase 1: matrix 2318 rows 229 cols
[2024-05-21 23:06:26] [INFO ] Computed 9 invariants in 10 ms
[2024-05-21 23:06:27] [INFO ] Implicit Places using invariants in 540 ms returned []
[2024-05-21 23:06:27] [INFO ] Flow matrix only has 2318 transitions (discarded 102 similar events)
[2024-05-21 23:06:27] [INFO ] Invariant cache hit.
[2024-05-21 23:06:27] [INFO ] State equation strengthened by 210 read => feed constraints.
[2024-05-21 23:06:28] [INFO ] Implicit Places using invariants and state equation in 1081 ms returned []
Implicit Place search using SMT with State Equation took 1643 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 229/280 places, 2420/3904 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 108684 ms. Remains : 229/280 places, 2420/3904 transitions.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Support contains 8 out of 228 places after structural reductions.
[2024-05-21 23:06:28] [INFO ] Flatten gal took : 327 ms
[2024-05-21 23:06:29] [INFO ] Flatten gal took : 175 ms
[2024-05-21 23:06:29] [INFO ] Input system was already deterministic with 2420 transitions.
RANDOM walk for 40003 steps (422 resets) in 1507 ms. (26 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40004 steps (115 resets) in 389 ms. (102 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (113 resets) in 160 ms. (248 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (105 resets) in 435 ms. (91 steps per ms) remains 3/3 properties
[2024-05-21 23:06:30] [INFO ] Flow matrix only has 2318 transitions (discarded 102 similar events)
// Phase 1: matrix 2318 rows 228 cols
[2024-05-21 23:06:30] [INFO ] Computed 8 invariants in 12 ms
[2024-05-21 23:06:30] [INFO ] State equation strengthened by 210 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 1 (OVERLAPS) 76/79 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1624/1703 variables, 79/82 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1703 variables, 0/82 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 257/1960 variables, 77/159 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1960 variables, 1/160 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1960 variables, 158/318 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1960 variables, 0/318 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/1961 variables, 1/319 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1961 variables, 1/320 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1961 variables, 0/320 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 474/2435 variables, 21/341 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2435 variables, 31/372 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2435 variables, 0/372 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/2438 variables, 1/373 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2438 variables, 0/373 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 103/2541 variables, 47/420 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2541 variables, 2/422 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2541 variables, 21/443 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2541 variables, 0/443 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 5/2546 variables, 3/446 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2546 variables, 0/446 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/2546 variables, 0/446 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2546/2546 variables, and 446 constraints, problems are : Problem set: 1 solved, 2 unsolved in 862 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 228/228 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/50 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1018/1068 variables, 50/52 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1068 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 195/1263 variables, 51/103 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1263 variables, 1/104 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1263 variables, 81/185 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1263 variables, 2/187 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1263 variables, 0/187 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/1264 variables, 1/188 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1264 variables, 1/189 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1264 variables, 0/189 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1017/2281 variables, 39/228 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2281 variables, 92/320 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2281 variables, 0/320 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 224/2505 variables, 59/379 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2505 variables, 2/381 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2505 variables, 28/409 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2505 variables, 0/409 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/2507 variables, 1/410 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2507 variables, 0/410 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 39/2546 variables, 28/438 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2546 variables, 1/439 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2546 variables, 9/448 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2546 variables, 0/448 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/2546 variables, 0/448 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2546/2546 variables, and 448 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1147 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 228/228 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2062ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 300 ms.
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 2420/2420 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 226 transition count 2423
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 226 transition count 2417
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 220 transition count 2417
Applied a total of 16 rules in 128 ms. Remains 220 /228 variables (removed 8) and now considering 2417/2420 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 220/228 places, 2417/2420 transitions.
RANDOM walk for 40002 steps (8 resets) in 423 ms. (94 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (9 resets) in 143 ms. (277 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (10 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 147869 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 2
Probabilistic random walk after 147869 steps, saw 62403 distinct states, run finished after 3015 ms. (steps per millisecond=49 ) properties seen :0
[2024-05-21 23:06:36] [INFO ] Flow matrix only has 2310 transitions (discarded 107 similar events)
// Phase 1: matrix 2310 rows 220 cols
[2024-05-21 23:06:36] [INFO ] Computed 8 invariants in 11 ms
[2024-05-21 23:06:36] [INFO ] State equation strengthened by 211 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1018/1068 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1068 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 190/1258 variables, 49/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1258 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1258 variables, 82/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1258 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1017/2275 variables, 39/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2275 variables, 92/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2275 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 232/2507 variables, 59/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2507 variables, 3/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2507 variables, 37/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2507 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 23/2530 variables, 23/438 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2530 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2530 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/2530 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2530/2530 variables, and 439 constraints, problems are : Problem set: 0 solved, 2 unsolved in 809 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 220/220 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1018/1068 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1068 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 190/1258 variables, 49/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1258 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1258 variables, 82/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1258 variables, 2/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:06:37] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 1 ms to minimize.
[2024-05-21 23:06:37] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:06:37] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 1 ms to minimize.
[2024-05-21 23:06:37] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:06:37] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1258 variables, 5/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1258 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1017/2275 variables, 39/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2275 variables, 92/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2275 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 232/2507 variables, 59/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2507 variables, 3/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2507 variables, 37/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2507 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 23/2530 variables, 23/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2530 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:06:38] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-21 23:06:39] [INFO ] Deduced a trap composed of 51 places in 926 ms of which 2 ms to minimize.
[2024-05-21 23:06:40] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/2530 variables, 3/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2530 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/2530 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2530/2530 variables, and 449 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3691 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 220/220 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 4554ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2636 ms.
Support contains 2 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 2417/2417 transitions.
Applied a total of 0 rules in 34 ms. Remains 220 /220 variables (removed 0) and now considering 2417/2417 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 220/220 places, 2417/2417 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 2417/2417 transitions.
Applied a total of 0 rules in 31 ms. Remains 220 /220 variables (removed 0) and now considering 2417/2417 (removed 0) transitions.
[2024-05-21 23:06:43] [INFO ] Flow matrix only has 2310 transitions (discarded 107 similar events)
[2024-05-21 23:06:43] [INFO ] Invariant cache hit.
[2024-05-21 23:06:43] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-21 23:06:43] [INFO ] Flow matrix only has 2310 transitions (discarded 107 similar events)
[2024-05-21 23:06:43] [INFO ] Invariant cache hit.
[2024-05-21 23:06:43] [INFO ] State equation strengthened by 211 read => feed constraints.
[2024-05-21 23:06:44] [INFO ] Implicit Places using invariants and state equation in 1121 ms returned []
Implicit Place search using SMT with State Equation took 1506 ms to find 0 implicit places.
[2024-05-21 23:06:44] [INFO ] Redundant transitions in 156 ms returned []
Running 2416 sub problems to find dead transitions.
[2024-05-21 23:06:44] [INFO ] Flow matrix only has 2310 transitions (discarded 107 similar events)
[2024-05-21 23:06:44] [INFO ] Invariant cache hit.
[2024-05-21 23:06:45] [INFO ] State equation strengthened by 211 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 220/2530 variables, and 8 constraints, problems are : Problem set: 0 solved, 2416 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/220 constraints, ReadFeed: 0/211 constraints, PredecessorRefiner: 2416/2416 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2416 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 220/2530 variables, and 8 constraints, problems are : Problem set: 0 solved, 2416 unsolved in 30182 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/220 constraints, ReadFeed: 0/211 constraints, PredecessorRefiner: 0/2416 constraints, Known Traps: 0/0 constraints]
After SMT, in 79151ms problems are : Problem set: 0 solved, 2416 unsolved
Search for dead transitions found 0 dead transitions in 79175ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80885 ms. Remains : 220/220 places, 2417/2417 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 103 transitions
Reduce isomorphic transitions removed 108 transitions.
Iterating post reduction 0 with 108 rules applied. Total rules applied 108 place count 220 transition count 2309
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 111 place count 217 transition count 2253
Iterating global reduction 1 with 3 rules applied. Total rules applied 114 place count 217 transition count 2253
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 118 place count 215 transition count 2251
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 120 place count 214 transition count 2258
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 121 place count 214 transition count 2257
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 125 place count 214 transition count 2253
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 129 place count 210 transition count 2253
Applied a total of 129 rules in 272 ms. Remains 210 /220 variables (removed 10) and now considering 2253/2417 (removed 164) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2253 rows 210 cols
[2024-05-21 23:08:04] [INFO ] Computed 9 invariants in 16 ms
[2024-05-21 23:08:07] [INFO ] [Real]Absence check using 9 positive place invariants in 356 ms returned sat
[2024-05-21 23:08:07] [INFO ] After 3240ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 23:08:13] [INFO ] [Nat]Absence check using 9 positive place invariants in 1429 ms returned sat
[2024-05-21 23:09:12] [INFO ] After 54055ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 23:09:14] [INFO ] After 56854ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 23:09:17] [INFO ] After 69411ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 73079 ms.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
FORMULA BugTracking-PT-q8m004-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 73 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(G(!p0)))))'
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 2420/2420 transitions.
Applied a total of 0 rules in 17 ms. Remains 228 /228 variables (removed 0) and now considering 2420/2420 (removed 0) transitions.
[2024-05-21 23:09:19] [INFO ] Flow matrix only has 2318 transitions (discarded 102 similar events)
// Phase 1: matrix 2318 rows 228 cols
[2024-05-21 23:09:19] [INFO ] Computed 8 invariants in 9 ms
[2024-05-21 23:09:50] [INFO ] Performed 28/228 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-21 23:10:28] [INFO ] Performed 42/228 implicitness test of which 0 returned IMPLICIT in 67 seconds.
[2024-05-21 23:11:08] [INFO ] Performed 44/228 implicitness test of which 0 returned IMPLICIT in 107 seconds.
[2024-05-21 23:11:39] [INFO ] Performed 58/228 implicitness test of which 0 returned IMPLICIT in 139 seconds.
[2024-05-21 23:11:40] [INFO ] Timeout of Implicit test with SMT after 139 seconds.
[2024-05-21 23:11:41] [INFO ] Implicit Places using invariants in 141785 ms returned []
[2024-05-21 23:11:41] [INFO ] Flow matrix only has 2318 transitions (discarded 102 similar events)
[2024-05-21 23:11:41] [INFO ] Invariant cache hit.
[2024-05-21 23:11:58] [INFO ] State equation strengthened by 210 read => feed constraints.
[2024-05-21 23:12:04] [INFO ] Implicit Places using invariants and state equation in 22840 ms returned []
Implicit Place search using SMT with State Equation took 165342 ms to find 0 implicit places.
Running 2418 sub problems to find dead transitions.
[2024-05-21 23:12:04] [INFO ] Flow matrix only has 2318 transitions (discarded 102 similar events)
[2024-05-21 23:12:04] [INFO ] Invariant cache hit.
[2024-05-21 23:12:04] [INFO ] State equation strengthened by 210 read => feed constraints.

BK_STOP 1716333132477

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="BugTracking-PT-q8m004"
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 BugTracking-PT-q8m004, 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-171620399400395"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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