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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 12 19:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 12 19:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Apr 12 19:12 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 57K 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-d0m04-LTLCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717241442743

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-d0m04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:30:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 11:30:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:30:45] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2024-06-01 11:30:45] [INFO ] Transformed 262 places.
[2024-06-01 11:30:45] [INFO ] Transformed 73 transitions.
[2024-06-01 11:30:45] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 377 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 190 places in 3 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 73/73 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 73
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 62 transition count 65
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 61 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 60 transition count 63
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 60 transition count 62
Applied a total of 23 rules in 152 ms. Remains 60 /72 variables (removed 12) and now considering 62/73 (removed 11) transitions.
// Phase 1: matrix 62 rows 60 cols
[2024-06-01 11:30:46] [INFO ] Computed 5 invariants in 23 ms
[2024-06-01 11:30:46] [INFO ] Implicit Places using invariants in 424 ms returned []
[2024-06-01 11:30:46] [INFO ] Invariant cache hit.
[2024-06-01 11:30:47] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-06-01 11:30:47] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 805 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2024-06-01 11:30:47] [INFO ] Invariant cache hit.
[2024-06-01 11:30:47] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-06-01 11:30:48] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 18 ms to minimize.
[2024-06-01 11:30:48] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 3 ms to minimize.
[2024-06-01 11:30:49] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2024-06-01 11:30:49] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 2 ms to minimize.
[2024-06-01 11:30:49] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/70 constraints. Problems are: Problem set: 5 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 26/96 constraints. Problems are: Problem set: 5 solved, 56 unsolved
[2024-06-01 11:30:50] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 2 ms to minimize.
[2024-06-01 11:30:50] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
[2024-06-01 11:30:50] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 3/99 constraints. Problems are: Problem set: 5 solved, 56 unsolved
[2024-06-01 11:30:51] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 1/100 constraints. Problems are: Problem set: 5 solved, 56 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/100 constraints. Problems are: Problem set: 5 solved, 56 unsolved
[2024-06-01 11:30:52] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 2 ms to minimize.
[2024-06-01 11:30:52] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/122 variables, 2/102 constraints. Problems are: Problem set: 5 solved, 56 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 0/102 constraints. Problems are: Problem set: 5 solved, 56 unsolved
At refinement iteration 13 (OVERLAPS) 0/122 variables, 0/102 constraints. Problems are: Problem set: 5 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 102 constraints, problems are : Problem set: 5 solved, 56 unsolved in 6392 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 5 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 2/3 constraints. Problems are: Problem set: 5 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/5 constraints. Problems are: Problem set: 5 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 5 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 1/53 variables, 1/6 constraints. Problems are: Problem set: 5 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/6 constraints. Problems are: Problem set: 5 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 4/57 variables, 1/7 constraints. Problems are: Problem set: 5 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 3/10 constraints. Problems are: Problem set: 5 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/10 constraints. Problems are: Problem set: 5 solved, 56 unsolved
At refinement iteration 9 (OVERLAPS) 62/119 variables, 57/67 constraints. Problems are: Problem set: 5 solved, 56 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 26/93 constraints. Problems are: Problem set: 5 solved, 56 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 8/101 constraints. Problems are: Problem set: 5 solved, 56 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/119 variables, 0/101 constraints. Problems are: Problem set: 5 solved, 56 unsolved
At refinement iteration 13 (OVERLAPS) 3/122 variables, 3/104 constraints. Problems are: Problem set: 5 solved, 56 unsolved
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/122 variables, 48/152 constraints. Problems are: Problem set: 7 solved, 54 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/122 variables, 6/158 constraints. Problems are: Problem set: 7 solved, 54 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/122 variables, 0/158 constraints. Problems are: Problem set: 7 solved, 54 unsolved
At refinement iteration 17 (OVERLAPS) 0/122 variables, 0/158 constraints. Problems are: Problem set: 7 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 158 constraints, problems are : Problem set: 7 solved, 54 unsolved in 4029 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 56/61 constraints, Known Traps: 11/11 constraints]
After SMT, in 10693ms problems are : Problem set: 7 solved, 54 unsolved
Search for dead transitions found 7 dead transitions in 10721ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in LTL mode, iteration 1 : 60/72 places, 55/73 transitions.
Reduce places removed 10 places and 8 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 50 transition count 46
Reduce places removed 3 places and 5 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 14 place count 47 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 46 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 16 place count 45 transition count 40
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 16 rules in 7 ms. Remains 45 /60 variables (removed 15) and now considering 40/55 (removed 15) transitions.
// Phase 1: matrix 40 rows 45 cols
[2024-06-01 11:30:57] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 11:30:58] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-01 11:30:58] [INFO ] Invariant cache hit.
[2024-06-01 11:30:58] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 11:30:58] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 45/72 places, 40/73 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11978 ms. Remains : 45/72 places, 40/73 transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Support contains 4 out of 42 places after structural reductions.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 11:30:58] [INFO ] Flatten gal took : 46 ms
[2024-06-01 11:30:58] [INFO ] Flatten gal took : 20 ms
[2024-06-01 11:30:58] [INFO ] Input system was already deterministic with 40 transitions.
RANDOM walk for 40000 steps (9017 resets) in 2077 ms. (19 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1881 resets) in 394 ms. (101 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (4178 resets) in 210 ms. (189 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (4693 resets) in 136 ms. (291 steps per ms) remains 3/3 properties
// Phase 1: matrix 40 rows 42 cols
[2024-06-01 11:30:59] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 11:30:59] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 1 (OVERLAPS) 32/35 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 38/73 variables, 35/38 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 14/52 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
After SMT solving in domain Real declared 82/82 variables, and 59 constraints, problems are : Problem set: 3 solved, 0 unsolved in 98 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 42/42 constraints, ReadFeed: 14/16 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 110ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 4 simplifications.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 8 stabilizing places and 12 stable transitions
Graph (complete) has 120 edges and 42 vertex of which 41 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 40/40 transitions.
Graph (complete) has 120 edges and 42 vertex of which 41 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 41 /42 variables (removed 1) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 41 cols
[2024-06-01 11:30:59] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 11:31:00] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 11:31:00] [INFO ] Invariant cache hit.
[2024-06-01 11:31:00] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 11:31:00] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-06-01 11:31:00] [INFO ] Redundant transitions in 1 ms returned []
Running 39 sub problems to find dead transitions.
[2024-06-01 11:31:00] [INFO ] Invariant cache hit.
[2024-06-01 11:31:00] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 40/81 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 60 constraints, problems are : Problem set: 0 solved, 39 unsolved in 952 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 40/81 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 39/99 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 0/81 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 99 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1132 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints]
After SMT, in 2124ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 2125ms
Starting structural reductions in SI_LTL mode, iteration 1 : 41/42 places, 40/40 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2363 ms. Remains : 41/42 places, 40/40 transitions.
Stuttering acceptance computed with spot in 288 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m04-LTLCardinality-08
Product exploration explored 100000 steps with 22350 reset in 389 ms.
Product exploration explored 100000 steps with 22377 reset in 208 ms.
Computed a total of 8 stabilizing places and 13 stable transitions
Computed a total of 8 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 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 104 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9016 resets) in 117 ms. (338 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (4151 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 135 steps, run visited all 1 properties in 12 ms. (steps per millisecond=11 )
Probabilistic random walk after 135 steps, saw 80 distinct states, run finished after 19 ms. (steps per millisecond=7 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 160 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 90 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 40/40 transitions.
Applied a total of 0 rules in 4 ms. Remains 41 /41 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2024-06-01 11:31:03] [INFO ] Invariant cache hit.
[2024-06-01 11:31:03] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 11:31:03] [INFO ] Invariant cache hit.
[2024-06-01 11:31:03] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 11:31:03] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2024-06-01 11:31:04] [INFO ] Redundant transitions in 0 ms returned []
Running 39 sub problems to find dead transitions.
[2024-06-01 11:31:04] [INFO ] Invariant cache hit.
[2024-06-01 11:31:04] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 40/81 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 60 constraints, problems are : Problem set: 0 solved, 39 unsolved in 761 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 40/81 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 39/99 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 0/81 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 99 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1123 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints]
After SMT, in 1923ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1924ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2088 ms. Remains : 41/41 places, 40/40 transitions.
Computed a total of 8 stabilizing places and 13 stable transitions
Computed a total of 8 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 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 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8923 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (4146 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 135 steps, run visited all 1 properties in 6 ms. (steps per millisecond=22 )
Probabilistic random walk after 135 steps, saw 80 distinct states, run finished after 6 ms. (steps per millisecond=22 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 122 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 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22295 reset in 141 ms.
Product exploration explored 100000 steps with 22259 reset in 253 ms.
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 40/40 transitions.
Applied a total of 0 rules in 7 ms. Remains 41 /41 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2024-06-01 11:31:06] [INFO ] Invariant cache hit.
[2024-06-01 11:31:07] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-01 11:31:07] [INFO ] Invariant cache hit.
[2024-06-01 11:31:07] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 11:31:07] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2024-06-01 11:31:07] [INFO ] Redundant transitions in 0 ms returned []
Running 39 sub problems to find dead transitions.
[2024-06-01 11:31:07] [INFO ] Invariant cache hit.
[2024-06-01 11:31:07] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 40/81 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 60 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1129 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 40/81 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 39/99 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 0/81 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 99 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1662 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints]
After SMT, in 2827ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 2830ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3073 ms. Remains : 41/41 places, 40/40 transitions.
Treatment of property SieveSingleMsgMbox-PT-d0m04-LTLCardinality-08 finished in 10272 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 11:31:10] [INFO ] Flatten gal took : 13 ms
[2024-06-01 11:31:10] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-06-01 11:31:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 42 places, 40 transitions and 156 arcs took 7 ms.
Total runtime 25083 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717241470944

--------------------
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-d0m04-LTLCardinality-08
ltl formula formula --ltl=/tmp/720/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 42 places, 40 transitions and 156 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/720/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/720/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/720/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/720/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 43 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 43, there are 43 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( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~22!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 109
pnml2lts-mc( 0/ 4): unique states count: 182
pnml2lts-mc( 0/ 4): unique transitions count: 386
pnml2lts-mc( 0/ 4): - self-loop count: 90
pnml2lts-mc( 0/ 4): - claim dead count: 18
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 215
pnml2lts-mc( 0/ 4): - cum. max stack depth: 104
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 215 states 479 transitions, fanout: 2.228
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
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, 16.7 B/state, compr.: 9.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 40 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-d0m04"
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-d0m04, 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-171683810500003"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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