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.r532-smll-171683810700067.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 SieveSingleMsgMbox-PT-d1m18, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683810700067
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 820K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Apr 12 19:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 46K Apr 12 19:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 12 19:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 450K 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 SieveSingleMsgMbox-PT-d1m18-LTLCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717243430893

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:03:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 12:03:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:03:53] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2024-06-01 12:03:53] [INFO ] Transformed 1295 places.
[2024-06-01 12:03:53] [INFO ] Transformed 749 transitions.
[2024-06-01 12:03:53] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 368 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1036 places in 13 ms
Reduce places removed 1036 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 242 transition count 509
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 318 place count 181 transition count 232
Iterating global reduction 1 with 61 rules applied. Total rules applied 379 place count 181 transition count 232
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 385 place count 181 transition count 226
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 429 place count 137 transition count 182
Iterating global reduction 2 with 44 rules applied. Total rules applied 473 place count 137 transition count 182
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 488 place count 137 transition count 167
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 514 place count 111 transition count 139
Iterating global reduction 3 with 26 rules applied. Total rules applied 540 place count 111 transition count 139
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 555 place count 111 transition count 124
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 562 place count 104 transition count 114
Iterating global reduction 4 with 7 rules applied. Total rules applied 569 place count 104 transition count 114
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 576 place count 97 transition count 107
Iterating global reduction 4 with 7 rules applied. Total rules applied 583 place count 97 transition count 107
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 587 place count 93 transition count 102
Iterating global reduction 4 with 4 rules applied. Total rules applied 591 place count 93 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 592 place count 93 transition count 101
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 596 place count 89 transition count 97
Iterating global reduction 5 with 4 rules applied. Total rules applied 600 place count 89 transition count 97
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 603 place count 86 transition count 94
Iterating global reduction 5 with 3 rules applied. Total rules applied 606 place count 86 transition count 94
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 607 place count 85 transition count 92
Iterating global reduction 5 with 1 rules applied. Total rules applied 608 place count 85 transition count 92
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 609 place count 84 transition count 91
Iterating global reduction 5 with 1 rules applied. Total rules applied 610 place count 84 transition count 91
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 611 place count 83 transition count 90
Iterating global reduction 5 with 1 rules applied. Total rules applied 612 place count 83 transition count 90
Applied a total of 612 rules in 125 ms. Remains 83 /259 variables (removed 176) and now considering 90/749 (removed 659) transitions.
// Phase 1: matrix 90 rows 83 cols
[2024-06-01 12:03:53] [INFO ] Computed 5 invariants in 16 ms
[2024-06-01 12:03:54] [INFO ] Implicit Places using invariants in 446 ms returned []
[2024-06-01 12:03:54] [INFO ] Invariant cache hit.
[2024-06-01 12:03:54] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-01 12:03:54] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 795 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2024-06-01 12:03:54] [INFO ] Invariant cache hit.
[2024-06-01 12:03:54] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 12:03:56] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 15 ms to minimize.
[2024-06-01 12:03:56] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 90/173 variables, 83/90 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 36/126 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 89 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/173 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 126 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4043 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 90/173 variables, 83/90 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 36/126 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 89/215 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 0/173 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 215 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4294 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 2/2 constraints]
After SMT, in 8609ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 8639ms
Starting structural reductions in LTL mode, iteration 1 : 83/259 places, 90/749 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9587 ms. Remains : 83/259 places, 90/749 transitions.
Support contains 1 out of 83 places after structural reductions.
[2024-06-01 12:04:03] [INFO ] Flatten gal took : 44 ms
[2024-06-01 12:04:03] [INFO ] Flatten gal took : 19 ms
[2024-06-01 12:04:03] [INFO ] Input system was already deterministic with 90 transitions.
RANDOM walk for 40000 steps (8986 resets) in 1138 ms. (35 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (4187 resets) in 182 ms. (218 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3795 steps, run visited all 1 properties in 22 ms. (steps per millisecond=172 )
Probabilistic random walk after 3795 steps, saw 1698 distinct states, run finished after 28 ms. (steps per millisecond=135 ) properties seen :1
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 260 edges and 83 vertex of which 82 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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' '!(G(F(p0)))'
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 90/90 transitions.
Applied a total of 0 rules in 12 ms. Remains 83 /83 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2024-06-01 12:04:03] [INFO ] Invariant cache hit.
[2024-06-01 12:04:04] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-01 12:04:04] [INFO ] Invariant cache hit.
[2024-06-01 12:04:04] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-01 12:04:04] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2024-06-01 12:04:04] [INFO ] Redundant transitions in 2 ms returned []
Running 89 sub problems to find dead transitions.
[2024-06-01 12:04:04] [INFO ] Invariant cache hit.
[2024-06-01 12:04:04] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 12:04:05] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 2 ms to minimize.
[2024-06-01 12:04:05] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 90/173 variables, 83/90 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 36/126 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 89 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/173 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 126 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3501 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 90/173 variables, 83/90 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 36/126 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 89/215 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 0/173 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 215 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4365 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 2/2 constraints]
After SMT, in 8004ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 8007ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8339 ms. Remains : 83/83 places, 90/90 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLCardinality-15
Product exploration explored 100000 steps with 22506 reset in 317 ms.
Product exploration explored 100000 steps with 22470 reset in 247 ms.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 260 edges and 83 vertex of which 82 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8972 resets) in 209 ms. (190 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (4242 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3795 steps, run visited all 1 properties in 23 ms. (steps per millisecond=165 )
Probabilistic random walk after 3795 steps, saw 1698 distinct states, run finished after 23 ms. (steps per millisecond=165 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 90/90 transitions.
Applied a total of 0 rules in 14 ms. Remains 83 /83 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2024-06-01 12:04:13] [INFO ] Invariant cache hit.
[2024-06-01 12:04:13] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-01 12:04:13] [INFO ] Invariant cache hit.
[2024-06-01 12:04:13] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-01 12:04:14] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2024-06-01 12:04:14] [INFO ] Redundant transitions in 2 ms returned []
Running 89 sub problems to find dead transitions.
[2024-06-01 12:04:14] [INFO ] Invariant cache hit.
[2024-06-01 12:04:14] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 12:04:15] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 2 ms to minimize.
[2024-06-01 12:04:15] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 90/173 variables, 83/90 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 36/126 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 89 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/173 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 126 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4049 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 90/173 variables, 83/90 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 36/126 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 89/215 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 0/173 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 215 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4456 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 2/2 constraints]
After SMT, in 8601ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 8608ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8928 ms. Remains : 83/83 places, 90/90 transitions.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 260 edges and 83 vertex of which 82 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9007 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (4145 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3795 steps, run visited all 1 properties in 21 ms. (steps per millisecond=180 )
Probabilistic random walk after 3795 steps, saw 1698 distinct states, run finished after 21 ms. (steps per millisecond=180 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22289 reset in 195 ms.
Product exploration explored 100000 steps with 22522 reset in 305 ms.
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 90/90 transitions.
Applied a total of 0 rules in 11 ms. Remains 83 /83 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2024-06-01 12:04:23] [INFO ] Invariant cache hit.
[2024-06-01 12:04:24] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-06-01 12:04:24] [INFO ] Invariant cache hit.
[2024-06-01 12:04:24] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-01 12:04:24] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2024-06-01 12:04:24] [INFO ] Redundant transitions in 3 ms returned []
Running 89 sub problems to find dead transitions.
[2024-06-01 12:04:24] [INFO ] Invariant cache hit.
[2024-06-01 12:04:24] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 12:04:25] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:04:25] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 90/173 variables, 83/90 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 36/126 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 89 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/173 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 126 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3985 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 90/173 variables, 83/90 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 36/126 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 89/215 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 0/173 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 215 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4041 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 2/2 constraints]
After SMT, in 8154ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 8156ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8713 ms. Remains : 83/83 places, 90/90 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLCardinality-15 finished in 28771 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' '!(G(F(p0)))'
[2024-06-01 12:04:32] [INFO ] Flatten gal took : 11 ms
[2024-06-01 12:04:32] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 12:04:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 83 places, 90 transitions and 357 arcs took 5 ms.
Total runtime 40286 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717243473288

--------------------
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
mcc2024
ltl formula name SieveSingleMsgMbox-PT-d1m18-LTLCardinality-15
ltl formula formula --ltl=/tmp/702/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 83 places, 90 transitions and 357 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/702/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/702/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/702/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/702/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 85 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 84, there are 93 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~60!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 542
pnml2lts-mc( 0/ 4): unique states count: 687
pnml2lts-mc( 0/ 4): unique transitions count: 1455
pnml2lts-mc( 0/ 4): - self-loop count: 490
pnml2lts-mc( 0/ 4): - claim dead count: 82
pnml2lts-mc( 0/ 4): - claim found count: 2
pnml2lts-mc( 0/ 4): - claim success count: 757
pnml2lts-mc( 0/ 4): - cum. max stack depth: 216
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 757 states 1686 transitions, fanout: 2.227
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 75700, Transitions per second: 168600
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 17.2 B/state, compr.: 5.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 90 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

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="SieveSingleMsgMbox-PT-d1m18"
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 SieveSingleMsgMbox-PT-d1m18, 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 r532-smll-171683810700067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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