fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r169-tall-167838856300739
Last Updated
May 14, 2023

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1369.983 115213.00 162079.00 754.80 FTFTFTF?FFFTFFFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r169-tall-167838856300739.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is FunctionPointer-PT-c016, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838856300739
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 7.0K Feb 25 11:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 11:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 11:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 12:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 12:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 25 12:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.2M Mar 5 18:22 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-c016-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678632470958

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
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-c016
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 14:47:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 14:47:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 14:47:52] [INFO ] Load time of PNML (sax parser for PT used): 341 ms
[2023-03-12 14:47:52] [INFO ] Transformed 2826 places.
[2023-03-12 14:47:52] [INFO ] Transformed 8960 transitions.
[2023-03-12 14:47:52] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 468 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 3 formulas.
Deduced a syphon composed of 1198 places in 54 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c016-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1611 transition count 5962
Discarding 298 places :
Symmetric choice reduction at 1 with 298 rule applications. Total rules 315 place count 1313 transition count 3674
Iterating global reduction 1 with 298 rules applied. Total rules applied 613 place count 1313 transition count 3674
Ensure Unique test removed 348 transitions
Reduce isomorphic transitions removed 348 transitions.
Iterating post reduction 1 with 348 rules applied. Total rules applied 961 place count 1313 transition count 3326
Discarding 155 places :
Symmetric choice reduction at 2 with 155 rule applications. Total rules 1116 place count 1158 transition count 3016
Iterating global reduction 2 with 155 rules applied. Total rules applied 1271 place count 1158 transition count 3016
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 2 with 64 rules applied. Total rules applied 1335 place count 1158 transition count 2952
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1348 place count 1145 transition count 2926
Iterating global reduction 3 with 13 rules applied. Total rules applied 1361 place count 1145 transition count 2926
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1373 place count 1133 transition count 2902
Iterating global reduction 3 with 12 rules applied. Total rules applied 1385 place count 1133 transition count 2902
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1397 place count 1121 transition count 2878
Iterating global reduction 3 with 12 rules applied. Total rules applied 1409 place count 1121 transition count 2878
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1421 place count 1109 transition count 2854
Iterating global reduction 3 with 12 rules applied. Total rules applied 1433 place count 1109 transition count 2854
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1445 place count 1097 transition count 2830
Iterating global reduction 3 with 12 rules applied. Total rules applied 1457 place count 1097 transition count 2830
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1468 place count 1086 transition count 2808
Iterating global reduction 3 with 11 rules applied. Total rules applied 1479 place count 1086 transition count 2808
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1488 place count 1077 transition count 2790
Iterating global reduction 3 with 9 rules applied. Total rules applied 1497 place count 1077 transition count 2790
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1539 place count 1035 transition count 2630
Iterating global reduction 3 with 42 rules applied. Total rules applied 1581 place count 1035 transition count 2630
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 1630 place count 986 transition count 2434
Iterating global reduction 3 with 49 rules applied. Total rules applied 1679 place count 986 transition count 2434
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 1728 place count 937 transition count 2314
Iterating global reduction 3 with 49 rules applied. Total rules applied 1777 place count 937 transition count 2314
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 1826 place count 888 transition count 2216
Iterating global reduction 3 with 49 rules applied. Total rules applied 1875 place count 888 transition count 2216
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 1923 place count 840 transition count 2120
Iterating global reduction 3 with 48 rules applied. Total rules applied 1971 place count 840 transition count 2120
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 2019 place count 792 transition count 2024
Iterating global reduction 3 with 48 rules applied. Total rules applied 2067 place count 792 transition count 2024
Discarding 47 places :
Symmetric choice reduction at 3 with 47 rule applications. Total rules 2114 place count 745 transition count 1930
Iterating global reduction 3 with 47 rules applied. Total rules applied 2161 place count 745 transition count 1930
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 2172 place count 734 transition count 1908
Iterating global reduction 3 with 11 rules applied. Total rules applied 2183 place count 734 transition count 1908
Applied a total of 2183 rules in 1144 ms. Remains 734 /1628 variables (removed 894) and now considering 1908/5962 (removed 4054) transitions.
[2023-03-12 14:47:54] [INFO ] Flow matrix only has 1283 transitions (discarded 625 similar events)
// Phase 1: matrix 1283 rows 734 cols
[2023-03-12 14:47:54] [INFO ] Computed 2 place invariants in 38 ms
[2023-03-12 14:47:55] [INFO ] Implicit Places using invariants in 828 ms returned []
[2023-03-12 14:47:55] [INFO ] Flow matrix only has 1283 transitions (discarded 625 similar events)
[2023-03-12 14:47:55] [INFO ] Invariant cache hit.
[2023-03-12 14:47:55] [INFO ] State equation strengthened by 311 read => feed constraints.
[2023-03-12 14:47:57] [INFO ] Implicit Places using invariants and state equation in 2307 ms returned []
Implicit Place search using SMT with State Equation took 3163 ms to find 0 implicit places.
[2023-03-12 14:47:57] [INFO ] Flow matrix only has 1283 transitions (discarded 625 similar events)
[2023-03-12 14:47:57] [INFO ] Invariant cache hit.
[2023-03-12 14:47:58] [INFO ] Dead Transitions using invariants and state equation in 651 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 734/1628 places, 1908/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4960 ms. Remains : 734/1628 places, 1908/5962 transitions.
Support contains 14 out of 734 places after structural reductions.
[2023-03-12 14:47:58] [INFO ] Flatten gal took : 161 ms
[2023-03-12 14:47:58] [INFO ] Flatten gal took : 99 ms
[2023-03-12 14:47:58] [INFO ] Input system was already deterministic with 1908 transitions.
Incomplete random walk after 10006 steps, including 2 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-12 14:47:59] [INFO ] Flow matrix only has 1283 transitions (discarded 625 similar events)
[2023-03-12 14:47:59] [INFO ] Invariant cache hit.
[2023-03-12 14:47:59] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 14:47:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:47:59] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:48:00] [INFO ] After 471ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-12 14:48:00] [INFO ] State equation strengthened by 311 read => feed constraints.
[2023-03-12 14:48:00] [INFO ] After 246ms SMT Verify possible using 311 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2023-03-12 14:48:00] [INFO ] After 630ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 207 ms.
[2023-03-12 14:48:01] [INFO ] After 1589ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 36 ms.
Support contains 8 out of 734 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 734/734 places, 1908/1908 transitions.
Graph (complete) has 3130 edges and 734 vertex of which 542 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.5 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 542 transition count 1524
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 390 place count 537 transition count 1512
Iterating global reduction 1 with 5 rules applied. Total rules applied 395 place count 537 transition count 1512
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 399 place count 537 transition count 1508
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 404 place count 532 transition count 1496
Iterating global reduction 2 with 5 rules applied. Total rules applied 409 place count 532 transition count 1496
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 413 place count 528 transition count 1488
Iterating global reduction 2 with 4 rules applied. Total rules applied 417 place count 528 transition count 1488
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 422 place count 523 transition count 1472
Iterating global reduction 2 with 5 rules applied. Total rules applied 427 place count 523 transition count 1472
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 432 place count 518 transition count 1456
Iterating global reduction 2 with 5 rules applied. Total rules applied 437 place count 518 transition count 1456
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 442 place count 513 transition count 1446
Iterating global reduction 2 with 5 rules applied. Total rules applied 447 place count 513 transition count 1446
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 452 place count 508 transition count 1436
Iterating global reduction 2 with 5 rules applied. Total rules applied 457 place count 508 transition count 1436
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 461 place count 504 transition count 1428
Iterating global reduction 2 with 4 rules applied. Total rules applied 465 place count 504 transition count 1428
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 471 place count 498 transition count 1410
Iterating global reduction 2 with 6 rules applied. Total rules applied 477 place count 498 transition count 1410
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 483 place count 492 transition count 1392
Iterating global reduction 2 with 6 rules applied. Total rules applied 489 place count 492 transition count 1392
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 492 place count 489 transition count 1386
Iterating global reduction 2 with 3 rules applied. Total rules applied 495 place count 489 transition count 1386
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 498 place count 486 transition count 1380
Iterating global reduction 2 with 3 rules applied. Total rules applied 501 place count 486 transition count 1380
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 504 place count 483 transition count 1374
Iterating global reduction 2 with 3 rules applied. Total rules applied 507 place count 483 transition count 1374
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 510 place count 480 transition count 1368
Iterating global reduction 2 with 3 rules applied. Total rules applied 513 place count 480 transition count 1368
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 516 place count 477 transition count 1362
Iterating global reduction 2 with 3 rules applied. Total rules applied 519 place count 477 transition count 1362
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 2 with 16 rules applied. Total rules applied 535 place count 477 transition count 1346
Applied a total of 535 rules in 447 ms. Remains 477 /734 variables (removed 257) and now considering 1346/1908 (removed 562) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 449 ms. Remains : 477/734 places, 1346/1908 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-12 14:48:01] [INFO ] Flow matrix only has 777 transitions (discarded 569 similar events)
// Phase 1: matrix 777 rows 477 cols
[2023-03-12 14:48:01] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-12 14:48:01] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 14:48:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 14:48:02] [INFO ] After 296ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 14:48:02] [INFO ] State equation strengthened by 94 read => feed constraints.
[2023-03-12 14:48:02] [INFO ] After 125ms SMT Verify possible using 94 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 14:48:02] [INFO ] After 298ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 110 ms.
[2023-03-12 14:48:02] [INFO ] After 845ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 33 ms.
Support contains 7 out of 477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 1346/1346 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 476 transition count 1344
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 476 transition count 1344
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 476 transition count 1342
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 475 transition count 1340
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 475 transition count 1340
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 474 transition count 1338
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 474 transition count 1338
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 11 place count 471 transition count 1326
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 471 transition count 1326
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 468 transition count 1320
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 468 transition count 1320
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 465 transition count 1314
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 465 transition count 1314
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 462 transition count 1308
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 462 transition count 1308
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 459 transition count 1302
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 459 transition count 1302
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 456 transition count 1296
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 456 transition count 1296
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 453 transition count 1290
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 place count 453 transition count 1290
Applied a total of 50 rules in 153 ms. Remains 453 /477 variables (removed 24) and now considering 1290/1346 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 453/477 places, 1290/1346 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 14:48:02] [INFO ] Flow matrix only has 737 transitions (discarded 553 similar events)
// Phase 1: matrix 737 rows 453 cols
[2023-03-12 14:48:02] [INFO ] Computed 3 place invariants in 9 ms
[2023-03-12 14:48:03] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:48:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 14:48:03] [INFO ] After 200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:48:03] [INFO ] State equation strengthened by 85 read => feed constraints.
[2023-03-12 14:48:03] [INFO ] After 99ms SMT Verify possible using 85 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:48:03] [INFO ] After 201ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-12 14:48:03] [INFO ] After 545ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 453 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 453/453 places, 1290/1290 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 451 transition count 1286
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 451 transition count 1286
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 449 transition count 1280
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 449 transition count 1280
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 447 transition count 1276
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 447 transition count 1276
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 445 transition count 1272
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 445 transition count 1272
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 443 transition count 1268
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 443 transition count 1268
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 441 transition count 1264
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 441 transition count 1264
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 439 transition count 1260
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 439 transition count 1260
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 437 transition count 1254
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 437 transition count 1254
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 436 transition count 1252
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 436 transition count 1252
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 435 transition count 1250
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 435 transition count 1250
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 434 transition count 1248
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 434 transition count 1248
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 433 transition count 1246
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 433 transition count 1246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 432 transition count 1244
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 432 transition count 1244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 431 transition count 1242
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 431 transition count 1242
Applied a total of 44 rules in 168 ms. Remains 431 /453 variables (removed 22) and now considering 1242/1290 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 431/453 places, 1242/1290 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:48:03] [INFO ] Flow matrix only has 704 transitions (discarded 538 similar events)
// Phase 1: matrix 704 rows 431 cols
[2023-03-12 14:48:03] [INFO ] Computed 3 place invariants in 7 ms
[2023-03-12 14:48:03] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:48:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 14:48:04] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:48:04] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-12 14:48:04] [INFO ] After 47ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 14:48:04] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-12 14:48:04] [INFO ] After 358ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 1242/1242 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 430 transition count 1240
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 430 transition count 1240
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 430 transition count 1238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 429 transition count 1236
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 429 transition count 1236
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 428 transition count 1234
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 428 transition count 1234
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 427 transition count 1230
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 427 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 426 transition count 1228
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 426 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 425 transition count 1226
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 425 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 424 transition count 1224
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 424 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 423 transition count 1222
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 422 transition count 1220
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 422 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 421 transition count 1218
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 421 transition count 1218
Applied a total of 22 rules in 138 ms. Remains 421 /431 variables (removed 10) and now considering 1218/1242 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 421/431 places, 1218/1242 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 591171 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :{}
Probabilistic random walk after 591171 steps, saw 362497 distinct states, run finished after 3002 ms. (steps per millisecond=196 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:48:07] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2023-03-12 14:48:07] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-12 14:48:07] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:48:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-12 14:48:07] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:48:07] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-12 14:48:07] [INFO ] After 71ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 14:48:07] [INFO ] After 123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-12 14:48:07] [INFO ] After 396ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 61 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 49 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2023-03-12 14:48:08] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-12 14:48:08] [INFO ] Invariant cache hit.
[2023-03-12 14:48:08] [INFO ] Implicit Places using invariants in 310 ms returned []
[2023-03-12 14:48:08] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-12 14:48:08] [INFO ] Invariant cache hit.
[2023-03-12 14:48:08] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-12 14:48:09] [INFO ] Implicit Places using invariants and state equation in 952 ms returned []
Implicit Place search using SMT with State Equation took 1278 ms to find 0 implicit places.
[2023-03-12 14:48:09] [INFO ] Redundant transitions in 83 ms returned []
[2023-03-12 14:48:09] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-12 14:48:09] [INFO ] Invariant cache hit.
[2023-03-12 14:48:09] [INFO ] Dead Transitions using invariants and state equation in 415 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1838 ms. Remains : 421/421 places, 1218/1218 transitions.
Ensure Unique test removed 530 transitions
Reduce isomorphic transitions removed 530 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 540 rules applied. Total rules applied 540 place count 421 transition count 678
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 550 place count 411 transition count 678
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 550 place count 411 transition count 606
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 694 place count 339 transition count 606
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 252 rules applied. Total rules applied 946 place count 213 transition count 480
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 1009 place count 150 transition count 354
Iterating global reduction 2 with 63 rules applied. Total rules applied 1072 place count 150 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1073 place count 150 transition count 353
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1135 place count 88 transition count 229
Iterating global reduction 3 with 62 rules applied. Total rules applied 1197 place count 88 transition count 229
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 1258 place count 27 transition count 107
Iterating global reduction 3 with 61 rules applied. Total rules applied 1319 place count 27 transition count 107
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 1379 place count 27 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1381 place count 26 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1383 place count 25 transition count 49
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 1387 place count 25 transition count 45
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1388 place count 25 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1389 place count 24 transition count 44
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1390 place count 24 transition count 43
Applied a total of 1390 rules in 69 ms. Remains 24 /421 variables (removed 397) and now considering 43/1218 (removed 1175) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 43 rows 24 cols
[2023-03-12 14:48:09] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-12 14:48:09] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:48:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 14:48:09] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:48:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 14:48:09] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 14:48:09] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-12 14:48:09] [INFO ] After 47ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA FunctionPointer-PT-c016-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
FORMULA FunctionPointer-PT-c016-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 192 stabilizing places and 512 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 1 out of 734 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 734/734 places, 1908/1908 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 725 transition count 1888
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 725 transition count 1888
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 26 place count 725 transition count 1880
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 35 place count 716 transition count 1858
Iterating global reduction 1 with 9 rules applied. Total rules applied 44 place count 716 transition count 1858
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 52 place count 708 transition count 1840
Iterating global reduction 1 with 8 rules applied. Total rules applied 60 place count 708 transition count 1840
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 72 place count 696 transition count 1800
Iterating global reduction 1 with 12 rules applied. Total rules applied 84 place count 696 transition count 1800
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 96 place count 684 transition count 1760
Iterating global reduction 1 with 12 rules applied. Total rules applied 108 place count 684 transition count 1760
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 120 place count 672 transition count 1736
Iterating global reduction 1 with 12 rules applied. Total rules applied 132 place count 672 transition count 1736
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 144 place count 660 transition count 1712
Iterating global reduction 1 with 12 rules applied. Total rules applied 156 place count 660 transition count 1712
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 168 place count 648 transition count 1684
Iterating global reduction 1 with 12 rules applied. Total rules applied 180 place count 648 transition count 1684
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 191 place count 637 transition count 1656
Iterating global reduction 1 with 11 rules applied. Total rules applied 202 place count 637 transition count 1656
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 213 place count 626 transition count 1632
Iterating global reduction 1 with 11 rules applied. Total rules applied 224 place count 626 transition count 1632
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 227 place count 623 transition count 1626
Iterating global reduction 1 with 3 rules applied. Total rules applied 230 place count 623 transition count 1626
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 233 place count 620 transition count 1620
Iterating global reduction 1 with 3 rules applied. Total rules applied 236 place count 620 transition count 1620
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 239 place count 617 transition count 1614
Iterating global reduction 1 with 3 rules applied. Total rules applied 242 place count 617 transition count 1614
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 245 place count 614 transition count 1608
Iterating global reduction 1 with 3 rules applied. Total rules applied 248 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 249 place count 613 transition count 1606
Iterating global reduction 1 with 1 rules applied. Total rules applied 250 place count 613 transition count 1606
Applied a total of 250 rules in 385 ms. Remains 613 /734 variables (removed 121) and now considering 1606/1908 (removed 302) transitions.
[2023-03-12 14:48:10] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2023-03-12 14:48:10] [INFO ] Computed 2 place invariants in 9 ms
[2023-03-12 14:48:10] [INFO ] Implicit Places using invariants in 438 ms returned []
[2023-03-12 14:48:10] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-12 14:48:10] [INFO ] Invariant cache hit.
[2023-03-12 14:48:11] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:48:12] [INFO ] Implicit Places using invariants and state equation in 1679 ms returned []
Implicit Place search using SMT with State Equation took 2119 ms to find 0 implicit places.
[2023-03-12 14:48:12] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-12 14:48:12] [INFO ] Invariant cache hit.
[2023-03-12 14:48:13] [INFO ] Dead Transitions using invariants and state equation in 537 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 613/734 places, 1606/1908 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3042 ms. Remains : 613/734 places, 1606/1908 transitions.
Stuttering acceptance computed with spot in 239 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(LEQ s540 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 849 ms.
Product exploration explored 100000 steps with 33333 reset in 762 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 68 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c016-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c016-LTLCardinality-01 finished in 5036 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(G(p1))))'
Support contains 2 out of 734 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 734/734 places, 1908/1908 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 725 transition count 1888
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 725 transition count 1888
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 24 place count 725 transition count 1882
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 33 place count 716 transition count 1858
Iterating global reduction 1 with 9 rules applied. Total rules applied 42 place count 716 transition count 1858
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 51 place count 707 transition count 1836
Iterating global reduction 1 with 9 rules applied. Total rules applied 60 place count 707 transition count 1836
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 73 place count 694 transition count 1794
Iterating global reduction 1 with 13 rules applied. Total rules applied 86 place count 694 transition count 1794
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 99 place count 681 transition count 1752
Iterating global reduction 1 with 13 rules applied. Total rules applied 112 place count 681 transition count 1752
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 125 place count 668 transition count 1726
Iterating global reduction 1 with 13 rules applied. Total rules applied 138 place count 668 transition count 1726
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 151 place count 655 transition count 1700
Iterating global reduction 1 with 13 rules applied. Total rules applied 164 place count 655 transition count 1700
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 177 place count 642 transition count 1670
Iterating global reduction 1 with 13 rules applied. Total rules applied 190 place count 642 transition count 1670
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 201 place count 631 transition count 1642
Iterating global reduction 1 with 11 rules applied. Total rules applied 212 place count 631 transition count 1642
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 223 place count 620 transition count 1618
Iterating global reduction 1 with 11 rules applied. Total rules applied 234 place count 620 transition count 1618
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 237 place count 617 transition count 1612
Iterating global reduction 1 with 3 rules applied. Total rules applied 240 place count 617 transition count 1612
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 243 place count 614 transition count 1606
Iterating global reduction 1 with 3 rules applied. Total rules applied 246 place count 614 transition count 1606
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 249 place count 611 transition count 1600
Iterating global reduction 1 with 3 rules applied. Total rules applied 252 place count 611 transition count 1600
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 255 place count 608 transition count 1594
Iterating global reduction 1 with 3 rules applied. Total rules applied 258 place count 608 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 259 place count 607 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 260 place count 607 transition count 1592
Applied a total of 260 rules in 264 ms. Remains 607 /734 variables (removed 127) and now considering 1592/1908 (removed 316) transitions.
[2023-03-12 14:48:15] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
// Phase 1: matrix 1063 rows 607 cols
[2023-03-12 14:48:15] [INFO ] Computed 2 place invariants in 11 ms
[2023-03-12 14:48:15] [INFO ] Implicit Places using invariants in 422 ms returned []
[2023-03-12 14:48:15] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
[2023-03-12 14:48:15] [INFO ] Invariant cache hit.
[2023-03-12 14:48:16] [INFO ] State equation strengthened by 264 read => feed constraints.
[2023-03-12 14:48:17] [INFO ] Implicit Places using invariants and state equation in 2100 ms returned []
Implicit Place search using SMT with State Equation took 2526 ms to find 0 implicit places.
[2023-03-12 14:48:17] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
[2023-03-12 14:48:17] [INFO ] Invariant cache hit.
[2023-03-12 14:48:18] [INFO ] Dead Transitions using invariants and state equation in 555 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 607/734 places, 1592/1908 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3357 ms. Remains : 607/734 places, 1592/1908 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND p1 (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(LEQ s76 0), p0:(LEQ s521 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 26548 reset in 674 ms.
Product exploration explored 100000 steps with 33424 reset in 704 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Detected a total of 192/607 stabilizing places and 512/1592 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p1), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 685 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0))]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 14:48:21] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
[2023-03-12 14:48:21] [INFO ] Invariant cache hit.
[2023-03-12 14:48:21] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:48:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:48:21] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:48:21] [INFO ] After 298ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:48:21] [INFO ] State equation strengthened by 264 read => feed constraints.
[2023-03-12 14:48:21] [INFO ] After 104ms SMT Verify possible using 264 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:48:21] [INFO ] After 211ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 92 ms.
[2023-03-12 14:48:21] [INFO ] After 718ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 607 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 607/607 places, 1592/1592 transitions.
Graph (complete) has 2656 edges and 607 vertex of which 415 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.2 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 415 transition count 1208
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 387 place count 415 transition count 1206
Applied a total of 387 rules in 114 ms. Remains 415 /607 variables (removed 192) and now considering 1206/1592 (removed 386) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 415/607 places, 1206/1592 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 342404 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :{}
Probabilistic random walk after 342404 steps, saw 209968 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 14:48:25] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2023-03-12 14:48:25] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-12 14:48:25] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:48:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 14:48:25] [INFO ] After 186ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:48:25] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-12 14:48:25] [INFO ] After 72ms SMT Verify possible using 74 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:48:25] [INFO ] After 142ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-12 14:48:25] [INFO ] After 459ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 51 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 50 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2023-03-12 14:48:25] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2023-03-12 14:48:25] [INFO ] Invariant cache hit.
[2023-03-12 14:48:26] [INFO ] Implicit Places using invariants in 316 ms returned []
[2023-03-12 14:48:26] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2023-03-12 14:48:26] [INFO ] Invariant cache hit.
[2023-03-12 14:48:26] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-12 14:48:27] [INFO ] Implicit Places using invariants and state equation in 942 ms returned []
Implicit Place search using SMT with State Equation took 1265 ms to find 0 implicit places.
[2023-03-12 14:48:27] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-12 14:48:27] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2023-03-12 14:48:27] [INFO ] Invariant cache hit.
[2023-03-12 14:48:27] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1752 ms. Remains : 415/415 places, 1206/1206 transitions.
Ensure Unique test removed 526 transitions
Reduce isomorphic transitions removed 526 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 536 rules applied. Total rules applied 536 place count 415 transition count 670
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 546 place count 405 transition count 670
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 546 place count 405 transition count 603
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 680 place count 338 transition count 603
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 936 place count 210 transition count 475
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1000 place count 146 transition count 347
Iterating global reduction 2 with 64 rules applied. Total rules applied 1064 place count 146 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1065 place count 146 transition count 346
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1065 place count 146 transition count 345
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1067 place count 145 transition count 345
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1130 place count 82 transition count 219
Iterating global reduction 3 with 63 rules applied. Total rules applied 1193 place count 82 transition count 219
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1255 place count 20 transition count 95
Iterating global reduction 3 with 62 rules applied. Total rules applied 1317 place count 20 transition count 95
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 3 with 61 rules applied. Total rules applied 1378 place count 20 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1380 place count 19 transition count 35
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 1386 place count 19 transition count 29
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1387 place count 19 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1388 place count 18 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1389 place count 18 transition count 27
Applied a total of 1389 rules in 39 ms. Remains 18 /415 variables (removed 397) and now considering 27/1206 (removed 1179) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 27 rows 18 cols
[2023-03-12 14:48:27] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-12 14:48:27] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:48:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-12 14:48:27] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:48:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 14:48:27] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:48:27] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-12 14:48:27] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p1), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 14 factoid took 775 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0))]
Support contains 2 out of 607 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 607/607 places, 1592/1592 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 607 transition count 1590
Applied a total of 2 rules in 767 ms. Remains 607 /607 variables (removed 0) and now considering 1590/1592 (removed 2) transitions.
[2023-03-12 14:48:29] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
// Phase 1: matrix 1062 rows 607 cols
[2023-03-12 14:48:29] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-12 14:48:29] [INFO ] Implicit Places using invariants in 415 ms returned []
[2023-03-12 14:48:29] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
[2023-03-12 14:48:29] [INFO ] Invariant cache hit.
[2023-03-12 14:48:30] [INFO ] State equation strengthened by 264 read => feed constraints.
[2023-03-12 14:48:31] [INFO ] Implicit Places using invariants and state equation in 1811 ms returned []
Implicit Place search using SMT with State Equation took 2228 ms to find 0 implicit places.
[2023-03-12 14:48:31] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-12 14:48:31] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
[2023-03-12 14:48:31] [INFO ] Invariant cache hit.
[2023-03-12 14:48:32] [INFO ] Dead Transitions using invariants and state equation in 546 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 607/607 places, 1590/1592 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3580 ms. Remains : 607/607 places, 1590/1592 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Detected a total of 192/607 stabilizing places and 512/1590 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 533 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 14:48:33] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
[2023-03-12 14:48:33] [INFO ] Invariant cache hit.
[2023-03-12 14:48:33] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:48:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 14:48:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:48:33] [INFO ] After 298ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:48:33] [INFO ] State equation strengthened by 264 read => feed constraints.
[2023-03-12 14:48:33] [INFO ] After 124ms SMT Verify possible using 264 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:48:33] [INFO ] After 240ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-12 14:48:33] [INFO ] After 735ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 607 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 607/607 places, 1590/1590 transitions.
Graph (complete) has 2655 edges and 607 vertex of which 415 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 415 transition count 1206
Applied a total of 385 rules in 53 ms. Remains 415 /607 variables (removed 192) and now considering 1206/1590 (removed 384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 415/607 places, 1206/1590 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-12 14:48:34] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2023-03-12 14:48:34] [INFO ] Computed 3 place invariants in 7 ms
[2023-03-12 14:48:34] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:48:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 14:48:34] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:48:34] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-12 14:48:34] [INFO ] After 63ms SMT Verify possible using 74 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 14:48:34] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-12 14:48:34] [INFO ] After 391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 49 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 415/415 places, 1206/1206 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Finished Best-First random walk after 8920 steps, including 2 resets, run visited all 1 properties in 8 ms. (steps per millisecond=1115 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 13 factoid took 229 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c016-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c016-LTLCardinality-06 finished in 19740 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 734 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 734/734 places, 1908/1908 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 725 transition count 1888
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 725 transition count 1888
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 26 place count 725 transition count 1880
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 35 place count 716 transition count 1858
Iterating global reduction 1 with 9 rules applied. Total rules applied 44 place count 716 transition count 1858
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 52 place count 708 transition count 1840
Iterating global reduction 1 with 8 rules applied. Total rules applied 60 place count 708 transition count 1840
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 72 place count 696 transition count 1800
Iterating global reduction 1 with 12 rules applied. Total rules applied 84 place count 696 transition count 1800
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 96 place count 684 transition count 1760
Iterating global reduction 1 with 12 rules applied. Total rules applied 108 place count 684 transition count 1760
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 120 place count 672 transition count 1736
Iterating global reduction 1 with 12 rules applied. Total rules applied 132 place count 672 transition count 1736
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 144 place count 660 transition count 1712
Iterating global reduction 1 with 12 rules applied. Total rules applied 156 place count 660 transition count 1712
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 168 place count 648 transition count 1684
Iterating global reduction 1 with 12 rules applied. Total rules applied 180 place count 648 transition count 1684
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 191 place count 637 transition count 1656
Iterating global reduction 1 with 11 rules applied. Total rules applied 202 place count 637 transition count 1656
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 213 place count 626 transition count 1632
Iterating global reduction 1 with 11 rules applied. Total rules applied 224 place count 626 transition count 1632
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 227 place count 623 transition count 1626
Iterating global reduction 1 with 3 rules applied. Total rules applied 230 place count 623 transition count 1626
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 233 place count 620 transition count 1620
Iterating global reduction 1 with 3 rules applied. Total rules applied 236 place count 620 transition count 1620
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 239 place count 617 transition count 1614
Iterating global reduction 1 with 3 rules applied. Total rules applied 242 place count 617 transition count 1614
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 245 place count 614 transition count 1608
Iterating global reduction 1 with 3 rules applied. Total rules applied 248 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 249 place count 613 transition count 1606
Iterating global reduction 1 with 1 rules applied. Total rules applied 250 place count 613 transition count 1606
Applied a total of 250 rules in 263 ms. Remains 613 /734 variables (removed 121) and now considering 1606/1908 (removed 302) transitions.
[2023-03-12 14:48:35] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2023-03-12 14:48:35] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-12 14:48:35] [INFO ] Implicit Places using invariants in 431 ms returned []
[2023-03-12 14:48:35] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-12 14:48:35] [INFO ] Invariant cache hit.
[2023-03-12 14:48:35] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:48:37] [INFO ] Implicit Places using invariants and state equation in 1619 ms returned []
Implicit Place search using SMT with State Equation took 2091 ms to find 0 implicit places.
[2023-03-12 14:48:37] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-12 14:48:37] [INFO ] Invariant cache hit.
[2023-03-12 14:48:37] [INFO ] Dead Transitions using invariants and state equation in 575 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 613/734 places, 1606/1908 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2949 ms. Remains : 613/734 places, 1606/1908 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LEQ s533 s474) (LEQ s70 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 479 ms.
Product exploration explored 100000 steps with 2 reset in 630 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 195 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10010 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 493670 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :{}
Probabilistic random walk after 493670 steps, saw 320426 distinct states, run finished after 3001 ms. (steps per millisecond=164 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:48:42] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-12 14:48:42] [INFO ] Invariant cache hit.
[2023-03-12 14:48:42] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:48:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:48:42] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:48:42] [INFO ] After 250ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:48:42] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:48:42] [INFO ] After 81ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 14:48:43] [INFO ] After 179ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-12 14:48:43] [INFO ] After 572ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Graph (complete) has 2679 edges and 613 vertex of which 421 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 421 transition count 1222
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 389 place count 421 transition count 1218
Applied a total of 389 rules in 96 ms. Remains 421 /613 variables (removed 192) and now considering 1218/1606 (removed 388) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 421/613 places, 1218/1606 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 587283 steps, run timeout after 3001 ms. (steps per millisecond=195 ) properties seen :{}
Probabilistic random walk after 587283 steps, saw 360112 distinct states, run finished after 3001 ms. (steps per millisecond=195 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:48:46] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2023-03-12 14:48:46] [INFO ] Computed 3 place invariants in 8 ms
[2023-03-12 14:48:46] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:48:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 14:48:46] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:48:46] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-12 14:48:46] [INFO ] After 77ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 14:48:46] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-12 14:48:46] [INFO ] After 429ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 44 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 44 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2023-03-12 14:48:46] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-12 14:48:46] [INFO ] Invariant cache hit.
[2023-03-12 14:48:47] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-12 14:48:47] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-12 14:48:47] [INFO ] Invariant cache hit.
[2023-03-12 14:48:47] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-12 14:48:48] [INFO ] Implicit Places using invariants and state equation in 916 ms returned []
Implicit Place search using SMT with State Equation took 1255 ms to find 0 implicit places.
[2023-03-12 14:48:48] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-12 14:48:48] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-12 14:48:48] [INFO ] Invariant cache hit.
[2023-03-12 14:48:48] [INFO ] Dead Transitions using invariants and state equation in 429 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1751 ms. Remains : 421/421 places, 1218/1218 transitions.
Ensure Unique test removed 530 transitions
Reduce isomorphic transitions removed 530 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 540 rules applied. Total rules applied 540 place count 421 transition count 678
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 550 place count 411 transition count 678
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 550 place count 411 transition count 606
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 694 place count 339 transition count 606
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 252 rules applied. Total rules applied 946 place count 213 transition count 480
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 1009 place count 150 transition count 354
Iterating global reduction 2 with 63 rules applied. Total rules applied 1072 place count 150 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1073 place count 150 transition count 353
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1135 place count 88 transition count 229
Iterating global reduction 3 with 62 rules applied. Total rules applied 1197 place count 88 transition count 229
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 1258 place count 27 transition count 107
Iterating global reduction 3 with 61 rules applied. Total rules applied 1319 place count 27 transition count 107
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 1379 place count 27 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1381 place count 26 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1383 place count 25 transition count 49
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 1387 place count 25 transition count 45
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1388 place count 25 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1389 place count 24 transition count 44
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1390 place count 24 transition count 43
Applied a total of 1390 rules in 24 ms. Remains 24 /421 variables (removed 397) and now considering 43/1218 (removed 1175) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 43 rows 24 cols
[2023-03-12 14:48:48] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-12 14:48:48] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:48:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 14:48:48] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:48:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 14:48:48] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 14:48:48] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-12 14:48:48] [INFO ] After 93ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Applied a total of 0 rules in 21 ms. Remains 613 /613 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
[2023-03-12 14:48:49] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2023-03-12 14:48:49] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-12 14:48:49] [INFO ] Implicit Places using invariants in 428 ms returned []
[2023-03-12 14:48:49] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-12 14:48:49] [INFO ] Invariant cache hit.
[2023-03-12 14:48:49] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:48:51] [INFO ] Implicit Places using invariants and state equation in 1636 ms returned []
Implicit Place search using SMT with State Equation took 2077 ms to find 0 implicit places.
[2023-03-12 14:48:51] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-12 14:48:51] [INFO ] Invariant cache hit.
[2023-03-12 14:48:51] [INFO ] Dead Transitions using invariants and state equation in 550 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2654 ms. Remains : 613/613 places, 1606/1606 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 183 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10015 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=455 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 497936 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :{}
Probabilistic random walk after 497936 steps, saw 323194 distinct states, run finished after 3001 ms. (steps per millisecond=165 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:48:55] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-12 14:48:55] [INFO ] Invariant cache hit.
[2023-03-12 14:48:55] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:48:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2023-03-12 14:48:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:48:55] [INFO ] After 251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:48:55] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:48:55] [INFO ] After 77ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 14:48:55] [INFO ] After 161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-12 14:48:55] [INFO ] After 563ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Graph (complete) has 2679 edges and 613 vertex of which 421 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.0 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 421 transition count 1222
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 389 place count 421 transition count 1218
Applied a total of 389 rules in 90 ms. Remains 421 /613 variables (removed 192) and now considering 1218/1606 (removed 388) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 421/613 places, 1218/1606 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 590956 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :{}
Probabilistic random walk after 590956 steps, saw 362363 distinct states, run finished after 3001 ms. (steps per millisecond=196 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:48:58] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2023-03-12 14:48:58] [INFO ] Computed 3 place invariants in 9 ms
[2023-03-12 14:48:58] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:48:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 14:48:59] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:48:59] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-12 14:48:59] [INFO ] After 58ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 14:48:59] [INFO ] After 110ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-12 14:48:59] [INFO ] After 385ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 49 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 45 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2023-03-12 14:48:59] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-12 14:48:59] [INFO ] Invariant cache hit.
[2023-03-12 14:48:59] [INFO ] Implicit Places using invariants in 307 ms returned []
[2023-03-12 14:48:59] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-12 14:48:59] [INFO ] Invariant cache hit.
[2023-03-12 14:48:59] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-12 14:49:00] [INFO ] Implicit Places using invariants and state equation in 923 ms returned []
Implicit Place search using SMT with State Equation took 1256 ms to find 0 implicit places.
[2023-03-12 14:49:00] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-12 14:49:00] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-12 14:49:00] [INFO ] Invariant cache hit.
[2023-03-12 14:49:01] [INFO ] Dead Transitions using invariants and state equation in 521 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1851 ms. Remains : 421/421 places, 1218/1218 transitions.
Ensure Unique test removed 530 transitions
Reduce isomorphic transitions removed 530 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 540 rules applied. Total rules applied 540 place count 421 transition count 678
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 550 place count 411 transition count 678
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 550 place count 411 transition count 606
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 694 place count 339 transition count 606
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 252 rules applied. Total rules applied 946 place count 213 transition count 480
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 1009 place count 150 transition count 354
Iterating global reduction 2 with 63 rules applied. Total rules applied 1072 place count 150 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1073 place count 150 transition count 353
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1135 place count 88 transition count 229
Iterating global reduction 3 with 62 rules applied. Total rules applied 1197 place count 88 transition count 229
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 1258 place count 27 transition count 107
Iterating global reduction 3 with 61 rules applied. Total rules applied 1319 place count 27 transition count 107
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 1379 place count 27 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1381 place count 26 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1383 place count 25 transition count 49
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 1387 place count 25 transition count 45
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1388 place count 25 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1389 place count 24 transition count 44
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1390 place count 24 transition count 43
Applied a total of 1390 rules in 22 ms. Remains 24 /421 variables (removed 397) and now considering 43/1218 (removed 1175) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 43 rows 24 cols
[2023-03-12 14:49:01] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-12 14:49:01] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:49:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 14:49:01] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:49:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 14:49:01] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 14:49:01] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-12 14:49:01] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 493 ms.
Product exploration explored 100000 steps with 0 reset in 516 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 613 transition count 1602
Applied a total of 4 rules in 180 ms. Remains 613 /613 variables (removed 0) and now considering 1602/1606 (removed 4) transitions.
[2023-03-12 14:49:03] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-12 14:49:03] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 613 cols
[2023-03-12 14:49:03] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-12 14:49:04] [INFO ] Dead Transitions using invariants and state equation in 853 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 613/613 places, 1602/1606 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1100 ms. Remains : 613/613 places, 1602/1606 transitions.
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Applied a total of 0 rules in 16 ms. Remains 613 /613 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
[2023-03-12 14:49:04] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2023-03-12 14:49:04] [INFO ] Computed 2 place invariants in 15 ms
[2023-03-12 14:49:04] [INFO ] Implicit Places using invariants in 440 ms returned []
[2023-03-12 14:49:04] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-12 14:49:04] [INFO ] Invariant cache hit.
[2023-03-12 14:49:04] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:49:06] [INFO ] Implicit Places using invariants and state equation in 1580 ms returned []
Implicit Place search using SMT with State Equation took 2043 ms to find 0 implicit places.
[2023-03-12 14:49:06] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-12 14:49:06] [INFO ] Invariant cache hit.
[2023-03-12 14:49:06] [INFO ] Dead Transitions using invariants and state equation in 569 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2644 ms. Remains : 613/613 places, 1606/1606 transitions.
Treatment of property FunctionPointer-PT-c016-LTLCardinality-07 finished in 32132 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(F(p0)) U p1))))'
Support contains 3 out of 734 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 734/734 places, 1908/1908 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 726 transition count 1890
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 726 transition count 1890
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 726 transition count 1884
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 30 place count 718 transition count 1862
Iterating global reduction 1 with 8 rules applied. Total rules applied 38 place count 718 transition count 1862
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 45 place count 711 transition count 1844
Iterating global reduction 1 with 7 rules applied. Total rules applied 52 place count 711 transition count 1844
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 62 place count 701 transition count 1812
Iterating global reduction 1 with 10 rules applied. Total rules applied 72 place count 701 transition count 1812
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 82 place count 691 transition count 1780
Iterating global reduction 1 with 10 rules applied. Total rules applied 92 place count 691 transition count 1780
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 102 place count 681 transition count 1760
Iterating global reduction 1 with 10 rules applied. Total rules applied 112 place count 681 transition count 1760
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 122 place count 671 transition count 1740
Iterating global reduction 1 with 10 rules applied. Total rules applied 132 place count 671 transition count 1740
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 141 place count 662 transition count 1722
Iterating global reduction 1 with 9 rules applied. Total rules applied 150 place count 662 transition count 1722
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 159 place count 653 transition count 1698
Iterating global reduction 1 with 9 rules applied. Total rules applied 168 place count 653 transition count 1698
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 177 place count 644 transition count 1674
Iterating global reduction 1 with 9 rules applied. Total rules applied 186 place count 644 transition count 1674
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 189 place count 641 transition count 1668
Iterating global reduction 1 with 3 rules applied. Total rules applied 192 place count 641 transition count 1668
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 195 place count 638 transition count 1662
Iterating global reduction 1 with 3 rules applied. Total rules applied 198 place count 638 transition count 1662
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 201 place count 635 transition count 1656
Iterating global reduction 1 with 3 rules applied. Total rules applied 204 place count 635 transition count 1656
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 207 place count 632 transition count 1650
Iterating global reduction 1 with 3 rules applied. Total rules applied 210 place count 632 transition count 1650
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 213 place count 629 transition count 1644
Iterating global reduction 1 with 3 rules applied. Total rules applied 216 place count 629 transition count 1644
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 222 place count 629 transition count 1638
Applied a total of 222 rules in 416 ms. Remains 629 /734 variables (removed 105) and now considering 1638/1908 (removed 270) transitions.
[2023-03-12 14:49:07] [INFO ] Flow matrix only has 1093 transitions (discarded 545 similar events)
// Phase 1: matrix 1093 rows 629 cols
[2023-03-12 14:49:07] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-12 14:49:07] [INFO ] Implicit Places using invariants in 461 ms returned []
[2023-03-12 14:49:07] [INFO ] Flow matrix only has 1093 transitions (discarded 545 similar events)
[2023-03-12 14:49:07] [INFO ] Invariant cache hit.
[2023-03-12 14:49:08] [INFO ] State equation strengthened by 269 read => feed constraints.
[2023-03-12 14:49:09] [INFO ] Implicit Places using invariants and state equation in 1970 ms returned []
Implicit Place search using SMT with State Equation took 2432 ms to find 0 implicit places.
[2023-03-12 14:49:09] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-12 14:49:09] [INFO ] Flow matrix only has 1093 transitions (discarded 545 similar events)
[2023-03-12 14:49:09] [INFO ] Invariant cache hit.
[2023-03-12 14:49:10] [INFO ] Dead Transitions using invariants and state equation in 565 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 629/734 places, 1638/1908 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3449 ms. Remains : 629/734 places, 1638/1908 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 3 s547), p0:(LEQ s554 s615)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 626 ms.
Product exploration explored 100000 steps with 4 reset in 682 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 352 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10003 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:49:12] [INFO ] Flow matrix only has 1093 transitions (discarded 545 similar events)
[2023-03-12 14:49:12] [INFO ] Invariant cache hit.
[2023-03-12 14:49:12] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:49:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 14:49:12] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:49:13] [INFO ] After 270ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:49:13] [INFO ] State equation strengthened by 269 read => feed constraints.
[2023-03-12 14:49:13] [INFO ] After 73ms SMT Verify possible using 269 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 14:49:13] [INFO ] After 132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-12 14:49:13] [INFO ] After 555ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 629 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 629/629 places, 1638/1638 transitions.
Graph (complete) has 2732 edges and 629 vertex of which 437 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.0 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 437 transition count 1254
Applied a total of 385 rules in 58 ms. Remains 437 /629 variables (removed 192) and now considering 1254/1638 (removed 384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 437/629 places, 1254/1638 transitions.
Finished random walk after 9082 steps, including 2 resets, run visited all 1 properties in 27 ms. (steps per millisecond=336 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F p1)]
Knowledge based reduction with 8 factoid took 418 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
[2023-03-12 14:49:14] [INFO ] Flow matrix only has 1093 transitions (discarded 545 similar events)
[2023-03-12 14:49:14] [INFO ] Invariant cache hit.
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F p1), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 8 factoid took 174 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c016-LTLCardinality-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c016-LTLCardinality-12 finished in 8253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 734 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 734/734 places, 1908/1908 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 725 transition count 1888
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 725 transition count 1888
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 24 place count 725 transition count 1882
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 33 place count 716 transition count 1858
Iterating global reduction 1 with 9 rules applied. Total rules applied 42 place count 716 transition count 1858
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 50 place count 708 transition count 1838
Iterating global reduction 1 with 8 rules applied. Total rules applied 58 place count 708 transition count 1838
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 69 place count 697 transition count 1804
Iterating global reduction 1 with 11 rules applied. Total rules applied 80 place count 697 transition count 1804
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 91 place count 686 transition count 1770
Iterating global reduction 1 with 11 rules applied. Total rules applied 102 place count 686 transition count 1770
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 113 place count 675 transition count 1748
Iterating global reduction 1 with 11 rules applied. Total rules applied 124 place count 675 transition count 1748
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 135 place count 664 transition count 1726
Iterating global reduction 1 with 11 rules applied. Total rules applied 146 place count 664 transition count 1726
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 158 place count 652 transition count 1696
Iterating global reduction 1 with 12 rules applied. Total rules applied 170 place count 652 transition count 1696
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 180 place count 642 transition count 1668
Iterating global reduction 1 with 10 rules applied. Total rules applied 190 place count 642 transition count 1668
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 200 place count 632 transition count 1646
Iterating global reduction 1 with 10 rules applied. Total rules applied 210 place count 632 transition count 1646
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 214 place count 628 transition count 1638
Iterating global reduction 1 with 4 rules applied. Total rules applied 218 place count 628 transition count 1638
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 222 place count 624 transition count 1630
Iterating global reduction 1 with 4 rules applied. Total rules applied 226 place count 624 transition count 1630
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 230 place count 620 transition count 1622
Iterating global reduction 1 with 4 rules applied. Total rules applied 234 place count 620 transition count 1622
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 238 place count 616 transition count 1614
Iterating global reduction 1 with 4 rules applied. Total rules applied 242 place count 616 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 243 place count 615 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 244 place count 615 transition count 1612
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 248 place count 615 transition count 1608
Applied a total of 248 rules in 437 ms. Remains 615 /734 variables (removed 119) and now considering 1608/1908 (removed 300) transitions.
[2023-03-12 14:49:15] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2023-03-12 14:49:15] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-12 14:49:16] [INFO ] Implicit Places using invariants in 468 ms returned []
[2023-03-12 14:49:16] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-12 14:49:16] [INFO ] Invariant cache hit.
[2023-03-12 14:49:16] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:49:18] [INFO ] Implicit Places using invariants and state equation in 1946 ms returned []
Implicit Place search using SMT with State Equation took 2415 ms to find 0 implicit places.
[2023-03-12 14:49:18] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-12 14:49:18] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-12 14:49:18] [INFO ] Invariant cache hit.
[2023-03-12 14:49:18] [INFO ] Dead Transitions using invariants and state equation in 564 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 615/734 places, 1608/1908 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3454 ms. Remains : 615/734 places, 1608/1908 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s544)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3103 steps with 4 reset in 24 ms.
FORMULA FunctionPointer-PT-c016-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLCardinality-14 finished in 3529 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : FunctionPointer-PT-c016-LTLCardinality-07
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 734 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 734/734 places, 1908/1908 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 725 transition count 1888
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 725 transition count 1888
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 26 place count 725 transition count 1880
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 35 place count 716 transition count 1858
Iterating global reduction 1 with 9 rules applied. Total rules applied 44 place count 716 transition count 1858
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 52 place count 708 transition count 1840
Iterating global reduction 1 with 8 rules applied. Total rules applied 60 place count 708 transition count 1840
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 72 place count 696 transition count 1800
Iterating global reduction 1 with 12 rules applied. Total rules applied 84 place count 696 transition count 1800
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 96 place count 684 transition count 1760
Iterating global reduction 1 with 12 rules applied. Total rules applied 108 place count 684 transition count 1760
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 120 place count 672 transition count 1736
Iterating global reduction 1 with 12 rules applied. Total rules applied 132 place count 672 transition count 1736
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 144 place count 660 transition count 1712
Iterating global reduction 1 with 12 rules applied. Total rules applied 156 place count 660 transition count 1712
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 168 place count 648 transition count 1684
Iterating global reduction 1 with 12 rules applied. Total rules applied 180 place count 648 transition count 1684
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 191 place count 637 transition count 1656
Iterating global reduction 1 with 11 rules applied. Total rules applied 202 place count 637 transition count 1656
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 213 place count 626 transition count 1632
Iterating global reduction 1 with 11 rules applied. Total rules applied 224 place count 626 transition count 1632
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 227 place count 623 transition count 1626
Iterating global reduction 1 with 3 rules applied. Total rules applied 230 place count 623 transition count 1626
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 233 place count 620 transition count 1620
Iterating global reduction 1 with 3 rules applied. Total rules applied 236 place count 620 transition count 1620
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 239 place count 617 transition count 1614
Iterating global reduction 1 with 3 rules applied. Total rules applied 242 place count 617 transition count 1614
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 245 place count 614 transition count 1608
Iterating global reduction 1 with 3 rules applied. Total rules applied 248 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 249 place count 613 transition count 1606
Iterating global reduction 1 with 1 rules applied. Total rules applied 250 place count 613 transition count 1606
Applied a total of 250 rules in 302 ms. Remains 613 /734 variables (removed 121) and now considering 1606/1908 (removed 302) transitions.
[2023-03-12 14:49:19] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2023-03-12 14:49:19] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-12 14:49:19] [INFO ] Implicit Places using invariants in 439 ms returned []
[2023-03-12 14:49:19] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-12 14:49:19] [INFO ] Invariant cache hit.
[2023-03-12 14:49:20] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:49:21] [INFO ] Implicit Places using invariants and state equation in 1633 ms returned []
Implicit Place search using SMT with State Equation took 2084 ms to find 0 implicit places.
[2023-03-12 14:49:21] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-12 14:49:21] [INFO ] Invariant cache hit.
[2023-03-12 14:49:21] [INFO ] Dead Transitions using invariants and state equation in 517 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 613/734 places, 1606/1908 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2905 ms. Remains : 613/734 places, 1606/1908 transitions.
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LEQ s533 s474) (LEQ s70 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3 reset in 493 ms.
Product exploration explored 100000 steps with 1 reset in 571 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 511803 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :{}
Probabilistic random walk after 511803 steps, saw 332194 distinct states, run finished after 3002 ms. (steps per millisecond=170 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:49:26] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-12 14:49:26] [INFO ] Invariant cache hit.
[2023-03-12 14:49:26] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:49:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 14:49:26] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:49:26] [INFO ] After 248ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:49:26] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:49:26] [INFO ] After 73ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 14:49:26] [INFO ] After 146ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-12 14:49:26] [INFO ] After 526ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Graph (complete) has 2679 edges and 613 vertex of which 421 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 421 transition count 1222
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 389 place count 421 transition count 1218
Applied a total of 389 rules in 88 ms. Remains 421 /613 variables (removed 192) and now considering 1218/1606 (removed 388) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 421/613 places, 1218/1606 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Finished Best-First random walk after 5093 steps, including 1 resets, run visited all 1 properties in 4 ms. (steps per millisecond=1273 )
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Applied a total of 0 rules in 17 ms. Remains 613 /613 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
[2023-03-12 14:49:27] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-12 14:49:27] [INFO ] Invariant cache hit.
[2023-03-12 14:49:27] [INFO ] Implicit Places using invariants in 419 ms returned []
[2023-03-12 14:49:27] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-12 14:49:27] [INFO ] Invariant cache hit.
[2023-03-12 14:49:28] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:49:29] [INFO ] Implicit Places using invariants and state equation in 1547 ms returned []
Implicit Place search using SMT with State Equation took 2004 ms to find 0 implicit places.
[2023-03-12 14:49:29] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-12 14:49:29] [INFO ] Invariant cache hit.
[2023-03-12 14:49:29] [INFO ] Dead Transitions using invariants and state equation in 564 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2587 ms. Remains : 613/613 places, 1606/1606 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 505952 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :{}
Probabilistic random walk after 505952 steps, saw 328396 distinct states, run finished after 3002 ms. (steps per millisecond=168 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:49:33] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-12 14:49:33] [INFO ] Invariant cache hit.
[2023-03-12 14:49:33] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:49:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 14:49:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:49:33] [INFO ] After 266ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:49:33] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:49:33] [INFO ] After 86ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 14:49:33] [INFO ] After 176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-12 14:49:33] [INFO ] After 619ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Graph (complete) has 2679 edges and 613 vertex of which 421 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 421 transition count 1222
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 389 place count 421 transition count 1218
Applied a total of 389 rules in 88 ms. Remains 421 /613 variables (removed 192) and now considering 1218/1606 (removed 388) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 421/613 places, 1218/1606 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 602021 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :{}
Probabilistic random walk after 602021 steps, saw 369149 distinct states, run finished after 3001 ms. (steps per millisecond=200 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:49:36] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2023-03-12 14:49:36] [INFO ] Computed 3 place invariants in 7 ms
[2023-03-12 14:49:37] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:49:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-12 14:49:37] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:49:37] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-12 14:49:37] [INFO ] After 61ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 14:49:37] [INFO ] After 117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-12 14:49:37] [INFO ] After 379ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 48 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 48 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2023-03-12 14:49:37] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-12 14:49:37] [INFO ] Invariant cache hit.
[2023-03-12 14:49:37] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-12 14:49:37] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-12 14:49:37] [INFO ] Invariant cache hit.
[2023-03-12 14:49:38] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-12 14:49:38] [INFO ] Implicit Places using invariants and state equation in 957 ms returned []
Implicit Place search using SMT with State Equation took 1264 ms to find 0 implicit places.
[2023-03-12 14:49:38] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-12 14:49:38] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-12 14:49:38] [INFO ] Invariant cache hit.
[2023-03-12 14:49:39] [INFO ] Dead Transitions using invariants and state equation in 386 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1732 ms. Remains : 421/421 places, 1218/1218 transitions.
Ensure Unique test removed 530 transitions
Reduce isomorphic transitions removed 530 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 540 rules applied. Total rules applied 540 place count 421 transition count 678
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 550 place count 411 transition count 678
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 550 place count 411 transition count 606
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 694 place count 339 transition count 606
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 252 rules applied. Total rules applied 946 place count 213 transition count 480
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 1009 place count 150 transition count 354
Iterating global reduction 2 with 63 rules applied. Total rules applied 1072 place count 150 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1073 place count 150 transition count 353
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1135 place count 88 transition count 229
Iterating global reduction 3 with 62 rules applied. Total rules applied 1197 place count 88 transition count 229
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 1258 place count 27 transition count 107
Iterating global reduction 3 with 61 rules applied. Total rules applied 1319 place count 27 transition count 107
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 1379 place count 27 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1381 place count 26 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1383 place count 25 transition count 49
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 1387 place count 25 transition count 45
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1388 place count 25 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1389 place count 24 transition count 44
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1390 place count 24 transition count 43
Applied a total of 1390 rules in 24 ms. Remains 24 /421 variables (removed 397) and now considering 43/1218 (removed 1175) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 43 rows 24 cols
[2023-03-12 14:49:39] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-12 14:49:39] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:49:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 14:49:39] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:49:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 14:49:39] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 14:49:39] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-12 14:49:39] [INFO ] After 49ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 490 ms.
Product exploration explored 100000 steps with 3 reset in 554 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 613 transition count 1602
Applied a total of 4 rules in 149 ms. Remains 613 /613 variables (removed 0) and now considering 1602/1606 (removed 4) transitions.
[2023-03-12 14:49:41] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-12 14:49:41] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 613 cols
[2023-03-12 14:49:41] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-12 14:49:41] [INFO ] Dead Transitions using invariants and state equation in 532 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 613/613 places, 1602/1606 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 725 ms. Remains : 613/613 places, 1602/1606 transitions.
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Applied a total of 0 rules in 18 ms. Remains 613 /613 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
[2023-03-12 14:49:41] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2023-03-12 14:49:41] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-12 14:49:42] [INFO ] Implicit Places using invariants in 435 ms returned []
[2023-03-12 14:49:42] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-12 14:49:42] [INFO ] Invariant cache hit.
[2023-03-12 14:49:42] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:49:43] [INFO ] Implicit Places using invariants and state equation in 1586 ms returned []
Implicit Place search using SMT with State Equation took 2026 ms to find 0 implicit places.
[2023-03-12 14:49:43] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-12 14:49:43] [INFO ] Invariant cache hit.
[2023-03-12 14:49:44] [INFO ] Dead Transitions using invariants and state equation in 562 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2607 ms. Remains : 613/613 places, 1606/1606 transitions.
Treatment of property FunctionPointer-PT-c016-LTLCardinality-07 finished in 25709 ms.
[2023-03-12 14:49:44] [INFO ] Flatten gal took : 69 ms
[2023-03-12 14:49:44] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2023-03-12 14:49:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 734 places, 1908 transitions and 7758 arcs took 14 ms.
Total runtime 112087 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1549/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : FunctionPointer-PT-c016-LTLCardinality-07

