About the Execution of LTSMin+red for PolyORBNT-PT-S10J80
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16194.460 | 296618.00 | 396782.00 | 162.80 | [undef] | Cannot compute |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654447300513.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBNT-PT-S10J80, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654447300513
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 27M
-rw-r--r-- 1 mcc users 39K Apr 12 11:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 196K Apr 12 11:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 509K Apr 12 10:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.0M Apr 12 10:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 18K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 198K Apr 12 14:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 829K Apr 12 14:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.9M Apr 12 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 6.9M Apr 12 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.4K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 14M May 18 16:43 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 PolyORBNT-PT-S10J80-CTLCardinality-2024-00
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-2024-01
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-2024-02
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-2024-03
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-2024-04
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-2024-05
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-2024-06
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-2024-07
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-2024-08
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-2024-09
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-2024-10
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-2024-11
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-2024-12
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-2024-13
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-2024-14
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717262116732
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J80
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:15:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 17:15:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:15:18] [INFO ] Load time of PNML (sax parser for PT used): 766 ms
[2024-06-01 17:15:19] [INFO ] Transformed 1614 places.
[2024-06-01 17:15:19] [INFO ] Transformed 13500 transitions.
[2024-06-01 17:15:19] [INFO ] Parsed PT model containing 1614 places and 13500 transitions and 119759 arcs in 1019 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 25 ms.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 650 out of 1614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1614/1614 places, 3390/3390 transitions.
Ensure Unique test removed 9 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1605 transition count 3390
Applied a total of 9 rules in 180 ms. Remains 1605 /1614 variables (removed 9) and now considering 3390/3390 (removed 0) transitions.
Running 3379 sub problems to find dead transitions.
[2024-06-01 17:15:19] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
// Phase 1: matrix 3381 rows 1605 cols
[2024-06-01 17:15:19] [INFO ] Computed 183 invariants in 264 ms
[2024-06-01 17:15:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1593 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 3379 unsolved
SMT process timed out in 43040ms, After SMT, problems are : Problem set: 0 solved, 3379 unsolved
Search for dead transitions found 0 dead transitions in 43110ms
[2024-06-01 17:16:02] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
[2024-06-01 17:16:02] [INFO ] Invariant cache hit.
[2024-06-01 17:16:05] [INFO ] Implicit Places using invariants in 2528 ms returned []
[2024-06-01 17:16:05] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
[2024-06-01 17:16:05] [INFO ] Invariant cache hit.
[2024-06-01 17:16:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:16:39] [INFO ] Performed 1028/1605 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 17:16:57] [INFO ] Implicit Places using invariants and state equation in 52183 ms returned []
Implicit Place search using SMT with State Equation took 54722 ms to find 0 implicit places.
Running 3379 sub problems to find dead transitions.
[2024-06-01 17:16:57] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
[2024-06-01 17:16:57] [INFO ] Invariant cache hit.
[2024-06-01 17:16:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1593 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 3379 unsolved
SMT process timed out in 54007ms, After SMT, problems are : Problem set: 0 solved, 3379 unsolved
Search for dead transitions found 0 dead transitions in 54060ms
Starting structural reductions in LTL mode, iteration 1 : 1605/1614 places, 3390/3390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 152162 ms. Remains : 1605/1614 places, 3390/3390 transitions.
Support contains 650 out of 1605 places after structural reductions.
[2024-06-01 17:17:52] [INFO ] Flatten gal took : 395 ms
[2024-06-01 17:17:52] [INFO ] Flatten gal took : 226 ms
[2024-06-01 17:17:53] [INFO ] Input system was already deterministic with 3390 transitions.
Support contains 648 out of 1605 places (down from 650) after GAL structural reductions.
RANDOM walk for 40000 steps (2243 resets) in 7618 ms. (5 steps per ms) remains 67/75 properties
BEST_FIRST walk for 4003 steps (40 resets) in 123 ms. (32 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (41 resets) in 81 ms. (48 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (39 resets) in 77 ms. (51 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (40 resets) in 78 ms. (50 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (40 resets) in 62 ms. (63 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (40 resets) in 97 ms. (40 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (40 resets) in 93 ms. (42 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (40 resets) in 57 ms. (68 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (40 resets) in 48 ms. (81 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (39 resets) in 47 ms. (83 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (40 resets) in 45 ms. (87 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (40 resets) in 50 ms. (78 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (40 resets) in 52 ms. (75 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (48 resets) in 63 ms. (62 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (40 resets) in 63 ms. (62 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (39 resets) in 45 ms. (87 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (41 resets) in 74 ms. (53 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (40 resets) in 53 ms. (74 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (39 resets) in 77 ms. (51 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (40 resets) in 66 ms. (59 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (40 resets) in 66 ms. (59 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (40 resets) in 64 ms. (61 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (40 resets) in 64 ms. (61 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (40 resets) in 84 ms. (47 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (39 resets) in 51 ms. (76 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (40 resets) in 54 ms. (72 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (40 resets) in 57 ms. (69 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (40 resets) in 43 ms. (91 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (40 resets) in 57 ms. (69 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (40 resets) in 51 ms. (76 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (40 resets) in 53 ms. (74 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (39 resets) in 43 ms. (91 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (40 resets) in 50 ms. (78 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (39 resets) in 43 ms. (90 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (39 resets) in 48 ms. (81 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (40 resets) in 42 ms. (93 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (40 resets) in 53 ms. (74 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (40 resets) in 52 ms. (75 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (40 resets) in 51 ms. (76 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (40 resets) in 41 ms. (95 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (40 resets) in 40 ms. (97 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (43 resets) in 53 ms. (74 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (40 resets) in 48 ms. (81 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (40 resets) in 57 ms. (69 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (40 resets) in 51 ms. (76 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (41 resets) in 55 ms. (71 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (40 resets) in 42 ms. (93 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (40 resets) in 48 ms. (81 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (39 resets) in 36 ms. (108 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (39 resets) in 47 ms. (83 steps per ms) remains 67/67 properties
[2024-06-01 17:17:56] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
[2024-06-01 17:17:56] [INFO ] Invariant cache hit.
[2024-06-01 17:17:56] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/646 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp71 is UNSAT
At refinement iteration 1 (OVERLAPS) 369/1015 variables, 103/103 constraints. Problems are: Problem set: 26 solved, 41 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp37 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1015 variables, 3/106 constraints. Problems are: Problem set: 30 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1015 variables, 0/106 constraints. Problems are: Problem set: 30 solved, 37 unsolved
At refinement iteration 4 (OVERLAPS) 530/1545 variables, 53/159 constraints. Problems are: Problem set: 30 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1545 variables, 0/159 constraints. Problems are: Problem set: 30 solved, 37 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp69 is UNSAT
At refinement iteration 6 (OVERLAPS) 56/1601 variables, 20/179 constraints. Problems are: Problem set: 51 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1601 variables, 0/179 constraints. Problems are: Problem set: 51 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 4/1605 variables, 4/183 constraints. Problems are: Problem set: 51 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1605 variables, 0/183 constraints. Problems are: Problem set: 51 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 3381/4986 variables, 1605/1788 constraints. Problems are: Problem set: 51 solved, 16 unsolved
SMT process timed out in 5393ms, After SMT, problems are : Problem set: 51 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 277 out of 1605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1605/1605 places, 3390/3390 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1604 transition count 3388
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 1602 transition count 3386
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 1600 transition count 3386
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 9 place count 1600 transition count 3306
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 169 place count 1520 transition count 3306
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 171 place count 1519 transition count 3305
Applied a total of 171 rules in 687 ms. Remains 1519 /1605 variables (removed 86) and now considering 3305/3390 (removed 85) transitions.
Running 3294 sub problems to find dead transitions.
[2024-06-01 17:18:02] [INFO ] Flow matrix only has 3296 transitions (discarded 9 similar events)
// Phase 1: matrix 3296 rows 1519 cols
[2024-06-01 17:18:03] [INFO ] Computed 182 invariants in 110 ms
[2024-06-01 17:18:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1509 variables, 159/159 constraints. Problems are: Problem set: 0 solved, 3294 unsolved
SMT process timed out in 44844ms, After SMT, problems are : Problem set: 0 solved, 3294 unsolved
Search for dead transitions found 0 dead transitions in 44897ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45591 ms. Remains : 1519/1605 places, 3305/3390 transitions.
RANDOM walk for 40000 steps (2706 resets) in 1653 ms. (24 steps per ms) remains 5/16 properties
BEST_FIRST walk for 40002 steps (385 resets) in 693 ms. (57 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (360 resets) in 277 ms. (143 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (386 resets) in 277 ms. (143 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (362 resets) in 209 ms. (190 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (368 resets) in 195 ms. (204 steps per ms) remains 2/2 properties
[2024-06-01 17:18:48] [INFO ] Flow matrix only has 3296 transitions (discarded 9 similar events)
[2024-06-01 17:18:48] [INFO ] Invariant cache hit.
[2024-06-01 17:18:48] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 283/290 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 410/700 variables, 76/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/700 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 690/1390 variables, 69/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1390 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 123/1513 variables, 23/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1513 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/1518 variables, 5/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1518 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 3296/4814 variables, 1518/1700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4814 variables, 1/1701 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4814 variables, 0/1701 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/4815 variables, 1/1702 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4815 variables, 0/1702 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/4815 variables, 0/1702 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4815/4815 variables, and 1702 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2353 ms.
Refiners :[Positive P Invariants (semi-flows): 159/159 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 1519/1519 constraints, ReadFeed: 1/1 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 283/290 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 410/700 variables, 76/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/700 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 690/1390 variables, 69/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1390 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 123/1513 variables, 23/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 17:18:53] [INFO ] Deduced a trap composed of 18 places in 1186 ms of which 89 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1513 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1513 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/1518 variables, 5/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1518 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3296/4814 variables, 1518/1701 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4814 variables, 1/1702 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4814 variables, 2/1704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4814 variables, 0/1704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/4815 variables, 1/1705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4815 variables, 0/1705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/4815 variables, 0/1705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4815/4815 variables, and 1705 constraints, problems are : Problem set: 0 solved, 2 unsolved in 8166 ms.
Refiners :[Positive P Invariants (semi-flows): 159/159 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 1519/1519 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 10564ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 250 ms.
Support contains 5 out of 1519 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1519/1519 places, 3305/3305 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1519 transition count 3302
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 1516 transition count 3301
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 1515 transition count 3301
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 82 Pre rules applied. Total rules applied 8 place count 1515 transition count 3219
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 172 place count 1433 transition count 3219
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 3 with 4 rules applied. Total rules applied 176 place count 1431 transition count 3217
Applied a total of 176 rules in 424 ms. Remains 1431 /1519 variables (removed 88) and now considering 3217/3305 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 437 ms. Remains : 1431/1519 places, 3217/3305 transitions.
RANDOM walk for 40000 steps (2938 resets) in 2590 ms. (15 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (242 resets) in 253 ms. (157 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 94384 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :0 out of 1
Probabilistic random walk after 94384 steps, saw 17183 distinct states, run finished after 3005 ms. (steps per millisecond=31 ) properties seen :0
[2024-06-01 17:19:03] [INFO ] Flow matrix only has 3208 transitions (discarded 9 similar events)
// Phase 1: matrix 3208 rows 1431 cols
[2024-06-01 17:19:04] [INFO ] Computed 182 invariants in 208 ms
[2024-06-01 17:19:04] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 270/275 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 328/603 variables, 77/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/603 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 710/1313 variables, 71/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1313 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 112/1425 variables, 22/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1425 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/1430 variables, 5/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1430 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3208/4638 variables, 1430/1612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4638 variables, 1/1613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4638 variables, 0/1613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/4639 variables, 1/1614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4639 variables, 0/1614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/4639 variables, 0/1614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4639/4639 variables, and 1614 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2455 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 1431/1431 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 270/275 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 328/603 variables, 77/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/603 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 710/1313 variables, 71/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1313 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 112/1425 variables, 22/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:19:07] [INFO ] Deduced a trap composed of 13 places in 972 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1425 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1425 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/1430 variables, 5/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1430 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3208/4638 variables, 1430/1613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4638 variables, 1/1614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4638 variables, 1/1615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4638 variables, 0/1615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/4639 variables, 1/1616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4639 variables, 0/1616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/4639 variables, 0/1616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4639/4639 variables, and 1616 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4879 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 1431/1431 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 7599ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 61 ms.
Support contains 5 out of 1431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1431/1431 places, 3217/3217 transitions.
Applied a total of 0 rules in 109 ms. Remains 1431 /1431 variables (removed 0) and now considering 3217/3217 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 1431/1431 places, 3217/3217 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1431/1431 places, 3217/3217 transitions.
Applied a total of 0 rules in 109 ms. Remains 1431 /1431 variables (removed 0) and now considering 3217/3217 (removed 0) transitions.
[2024-06-01 17:19:11] [INFO ] Flow matrix only has 3208 transitions (discarded 9 similar events)
[2024-06-01 17:19:11] [INFO ] Invariant cache hit.
[2024-06-01 17:19:15] [INFO ] Implicit Places using invariants in 3290 ms returned []
[2024-06-01 17:19:15] [INFO ] Flow matrix only has 3208 transitions (discarded 9 similar events)
[2024-06-01 17:19:15] [INFO ] Invariant cache hit.
[2024-06-01 17:19:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:19:48] [INFO ] Performed 880/1431 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 17:20:02] [INFO ] Implicit Places using invariants and state equation in 47604 ms returned []
Implicit Place search using SMT with State Equation took 50909 ms to find 0 implicit places.
[2024-06-01 17:20:02] [INFO ] Redundant transitions in 209 ms returned []
Running 3206 sub problems to find dead transitions.
[2024-06-01 17:20:02] [INFO ] Flow matrix only has 3208 transitions (discarded 9 similar events)
[2024-06-01 17:20:02] [INFO ] Invariant cache hit.
[2024-06-01 17:20:02] [INFO ] State equation strengthened by 1 read => feed constraints.
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : PolyORBNT-PT-S10J80-CTLCardinality-2024-00
Could not compute solution for formula : PolyORBNT-PT-S10J80-CTLCardinality-2024-01
Could not compute solution for formula : PolyORBNT-PT-S10J80-CTLCardinality-2024-02
Could not compute solution for formula : PolyORBNT-PT-S10J80-CTLCardinality-2024-03
Could not compute solution for formula : PolyORBNT-PT-S10J80-CTLCardinality-2024-04
Could not compute solution for formula : PolyORBNT-PT-S10J80-CTLCardinality-2024-05
Could not compute solution for formula : PolyORBNT-PT-S10J80-CTLCardinality-2024-06
Could not compute solution for formula : PolyORBNT-PT-S10J80-CTLCardinality-2024-07
Could not compute solution for formula : PolyORBNT-PT-S10J80-CTLCardinality-2024-08
Could not compute solution for formula : PolyORBNT-PT-S10J80-CTLCardinality-2024-09
Could not compute solution for formula : PolyORBNT-PT-S10J80-CTLCardinality-2024-10
Could not compute solution for formula : PolyORBNT-PT-S10J80-CTLCardinality-2024-11
Could not compute solution for formula : PolyORBNT-PT-S10J80-CTLCardinality-2024-12
Could not compute solution for formula : PolyORBNT-PT-S10J80-CTLCardinality-2024-13
Could not compute solution for formula : PolyORBNT-PT-S10J80-CTLCardinality-2024-14
Could not compute solution for formula : PolyORBNT-PT-S10J80-CTLCardinality-2024-15
BK_STOP 1717262413350
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name PolyORBNT-PT-S10J80-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/592/ctl_0_
ctl formula name PolyORBNT-PT-S10J80-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/592/ctl_1_
ctl formula name PolyORBNT-PT-S10J80-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/592/ctl_2_
ctl formula name PolyORBNT-PT-S10J80-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/592/ctl_3_
ctl formula name PolyORBNT-PT-S10J80-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/592/ctl_4_
ctl formula name PolyORBNT-PT-S10J80-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/592/ctl_5_
ctl formula name PolyORBNT-PT-S10J80-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/592/ctl_6_
ctl formula name PolyORBNT-PT-S10J80-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/592/ctl_7_
ctl formula name PolyORBNT-PT-S10J80-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/592/ctl_8_
ctl formula name PolyORBNT-PT-S10J80-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/592/ctl_9_
ctl formula name PolyORBNT-PT-S10J80-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/592/ctl_10_
ctl formula name PolyORBNT-PT-S10J80-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/592/ctl_11_
ctl formula name PolyORBNT-PT-S10J80-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/592/ctl_12_
ctl formula name PolyORBNT-PT-S10J80-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/592/ctl_13_
ctl formula name PolyORBNT-PT-S10J80-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/592/ctl_14_
ctl formula name PolyORBNT-PT-S10J80-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/592/ctl_15_
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="PolyORBNT-PT-S10J80"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBNT-PT-S10J80, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654447300513"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S10J80.tgz
mv PolyORBNT-PT-S10J80 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;