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.r464-smll-171620118400347.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 Anderson-PT-08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620118400347
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 15:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 15:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 15:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 667K 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 Anderson-PT-08-LTLCardinality-00
FORMULA_NAME Anderson-PT-08-LTLCardinality-01
FORMULA_NAME Anderson-PT-08-LTLCardinality-02
FORMULA_NAME Anderson-PT-08-LTLCardinality-03
FORMULA_NAME Anderson-PT-08-LTLCardinality-04
FORMULA_NAME Anderson-PT-08-LTLCardinality-05
FORMULA_NAME Anderson-PT-08-LTLCardinality-06
FORMULA_NAME Anderson-PT-08-LTLCardinality-07
FORMULA_NAME Anderson-PT-08-LTLCardinality-08
FORMULA_NAME Anderson-PT-08-LTLCardinality-09
FORMULA_NAME Anderson-PT-08-LTLCardinality-10
FORMULA_NAME Anderson-PT-08-LTLCardinality-11
FORMULA_NAME Anderson-PT-08-LTLCardinality-12
FORMULA_NAME Anderson-PT-08-LTLCardinality-13
FORMULA_NAME Anderson-PT-08-LTLCardinality-14
FORMULA_NAME Anderson-PT-08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717257017524

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:50:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 15:50:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:50:19] [INFO ] Load time of PNML (sax parser for PT used): 231 ms
[2024-06-01 15:50:19] [INFO ] Transformed 401 places.
[2024-06-01 15:50:19] [INFO ] Transformed 1328 transitions.
[2024-06-01 15:50:19] [INFO ] Found NUPN structural information;
[2024-06-01 15:50:19] [INFO ] Parsed PT model containing 401 places and 1328 transitions and 5088 arcs in 403 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 4 formulas.
FORMULA Anderson-PT-08-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 1328/1328 transitions.
Discarding 101 places :
Symmetric choice reduction at 0 with 101 rule applications. Total rules 101 place count 300 transition count 499
Iterating global reduction 0 with 101 rules applied. Total rules applied 202 place count 300 transition count 499
Applied a total of 202 rules in 123 ms. Remains 300 /401 variables (removed 101) and now considering 499/1328 (removed 829) transitions.
// Phase 1: matrix 499 rows 300 cols
[2024-06-01 15:50:20] [INFO ] Computed 19 invariants in 50 ms
[2024-06-01 15:50:20] [INFO ] Implicit Places using invariants in 797 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 843 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 299/401 places, 499/1328 transitions.
Applied a total of 0 rules in 12 ms. Remains 299 /299 variables (removed 0) and now considering 499/499 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1007 ms. Remains : 299/401 places, 499/1328 transitions.
Support contains 20 out of 299 places after structural reductions.
[2024-06-01 15:50:21] [INFO ] Flatten gal took : 110 ms
[2024-06-01 15:50:21] [INFO ] Flatten gal took : 58 ms
[2024-06-01 15:50:21] [INFO ] Input system was already deterministic with 499 transitions.
Support contains 18 out of 299 places (down from 20) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2112 ms. (18 steps per ms) remains 0/11 properties
FORMULA Anderson-PT-08-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Anderson-PT-08-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Anderson-PT-08-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 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' '!(X((F(p0)&&X(X(p1)))))'
Support contains 3 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 499/499 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 290 transition count 448
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 290 transition count 448
Applied a total of 18 rules in 30 ms. Remains 290 /299 variables (removed 9) and now considering 448/499 (removed 51) transitions.
// Phase 1: matrix 448 rows 290 cols
[2024-06-01 15:50:22] [INFO ] Computed 18 invariants in 8 ms
[2024-06-01 15:50:22] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-06-01 15:50:22] [INFO ] Invariant cache hit.
[2024-06-01 15:50:23] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-01 15:50:24] [INFO ] Implicit Places using invariants and state equation in 1368 ms returned []
Implicit Place search using SMT with State Equation took 1759 ms to find 0 implicit places.
Running 440 sub problems to find dead transitions.
[2024-06-01 15:50:24] [INFO ] Invariant cache hit.
[2024-06-01 15:50:24] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/290 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-06-01 15:50:30] [INFO ] Deduced a trap composed of 100 places in 357 ms of which 46 ms to minimize.
[2024-06-01 15:50:32] [INFO ] Deduced a trap composed of 179 places in 235 ms of which 4 ms to minimize.
[2024-06-01 15:50:32] [INFO ] Deduced a trap composed of 89 places in 202 ms of which 4 ms to minimize.
[2024-06-01 15:50:32] [INFO ] Deduced a trap composed of 108 places in 216 ms of which 4 ms to minimize.
[2024-06-01 15:50:32] [INFO ] Deduced a trap composed of 71 places in 178 ms of which 4 ms to minimize.
[2024-06-01 15:50:33] [INFO ] Deduced a trap composed of 136 places in 175 ms of which 4 ms to minimize.
[2024-06-01 15:50:33] [INFO ] Deduced a trap composed of 116 places in 245 ms of which 4 ms to minimize.
[2024-06-01 15:50:33] [INFO ] Deduced a trap composed of 97 places in 273 ms of which 5 ms to minimize.
[2024-06-01 15:50:34] [INFO ] Deduced a trap composed of 153 places in 357 ms of which 5 ms to minimize.
[2024-06-01 15:50:34] [INFO ] Deduced a trap composed of 113 places in 252 ms of which 5 ms to minimize.
[2024-06-01 15:50:34] [INFO ] Deduced a trap composed of 79 places in 281 ms of which 5 ms to minimize.
[2024-06-01 15:50:34] [INFO ] Deduced a trap composed of 85 places in 341 ms of which 5 ms to minimize.
[2024-06-01 15:50:35] [INFO ] Deduced a trap composed of 96 places in 338 ms of which 5 ms to minimize.
[2024-06-01 15:50:35] [INFO ] Deduced a trap composed of 152 places in 271 ms of which 5 ms to minimize.
[2024-06-01 15:50:35] [INFO ] Deduced a trap composed of 173 places in 303 ms of which 4 ms to minimize.
[2024-06-01 15:50:36] [INFO ] Deduced a trap composed of 169 places in 347 ms of which 5 ms to minimize.
[2024-06-01 15:50:36] [INFO ] Deduced a trap composed of 147 places in 330 ms of which 5 ms to minimize.
[2024-06-01 15:50:37] [INFO ] Deduced a trap composed of 156 places in 332 ms of which 5 ms to minimize.
[2024-06-01 15:50:37] [INFO ] Deduced a trap composed of 127 places in 332 ms of which 5 ms to minimize.
[2024-06-01 15:50:37] [INFO ] Deduced a trap composed of 199 places in 347 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-06-01 15:50:38] [INFO ] Deduced a trap composed of 80 places in 320 ms of which 5 ms to minimize.
[2024-06-01 15:50:43] [INFO ] Deduced a trap composed of 147 places in 326 ms of which 14 ms to minimize.
[2024-06-01 15:50:43] [INFO ] Deduced a trap composed of 49 places in 318 ms of which 5 ms to minimize.
[2024-06-01 15:50:43] [INFO ] Deduced a trap composed of 57 places in 336 ms of which 5 ms to minimize.
[2024-06-01 15:50:45] [INFO ] Deduced a trap composed of 99 places in 324 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-06-01 15:50:51] [INFO ] Deduced a trap composed of 133 places in 331 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 290/738 variables, and 44 constraints, problems are : Problem set: 0 solved, 440 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/290 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 440/440 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 440 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/290 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 26/44 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-06-01 15:50:57] [INFO ] Deduced a trap composed of 52 places in 299 ms of which 5 ms to minimize.
[2024-06-01 15:50:59] [INFO ] Deduced a trap composed of 143 places in 348 ms of which 5 ms to minimize.
[2024-06-01 15:50:59] [INFO ] Deduced a trap composed of 89 places in 359 ms of which 5 ms to minimize.
[2024-06-01 15:50:59] [INFO ] Deduced a trap composed of 102 places in 301 ms of which 5 ms to minimize.
[2024-06-01 15:51:00] [INFO ] Deduced a trap composed of 127 places in 325 ms of which 4 ms to minimize.
[2024-06-01 15:51:00] [INFO ] Deduced a trap composed of 153 places in 251 ms of which 4 ms to minimize.
[2024-06-01 15:51:00] [INFO ] Deduced a trap composed of 117 places in 231 ms of which 6 ms to minimize.
[2024-06-01 15:51:01] [INFO ] Deduced a trap composed of 100 places in 346 ms of which 7 ms to minimize.
[2024-06-01 15:51:01] [INFO ] Deduced a trap composed of 103 places in 339 ms of which 7 ms to minimize.
[2024-06-01 15:51:01] [INFO ] Deduced a trap composed of 107 places in 291 ms of which 4 ms to minimize.
[2024-06-01 15:51:02] [INFO ] Deduced a trap composed of 125 places in 299 ms of which 3 ms to minimize.
[2024-06-01 15:51:02] [INFO ] Deduced a trap composed of 86 places in 254 ms of which 5 ms to minimize.
[2024-06-01 15:51:03] [INFO ] Deduced a trap composed of 114 places in 371 ms of which 5 ms to minimize.
[2024-06-01 15:51:03] [INFO ] Deduced a trap composed of 115 places in 367 ms of which 5 ms to minimize.
[2024-06-01 15:51:03] [INFO ] Deduced a trap composed of 104 places in 343 ms of which 5 ms to minimize.
[2024-06-01 15:51:04] [INFO ] Deduced a trap composed of 164 places in 344 ms of which 5 ms to minimize.
[2024-06-01 15:51:04] [INFO ] Deduced a trap composed of 100 places in 351 ms of which 5 ms to minimize.
[2024-06-01 15:51:06] [INFO ] Deduced a trap composed of 137 places in 325 ms of which 5 ms to minimize.
[2024-06-01 15:51:06] [INFO ] Deduced a trap composed of 103 places in 344 ms of which 5 ms to minimize.
[2024-06-01 15:51:06] [INFO ] Deduced a trap composed of 117 places in 336 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-06-01 15:51:10] [INFO ] Deduced a trap composed of 85 places in 354 ms of which 5 ms to minimize.
[2024-06-01 15:51:11] [INFO ] Deduced a trap composed of 125 places in 332 ms of which 5 ms to minimize.
[2024-06-01 15:51:11] [INFO ] Deduced a trap composed of 155 places in 317 ms of which 5 ms to minimize.
[2024-06-01 15:51:11] [INFO ] Deduced a trap composed of 131 places in 302 ms of which 5 ms to minimize.
[2024-06-01 15:51:12] [INFO ] Deduced a trap composed of 106 places in 351 ms of which 7 ms to minimize.
[2024-06-01 15:51:12] [INFO ] Deduced a trap composed of 92 places in 349 ms of which 5 ms to minimize.
[2024-06-01 15:51:12] [INFO ] Deduced a trap composed of 89 places in 336 ms of which 5 ms to minimize.
[2024-06-01 15:51:13] [INFO ] Deduced a trap composed of 144 places in 319 ms of which 4 ms to minimize.
[2024-06-01 15:51:13] [INFO ] Deduced a trap composed of 82 places in 328 ms of which 6 ms to minimize.
[2024-06-01 15:51:13] [INFO ] Deduced a trap composed of 174 places in 301 ms of which 4 ms to minimize.
[2024-06-01 15:51:14] [INFO ] Deduced a trap composed of 184 places in 300 ms of which 8 ms to minimize.
[2024-06-01 15:51:14] [INFO ] Deduced a trap composed of 76 places in 344 ms of which 5 ms to minimize.
[2024-06-01 15:51:14] [INFO ] Deduced a trap composed of 187 places in 345 ms of which 5 ms to minimize.
[2024-06-01 15:51:15] [INFO ] Deduced a trap composed of 124 places in 366 ms of which 6 ms to minimize.
[2024-06-01 15:51:15] [INFO ] Deduced a trap composed of 112 places in 357 ms of which 5 ms to minimize.
[2024-06-01 15:51:16] [INFO ] Deduced a trap composed of 115 places in 358 ms of which 5 ms to minimize.
[2024-06-01 15:51:16] [INFO ] Deduced a trap composed of 82 places in 338 ms of which 5 ms to minimize.
[2024-06-01 15:51:16] [INFO ] Deduced a trap composed of 129 places in 346 ms of which 5 ms to minimize.
[2024-06-01 15:51:17] [INFO ] Deduced a trap composed of 91 places in 342 ms of which 5 ms to minimize.
[2024-06-01 15:51:17] [INFO ] Deduced a trap composed of 102 places in 343 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-06-01 15:51:19] [INFO ] Deduced a trap composed of 145 places in 265 ms of which 4 ms to minimize.
[2024-06-01 15:51:21] [INFO ] Deduced a trap composed of 108 places in 329 ms of which 5 ms to minimize.
[2024-06-01 15:51:22] [INFO ] Deduced a trap composed of 131 places in 324 ms of which 5 ms to minimize.
[2024-06-01 15:51:22] [INFO ] Deduced a trap composed of 158 places in 327 ms of which 5 ms to minimize.
[2024-06-01 15:51:22] [INFO ] Deduced a trap composed of 169 places in 251 ms of which 4 ms to minimize.
[2024-06-01 15:51:23] [INFO ] Deduced a trap composed of 166 places in 325 ms of which 5 ms to minimize.
[2024-06-01 15:51:23] [INFO ] Deduced a trap composed of 101 places in 326 ms of which 5 ms to minimize.
[2024-06-01 15:51:23] [INFO ] Deduced a trap composed of 90 places in 268 ms of which 5 ms to minimize.
[2024-06-01 15:51:23] [INFO ] Deduced a trap composed of 165 places in 235 ms of which 4 ms to minimize.
[2024-06-01 15:51:24] [INFO ] Deduced a trap composed of 94 places in 342 ms of which 5 ms to minimize.
[2024-06-01 15:51:24] [INFO ] Deduced a trap composed of 90 places in 342 ms of which 5 ms to minimize.
[2024-06-01 15:51:25] [INFO ] Deduced a trap composed of 122 places in 330 ms of which 5 ms to minimize.
SMT process timed out in 60752ms, After SMT, problems are : Problem set: 0 solved, 440 unsolved
Search for dead transitions found 0 dead transitions in 60797ms
Starting structural reductions in LTL mode, iteration 1 : 290/299 places, 448/499 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62612 ms. Remains : 290/299 places, 448/499 transitions.
Stuttering acceptance computed with spot in 556 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : Anderson-PT-08-LTLCardinality-04
Product exploration explored 100000 steps with 98 reset in 603 ms.
Stack based approach found an accepted trace after 65 steps with 2 reset with depth 58 and stack size 58 in 2 ms.
FORMULA Anderson-PT-08-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLCardinality-04 finished in 63864 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 299 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 299/299 places, 499/499 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 299 transition count 435
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 235 transition count 435
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 128 place count 235 transition count 380
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 238 place count 180 transition count 380
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 248 place count 170 transition count 314
Iterating global reduction 2 with 10 rules applied. Total rules applied 258 place count 170 transition count 314
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 260 place count 169 transition count 313
Applied a total of 260 rules in 92 ms. Remains 169 /299 variables (removed 130) and now considering 313/499 (removed 186) transitions.
// Phase 1: matrix 313 rows 169 cols
[2024-06-01 15:51:26] [INFO ] Computed 18 invariants in 6 ms
[2024-06-01 15:51:26] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-06-01 15:51:26] [INFO ] Invariant cache hit.
[2024-06-01 15:51:26] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-01 15:51:27] [INFO ] Implicit Places using invariants and state equation in 954 ms returned []
Implicit Place search using SMT with State Equation took 1294 ms to find 0 implicit places.
[2024-06-01 15:51:27] [INFO ] Redundant transitions in 36 ms returned []
Running 305 sub problems to find dead transitions.
[2024-06-01 15:51:27] [INFO ] Invariant cache hit.
[2024-06-01 15:51:27] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-01 15:51:31] [INFO ] Deduced a trap composed of 65 places in 242 ms of which 3 ms to minimize.
[2024-06-01 15:51:31] [INFO ] Deduced a trap composed of 75 places in 163 ms of which 3 ms to minimize.
[2024-06-01 15:51:31] [INFO ] Deduced a trap composed of 63 places in 145 ms of which 2 ms to minimize.
[2024-06-01 15:51:31] [INFO ] Deduced a trap composed of 62 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:51:32] [INFO ] Deduced a trap composed of 62 places in 134 ms of which 3 ms to minimize.
[2024-06-01 15:51:32] [INFO ] Deduced a trap composed of 60 places in 144 ms of which 3 ms to minimize.
[2024-06-01 15:51:32] [INFO ] Deduced a trap composed of 62 places in 133 ms of which 2 ms to minimize.
[2024-06-01 15:51:32] [INFO ] Deduced a trap composed of 65 places in 185 ms of which 4 ms to minimize.
[2024-06-01 15:51:32] [INFO ] Deduced a trap composed of 64 places in 219 ms of which 3 ms to minimize.
[2024-06-01 15:51:33] [INFO ] Deduced a trap composed of 68 places in 218 ms of which 3 ms to minimize.
[2024-06-01 15:51:33] [INFO ] Deduced a trap composed of 71 places in 202 ms of which 3 ms to minimize.
[2024-06-01 15:51:33] [INFO ] Deduced a trap composed of 70 places in 201 ms of which 3 ms to minimize.
[2024-06-01 15:51:33] [INFO ] Deduced a trap composed of 73 places in 161 ms of which 3 ms to minimize.
[2024-06-01 15:51:33] [INFO ] Deduced a trap composed of 66 places in 208 ms of which 3 ms to minimize.
[2024-06-01 15:51:34] [INFO ] Deduced a trap composed of 70 places in 161 ms of which 2 ms to minimize.
[2024-06-01 15:51:34] [INFO ] Deduced a trap composed of 67 places in 216 ms of which 4 ms to minimize.
[2024-06-01 15:51:34] [INFO ] Deduced a trap composed of 60 places in 187 ms of which 3 ms to minimize.
[2024-06-01 15:51:34] [INFO ] Deduced a trap composed of 72 places in 216 ms of which 3 ms to minimize.
[2024-06-01 15:51:35] [INFO ] Deduced a trap composed of 63 places in 207 ms of which 3 ms to minimize.
[2024-06-01 15:51:35] [INFO ] Deduced a trap composed of 68 places in 213 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-01 15:51:36] [INFO ] Deduced a trap composed of 64 places in 163 ms of which 3 ms to minimize.
[2024-06-01 15:51:36] [INFO ] Deduced a trap composed of 79 places in 182 ms of which 2 ms to minimize.
[2024-06-01 15:51:36] [INFO ] Deduced a trap composed of 71 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:51:37] [INFO ] Deduced a trap composed of 63 places in 177 ms of which 3 ms to minimize.
[2024-06-01 15:51:37] [INFO ] Deduced a trap composed of 64 places in 208 ms of which 3 ms to minimize.
[2024-06-01 15:51:37] [INFO ] Deduced a trap composed of 56 places in 207 ms of which 3 ms to minimize.
[2024-06-01 15:51:37] [INFO ] Deduced a trap composed of 79 places in 207 ms of which 3 ms to minimize.
[2024-06-01 15:51:37] [INFO ] Deduced a trap composed of 61 places in 207 ms of which 3 ms to minimize.
[2024-06-01 15:51:38] [INFO ] Deduced a trap composed of 77 places in 205 ms of which 4 ms to minimize.
[2024-06-01 15:51:38] [INFO ] Deduced a trap composed of 82 places in 198 ms of which 3 ms to minimize.
[2024-06-01 15:51:38] [INFO ] Deduced a trap composed of 65 places in 193 ms of which 3 ms to minimize.
[2024-06-01 15:51:38] [INFO ] Deduced a trap composed of 56 places in 187 ms of which 4 ms to minimize.
[2024-06-01 15:51:38] [INFO ] Deduced a trap composed of 51 places in 212 ms of which 4 ms to minimize.
[2024-06-01 15:51:39] [INFO ] Deduced a trap composed of 74 places in 170 ms of which 3 ms to minimize.
[2024-06-01 15:51:39] [INFO ] Deduced a trap composed of 71 places in 205 ms of which 3 ms to minimize.
[2024-06-01 15:51:39] [INFO ] Deduced a trap composed of 65 places in 212 ms of which 3 ms to minimize.
[2024-06-01 15:51:40] [INFO ] Deduced a trap composed of 76 places in 187 ms of which 3 ms to minimize.
[2024-06-01 15:51:40] [INFO ] Deduced a trap composed of 69 places in 195 ms of which 3 ms to minimize.
[2024-06-01 15:51:40] [INFO ] Deduced a trap composed of 67 places in 220 ms of which 3 ms to minimize.
[2024-06-01 15:51:40] [INFO ] Deduced a trap composed of 70 places in 205 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-01 15:51:44] [INFO ] Deduced a trap composed of 57 places in 170 ms of which 3 ms to minimize.
[2024-06-01 15:51:44] [INFO ] Deduced a trap composed of 63 places in 208 ms of which 3 ms to minimize.
[2024-06-01 15:51:44] [INFO ] Deduced a trap composed of 56 places in 195 ms of which 3 ms to minimize.
[2024-06-01 15:51:44] [INFO ] Deduced a trap composed of 50 places in 223 ms of which 3 ms to minimize.
[2024-06-01 15:51:45] [INFO ] Deduced a trap composed of 60 places in 210 ms of which 4 ms to minimize.
[2024-06-01 15:51:45] [INFO ] Deduced a trap composed of 48 places in 203 ms of which 3 ms to minimize.
[2024-06-01 15:51:45] [INFO ] Deduced a trap composed of 81 places in 200 ms of which 3 ms to minimize.
[2024-06-01 15:51:45] [INFO ] Deduced a trap composed of 72 places in 192 ms of which 3 ms to minimize.
[2024-06-01 15:51:45] [INFO ] Deduced a trap composed of 73 places in 193 ms of which 3 ms to minimize.
[2024-06-01 15:51:46] [INFO ] Deduced a trap composed of 47 places in 196 ms of which 3 ms to minimize.
[2024-06-01 15:51:46] [INFO ] Deduced a trap composed of 61 places in 197 ms of which 3 ms to minimize.
[2024-06-01 15:51:46] [INFO ] Deduced a trap composed of 52 places in 163 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-01 15:51:48] [INFO ] Deduced a trap composed of 73 places in 199 ms of which 4 ms to minimize.
[2024-06-01 15:51:49] [INFO ] Deduced a trap composed of 51 places in 161 ms of which 3 ms to minimize.
[2024-06-01 15:51:49] [INFO ] Deduced a trap composed of 83 places in 202 ms of which 4 ms to minimize.
[2024-06-01 15:51:49] [INFO ] Deduced a trap composed of 56 places in 212 ms of which 3 ms to minimize.
[2024-06-01 15:51:49] [INFO ] Deduced a trap composed of 56 places in 225 ms of which 3 ms to minimize.
[2024-06-01 15:51:50] [INFO ] Deduced a trap composed of 56 places in 215 ms of which 3 ms to minimize.
[2024-06-01 15:51:50] [INFO ] Deduced a trap composed of 78 places in 229 ms of which 3 ms to minimize.
[2024-06-01 15:51:50] [INFO ] Deduced a trap composed of 72 places in 236 ms of which 3 ms to minimize.
[2024-06-01 15:51:50] [INFO ] Deduced a trap composed of 64 places in 153 ms of which 2 ms to minimize.
[2024-06-01 15:51:50] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 3 ms to minimize.
[2024-06-01 15:51:50] [INFO ] Deduced a trap composed of 52 places in 123 ms of which 2 ms to minimize.
[2024-06-01 15:51:51] [INFO ] Deduced a trap composed of 58 places in 121 ms of which 2 ms to minimize.
[2024-06-01 15:51:51] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 4 ms to minimize.
[2024-06-01 15:51:51] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 3 ms to minimize.
[2024-06-01 15:51:51] [INFO ] Deduced a trap composed of 49 places in 113 ms of which 2 ms to minimize.
[2024-06-01 15:51:51] [INFO ] Deduced a trap composed of 51 places in 128 ms of which 2 ms to minimize.
[2024-06-01 15:51:51] [INFO ] Deduced a trap composed of 61 places in 110 ms of which 2 ms to minimize.
[2024-06-01 15:51:51] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 2 ms to minimize.
[2024-06-01 15:51:52] [INFO ] Deduced a trap composed of 57 places in 161 ms of which 2 ms to minimize.
[2024-06-01 15:51:52] [INFO ] Deduced a trap composed of 63 places in 124 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-01 15:51:55] [INFO ] Deduced a trap composed of 50 places in 163 ms of which 3 ms to minimize.
[2024-06-01 15:51:55] [INFO ] Deduced a trap composed of 49 places in 206 ms of which 3 ms to minimize.
[2024-06-01 15:51:55] [INFO ] Deduced a trap composed of 53 places in 181 ms of which 3 ms to minimize.
[2024-06-01 15:51:56] [INFO ] Deduced a trap composed of 54 places in 167 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 168/482 variables, and 93 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 7/8 constraints, State Equation: 0/169 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 76/76 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 76/93 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-01 15:52:02] [INFO ] Deduced a trap composed of 63 places in 161 ms of which 3 ms to minimize.
[2024-06-01 15:52:03] [INFO ] Deduced a trap composed of 60 places in 146 ms of which 3 ms to minimize.
[2024-06-01 15:52:04] [INFO ] Deduced a trap composed of 65 places in 169 ms of which 3 ms to minimize.
[2024-06-01 15:52:04] [INFO ] Deduced a trap composed of 55 places in 157 ms of which 3 ms to minimize.
[2024-06-01 15:52:04] [INFO ] Deduced a trap composed of 57 places in 217 ms of which 4 ms to minimize.
[2024-06-01 15:52:04] [INFO ] Deduced a trap composed of 63 places in 205 ms of which 3 ms to minimize.
[2024-06-01 15:52:05] [INFO ] Deduced a trap composed of 52 places in 214 ms of which 4 ms to minimize.
[2024-06-01 15:52:05] [INFO ] Deduced a trap composed of 48 places in 215 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 8/101 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-01 15:52:12] [INFO ] Deduced a trap composed of 68 places in 154 ms of which 3 ms to minimize.
[2024-06-01 15:52:14] [INFO ] Deduced a trap composed of 74 places in 224 ms of which 3 ms to minimize.
[2024-06-01 15:52:14] [INFO ] Deduced a trap composed of 57 places in 127 ms of which 2 ms to minimize.
[2024-06-01 15:52:14] [INFO ] Deduced a trap composed of 68 places in 162 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 168/482 variables, and 105 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 7/8 constraints, State Equation: 0/169 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 0/305 constraints, Known Traps: 88/88 constraints]
After SMT, in 60397ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 60408ms
Starting structural reductions in SI_LTL mode, iteration 1 : 169/299 places, 313/499 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61844 ms. Remains : 169/299 places, 313/499 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-08-LTLCardinality-11
Product exploration explored 100000 steps with 14 reset in 240 ms.
Stack based approach found an accepted trace after 30 steps with 0 reset with depth 31 and stack size 31 in 1 ms.
FORMULA Anderson-PT-08-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLCardinality-11 finished in 62161 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(X(G((p0&&F((G(p0)&&p1))))))))'
Support contains 4 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 499/499 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 291 transition count 435
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 291 transition count 435
Applied a total of 16 rules in 14 ms. Remains 291 /299 variables (removed 8) and now considering 435/499 (removed 64) transitions.
// Phase 1: matrix 435 rows 291 cols
[2024-06-01 15:52:28] [INFO ] Computed 18 invariants in 6 ms
[2024-06-01 15:52:28] [INFO ] Implicit Places using invariants in 391 ms returned []
[2024-06-01 15:52:28] [INFO ] Invariant cache hit.
[2024-06-01 15:52:29] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-01 15:52:30] [INFO ] Implicit Places using invariants and state equation in 1910 ms returned []
Implicit Place search using SMT with State Equation took 2303 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2024-06-01 15:52:30] [INFO ] Invariant cache hit.
[2024-06-01 15:52:30] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/290 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-01 15:52:38] [INFO ] Deduced a trap composed of 81 places in 344 ms of which 5 ms to minimize.
[2024-06-01 15:52:40] [INFO ] Deduced a trap composed of 63 places in 357 ms of which 5 ms to minimize.
[2024-06-01 15:52:40] [INFO ] Deduced a trap composed of 172 places in 327 ms of which 5 ms to minimize.
[2024-06-01 15:52:40] [INFO ] Deduced a trap composed of 68 places in 337 ms of which 5 ms to minimize.
[2024-06-01 15:52:41] [INFO ] Deduced a trap composed of 118 places in 225 ms of which 3 ms to minimize.
[2024-06-01 15:52:41] [INFO ] Deduced a trap composed of 92 places in 196 ms of which 3 ms to minimize.
[2024-06-01 15:52:42] [INFO ] Deduced a trap composed of 119 places in 275 ms of which 5 ms to minimize.
[2024-06-01 15:52:42] [INFO ] Deduced a trap composed of 66 places in 338 ms of which 5 ms to minimize.
[2024-06-01 15:52:42] [INFO ] Deduced a trap composed of 65 places in 310 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-01 15:52:47] [INFO ] Deduced a trap composed of 134 places in 258 ms of which 3 ms to minimize.
[2024-06-01 15:52:47] [INFO ] Deduced a trap composed of 172 places in 182 ms of which 3 ms to minimize.
[2024-06-01 15:52:47] [INFO ] Deduced a trap composed of 120 places in 179 ms of which 3 ms to minimize.
[2024-06-01 15:52:47] [INFO ] Deduced a trap composed of 194 places in 298 ms of which 4 ms to minimize.
[2024-06-01 15:52:48] [INFO ] Deduced a trap composed of 63 places in 304 ms of which 4 ms to minimize.
[2024-06-01 15:52:48] [INFO ] Deduced a trap composed of 187 places in 232 ms of which 5 ms to minimize.
[2024-06-01 15:52:48] [INFO ] Deduced a trap composed of 110 places in 280 ms of which 4 ms to minimize.
[2024-06-01 15:52:49] [INFO ] Deduced a trap composed of 68 places in 273 ms of which 4 ms to minimize.
[2024-06-01 15:52:49] [INFO ] Deduced a trap composed of 120 places in 272 ms of which 4 ms to minimize.
[2024-06-01 15:52:49] [INFO ] Deduced a trap composed of 117 places in 272 ms of which 4 ms to minimize.
[2024-06-01 15:52:49] [INFO ] Deduced a trap composed of 73 places in 271 ms of which 5 ms to minimize.
[2024-06-01 15:52:50] [INFO ] Deduced a trap composed of 91 places in 275 ms of which 5 ms to minimize.
[2024-06-01 15:52:50] [INFO ] Deduced a trap composed of 90 places in 230 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 13/39 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-01 15:52:58] [INFO ] Deduced a trap composed of 117 places in 247 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 290/726 variables, and 40 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 7/8 constraints, State Equation: 0/291 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/290 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-01 15:53:05] [INFO ] Deduced a trap composed of 160 places in 279 ms of which 3 ms to minimize.
[2024-06-01 15:53:05] [INFO ] Deduced a trap composed of 140 places in 194 ms of which 3 ms to minimize.
[2024-06-01 15:53:05] [INFO ] Deduced a trap composed of 177 places in 251 ms of which 4 ms to minimize.
[2024-06-01 15:53:06] [INFO ] Deduced a trap composed of 100 places in 242 ms of which 3 ms to minimize.
[2024-06-01 15:53:06] [INFO ] Deduced a trap composed of 151 places in 194 ms of which 2 ms to minimize.
[2024-06-01 15:53:06] [INFO ] Deduced a trap composed of 128 places in 197 ms of which 5 ms to minimize.
[2024-06-01 15:53:06] [INFO ] Deduced a trap composed of 153 places in 273 ms of which 4 ms to minimize.
[2024-06-01 15:53:07] [INFO ] Deduced a trap composed of 153 places in 193 ms of which 3 ms to minimize.
[2024-06-01 15:53:07] [INFO ] Deduced a trap composed of 156 places in 269 ms of which 5 ms to minimize.
[2024-06-01 15:53:07] [INFO ] Deduced a trap composed of 131 places in 278 ms of which 5 ms to minimize.
[2024-06-01 15:53:07] [INFO ] Deduced a trap composed of 108 places in 337 ms of which 5 ms to minimize.
[2024-06-01 15:53:08] [INFO ] Deduced a trap composed of 185 places in 345 ms of which 5 ms to minimize.
[2024-06-01 15:53:08] [INFO ] Deduced a trap composed of 110 places in 342 ms of which 5 ms to minimize.
[2024-06-01 15:53:09] [INFO ] Deduced a trap composed of 167 places in 336 ms of which 5 ms to minimize.
[2024-06-01 15:53:09] [INFO ] Deduced a trap composed of 115 places in 338 ms of which 6 ms to minimize.
[2024-06-01 15:53:09] [INFO ] Deduced a trap composed of 108 places in 330 ms of which 3 ms to minimize.
[2024-06-01 15:53:10] [INFO ] Deduced a trap composed of 125 places in 348 ms of which 5 ms to minimize.
[2024-06-01 15:53:10] [INFO ] Deduced a trap composed of 147 places in 340 ms of which 5 ms to minimize.
[2024-06-01 15:53:10] [INFO ] Deduced a trap composed of 126 places in 346 ms of which 5 ms to minimize.
[2024-06-01 15:53:11] [INFO ] Deduced a trap composed of 136 places in 339 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 290/726 variables, and 60 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 7/8 constraints, State Equation: 0/291 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 0/427 constraints, Known Traps: 43/43 constraints]
After SMT, in 60400ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 60412ms
Starting structural reductions in LTL mode, iteration 1 : 291/299 places, 435/499 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62734 ms. Remains : 291/299 places, 435/499 transitions.
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Anderson-PT-08-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 203 ms.
Entered a terminal (fully accepting) state of product in 500 steps with 0 reset in 4 ms.
FORMULA Anderson-PT-08-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-08-LTLCardinality-15 finished in 63281 ms.
All properties solved by simple procedures.
Total runtime 192453 ms.
ITS solved all properties within timeout

BK_STOP 1717257211734

--------------------
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="Anderson-PT-08"
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 Anderson-PT-08, 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 r464-smll-171620118400347"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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