BK_STOP 1678632586171

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name FunctionPointer-PT-c016-LTLCardinality-07
ltl formula formula --ltl=/tmp/1549/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 734 places, 1908 transitions and 7758 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1549/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1549/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1549/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.210 real 0.070 user 0.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1549/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x564ec50b83f4]
1: pnml2lts-mc(+0xa2496) [0x564ec50b8496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fe9de6a9140]
3: pnml2lts-mc(+0x405be5) [0x564ec541bbe5]
4: pnml2lts-mc(+0x16b3f9) [0x564ec51813f9]
5: pnml2lts-mc(+0x164ac4) [0x564ec517aac4]
6: pnml2lts-mc(+0x272e0a) [0x564ec5288e0a]
7: pnml2lts-mc(+0xb61f0) [0x564ec50cc1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fe9de4fc4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fe9de4fc67a]
10: pnml2lts-mc(+0xa1581) [0x564ec50b7581]
11: pnml2lts-mc(+0xa1910) [0x564ec50b7910]
12: pnml2lts-mc(+0xa32a2) [0x564ec50b92a2]
13: pnml2lts-mc(+0xa50f4) [0x564ec50bb0f4]
14: pnml2lts-mc(+0x3f34b3) [0x564ec54094b3]
15: pnml2lts-mc(+0x7c63d) [0x564ec509263d]
16: pnml2lts-mc(+0x67d86) [0x564ec507dd86]
17: pnml2lts-mc(+0x60a8a) [0x564ec5076a8a]
18: pnml2lts-mc(+0x5eb15) [0x564ec5074b15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fe9de4e4d0a]
20: pnml2lts-mc(+0x6075e) [0x564ec507675e]

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-c016"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is FunctionPointer-PT-c016, 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 r169-tall-167838856300739"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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