Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r476-tall-171620505100078.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is CANConstruction-PT-090, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505100078
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 9.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 12M 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 CANConstruction-PT-090-ReachabilityCardinality-2024-00
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-01
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-02
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-03
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-04
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-05
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-06
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-07
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-08
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-09
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-10
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2023-11
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-12
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-13
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-14
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717183739227

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-090
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:29:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 19:29:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:29:01] [INFO ] Load time of PNML (sax parser for PT used): 690 ms
[2024-05-31 19:29:01] [INFO ] Transformed 17282 places.
[2024-05-31 19:29:01] [INFO ] Transformed 33120 transitions.
[2024-05-31 19:29:01] [INFO ] Parsed PT model containing 17282 places and 33120 transitions and 99000 arcs in 932 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (24 resets) in 3878 ms. (10 steps per ms) remains 10/16 properties
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 467 ms. (85 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 905 ms. (44 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 10/10 properties
// Phase 1: matrix 33120 rows 17282 cols
[2024-05-31 19:29:04] [INFO ] Computed 181 invariants in 439 ms
[2024-05-31 19:29:04] [INFO ] State equation strengthened by 16110 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem CANConstruction-PT-090-ReachabilityCardinality-2024-00 is UNSAT
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-090-ReachabilityCardinality-2024-15 is UNSAT
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 17017/17180 variables, 79/79 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17180 variables, 1/80 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17180 variables, 0/80 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 12/17192 variables, 12/92 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 17192/50402 variables, and 92 constraints, problems are : Problem set: 2 solved, 8 unsolved in 5108 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 1/90 constraints, State Equation: 0/17282 constraints, ReadFeed: 0/16110 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 17050/17172 variables, 71/71 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17172 variables, 1/72 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-05-31 19:30:08] [INFO ] Deduced a trap composed of 167 places in 56451 ms of which 671 ms to minimize.
SMT process timed out in 64873ms, After SMT, problems are : Problem set: 2 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 122 out of 17282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17282/17282 places, 33120/33120 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 613 transitions
Trivial Post-agglo rules discarded 613 transitions
Performed 613 trivial Post agglomeration. Transition count delta: 613
Iterating post reduction 0 with 613 rules applied. Total rules applied 613 place count 17282 transition count 32507
Reduce places removed 613 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 619 rules applied. Total rules applied 1232 place count 16669 transition count 32501
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1238 place count 16663 transition count 32501
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1238 place count 16663 transition count 32498
Deduced a syphon composed of 3 places in 12 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1244 place count 16660 transition count 32498
Discarding 7857 places :
Symmetric choice reduction at 3 with 7857 rule applications. Total rules 9101 place count 8803 transition count 16784
Iterating global reduction 3 with 7857 rules applied. Total rules applied 16958 place count 8803 transition count 16784
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 8 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 17128 place count 8718 transition count 16699
Free-agglomeration rule applied 89 times.
Iterating global reduction 3 with 89 rules applied. Total rules applied 17217 place count 8718 transition count 16610
Reduce places removed 89 places and 0 transitions.
Iterating post reduction 3 with 89 rules applied. Total rules applied 17306 place count 8629 transition count 16610
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 17308 place count 8629 transition count 16608
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 17310 place count 8627 transition count 16608
Partial Free-agglomeration rule applied 94 times.
Drop transitions (Partial Free agglomeration) removed 94 transitions
Iterating global reduction 5 with 94 rules applied. Total rules applied 17404 place count 8627 transition count 16608
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 17407 place count 8627 transition count 16608
Applied a total of 17407 rules in 21555 ms. Remains 8627 /17282 variables (removed 8655) and now considering 16608/33120 (removed 16512) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21568 ms. Remains : 8627/17282 places, 16608/33120 transitions.
RANDOM walk for 40000 steps (60 resets) in 1526 ms. (26 steps per ms) remains 4/8 properties
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 4/4 properties
// Phase 1: matrix 16608 rows 8627 cols
[2024-05-31 19:30:30] [INFO ] Computed 181 invariants in 127 ms
[2024-05-31 19:30:31] [INFO ] State equation strengthened by 16237 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8432/8494 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8494 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8494 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 43/8537 variables, 43/92 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8537 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 89/8626 variables, 89/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8626 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 16608/25234 variables, 8626/8807 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/25234 variables, 16237/25044 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/25234 variables, 0/25044 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/25235 variables, 1/25045 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/25235 variables, 0/25045 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/25235 variables, 0/25045 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25235/25235 variables, and 25045 constraints, problems are : Problem set: 0 solved, 4 unsolved in 19933 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 90/90 constraints, State Equation: 8627/8627 constraints, ReadFeed: 16237/16237 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8432/8494 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8494 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 19:31:09] [INFO ] Deduced a trap composed of 2 places in 17256 ms of which 54 ms to minimize.
[2024-05-31 19:31:26] [INFO ] Deduced a trap composed of 2 places in 17214 ms of which 50 ms to minimize.
[2024-05-31 19:31:29] [INFO ] Deduced a trap composed of 93 places in 2479 ms of which 21 ms to minimize.
[2024-05-31 19:31:32] [INFO ] Deduced a trap composed of 96 places in 2877 ms of which 23 ms to minimize.
[2024-05-31 19:31:34] [INFO ] Deduced a trap composed of 96 places in 2341 ms of which 19 ms to minimize.
[2024-05-31 19:31:37] [INFO ] Deduced a trap composed of 99 places in 2425 ms of which 20 ms to minimize.
SMT process timed out in 66564ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 62 out of 8627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8627/8627 places, 16608/16608 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8627 transition count 16607
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8626 transition count 16607
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 7 place count 8621 transition count 16597
Iterating global reduction 2 with 5 rules applied. Total rules applied 12 place count 8621 transition count 16597
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 52 place count 8601 transition count 16577
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 62 place count 8596 transition count 16577
Applied a total of 62 rules in 10284 ms. Remains 8596 /8627 variables (removed 31) and now considering 16577/16608 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10284 ms. Remains : 8596/8627 places, 16577/16608 transitions.
RANDOM walk for 40000 steps (60 resets) in 1476 ms. (27 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 142386 steps, run timeout after 3003 ms. (steps per millisecond=47 ) properties seen :0 out of 4
Probabilistic random walk after 142386 steps, saw 139704 distinct states, run finished after 3007 ms. (steps per millisecond=47 ) properties seen :0
// Phase 1: matrix 16577 rows 8596 cols
[2024-05-31 19:31:51] [INFO ] Computed 181 invariants in 121 ms
[2024-05-31 19:31:51] [INFO ] State equation strengthened by 16267 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8401/8463 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8463 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8463 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 43/8506 variables, 43/92 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8506 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 89/8595 variables, 89/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8595 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 16577/25172 variables, 8595/8776 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/25172 variables, 16267/25043 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/25172 variables, 0/25043 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/25173 variables, 1/25044 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/25173 variables, 0/25044 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/25173 variables, 0/25044 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25173/25173 variables, and 25044 constraints, problems are : Problem set: 0 solved, 4 unsolved in 18411 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 90/90 constraints, State Equation: 8596/8596 constraints, ReadFeed: 16267/16267 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8401/8463 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8463 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 19:32:27] [INFO ] Deduced a trap composed of 2 places in 16319 ms of which 48 ms to minimize.
[2024-05-31 19:32:30] [INFO ] Deduced a trap composed of 93 places in 2646 ms of which 20 ms to minimize.
[2024-05-31 19:32:33] [INFO ] Deduced a trap composed of 96 places in 2671 ms of which 22 ms to minimize.
[2024-05-31 19:32:35] [INFO ] Deduced a trap composed of 96 places in 2468 ms of which 21 ms to minimize.
[2024-05-31 19:32:38] [INFO ] Deduced a trap composed of 103 places in 2339 ms of which 20 ms to minimize.
[2024-05-31 19:32:40] [INFO ] Deduced a trap composed of 100 places in 2455 ms of which 20 ms to minimize.
[2024-05-31 19:32:43] [INFO ] Deduced a trap composed of 99 places in 2385 ms of which 21 ms to minimize.
[2024-05-31 19:32:45] [INFO ] Deduced a trap composed of 96 places in 2371 ms of which 20 ms to minimize.
[2024-05-31 19:32:48] [INFO ] Deduced a trap composed of 100 places in 2314 ms of which 20 ms to minimize.
[2024-05-31 19:32:50] [INFO ] Deduced a trap composed of 96 places in 2204 ms of which 20 ms to minimize.
[2024-05-31 19:32:52] [INFO ] Deduced a trap composed of 96 places in 2109 ms of which 19 ms to minimize.
[2024-05-31 19:32:54] [INFO ] Deduced a trap composed of 96 places in 2148 ms of which 17 ms to minimize.
[2024-05-31 19:32:57] [INFO ] Deduced a trap composed of 96 places in 2104 ms of which 18 ms to minimize.
[2024-05-31 19:32:59] [INFO ] Deduced a trap composed of 96 places in 2113 ms of which 17 ms to minimize.
[2024-05-31 19:33:01] [INFO ] Deduced a trap composed of 96 places in 2082 ms of which 23 ms to minimize.
[2024-05-31 19:33:03] [INFO ] Deduced a trap composed of 93 places in 1821 ms of which 16 ms to minimize.
[2024-05-31 19:33:05] [INFO ] Deduced a trap composed of 96 places in 1615 ms of which 17 ms to minimize.
[2024-05-31 19:33:06] [INFO ] Deduced a trap composed of 96 places in 1559 ms of which 16 ms to minimize.
[2024-05-31 19:33:08] [INFO ] Deduced a trap composed of 96 places in 1627 ms of which 16 ms to minimize.
[2024-05-31 19:33:10] [INFO ] Deduced a trap composed of 96 places in 1623 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/8463 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 19:33:13] [INFO ] Deduced a trap composed of 96 places in 3009 ms of which 22 ms to minimize.
[2024-05-31 19:33:16] [INFO ] Deduced a trap composed of 93 places in 2949 ms of which 23 ms to minimize.
[2024-05-31 19:33:19] [INFO ] Deduced a trap composed of 93 places in 2815 ms of which 21 ms to minimize.
[2024-05-31 19:33:22] [INFO ] Deduced a trap composed of 93 places in 2871 ms of which 21 ms to minimize.
[2024-05-31 19:33:25] [INFO ] Deduced a trap composed of 96 places in 2914 ms of which 24 ms to minimize.
SMT process timed out in 94117ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 62 out of 8596 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8596/8596 places, 16577/16577 transitions.
Applied a total of 0 rules in 2743 ms. Remains 8596 /8596 variables (removed 0) and now considering 16577/16577 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2745 ms. Remains : 8596/8596 places, 16577/16577 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8596/8596 places, 16577/16577 transitions.
Applied a total of 0 rules in 2763 ms. Remains 8596 /8596 variables (removed 0) and now considering 16577/16577 (removed 0) transitions.
[2024-05-31 19:33:30] [INFO ] Invariant cache hit.
[2024-05-31 19:33:39] [INFO ] Implicit Places using invariants in 8845 ms returned [10, 14, 20, 24, 30, 34, 38, 46, 52, 56, 62, 68, 72, 76, 82, 86, 90, 94, 98, 102, 108, 116, 122, 126, 131, 137, 141, 147, 153, 159, 165, 171, 175, 179, 183, 187, 193, 199, 205, 213, 217, 223, 227, 235, 241, 245, 249, 255, 261, 265, 269, 275, 281, 286, 290, 294, 300, 304, 308, 314, 318, 324, 328, 332, 338, 342, 348, 354, 360, 364, 370, 374, 380, 386, 392, 396, 400, 406, 410, 416, 422, 426, 430, 436, 442, 446, 450, 456, 462]
Discarding 89 places :
Implicit Place search using SMT only with invariants took 8872 ms to find 89 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 8507/8596 places, 16577/16577 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 8507 transition count 16543
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 8473 transition count 16543
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 71 place count 8470 transition count 16540
Iterating global reduction 2 with 3 rules applied. Total rules applied 74 place count 8470 transition count 16540
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 4 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 106 rules applied. Total rules applied 180 place count 8417 transition count 16487
Applied a total of 180 rules in 8856 ms. Remains 8417 /8507 variables (removed 90) and now considering 16487/16577 (removed 90) transitions.
// Phase 1: matrix 16487 rows 8417 cols
[2024-05-31 19:33:49] [INFO ] Computed 92 invariants in 468 ms
[2024-05-31 19:33:56] [INFO ] Implicit Places using invariants in 7846 ms returned []
Implicit Place search using SMT only with invariants took 7846 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 8417/8596 places, 16487/16577 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 28340 ms. Remains : 8417/8596 places, 16487/16577 transitions.
RANDOM walk for 40000 steps (60 resets) in 1169 ms. (34 steps per ms) remains 3/4 properties
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 3/3 properties
[2024-05-31 19:33:56] [INFO ] Invariant cache hit.
[2024-05-31 19:33:57] [INFO ] State equation strengthened by 16140 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8311/8372 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8372 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8372 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 44/8416 variables, 44/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8416 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 16487/24903 variables, 8416/8508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24903 variables, 16140/24648 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24903 variables, 0/24648 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/24904 variables, 1/24649 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/24904 variables, 0/24649 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/24904 variables, 0/24649 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24904/24904 variables, and 24649 constraints, problems are : Problem set: 0 solved, 3 unsolved in 18686 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 8417/8417 constraints, ReadFeed: 16140/16140 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/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8311/8372 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8372 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 19:34:32] [INFO ] Deduced a trap composed of 2 places in 15567 ms of which 44 ms to minimize.
[2024-05-31 19:34:34] [INFO ] Deduced a trap composed of 93 places in 2315 ms of which 21 ms to minimize.
[2024-05-31 19:34:37] [INFO ] Deduced a trap composed of 94 places in 2699 ms of which 30 ms to minimize.
[2024-05-31 19:34:39] [INFO ] Deduced a trap composed of 93 places in 2163 ms of which 20 ms to minimize.
[2024-05-31 19:34:42] [INFO ] Deduced a trap composed of 93 places in 2294 ms of which 20 ms to minimize.
[2024-05-31 19:34:44] [INFO ] Deduced a trap composed of 94 places in 1944 ms of which 18 ms to minimize.
[2024-05-31 19:34:46] [INFO ] Deduced a trap composed of 94 places in 2008 ms of which 19 ms to minimize.
[2024-05-31 19:34:48] [INFO ] Deduced a trap composed of 93 places in 2204 ms of which 22 ms to minimize.
[2024-05-31 19:34:50] [INFO ] Deduced a trap composed of 93 places in 1853 ms of which 16 ms to minimize.
[2024-05-31 19:34:52] [INFO ] Deduced a trap composed of 94 places in 1884 ms of which 18 ms to minimize.
[2024-05-31 19:34:54] [INFO ] Deduced a trap composed of 93 places in 2007 ms of which 18 ms to minimize.
[2024-05-31 19:34:56] [INFO ] Deduced a trap composed of 93 places in 1937 ms of which 16 ms to minimize.
[2024-05-31 19:34:59] [INFO ] Deduced a trap composed of 93 places in 2040 ms of which 19 ms to minimize.
[2024-05-31 19:35:01] [INFO ] Deduced a trap composed of 93 places in 2037 ms of which 18 ms to minimize.
[2024-05-31 19:35:03] [INFO ] Deduced a trap composed of 93 places in 1864 ms of which 18 ms to minimize.
[2024-05-31 19:35:05] [INFO ] Deduced a trap composed of 94 places in 1843 ms of which 17 ms to minimize.
[2024-05-31 19:35:06] [INFO ] Deduced a trap composed of 94 places in 1690 ms of which 18 ms to minimize.
[2024-05-31 19:35:08] [INFO ] Deduced a trap composed of 94 places in 1605 ms of which 16 ms to minimize.
[2024-05-31 19:35:10] [INFO ] Deduced a trap composed of 94 places in 1853 ms of which 18 ms to minimize.
[2024-05-31 19:35:12] [INFO ] Deduced a trap composed of 93 places in 2155 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/8372 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 19:35:15] [INFO ] Deduced a trap composed of 93 places in 2405 ms of which 20 ms to minimize.
[2024-05-31 19:35:17] [INFO ] Deduced a trap composed of 94 places in 2305 ms of which 19 ms to minimize.
[2024-05-31 19:35:20] [INFO ] Deduced a trap composed of 93 places in 2360 ms of which 19 ms to minimize.
[2024-05-31 19:35:22] [INFO ] Deduced a trap composed of 94 places in 2418 ms of which 19 ms to minimize.
[2024-05-31 19:35:25] [INFO ] Deduced a trap composed of 93 places in 2421 ms of which 36 ms to minimize.
[2024-05-31 19:35:27] [INFO ] Deduced a trap composed of 94 places in 2516 ms of which 21 ms to minimize.
[2024-05-31 19:35:30] [INFO ] Deduced a trap composed of 94 places in 2410 ms of which 21 ms to minimize.
[2024-05-31 19:35:32] [INFO ] Deduced a trap composed of 93 places in 2427 ms of which 19 ms to minimize.
[2024-05-31 19:35:35] [INFO ] Deduced a trap composed of 93 places in 2387 ms of which 21 ms to minimize.
[2024-05-31 19:35:37] [INFO ] Deduced a trap composed of 93 places in 2198 ms of which 19 ms to minimize.
[2024-05-31 19:35:40] [INFO ] Deduced a trap composed of 93 places in 2424 ms of which 21 ms to minimize.
[2024-05-31 19:35:42] [INFO ] Deduced a trap composed of 100 places in 2435 ms of which 23 ms to minimize.
[2024-05-31 19:35:45] [INFO ] Deduced a trap composed of 94 places in 2212 ms of which 19 ms to minimize.
[2024-05-31 19:35:47] [INFO ] Deduced a trap composed of 94 places in 2213 ms of which 19 ms to minimize.
SMT process timed out in 110515ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 61 out of 8417 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8417/8417 places, 16487/16487 transitions.
Applied a total of 0 rules in 3263 ms. Remains 8417 /8417 variables (removed 0) and now considering 16487/16487 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3263 ms. Remains : 8417/8417 places, 16487/16487 transitions.
[2024-05-31 19:35:50] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2024-05-31 19:35:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 8417 places, 16487 transitions and 65590 arcs took 70 ms.
[2024-05-31 19:35:51] [INFO ] Flatten gal took : 738 ms
Total runtime 411501 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : CANConstruction-PT-090-ReachabilityCardinality-2024-04
Could not compute solution for formula : CANConstruction-PT-090-ReachabilityCardinality-2024-07
Could not compute solution for formula : CANConstruction-PT-090-ReachabilityCardinality-2023-11

BK_STOP 1717184152152

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name CANConstruction-PT-090-ReachabilityCardinality-2024-04
rfs formula type EF
rfs formula formula --invariant=/tmp/761/inv_0_
rfs formula name CANConstruction-PT-090-ReachabilityCardinality-2024-07
rfs formula type EF
rfs formula formula --invariant=/tmp/761/inv_1_
rfs formula name CANConstruction-PT-090-ReachabilityCardinality-2023-11
rfs formula type AG
rfs formula formula --invariant=/tmp/761/inv_2_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANConstruction-PT-090"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is CANConstruction-PT-090, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r476-tall-171620505100078"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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