fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r496-tall-171640603000259
Last Updated
July 7, 2024

About the Execution of LTSMin+red for FunctionPointer-PT-b064

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
779.647 109921.00 140549.00 346.50 FFTFFFFTFFTTFFFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r496-tall-171640603000259.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 FunctionPointer-PT-b064, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603000259
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 896K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 15:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 11 15:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 391K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717189538156

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b064
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:05:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 21:05:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:05:39] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2024-05-31 21:05:39] [INFO ] Transformed 306 places.
[2024-05-31 21:05:39] [INFO ] Transformed 840 transitions.
[2024-05-31 21:05:39] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b064-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 212 transition count 648
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 36 place count 186 transition count 490
Iterating global reduction 1 with 26 rules applied. Total rules applied 62 place count 186 transition count 490
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 86 place count 186 transition count 466
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 101 place count 171 transition count 436
Iterating global reduction 2 with 15 rules applied. Total rules applied 116 place count 171 transition count 436
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 120 place count 171 transition count 432
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 126 place count 165 transition count 420
Iterating global reduction 3 with 6 rules applied. Total rules applied 132 place count 165 transition count 420
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 137 place count 160 transition count 400
Iterating global reduction 3 with 5 rules applied. Total rules applied 142 place count 160 transition count 400
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 146 place count 156 transition count 392
Iterating global reduction 3 with 4 rules applied. Total rules applied 150 place count 156 transition count 392
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 154 place count 152 transition count 376
Iterating global reduction 3 with 4 rules applied. Total rules applied 158 place count 152 transition count 376
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 162 place count 148 transition count 360
Iterating global reduction 3 with 4 rules applied. Total rules applied 166 place count 148 transition count 360
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 170 place count 144 transition count 352
Iterating global reduction 3 with 4 rules applied. Total rules applied 174 place count 144 transition count 352
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 176 place count 142 transition count 348
Iterating global reduction 3 with 2 rules applied. Total rules applied 178 place count 142 transition count 348
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 180 place count 140 transition count 344
Iterating global reduction 3 with 2 rules applied. Total rules applied 182 place count 140 transition count 344
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 184 place count 138 transition count 340
Iterating global reduction 3 with 2 rules applied. Total rules applied 186 place count 138 transition count 340
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 188 place count 136 transition count 336
Iterating global reduction 3 with 2 rules applied. Total rules applied 190 place count 136 transition count 336
Applied a total of 190 rules in 102 ms. Remains 136 /222 variables (removed 86) and now considering 336/648 (removed 312) transitions.
[2024-05-31 21:05:39] [INFO ] Flow matrix only has 230 transitions (discarded 106 similar events)
// Phase 1: matrix 230 rows 136 cols
[2024-05-31 21:05:39] [INFO ] Computed 2 invariants in 17 ms
[2024-05-31 21:05:40] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-05-31 21:05:40] [INFO ] Flow matrix only has 230 transitions (discarded 106 similar events)
[2024-05-31 21:05:40] [INFO ] Invariant cache hit.
[2024-05-31 21:05:40] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-31 21:05:40] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
Running 334 sub problems to find dead transitions.
[2024-05-31 21:05:40] [INFO ] Flow matrix only has 230 transitions (discarded 106 similar events)
[2024-05-31 21:05:40] [INFO ] Invariant cache hit.
[2024-05-31 21:05:40] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (OVERLAPS) 230/366 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 53/191 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 334 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/366 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 334 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 191 constraints, problems are : Problem set: 0 solved, 334 unsolved in 10692 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (OVERLAPS) 230/366 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 53/191 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 334/525 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 7 (OVERLAPS) 0/366 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 334 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 525 constraints, problems are : Problem set: 0 solved, 334 unsolved in 11942 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 0/0 constraints]
After SMT, in 23139ms problems are : Problem set: 0 solved, 334 unsolved
Search for dead transitions found 0 dead transitions in 23156ms
Starting structural reductions in LTL mode, iteration 1 : 136/222 places, 336/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23845 ms. Remains : 136/222 places, 336/648 transitions.
Support contains 14 out of 136 places after structural reductions.
[2024-05-31 21:06:03] [INFO ] Flatten gal took : 47 ms
[2024-05-31 21:06:03] [INFO ] Flatten gal took : 23 ms
[2024-05-31 21:06:03] [INFO ] Input system was already deterministic with 336 transitions.
Support contains 13 out of 136 places (down from 14) after GAL structural reductions.
RANDOM walk for 40044 steps (32 resets) in 798 ms. (50 steps per ms) remains 3/10 properties
BEST_FIRST walk for 40004 steps (20 resets) in 106 ms. (373 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (18 resets) in 112 ms. (354 steps per ms) remains 2/3 properties
[2024-05-31 21:06:04] [INFO ] Flow matrix only has 230 transitions (discarded 106 similar events)
[2024-05-31 21:06:04] [INFO ] Invariant cache hit.
[2024-05-31 21:06:04] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 14/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 64/80 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 183/263 variables, 60/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 36/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 16/279 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/279 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Real declared 352/366 variables, and 173 constraints, problems are : Problem set: 2 solved, 0 unsolved in 123 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/136 constraints, ReadFeed: 44/53 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 130ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA FunctionPointer-PT-b064-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 7 simplifications.
FORMULA FunctionPointer-PT-b064-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 24 stabilizing places and 64 stable transitions
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 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 336/336 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 129 transition count 320
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 129 transition count 320
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 129 transition count 316
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 124 transition count 304
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 124 transition count 304
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 119 transition count 288
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 119 transition count 288
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 115 transition count 278
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 115 transition count 278
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 112 transition count 270
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 112 transition count 270
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 55 place count 109 transition count 262
Iterating global reduction 1 with 3 rules applied. Total rules applied 58 place count 109 transition count 262
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 61 place count 106 transition count 256
Iterating global reduction 1 with 3 rules applied. Total rules applied 64 place count 106 transition count 256
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 67 place count 103 transition count 250
Iterating global reduction 1 with 3 rules applied. Total rules applied 70 place count 103 transition count 250
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 101 transition count 246
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 101 transition count 246
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 100 transition count 244
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 100 transition count 244
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 78 place count 100 transition count 242
Applied a total of 78 rules in 69 ms. Remains 100 /136 variables (removed 36) and now considering 242/336 (removed 94) transitions.
[2024-05-31 21:06:04] [INFO ] Flow matrix only has 166 transitions (discarded 76 similar events)
// Phase 1: matrix 166 rows 100 cols
[2024-05-31 21:06:04] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:06:04] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-31 21:06:04] [INFO ] Flow matrix only has 166 transitions (discarded 76 similar events)
[2024-05-31 21:06:04] [INFO ] Invariant cache hit.
[2024-05-31 21:06:04] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-31 21:06:04] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2024-05-31 21:06:04] [INFO ] Redundant transitions in 10 ms returned []
Running 240 sub problems to find dead transitions.
[2024-05-31 21:06:04] [INFO ] Flow matrix only has 166 transitions (discarded 76 similar events)
[2024-05-31 21:06:04] [INFO ] Invariant cache hit.
[2024-05-31 21:06:04] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 166/266 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 41/143 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 240 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/266 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 143 constraints, problems are : Problem set: 0 solved, 240 unsolved in 5750 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 166/266 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 41/143 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 240/383 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (OVERLAPS) 0/266 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 383 constraints, problems are : Problem set: 0 solved, 240 unsolved in 6451 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints]
After SMT, in 12431ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 12434ms
Starting structural reductions in SI_LTL mode, iteration 1 : 100/136 places, 242/336 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12737 ms. Remains : 100/136 places, 242/336 transitions.
Stuttering acceptance computed with spot in 218 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b064-LTLCardinality-03
Stuttering criterion allowed to conclude after 3461 steps with 37 reset in 22 ms.
FORMULA FunctionPointer-PT-b064-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLCardinality-03 finished in 13034 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 336/336 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 129 transition count 320
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 129 transition count 320
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 20 place count 129 transition count 314
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 125 transition count 304
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 125 transition count 304
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 121 transition count 290
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 121 transition count 290
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 117 transition count 280
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 117 transition count 280
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 114 transition count 272
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 place count 114 transition count 272
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 53 place count 111 transition count 264
Iterating global reduction 1 with 3 rules applied. Total rules applied 56 place count 111 transition count 264
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 108 transition count 258
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 108 transition count 258
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 65 place count 105 transition count 252
Iterating global reduction 1 with 3 rules applied. Total rules applied 68 place count 105 transition count 252
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 103 transition count 248
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 103 transition count 248
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 102 transition count 246
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 102 transition count 246
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 101 transition count 244
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 101 transition count 244
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 78 place count 101 transition count 242
Applied a total of 78 rules in 56 ms. Remains 101 /136 variables (removed 35) and now considering 242/336 (removed 94) transitions.
[2024-05-31 21:06:17] [INFO ] Flow matrix only has 165 transitions (discarded 77 similar events)
// Phase 1: matrix 165 rows 101 cols
[2024-05-31 21:06:17] [INFO ] Computed 2 invariants in 5 ms
[2024-05-31 21:06:17] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-31 21:06:17] [INFO ] Flow matrix only has 165 transitions (discarded 77 similar events)
[2024-05-31 21:06:17] [INFO ] Invariant cache hit.
[2024-05-31 21:06:17] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 21:06:17] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
[2024-05-31 21:06:17] [INFO ] Redundant transitions in 8 ms returned []
Running 240 sub problems to find dead transitions.
[2024-05-31 21:06:17] [INFO ] Flow matrix only has 165 transitions (discarded 77 similar events)
[2024-05-31 21:06:17] [INFO ] Invariant cache hit.
[2024-05-31 21:06:17] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 165/266 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 40/143 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (OVERLAPS) 0/266 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 143 constraints, problems are : Problem set: 0 solved, 240 unsolved in 5418 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 165/266 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 40/143 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 240/383 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (OVERLAPS) 0/266 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 383 constraints, problems are : Problem set: 0 solved, 240 unsolved in 6774 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints]
After SMT, in 12371ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 12373ms
Starting structural reductions in SI_LTL mode, iteration 1 : 101/136 places, 242/336 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12808 ms. Remains : 101/136 places, 242/336 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b064-LTLCardinality-04
Stuttering criterion allowed to conclude after 1257 steps with 13 reset in 8 ms.
FORMULA FunctionPointer-PT-b064-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLCardinality-04 finished in 12866 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' '!(X(X(G(p0))))'
Support contains 1 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 336/336 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 128 transition count 318
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 128 transition count 318
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 22 place count 128 transition count 312
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 27 place count 123 transition count 300
Iterating global reduction 1 with 5 rules applied. Total rules applied 32 place count 123 transition count 300
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 118 transition count 284
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 118 transition count 284
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 113 transition count 272
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 113 transition count 272
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 55 place count 110 transition count 264
Iterating global reduction 1 with 3 rules applied. Total rules applied 58 place count 110 transition count 264
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 61 place count 107 transition count 256
Iterating global reduction 1 with 3 rules applied. Total rules applied 64 place count 107 transition count 256
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 67 place count 104 transition count 250
Iterating global reduction 1 with 3 rules applied. Total rules applied 70 place count 104 transition count 250
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 73 place count 101 transition count 244
Iterating global reduction 1 with 3 rules applied. Total rules applied 76 place count 101 transition count 244
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 78 place count 99 transition count 240
Iterating global reduction 1 with 2 rules applied. Total rules applied 80 place count 99 transition count 240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 98 transition count 238
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 98 transition count 238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 97 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 97 transition count 236
Applied a total of 84 rules in 13 ms. Remains 97 /136 variables (removed 39) and now considering 236/336 (removed 100) transitions.
[2024-05-31 21:06:30] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
// Phase 1: matrix 159 rows 97 cols
[2024-05-31 21:06:30] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:06:30] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-31 21:06:30] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2024-05-31 21:06:30] [INFO ] Invariant cache hit.
[2024-05-31 21:06:30] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 21:06:30] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2024-05-31 21:06:30] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2024-05-31 21:06:30] [INFO ] Invariant cache hit.
[2024-05-31 21:06:30] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 159/256 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (OVERLAPS) 0/256 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 136 constraints, problems are : Problem set: 0 solved, 234 unsolved in 5712 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 159/256 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 234/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (OVERLAPS) 0/256 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 370 constraints, problems are : Problem set: 0 solved, 234 unsolved in 9467 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
After SMT, in 15328ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 15331ms
Starting structural reductions in LTL mode, iteration 1 : 97/136 places, 236/336 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15545 ms. Remains : 97/136 places, 236/336 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b064-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 13506 steps with 144 reset in 146 ms.
FORMULA FunctionPointer-PT-b064-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLCardinality-05 finished in 15832 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' '!(X((F(G(p0))||G(p1))))'
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 336/336 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 130 transition count 322
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 130 transition count 322
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 130 transition count 318
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 20 place count 126 transition count 308
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 126 transition count 308
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 122 transition count 294
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 122 transition count 294
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 118 transition count 284
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 118 transition count 284
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 115 transition count 276
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 115 transition count 276
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 112 transition count 268
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 112 transition count 268
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 55 place count 109 transition count 262
Iterating global reduction 1 with 3 rules applied. Total rules applied 58 place count 109 transition count 262
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 61 place count 106 transition count 256
Iterating global reduction 1 with 3 rules applied. Total rules applied 64 place count 106 transition count 256
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 105 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 105 transition count 254
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 104 transition count 252
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 104 transition count 252
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 103 transition count 250
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 103 transition count 250
Applied a total of 70 rules in 13 ms. Remains 103 /136 variables (removed 33) and now considering 250/336 (removed 86) transitions.
[2024-05-31 21:06:46] [INFO ] Flow matrix only has 171 transitions (discarded 79 similar events)
// Phase 1: matrix 171 rows 103 cols
[2024-05-31 21:06:46] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:06:46] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-31 21:06:46] [INFO ] Flow matrix only has 171 transitions (discarded 79 similar events)
[2024-05-31 21:06:46] [INFO ] Invariant cache hit.
[2024-05-31 21:06:46] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-31 21:06:46] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Running 248 sub problems to find dead transitions.
[2024-05-31 21:06:46] [INFO ] Flow matrix only has 171 transitions (discarded 79 similar events)
[2024-05-31 21:06:46] [INFO ] Invariant cache hit.
[2024-05-31 21:06:46] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (OVERLAPS) 171/274 variables, 103/105 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 42/147 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 248 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/274 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 147 constraints, problems are : Problem set: 0 solved, 248 unsolved in 5922 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (OVERLAPS) 171/274 variables, 103/105 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 42/147 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 248/395 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (OVERLAPS) 0/274 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 395 constraints, problems are : Problem set: 0 solved, 248 unsolved in 7529 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints]
After SMT, in 13636ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 13639ms
Starting structural reductions in LTL mode, iteration 1 : 103/136 places, 250/336 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13887 ms. Remains : 103/136 places, 250/336 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b064-LTLCardinality-06
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b064-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLCardinality-06 finished in 14048 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 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 336/336 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 129 transition count 322
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 129 transition count 322
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 20 place count 129 transition count 316
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 125 transition count 306
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 125 transition count 306
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 121 transition count 294
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 121 transition count 294
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 117 transition count 286
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 117 transition count 286
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 115 transition count 280
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 115 transition count 280
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 113 transition count 274
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 113 transition count 274
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 111 transition count 270
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 111 transition count 270
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 109 transition count 266
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 109 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 108 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 108 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 107 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 107 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 106 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 106 transition count 260
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 70 place count 106 transition count 256
Applied a total of 70 rules in 35 ms. Remains 106 /136 variables (removed 30) and now considering 256/336 (removed 80) transitions.
[2024-05-31 21:07:00] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
// Phase 1: matrix 174 rows 106 cols
[2024-05-31 21:07:00] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:07:00] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-31 21:07:00] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2024-05-31 21:07:00] [INFO ] Invariant cache hit.
[2024-05-31 21:07:00] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 21:07:00] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2024-05-31 21:07:00] [INFO ] Redundant transitions in 3 ms returned []
Running 254 sub problems to find dead transitions.
[2024-05-31 21:07:00] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2024-05-31 21:07:00] [INFO ] Invariant cache hit.
[2024-05-31 21:07:00] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 148 constraints, problems are : Problem set: 0 solved, 254 unsolved in 6154 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 254/402 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (OVERLAPS) 0/280 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 402 constraints, problems are : Problem set: 0 solved, 254 unsolved in 8270 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints]
After SMT, in 14608ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 14611ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/136 places, 256/336 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14857 ms. Remains : 106/136 places, 256/336 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b064-LTLCardinality-08
Stuttering criterion allowed to conclude after 167 steps with 3 reset in 6 ms.
FORMULA FunctionPointer-PT-b064-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLCardinality-08 finished in 14966 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(p0)))))'
Support contains 1 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 336/336 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 129 transition count 320
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 129 transition count 320
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 129 transition count 316
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 124 transition count 304
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 124 transition count 304
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 119 transition count 288
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 119 transition count 288
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 43 place count 114 transition count 276
Iterating global reduction 1 with 5 rules applied. Total rules applied 48 place count 114 transition count 276
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 111 transition count 268
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 111 transition count 268
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 108 transition count 260
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 108 transition count 260
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 105 transition count 254
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 105 transition count 254
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 102 transition count 248
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 102 transition count 248
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 100 transition count 244
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 100 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 99 transition count 242
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 99 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 98 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 98 transition count 240
Applied a total of 80 rules in 10 ms. Remains 98 /136 variables (removed 38) and now considering 240/336 (removed 96) transitions.
[2024-05-31 21:07:15] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
// Phase 1: matrix 161 rows 98 cols
[2024-05-31 21:07:15] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:07:15] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-31 21:07:15] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2024-05-31 21:07:15] [INFO ] Invariant cache hit.
[2024-05-31 21:07:15] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 21:07:15] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2024-05-31 21:07:15] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2024-05-31 21:07:15] [INFO ] Invariant cache hit.
[2024-05-31 21:07:15] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/259 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 137 constraints, problems are : Problem set: 0 solved, 238 unsolved in 5617 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 238/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (OVERLAPS) 0/259 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 375 constraints, problems are : Problem set: 0 solved, 238 unsolved in 6809 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints]
After SMT, in 12601ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 12604ms
Starting structural reductions in LTL mode, iteration 1 : 98/136 places, 240/336 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12827 ms. Remains : 98/136 places, 240/336 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b064-LTLCardinality-12
Stuttering criterion allowed to conclude after 57 steps with 0 reset in 4 ms.
FORMULA FunctionPointer-PT-b064-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLCardinality-12 finished in 12926 ms.
All properties solved by simple procedures.
Total runtime 108764 ms.
ITS solved all properties within timeout

BK_STOP 1717189648077

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-b064"
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 FunctionPointer-PT-b064, 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 r496-tall-171640603000259"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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