About the Execution of LTSMin+red for PermAdmissibility-COL-01
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 388.048 | 9550.00 | 23136.00 | 198.40 | TTF??T?FFT???F?? | normal |
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.r512-smll-171654406900105.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 PermAdmissibility-COL-01, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654406900105
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 9.6K Apr 12 09:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 12 09:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 09:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 09:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 09:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 12 09:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 09:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 12 09:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 54K 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 PermAdmissibility-COL-01-CTLCardinality-2024-00
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-2024-01
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-2024-02
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-2024-03
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-2024-04
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-2024-05
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-2024-06
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-2024-07
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-2024-08
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-2024-09
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-2024-10
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-2024-11
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-2024-12
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-2024-13
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-2024-14
FORMULA_NAME PermAdmissibility-COL-01-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717251132405
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-COL-01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:12:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 14:12:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:12:14] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 14:12:14] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 14:12:15] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1027 ms
[2024-06-01 14:12:15] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 37 ms.
[2024-06-01 14:12:15] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 6 ms.
[2024-06-01 14:12:15] [INFO ] Skeletonized 16 HLPN properties in 4 ms.
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40000 steps (2352 resets) in 3450 ms. (11 steps per ms) remains 90/128 properties
BEST_FIRST walk for 4000 steps (232 resets) in 225 ms. (17 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 76 ms. (51 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 57 ms. (68 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 96 ms. (41 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 67 ms. (58 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 63 ms. (62 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 52 ms. (75 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 67 ms. (58 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 48 ms. (81 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 50 ms. (78 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 50 ms. (78 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 80 ms. (49 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 57 ms. (68 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 53 ms. (74 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 49 ms. (80 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 85 ms. (46 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 64 ms. (61 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 82 ms. (48 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 50 ms. (78 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 73 ms. (54 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 50 ms. (78 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 49 ms. (80 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 48 ms. (81 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 48 ms. (81 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 64 ms. (61 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 62 ms. (63 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 49 ms. (80 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 48 ms. (81 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 50 ms. (78 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 47 ms. (83 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 49 ms. (80 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 73 ms. (54 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 103 ms. (38 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 46 ms. (85 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 48 ms. (81 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 47 ms. (83 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 47 ms. (83 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 81 ms. (48 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 55 ms. (71 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 55 ms. (71 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 53 ms. (74 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 52 ms. (75 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 52 ms. (75 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 54 ms. (72 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 50 ms. (78 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 48 ms. (81 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 46 ms. (85 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 48 ms. (81 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 64 ms. (61 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (232 resets) in 46 ms. (85 steps per ms) remains 90/90 properties
// Phase 1: matrix 16 rows 40 cols
[2024-06-01 14:12:17] [INFO ] Computed 24 invariants in 8 ms
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp83 is UNSAT
Problem AtomicPropp86 is UNSAT
Problem AtomicPropp88 is UNSAT
Problem AtomicPropp89 is UNSAT
Problem AtomicPropp91 is UNSAT
Problem AtomicPropp92 is UNSAT
Problem AtomicPropp93 is UNSAT
Problem AtomicPropp94 is UNSAT
Problem AtomicPropp95 is UNSAT
Problem AtomicPropp98 is UNSAT
Problem AtomicPropp99 is UNSAT
Problem AtomicPropp100 is UNSAT
Problem AtomicPropp104 is UNSAT
Problem AtomicPropp105 is UNSAT
Problem AtomicPropp106 is UNSAT
Problem AtomicPropp107 is UNSAT
Problem AtomicPropp108 is UNSAT
Problem AtomicPropp109 is UNSAT
Problem AtomicPropp111 is UNSAT
Problem AtomicPropp112 is UNSAT
Problem AtomicPropp113 is UNSAT
Problem AtomicPropp115 is UNSAT
Problem AtomicPropp119 is UNSAT
Problem AtomicPropp120 is UNSAT
Problem AtomicPropp121 is UNSAT
Problem AtomicPropp122 is UNSAT
Problem AtomicPropp123 is UNSAT
Problem AtomicPropp124 is UNSAT
Problem AtomicPropp125 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 24/24 constraints. Problems are: Problem set: 89 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/24 constraints. Problems are: Problem set: 89 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 16/56 variables, 40/64 constraints. Problems are: Problem set: 89 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/64 constraints. Problems are: Problem set: 89 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 0/56 variables, 0/64 constraints. Problems are: Problem set: 89 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 64 constraints, problems are : Problem set: 89 solved, 1 unsolved in 434 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 89 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 89 solved, 1 unsolved
Problem AtomicPropp29 is UNSAT
After SMT solving in domain Int declared 31/56 variables, and 15 constraints, problems are : Problem set: 90 solved, 0 unsolved in 63 ms.
Refiners :[Generalized P Invariants (flows): 15/24 constraints, State Equation: 0/40 constraints, PredecessorRefiner: 0/90 constraints, Known Traps: 0/0 constraints]
After SMT, in 582ms problems are : Problem set: 90 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 90 atomic propositions for a total of 16 simplifications.
FORMULA PermAdmissibility-COL-01-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:12:18] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-01 14:12:18] [INFO ] Flatten gal took : 29 ms
[2024-06-01 14:12:18] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PermAdmissibility-COL-01-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:12:18] [INFO ] Flatten gal took : 9 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :input
Symmetric sort wr.t. initial detected :input
Symmetric sort wr.t. initial and guards detected :input
Applying symmetric unfolding of full symmetric sort :input domain size was 8
[2024-06-01 14:12:18] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 16 ms.
[2024-06-01 14:12:18] [INFO ] Unfolded 9 HLPN properties in 1 ms.
Support contains 38 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Applied a total of 0 rules in 8 ms. Remains 40 /40 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2024-06-01 14:12:18] [INFO ] Invariant cache hit.
[2024-06-01 14:12:18] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-01 14:12:18] [INFO ] Invariant cache hit.
[2024-06-01 14:12:18] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Running 15 sub problems to find dead transitions.
[2024-06-01 14:12:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 5/36 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 4/40 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 16/56 variables, 40/64 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/56 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 64 constraints, problems are : Problem set: 0 solved, 15 unsolved in 403 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 5/36 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 4/40 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 16/56 variables, 40/64 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 15/79 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/56 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 79 constraints, problems are : Problem set: 0 solved, 15 unsolved in 306 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 722ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 723ms
Finished structural reductions in LTL mode , in 1 iterations and 894 ms. Remains : 40/40 places, 16/16 transitions.
Support contains 38 out of 40 places after structural reductions.
[2024-06-01 14:12:19] [INFO ] Flatten gal took : 7 ms
[2024-06-01 14:12:19] [INFO ] Flatten gal took : 8 ms
[2024-06-01 14:12:19] [INFO ] Input system was already deterministic with 16 transitions.
RANDOM walk for 40000 steps (2352 resets) in 710 ms. (56 steps per ms) remains 61/89 properties
BEST_FIRST walk for 4000 steps (232 resets) in 49 ms. (80 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 117 ms. (33 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 54 ms. (72 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 94 ms. (42 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 51 ms. (76 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 49 ms. (80 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 77 ms. (51 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 48 ms. (81 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 48 ms. (81 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 48 ms. (81 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 119 ms. (33 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 75 ms. (52 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 77 ms. (51 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 101 ms. (39 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 67 ms. (58 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 52 ms. (75 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 66 ms. (59 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 59 ms. (66 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 55 ms. (71 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 61 ms. (64 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 50 ms. (78 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 57 ms. (68 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 96 ms. (41 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 77 ms. (51 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 74 ms. (53 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 40 ms. (97 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 37 ms. (105 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 38 ms. (102 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 38 ms. (102 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 38 ms. (102 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 48 ms. (81 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 35 ms. (111 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 36 ms. (108 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 37 ms. (105 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 38 ms. (102 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 35 ms. (111 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 36 ms. (108 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 38 ms. (102 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 35 ms. (111 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 58 ms. (67 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 42 ms. (93 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 45 ms. (86 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 38 ms. (102 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 35 ms. (111 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 35 ms. (111 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 37 ms. (105 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 36 ms. (108 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 38 ms. (102 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 53 ms. (74 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (232 resets) in 41 ms. (95 steps per ms) remains 61/61 properties
[2024-06-01 14:12:20] [INFO ] Invariant cache hit.
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp84 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 13/13 constraints. Problems are: Problem set: 4 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 4 solved, 57 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 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 AtomicPropp50 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp83 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp86 is UNSAT
At refinement iteration 2 (OVERLAPS) 3/40 variables, 11/24 constraints. Problems are: Problem set: 60 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/24 constraints. Problems are: Problem set: 60 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 16/56 variables, 40/64 constraints. Problems are: Problem set: 60 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/64 constraints. Problems are: Problem set: 60 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/56 variables, 0/64 constraints. Problems are: Problem set: 60 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 64 constraints, problems are : Problem set: 60 solved, 1 unsolved in 415 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 60 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 60 solved, 1 unsolved
Problem AtomicPropp20 is UNSAT
After SMT solving in domain Int declared 31/56 variables, and 15 constraints, problems are : Problem set: 61 solved, 0 unsolved in 34 ms.
Refiners :[Generalized P Invariants (flows): 15/24 constraints, State Equation: 0/40 constraints, PredecessorRefiner: 0/61 constraints, Known Traps: 0/0 constraints]
After SMT, in 474ms problems are : Problem set: 61 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 61 atomic propositions for a total of 9 simplifications.
[2024-06-01 14:12:21] [INFO ] Flatten gal took : 5 ms
[2024-06-01 14:12:21] [INFO ] Flatten gal took : 5 ms
[2024-06-01 14:12:21] [INFO ] Input system was already deterministic with 16 transitions.
Support contains 22 out of 40 places (down from 24) after GAL structural reductions.
FORMULA PermAdmissibility-COL-01-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Graph (complete) has 105 edges and 40 vertex of which 29 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 19 ms. Remains 27 /40 variables (removed 13) and now considering 14/16 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 27/40 places, 14/16 transitions.
[2024-06-01 14:12:21] [INFO ] Flatten gal took : 3 ms
[2024-06-01 14:12:21] [INFO ] Flatten gal took : 4 ms
[2024-06-01 14:12:21] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 30 transition count 16
Applied a total of 10 rules in 9 ms. Remains 30 /40 variables (removed 10) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 30/40 places, 16/16 transitions.
[2024-06-01 14:12:21] [INFO ] Flatten gal took : 2 ms
[2024-06-01 14:12:21] [INFO ] Flatten gal took : 3 ms
[2024-06-01 14:12:21] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 31 transition count 16
Applied a total of 9 rules in 1 ms. Remains 31 /40 variables (removed 9) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/40 places, 16/16 transitions.
[2024-06-01 14:12:21] [INFO ] Flatten gal took : 3 ms
[2024-06-01 14:12:21] [INFO ] Flatten gal took : 2 ms
[2024-06-01 14:12:21] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 31 transition count 16
Applied a total of 9 rules in 1 ms. Remains 31 /40 variables (removed 9) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/40 places, 16/16 transitions.
[2024-06-01 14:12:21] [INFO ] Flatten gal took : 2 ms
[2024-06-01 14:12:21] [INFO ] Flatten gal took : 2 ms
[2024-06-01 14:12:21] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 32 transition count 16
Applied a total of 8 rules in 1 ms. Remains 32 /40 variables (removed 8) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 32/40 places, 16/16 transitions.
[2024-06-01 14:12:21] [INFO ] Flatten gal took : 3 ms
[2024-06-01 14:12:21] [INFO ] Flatten gal took : 2 ms
[2024-06-01 14:12:21] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 33 transition count 16
Applied a total of 7 rules in 1 ms. Remains 33 /40 variables (removed 7) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 33/40 places, 16/16 transitions.
[2024-06-01 14:12:21] [INFO ] Flatten gal took : 2 ms
[2024-06-01 14:12:21] [INFO ] Flatten gal took : 2 ms
[2024-06-01 14:12:21] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 32 transition count 16
Applied a total of 8 rules in 2 ms. Remains 32 /40 variables (removed 8) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 32/40 places, 16/16 transitions.
[2024-06-01 14:12:21] [INFO ] Flatten gal took : 2 ms
[2024-06-01 14:12:21] [INFO ] Flatten gal took : 2 ms
[2024-06-01 14:12:21] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Graph (complete) has 105 edges and 40 vertex of which 32 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 3 ms. Remains 30 /40 variables (removed 10) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 30/40 places, 16/16 transitions.
[2024-06-01 14:12:21] [INFO ] Flatten gal took : 2 ms
[2024-06-01 14:12:21] [INFO ] Flatten gal took : 2 ms
[2024-06-01 14:12:21] [INFO ] Input system was already deterministic with 16 transitions.
[2024-06-01 14:12:21] [INFO ] Flatten gal took : 3 ms
[2024-06-01 14:12:21] [INFO ] Flatten gal took : 3 ms
[2024-06-01 14:12:21] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 14:12:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 40 places, 16 transitions and 83 arcs took 1 ms.
Total runtime 7448 ms.
There are residual formulas that ITS could not solve within timeout
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 : PermAdmissibility-COL-01-CTLCardinality-2024-03
Could not compute solution for formula : PermAdmissibility-COL-01-CTLCardinality-2024-04
Could not compute solution for formula : PermAdmissibility-COL-01-CTLCardinality-2024-06
Could not compute solution for formula : PermAdmissibility-COL-01-CTLCardinality-2024-10
Could not compute solution for formula : PermAdmissibility-COL-01-CTLCardinality-2024-11
Could not compute solution for formula : PermAdmissibility-COL-01-CTLCardinality-2024-12
Could not compute solution for formula : PermAdmissibility-COL-01-CTLCardinality-2024-14
Could not compute solution for formula : PermAdmissibility-COL-01-CTLCardinality-2024-15
BK_STOP 1717251141955
--------------------
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 PermAdmissibility-COL-01-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/522/ctl_0_
ctl formula name PermAdmissibility-COL-01-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/522/ctl_1_
ctl formula name PermAdmissibility-COL-01-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/522/ctl_2_
ctl formula name PermAdmissibility-COL-01-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/522/ctl_3_
ctl formula name PermAdmissibility-COL-01-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/522/ctl_4_
ctl formula name PermAdmissibility-COL-01-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/522/ctl_5_
ctl formula name PermAdmissibility-COL-01-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/522/ctl_6_
ctl formula name PermAdmissibility-COL-01-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/522/ctl_7_
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="PermAdmissibility-COL-01"
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 PermAdmissibility-COL-01, 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 r512-smll-171654406900105"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-COL-01.tgz
mv PermAdmissibility-COL-01 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 ;