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.r484-smll-171624275400163.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 DLCround-PT-06a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r484-smll-171624275400163
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 804K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 13 13:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 13 13:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 13 13:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 13 13:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:38 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 325K 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 DLCround-PT-06a-LTLCardinality-00
FORMULA_NAME DLCround-PT-06a-LTLCardinality-01
FORMULA_NAME DLCround-PT-06a-LTLCardinality-02
FORMULA_NAME DLCround-PT-06a-LTLCardinality-03
FORMULA_NAME DLCround-PT-06a-LTLCardinality-04
FORMULA_NAME DLCround-PT-06a-LTLCardinality-05
FORMULA_NAME DLCround-PT-06a-LTLCardinality-06
FORMULA_NAME DLCround-PT-06a-LTLCardinality-07
FORMULA_NAME DLCround-PT-06a-LTLCardinality-08
FORMULA_NAME DLCround-PT-06a-LTLCardinality-09
FORMULA_NAME DLCround-PT-06a-LTLCardinality-10
FORMULA_NAME DLCround-PT-06a-LTLCardinality-11
FORMULA_NAME DLCround-PT-06a-LTLCardinality-12
FORMULA_NAME DLCround-PT-06a-LTLCardinality-13
FORMULA_NAME DLCround-PT-06a-LTLCardinality-14
FORMULA_NAME DLCround-PT-06a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717223560226

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-06a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:32:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:32:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:32:42] [INFO ] Load time of PNML (sax parser for PT used): 240 ms
[2024-06-01 06:32:42] [INFO ] Transformed 197 places.
[2024-06-01 06:32:43] [INFO ] Transformed 1313 transitions.
[2024-06-01 06:32:43] [INFO ] Found NUPN structural information;
[2024-06-01 06:32:43] [INFO ] Parsed PT model containing 197 places and 1313 transitions and 5002 arcs in 603 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 135 transitions
Reduce redundant transitions removed 135 transitions.
FORMULA DLCround-PT-06a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 1178/1178 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 180 transition count 994
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 180 transition count 994
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 180 transition count 991
Drop transitions (Redundant composition of simpler transitions.) removed 286 transitions
Redundant transition composition rules discarded 286 transitions
Iterating global reduction 1 with 286 rules applied. Total rules applied 323 place count 180 transition count 705
Applied a total of 323 rules in 147 ms. Remains 180 /197 variables (removed 17) and now considering 705/1178 (removed 473) transitions.
[2024-06-01 06:32:43] [INFO ] Flow matrix only has 134 transitions (discarded 571 similar events)
// Phase 1: matrix 134 rows 180 cols
[2024-06-01 06:32:43] [INFO ] Computed 109 invariants in 23 ms
[2024-06-01 06:32:44] [INFO ] Implicit Places using invariants in 1227 ms returned [82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 95, 96, 97, 99, 100, 101, 102, 103, 104, 105, 106, 107, 109, 110, 111, 112, 113, 114, 115, 116, 117, 120, 121, 122, 123, 124, 125, 127, 128, 129, 130, 131, 132, 133, 134, 135, 137, 139, 140, 141, 142, 143, 144, 145, 147, 148, 149, 150, 151, 152, 153, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 167, 169, 170, 171, 172, 173, 174, 175, 176, 178, 179]
Discarding 85 places :
Ensure Unique test removed 461 transitions
Reduce isomorphic transitions removed 461 transitions.
Implicit Place search using SMT only with invariants took 1293 ms to find 85 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 95/197 places, 244/1178 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 0 with 70 rules applied. Total rules applied 70 place count 95 transition count 174
Applied a total of 70 rules in 7 ms. Remains 95 /95 variables (removed 0) and now considering 174/244 (removed 70) transitions.
[2024-06-01 06:32:44] [INFO ] Flow matrix only has 134 transitions (discarded 40 similar events)
// Phase 1: matrix 134 rows 95 cols
[2024-06-01 06:32:44] [INFO ] Computed 24 invariants in 3 ms
[2024-06-01 06:32:44] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-01 06:32:44] [INFO ] Flow matrix only has 134 transitions (discarded 40 similar events)
[2024-06-01 06:32:44] [INFO ] Invariant cache hit.
[2024-06-01 06:32:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:32:44] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 95/197 places, 174/1178 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1708 ms. Remains : 95/197 places, 174/1178 transitions.
Support contains 20 out of 95 places after structural reductions.
[2024-06-01 06:32:45] [INFO ] Flatten gal took : 66 ms
[2024-06-01 06:32:45] [INFO ] Flatten gal took : 25 ms
[2024-06-01 06:32:45] [INFO ] Input system was already deterministic with 174 transitions.
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 40000 steps (8 resets) in 2307 ms. (17 steps per ms) remains 7/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 104 ms. (380 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 7/7 properties
[2024-06-01 06:32:46] [INFO ] Flow matrix only has 134 transitions (discarded 40 similar events)
[2024-06-01 06:32:46] [INFO ] Invariant cache hit.
[2024-06-01 06:32:46] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp8 is UNSAT
At refinement iteration 1 (OVERLAPS) 14/29 variables, 14/14 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 66/95 variables, 10/24 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 133/228 variables, 95/119 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 0/119 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/229 variables, 1/120 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 0/120 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/229 variables, 0/120 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 120 constraints, problems are : Problem set: 1 solved, 6 unsolved in 518 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 95/95 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
After SMT solving in domain Int declared 19/229 variables, and 12 constraints, problems are : Problem set: 7 solved, 0 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 12/24 constraints, State Equation: 0/95 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 639ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 8 atomic propositions for a total of 6 simplifications.
FORMULA DLCround-PT-06a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 14 stabilizing places and 1 stable transitions
Graph (complete) has 197 edges and 95 vertex of which 82 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.5 ms
FORMULA DLCround-PT-06a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 1 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 174/174 transitions.
Graph (trivial) has 173 edges and 95 vertex of which 81 / 95 are part of one of the 11 SCC in 4 ms
Free SCC test removed 70 places
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 162 transitions.
Graph (complete) has 35 edges and 25 vertex of which 13 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 0 output transitions
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 12 place count 3 transition count 2
Iterating global reduction 0 with 10 rules applied. Total rules applied 22 place count 3 transition count 2
Applied a total of 22 rules in 27 ms. Remains 3 /95 variables (removed 92) and now considering 2/174 (removed 172) transitions.
// Phase 1: matrix 2 rows 3 cols
[2024-06-01 06:32:47] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 06:32:47] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 06:32:47] [INFO ] Invariant cache hit.
[2024-06-01 06:32:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:32:47] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-06-01 06:32:47] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-06-01 06:32:47] [INFO ] Invariant cache hit.
[2024-06-01 06:32:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/4 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/5 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/5 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5/5 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 3/3 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/4 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/5 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/5 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5/5 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 112ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 113ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/95 places, 2/174 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 205 ms. Remains : 3/95 places, 2/174 transitions.
Stuttering acceptance computed with spot in 360 ms :[true, (NOT p0)]
Running random walk in product with property : DLCround-PT-06a-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA DLCround-PT-06a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06a-LTLCardinality-05 finished in 679 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||G(p1)))&&F(G(p2))))'
Support contains 3 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 174/174 transitions.
Graph (trivial) has 168 edges and 95 vertex of which 79 / 95 are part of one of the 11 SCC in 1 ms
Free SCC test removed 68 places
Ensure Unique test removed 157 transitions
Reduce isomorphic transitions removed 157 transitions.
Graph (complete) has 40 edges and 27 vertex of which 15 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 0 output transitions
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 10 place count 7 transition count 9
Iterating global reduction 0 with 8 rules applied. Total rules applied 18 place count 7 transition count 9
Applied a total of 18 rules in 7 ms. Remains 7 /95 variables (removed 88) and now considering 9/174 (removed 165) transitions.
[2024-06-01 06:32:47] [INFO ] Flow matrix only has 6 transitions (discarded 3 similar events)
// Phase 1: matrix 6 rows 7 cols
[2024-06-01 06:32:47] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 06:32:48] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 06:32:48] [INFO ] Flow matrix only has 6 transitions (discarded 3 similar events)
[2024-06-01 06:32:48] [INFO ] Invariant cache hit.
[2024-06-01 06:32:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:32:48] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-06-01 06:32:48] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2024-06-01 06:32:48] [INFO ] Flow matrix only has 6 transitions (discarded 3 similar events)
[2024-06-01 06:32:48] [INFO ] Invariant cache hit.
[2024-06-01 06:32:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 1/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 5/12 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/13 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 12 constraints, problems are : Problem set: 0 solved, 8 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 7/7 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 1/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 5/12 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/12 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1/13 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/13 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/13 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 20 constraints, problems are : Problem set: 0 solved, 8 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 7/7 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 380ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 381ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/95 places, 9/174 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 460 ms. Remains : 7/95 places, 9/174 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : DLCround-PT-06a-LTLCardinality-08
Product exploration explored 100000 steps with 0 reset in 463 ms.
Product exploration explored 100000 steps with 0 reset in 282 ms.
Computed a total of 3 stabilizing places and 1 stable transitions
Graph (complete) has 12 edges and 7 vertex of which 6 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 3 stabilizing places and 1 stable transitions
Detected a total of 3/7 stabilizing places and 1/9 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X p2), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 11 factoid took 836 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 382 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), false, false, false, false]
RANDOM walk for 40000 steps (8 resets) in 452 ms. (88 steps per ms) remains 3/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 3/3 properties
[2024-06-01 06:32:50] [INFO ] Flow matrix only has 6 transitions (discarded 3 similar events)
[2024-06-01 06:32:50] [INFO ] Invariant cache hit.
[2024-06-01 06:32:50] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem apf5 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem apf2 is UNSAT
Problem apf6 is UNSAT
After SMT solving in domain Real declared 6/13 variables, and 3 constraints, problems are : Problem set: 3 solved, 0 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 3/4 constraints, State Equation: 0/7 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 45ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X p2), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p0) (NOT p1) p2)), (G (OR (NOT p0) (NOT p1) (NOT p2))), (G (OR (NOT p0) p1 p2))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F p2), (F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 14 factoid took 1436 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 927 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), false, false]
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), false, false]
[2024-06-01 06:32:53] [INFO ] Flow matrix only has 6 transitions (discarded 3 similar events)
[2024-06-01 06:32:53] [INFO ] Invariant cache hit.
[2024-06-01 06:32:53] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 06:32:53] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 06:32:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:32:53] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 06:32:53] [INFO ] Computed and/alt/rep : 8/12/5 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 06:32:53] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-06-01 06:32:53] [INFO ] Flow matrix only has 6 transitions (discarded 3 similar events)
[2024-06-01 06:32:53] [INFO ] Invariant cache hit.
[2024-06-01 06:32:53] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 06:32:53] [INFO ] Flow matrix only has 6 transitions (discarded 3 similar events)
[2024-06-01 06:32:53] [INFO ] Invariant cache hit.
[2024-06-01 06:32:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:32:53] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-06-01 06:32:53] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2024-06-01 06:32:53] [INFO ] Flow matrix only has 6 transitions (discarded 3 similar events)
[2024-06-01 06:32:53] [INFO ] Invariant cache hit.
[2024-06-01 06:32:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 1/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 5/12 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/13 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 12 constraints, problems are : Problem set: 0 solved, 8 unsolved in 243 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 7/7 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 1/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 5/12 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/12 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1/13 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/13 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/13 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 20 constraints, problems are : Problem set: 0 solved, 8 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 7/7 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 422ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 422ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 499 ms. Remains : 7/7 places, 9/9 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Graph (complete) has 12 edges and 7 vertex of which 6 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 3 stabilizing places and 1 stable transitions
Detected a total of 3/7 stabilizing places and 1/9 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 12 factoid took 1163 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), false, false]
RANDOM walk for 40000 steps (8 resets) in 82 ms. (481 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
[2024-06-01 06:32:55] [INFO ] Flow matrix only has 6 transitions (discarded 3 similar events)
[2024-06-01 06:32:55] [INFO ] Invariant cache hit.
[2024-06-01 06:32:55] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 6/13 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 3/4 constraints, State Equation: 0/7 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 38ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p0) p1 p2))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT p1)), (F p2), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 13 factoid took 2967 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), false, false]
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), false, false]
[2024-06-01 06:32:59] [INFO ] Flow matrix only has 6 transitions (discarded 3 similar events)
[2024-06-01 06:32:59] [INFO ] Invariant cache hit.
[2024-06-01 06:32:59] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 06:32:59] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 06:32:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:32:59] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 06:32:59] [INFO ] Computed and/alt/rep : 8/12/5 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 06:32:59] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), false, false]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-06a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06a-LTLCardinality-08 finished in 11732 ms.
All properties solved by simple procedures.
Total runtime 17306 ms.
ITS solved all properties within timeout

BK_STOP 1717223579844

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML

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="DLCround-PT-06a"
export BK_EXAMINATION="LTLCardinality"
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 DLCround-PT-06a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r484-smll-171624275400163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-06a.tgz
mv DLCround-PT-06a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;