Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.2M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716528489002

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c004
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-24 05:28:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 05:28:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 05:28:10] [INFO ] Load time of PNML (sax parser for PT used): 329 ms
[2024-05-24 05:28:10] [INFO ] Transformed 2826 places.
[2024-05-24 05:28:10] [INFO ] Transformed 8960 transitions.
[2024-05-24 05:28:11] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 514 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 43 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c004-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 1612 transition count 5962
Discarding 293 places :
Symmetric choice reduction at 1 with 293 rule applications. Total rules 309 place count 1319 transition count 3750
Iterating global reduction 1 with 293 rules applied. Total rules applied 602 place count 1319 transition count 3750
Ensure Unique test removed 396 transitions
Reduce isomorphic transitions removed 396 transitions.
Iterating post reduction 1 with 396 rules applied. Total rules applied 998 place count 1319 transition count 3354
Discarding 149 places :
Symmetric choice reduction at 2 with 149 rule applications. Total rules 1147 place count 1170 transition count 3056
Iterating global reduction 2 with 149 rules applied. Total rules applied 1296 place count 1170 transition count 3056
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 2 with 84 rules applied. Total rules applied 1380 place count 1170 transition count 2972
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1393 place count 1157 transition count 2946
Iterating global reduction 3 with 13 rules applied. Total rules applied 1406 place count 1157 transition count 2946
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1418 place count 1145 transition count 2922
Iterating global reduction 3 with 12 rules applied. Total rules applied 1430 place count 1145 transition count 2922
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1442 place count 1133 transition count 2898
Iterating global reduction 3 with 12 rules applied. Total rules applied 1454 place count 1133 transition count 2898
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1466 place count 1121 transition count 2874
Iterating global reduction 3 with 12 rules applied. Total rules applied 1478 place count 1121 transition count 2874
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1490 place count 1109 transition count 2850
Iterating global reduction 3 with 12 rules applied. Total rules applied 1502 place count 1109 transition count 2850
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1512 place count 1099 transition count 2830
Iterating global reduction 3 with 10 rules applied. Total rules applied 1522 place count 1099 transition count 2830
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1531 place count 1090 transition count 2812
Iterating global reduction 3 with 9 rules applied. Total rules applied 1540 place count 1090 transition count 2812
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 1570 place count 1060 transition count 2702
Iterating global reduction 3 with 30 rules applied. Total rules applied 1600 place count 1060 transition count 2702
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1642 place count 1018 transition count 2534
Iterating global reduction 3 with 42 rules applied. Total rules applied 1684 place count 1018 transition count 2534
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1726 place count 976 transition count 2416
Iterating global reduction 3 with 42 rules applied. Total rules applied 1768 place count 976 transition count 2416
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 1809 place count 935 transition count 2334
Iterating global reduction 3 with 41 rules applied. Total rules applied 1850 place count 935 transition count 2334
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 1891 place count 894 transition count 2252
Iterating global reduction 3 with 41 rules applied. Total rules applied 1932 place count 894 transition count 2252
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 1973 place count 853 transition count 2170
Iterating global reduction 3 with 41 rules applied. Total rules applied 2014 place count 853 transition count 2170
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 2054 place count 813 transition count 2090
Iterating global reduction 3 with 40 rules applied. Total rules applied 2094 place count 813 transition count 2090
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 2111 place count 796 transition count 2056
Iterating global reduction 3 with 17 rules applied. Total rules applied 2128 place count 796 transition count 2056
Applied a total of 2128 rules in 1353 ms. Remains 796 /1628 variables (removed 832) and now considering 2056/5962 (removed 3906) transitions.
[2024-05-24 05:28:12] [INFO ] Flow matrix only has 1386 transitions (discarded 670 similar events)
// Phase 1: matrix 1386 rows 796 cols
[2024-05-24 05:28:12] [INFO ] Computed 2 invariants in 43 ms
[2024-05-24 05:28:13] [INFO ] Implicit Places using invariants in 731 ms returned []
[2024-05-24 05:28:13] [INFO ] Flow matrix only has 1386 transitions (discarded 670 similar events)
[2024-05-24 05:28:13] [INFO ] Invariant cache hit.
[2024-05-24 05:28:13] [INFO ] State equation strengthened by 333 read => feed constraints.
[2024-05-24 05:28:16] [INFO ] Implicit Places using invariants and state equation in 3245 ms returned []
Implicit Place search using SMT with State Equation took 4106 ms to find 0 implicit places.
[2024-05-24 05:28:16] [INFO ] Flow matrix only has 1386 transitions (discarded 670 similar events)
[2024-05-24 05:28:16] [INFO ] Invariant cache hit.
[2024-05-24 05:28:17] [INFO ] Dead Transitions using invariants and state equation in 695 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 796/1628 places, 2056/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6161 ms. Remains : 796/1628 places, 2056/5962 transitions.
Support contains 27 out of 796 places after structural reductions.
[2024-05-24 05:28:17] [INFO ] Flatten gal took : 172 ms
[2024-05-24 05:28:17] [INFO ] Flatten gal took : 105 ms
[2024-05-24 05:28:18] [INFO ] Input system was already deterministic with 2056 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 20) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2024-05-24 05:28:18] [INFO ] Flow matrix only has 1386 transitions (discarded 670 similar events)
[2024-05-24 05:28:18] [INFO ] Invariant cache hit.
[2024-05-24 05:28:18] [INFO ] After 333ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-24 05:28:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 05:28:19] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-24 05:28:20] [INFO ] After 863ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :14
[2024-05-24 05:28:20] [INFO ] State equation strengthened by 333 read => feed constraints.
[2024-05-24 05:28:20] [INFO ] After 685ms SMT Verify possible using 333 Read/Feed constraints in natural domain returned unsat :1 sat :14
[2024-05-24 05:28:21] [INFO ] After 1700ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :14
Attempting to minimize the solution found.
Minimization took 566 ms.
[2024-05-24 05:28:22] [INFO ] After 3633ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :14
Fused 15 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 22 out of 796 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 796/796 places, 2056/2056 transitions.
Graph (complete) has 3358 edges and 796 vertex of which 607 are kept as prefixes of interest. Removing 189 places using SCC suffix rule.5 ms
Discarding 189 places :
Also discarding 0 output transitions
Drop transitions removed 379 transitions
Reduce isomorphic transitions removed 379 transitions.
Iterating post reduction 0 with 379 rules applied. Total rules applied 380 place count 607 transition count 1677
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 382 place count 605 transition count 1673
Iterating global reduction 1 with 2 rules applied. Total rules applied 384 place count 605 transition count 1673
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 386 place count 605 transition count 1671
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 388 place count 603 transition count 1667
Iterating global reduction 2 with 2 rules applied. Total rules applied 390 place count 603 transition count 1667
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 392 place count 601 transition count 1663
Iterating global reduction 2 with 2 rules applied. Total rules applied 394 place count 601 transition count 1663
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 399 place count 596 transition count 1645
Iterating global reduction 2 with 5 rules applied. Total rules applied 404 place count 596 transition count 1645
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 409 place count 591 transition count 1627
Iterating global reduction 2 with 5 rules applied. Total rules applied 414 place count 591 transition count 1627
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 419 place count 586 transition count 1617
Iterating global reduction 2 with 5 rules applied. Total rules applied 424 place count 586 transition count 1617
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 430 place count 580 transition count 1601
Iterating global reduction 2 with 6 rules applied. Total rules applied 436 place count 580 transition count 1601
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 442 place count 574 transition count 1585
Iterating global reduction 2 with 6 rules applied. Total rules applied 448 place count 574 transition count 1585
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 454 place count 568 transition count 1573
Iterating global reduction 2 with 6 rules applied. Total rules applied 460 place count 568 transition count 1573
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 466 place count 562 transition count 1561
Iterating global reduction 2 with 6 rules applied. Total rules applied 472 place count 562 transition count 1561
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 474 place count 560 transition count 1557
Iterating global reduction 2 with 2 rules applied. Total rules applied 476 place count 560 transition count 1557
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 478 place count 558 transition count 1553
Iterating global reduction 2 with 2 rules applied. Total rules applied 480 place count 558 transition count 1553
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 482 place count 556 transition count 1549
Iterating global reduction 2 with 2 rules applied. Total rules applied 484 place count 556 transition count 1549
Drop transitions removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 2 with 32 rules applied. Total rules applied 516 place count 556 transition count 1517
Applied a total of 516 rules in 442 ms. Remains 556 /796 variables (removed 240) and now considering 1517/2056 (removed 539) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 443 ms. Remains : 556/796 places, 1517/2056 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-24 05:28:23] [INFO ] Flow matrix only has 904 transitions (discarded 613 similar events)
// Phase 1: matrix 904 rows 556 cols
[2024-05-24 05:28:23] [INFO ] Computed 3 invariants in 8 ms
[2024-05-24 05:28:23] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:28:23] [INFO ] After 348ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:3
[2024-05-24 05:28:23] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-24 05:28:24] [INFO ] After 89ms SMT Verify possible using 127 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-24 05:28:24] [INFO ] After 599ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-24 05:28:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:28:24] [INFO ] After 324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-24 05:28:24] [INFO ] After 206ms SMT Verify possible using 127 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-24 05:28:24] [INFO ] After 465ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 159 ms.
[2024-05-24 05:28:25] [INFO ] After 1083ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 4 ms.
Support contains 7 out of 556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 1517/1517 transitions.
Graph (complete) has 2584 edges and 556 vertex of which 553 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 553 transition count 1512
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 17 place count 542 transition count 1488
Iterating global reduction 1 with 11 rules applied. Total rules applied 28 place count 542 transition count 1488
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 32 place count 542 transition count 1484
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 42 place count 532 transition count 1458
Iterating global reduction 2 with 10 rules applied. Total rules applied 52 place count 532 transition count 1458
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 62 place count 522 transition count 1432
Iterating global reduction 2 with 10 rules applied. Total rules applied 72 place count 522 transition count 1432
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 84 place count 510 transition count 1400
Iterating global reduction 2 with 12 rules applied. Total rules applied 96 place count 510 transition count 1400
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 107 place count 499 transition count 1378
Iterating global reduction 2 with 11 rules applied. Total rules applied 118 place count 499 transition count 1378
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 129 place count 488 transition count 1356
Iterating global reduction 2 with 11 rules applied. Total rules applied 140 place count 488 transition count 1356
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 151 place count 477 transition count 1334
Iterating global reduction 2 with 11 rules applied. Total rules applied 162 place count 477 transition count 1334
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 172 place count 467 transition count 1314
Iterating global reduction 2 with 10 rules applied. Total rules applied 182 place count 467 transition count 1314
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 189 place count 460 transition count 1300
Iterating global reduction 2 with 7 rules applied. Total rules applied 196 place count 460 transition count 1300
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 200 place count 456 transition count 1292
Iterating global reduction 2 with 4 rules applied. Total rules applied 204 place count 456 transition count 1292
Applied a total of 204 rules in 160 ms. Remains 456 /556 variables (removed 100) and now considering 1292/1517 (removed 225) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 456/556 places, 1292/1517 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-24 05:28:25] [INFO ] Flow matrix only has 740 transitions (discarded 552 similar events)
// Phase 1: matrix 740 rows 456 cols
[2024-05-24 05:28:25] [INFO ] Computed 3 invariants in 3 ms
[2024-05-24 05:28:25] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 05:28:25] [INFO ] After 313ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 05:28:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:28:26] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 05:28:26] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-05-24 05:28:26] [INFO ] After 100ms SMT Verify possible using 86 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 05:28:26] [INFO ] After 216ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 74 ms.
[2024-05-24 05:28:26] [INFO ] After 611ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 1 properties in 3 ms.
Support contains 2 out of 456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 1292/1292 transitions.
Graph (complete) has 2225 edges and 456 vertex of which 455 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 452 transition count 1284
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 452 transition count 1284
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 10 place count 449 transition count 1278
Iterating global reduction 0 with 3 rules applied. Total rules applied 13 place count 449 transition count 1278
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 16 place count 446 transition count 1270
Iterating global reduction 0 with 3 rules applied. Total rules applied 19 place count 446 transition count 1270
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 22 place count 443 transition count 1264
Iterating global reduction 0 with 3 rules applied. Total rules applied 25 place count 443 transition count 1264
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 28 place count 440 transition count 1258
Iterating global reduction 0 with 3 rules applied. Total rules applied 31 place count 440 transition count 1258
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 34 place count 437 transition count 1252
Iterating global reduction 0 with 3 rules applied. Total rules applied 37 place count 437 transition count 1252
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 40 place count 434 transition count 1246
Iterating global reduction 0 with 3 rules applied. Total rules applied 43 place count 434 transition count 1246
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 45 place count 432 transition count 1242
Iterating global reduction 0 with 2 rules applied. Total rules applied 47 place count 432 transition count 1242
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 49 place count 430 transition count 1238
Iterating global reduction 0 with 2 rules applied. Total rules applied 51 place count 430 transition count 1238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 52 place count 429 transition count 1236
Iterating global reduction 0 with 1 rules applied. Total rules applied 53 place count 429 transition count 1236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 54 place count 428 transition count 1232
Iterating global reduction 0 with 1 rules applied. Total rules applied 55 place count 428 transition count 1232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 56 place count 427 transition count 1230
Iterating global reduction 0 with 1 rules applied. Total rules applied 57 place count 427 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 58 place count 426 transition count 1228
Iterating global reduction 0 with 1 rules applied. Total rules applied 59 place count 426 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 60 place count 425 transition count 1226
Iterating global reduction 0 with 1 rules applied. Total rules applied 61 place count 425 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 62 place count 424 transition count 1224
Iterating global reduction 0 with 1 rules applied. Total rules applied 63 place count 424 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 64 place count 423 transition count 1222
Iterating global reduction 0 with 1 rules applied. Total rules applied 65 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 66 place count 422 transition count 1220
Iterating global reduction 0 with 1 rules applied. Total rules applied 67 place count 422 transition count 1220
Applied a total of 67 rules in 186 ms. Remains 422 /456 variables (removed 34) and now considering 1220/1292 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 422/456 places, 1220/1292 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 344342 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :{}
Probabilistic random walk after 344342 steps, saw 211156 distinct states, run finished after 3002 ms. (steps per millisecond=114 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 05:28:29] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2024-05-24 05:28:29] [INFO ] Computed 3 invariants in 16 ms
[2024-05-24 05:28:29] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 05:28:30] [INFO ] After 260ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 05:28:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 05:28:30] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 05:28:30] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 05:28:30] [INFO ] After 65ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 05:28:30] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 44 ms.
[2024-05-24 05:28:30] [INFO ] After 457ms 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 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 70 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 73 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-24 05:28:30] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-24 05:28:30] [INFO ] Invariant cache hit.
[2024-05-24 05:28:30] [INFO ] Implicit Places using invariants in 308 ms returned []
[2024-05-24 05:28:30] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-24 05:28:30] [INFO ] Invariant cache hit.
[2024-05-24 05:28:31] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 05:28:31] [INFO ] Implicit Places using invariants and state equation in 896 ms returned []
Implicit Place search using SMT with State Equation took 1207 ms to find 0 implicit places.
[2024-05-24 05:28:31] [INFO ] Redundant transitions in 82 ms returned []
[2024-05-24 05:28:31] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-24 05:28:31] [INFO ] Invariant cache hit.
[2024-05-24 05:28:32] [INFO ] Dead Transitions using invariants and state equation in 380 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1759 ms. Remains : 422/422 places, 1220/1220 transitions.
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 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 541 rules applied. Total rules applied 541 place count 422 transition count 679
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 551 place count 412 transition count 679
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 551 place count 412 transition count 606
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 697 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 949 place count 213 transition count 480
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 1012 place count 150 transition count 354
Iterating global reduction 2 with 63 rules applied. Total rules applied 1075 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 1076 place count 150 transition count 353
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1138 place count 88 transition count 229
Iterating global reduction 3 with 62 rules applied. Total rules applied 1200 place count 88 transition count 229
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1262 place count 26 transition count 105
Iterating global reduction 3 with 62 rules applied. Total rules applied 1324 place count 26 transition count 105
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 3 with 62 rules applied. Total rules applied 1386 place count 26 transition count 43
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 1388 place count 25 transition count 42
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1392 place count 23 transition count 43
Applied a total of 1392 rules in 53 ms. Remains 23 /422 variables (removed 399) and now considering 43/1220 (removed 1177) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 43 rows 23 cols
[2024-05-24 05:28:32] [INFO ] Computed 3 invariants in 0 ms
[2024-05-24 05:28:32] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-24 05:28:32] [INFO ] After 12ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-24 05:28:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 05:28:32] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :2
[2024-05-24 05:28:32] [INFO ] After 9ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-24 05:28:32] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 05:28:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-24 05:28:32] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 05:28:32] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 05:28:32] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-24 05:28:32] [INFO ] After 49ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA FunctionPointer-PT-c004-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FunctionPointer-PT-c004-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA FunctionPointer-PT-c004-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 192 stabilizing places and 512 stable transitions
Graph (complete) has 4512 edges and 796 vertex of which 795 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.21 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 796 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 796/796 places, 2056/2056 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 795 transition count 2056
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 779 transition count 2020
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 779 transition count 2020
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 37 place count 779 transition count 2016
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 52 place count 764 transition count 1976
Iterating global reduction 2 with 15 rules applied. Total rules applied 67 place count 764 transition count 1976
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 82 place count 749 transition count 1930
Iterating global reduction 2 with 15 rules applied. Total rules applied 97 place count 749 transition count 1930
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 116 place count 730 transition count 1870
Iterating global reduction 2 with 19 rules applied. Total rules applied 135 place count 730 transition count 1870
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 153 place count 712 transition count 1822
Iterating global reduction 2 with 18 rules applied. Total rules applied 171 place count 712 transition count 1822
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 189 place count 694 transition count 1786
Iterating global reduction 2 with 18 rules applied. Total rules applied 207 place count 694 transition count 1786
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 226 place count 675 transition count 1744
Iterating global reduction 2 with 19 rules applied. Total rules applied 245 place count 675 transition count 1744
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 262 place count 658 transition count 1706
Iterating global reduction 2 with 17 rules applied. Total rules applied 279 place count 658 transition count 1706
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 293 place count 644 transition count 1678
Iterating global reduction 2 with 14 rules applied. Total rules applied 307 place count 644 transition count 1678
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 316 place count 635 transition count 1660
Iterating global reduction 2 with 9 rules applied. Total rules applied 325 place count 635 transition count 1660
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 329 place count 631 transition count 1648
Iterating global reduction 2 with 4 rules applied. Total rules applied 333 place count 631 transition count 1648
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 337 place count 627 transition count 1636
Iterating global reduction 2 with 4 rules applied. Total rules applied 341 place count 627 transition count 1636
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 345 place count 623 transition count 1628
Iterating global reduction 2 with 4 rules applied. Total rules applied 349 place count 623 transition count 1628
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 351 place count 621 transition count 1624
Iterating global reduction 2 with 2 rules applied. Total rules applied 353 place count 621 transition count 1624
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 355 place count 619 transition count 1620
Iterating global reduction 2 with 2 rules applied. Total rules applied 357 place count 619 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 359 place count 617 transition count 1616
Iterating global reduction 2 with 2 rules applied. Total rules applied 361 place count 617 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 363 place count 615 transition count 1612
Iterating global reduction 2 with 2 rules applied. Total rules applied 365 place count 615 transition count 1612
Applied a total of 365 rules in 446 ms. Remains 615 /796 variables (removed 181) and now considering 1612/2056 (removed 444) transitions.
[2024-05-24 05:28:33] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2024-05-24 05:28:33] [INFO ] Computed 2 invariants in 16 ms
[2024-05-24 05:28:33] [INFO ] Implicit Places using invariants in 411 ms returned []
[2024-05-24 05:28:33] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-24 05:28:33] [INFO ] Invariant cache hit.
[2024-05-24 05:28:33] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 05:28:35] [INFO ] Implicit Places using invariants and state equation in 1721 ms returned []
Implicit Place search using SMT with State Equation took 2134 ms to find 0 implicit places.
[2024-05-24 05:28:35] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-24 05:28:35] [INFO ] Invariant cache hit.
[2024-05-24 05:28:35] [INFO ] Dead Transitions using invariants and state equation in 487 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 615/796 places, 1612/2056 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3069 ms. Remains : 615/796 places, 1612/2056 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s544 s329)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 905 ms.
Product exploration explored 100000 steps with 50000 reset in 814 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 p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 25 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c004-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c004-LTLCardinality-00 finished in 5062 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(p1)))))'
Support contains 3 out of 796 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 796/796 places, 2056/2056 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 795 transition count 2056
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 16 place count 780 transition count 2024
Iterating global reduction 1 with 15 rules applied. Total rules applied 31 place count 780 transition count 2024
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 37 place count 780 transition count 2018
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 51 place count 766 transition count 1984
Iterating global reduction 2 with 14 rules applied. Total rules applied 65 place count 766 transition count 1984
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 79 place count 752 transition count 1942
Iterating global reduction 2 with 14 rules applied. Total rules applied 93 place count 752 transition count 1942
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 112 place count 733 transition count 1878
Iterating global reduction 2 with 19 rules applied. Total rules applied 131 place count 733 transition count 1878
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 149 place count 715 transition count 1826
Iterating global reduction 2 with 18 rules applied. Total rules applied 167 place count 715 transition count 1826
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 185 place count 697 transition count 1790
Iterating global reduction 2 with 18 rules applied. Total rules applied 203 place count 697 transition count 1790
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 222 place count 678 transition count 1748
Iterating global reduction 2 with 19 rules applied. Total rules applied 241 place count 678 transition count 1748
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 259 place count 660 transition count 1708
Iterating global reduction 2 with 18 rules applied. Total rules applied 277 place count 660 transition count 1708
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 293 place count 644 transition count 1676
Iterating global reduction 2 with 16 rules applied. Total rules applied 309 place count 644 transition count 1676
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 320 place count 633 transition count 1654
Iterating global reduction 2 with 11 rules applied. Total rules applied 331 place count 633 transition count 1654
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 334 place count 630 transition count 1646
Iterating global reduction 2 with 3 rules applied. Total rules applied 337 place count 630 transition count 1646
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 340 place count 627 transition count 1638
Iterating global reduction 2 with 3 rules applied. Total rules applied 343 place count 627 transition count 1638
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 346 place count 624 transition count 1632
Iterating global reduction 2 with 3 rules applied. Total rules applied 349 place count 624 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 350 place count 623 transition count 1630
Iterating global reduction 2 with 1 rules applied. Total rules applied 351 place count 623 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 352 place count 622 transition count 1628
Iterating global reduction 2 with 1 rules applied. Total rules applied 353 place count 622 transition count 1628
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 354 place count 621 transition count 1626
Iterating global reduction 2 with 1 rules applied. Total rules applied 355 place count 621 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 356 place count 620 transition count 1624
Iterating global reduction 2 with 1 rules applied. Total rules applied 357 place count 620 transition count 1624
Applied a total of 357 rules in 217 ms. Remains 620 /796 variables (removed 176) and now considering 1624/2056 (removed 432) transitions.
[2024-05-24 05:28:37] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 620 cols
[2024-05-24 05:28:37] [INFO ] Computed 2 invariants in 11 ms
[2024-05-24 05:28:38] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-05-24 05:28:38] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-24 05:28:38] [INFO ] Invariant cache hit.
[2024-05-24 05:28:38] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:28:39] [INFO ] Implicit Places using invariants and state equation in 1620 ms returned []
Implicit Place search using SMT with State Equation took 2003 ms to find 0 implicit places.
[2024-05-24 05:28:39] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-24 05:28:39] [INFO ] Invariant cache hit.
[2024-05-24 05:28:40] [INFO ] Dead Transitions using invariants and state equation in 508 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 620/796 places, 1624/2056 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2729 ms. Remains : 620/796 places, 1624/2056 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s547 s188), p1:(LEQ s537 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 664 ms.
Product exploration explored 100000 steps with 33333 reset in 698 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 p0 p1), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 93 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c004-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c004-LTLCardinality-01 finished in 4352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 4 out of 796 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 796/796 places, 2056/2056 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 782 transition count 2026
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 782 transition count 2026
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 34 place count 782 transition count 2020
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 47 place count 769 transition count 1986
Iterating global reduction 1 with 13 rules applied. Total rules applied 60 place count 769 transition count 1986
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 73 place count 756 transition count 1946
Iterating global reduction 1 with 13 rules applied. Total rules applied 86 place count 756 transition count 1946
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 104 place count 738 transition count 1886
Iterating global reduction 1 with 18 rules applied. Total rules applied 122 place count 738 transition count 1886
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 139 place count 721 transition count 1836
Iterating global reduction 1 with 17 rules applied. Total rules applied 156 place count 721 transition count 1836
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 173 place count 704 transition count 1802
Iterating global reduction 1 with 17 rules applied. Total rules applied 190 place count 704 transition count 1802
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 208 place count 686 transition count 1762
Iterating global reduction 1 with 18 rules applied. Total rules applied 226 place count 686 transition count 1762
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 243 place count 669 transition count 1724
Iterating global reduction 1 with 17 rules applied. Total rules applied 260 place count 669 transition count 1724
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 274 place count 655 transition count 1696
Iterating global reduction 1 with 14 rules applied. Total rules applied 288 place count 655 transition count 1696
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 298 place count 645 transition count 1676
Iterating global reduction 1 with 10 rules applied. Total rules applied 308 place count 645 transition count 1676
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 310 place count 643 transition count 1672
Iterating global reduction 1 with 2 rules applied. Total rules applied 312 place count 643 transition count 1672
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 314 place count 641 transition count 1668
Iterating global reduction 1 with 2 rules applied. Total rules applied 316 place count 641 transition count 1668
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 318 place count 639 transition count 1664
Iterating global reduction 1 with 2 rules applied. Total rules applied 320 place count 639 transition count 1664
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 326 place count 639 transition count 1658
Applied a total of 326 rules in 531 ms. Remains 639 /796 variables (removed 157) and now considering 1658/2056 (removed 398) transitions.
[2024-05-24 05:28:42] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
// Phase 1: matrix 1109 rows 639 cols
[2024-05-24 05:28:42] [INFO ] Computed 2 invariants in 14 ms
[2024-05-24 05:28:43] [INFO ] Implicit Places using invariants in 401 ms returned []
[2024-05-24 05:28:43] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2024-05-24 05:28:43] [INFO ] Invariant cache hit.
[2024-05-24 05:28:43] [INFO ] State equation strengthened by 273 read => feed constraints.
[2024-05-24 05:28:44] [INFO ] Implicit Places using invariants and state equation in 1824 ms returned []
Implicit Place search using SMT with State Equation took 2227 ms to find 0 implicit places.
[2024-05-24 05:28:44] [INFO ] Redundant transitions in 39 ms returned []
[2024-05-24 05:28:44] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2024-05-24 05:28:44] [INFO ] Invariant cache hit.
[2024-05-24 05:28:45] [INFO ] Dead Transitions using invariants and state equation in 486 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 639/796 places, 1658/2056 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3294 ms. Remains : 639/796 places, 1658/2056 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s551 s426), p0:(OR (LEQ 1 s544) (GT 2 s574))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 396 ms.
Product exploration explored 100000 steps with 0 reset in 550 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Graph (complete) has 3686 edges and 639 vertex of which 638 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 87 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :1
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
Running SMT prover for 1 properties.
[2024-05-24 05:28:46] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2024-05-24 05:28:46] [INFO ] Invariant cache hit.
[2024-05-24 05:28:46] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 05:28:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 05:28:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:28:47] [INFO ] After 270ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 05:28:47] [INFO ] State equation strengthened by 273 read => feed constraints.
[2024-05-24 05:28:47] [INFO ] After 90ms SMT Verify possible using 273 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 05:28:47] [INFO ] After 147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2024-05-24 05:28:47] [INFO ] After 563ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 639 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 639/639 places, 1658/1658 transitions.
Graph (complete) has 2770 edges and 639 vertex of which 447 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 447 transition count 1274
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 447 transition count 1272
Applied a total of 387 rules in 99 ms. Remains 447 /639 variables (removed 192) and now considering 1272/1658 (removed 386) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 447/639 places, 1272/1658 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 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 568010 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :{}
Probabilistic random walk after 568010 steps, saw 348296 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 05:28:50] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
// Phase 1: matrix 726 rows 447 cols
[2024-05-24 05:28:50] [INFO ] Computed 3 invariants in 6 ms
[2024-05-24 05:28:50] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 05:28:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 05:28:50] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 05:28:50] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-24 05:28:50] [INFO ] After 46ms SMT Verify possible using 83 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 05:28:50] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2024-05-24 05:28:50] [INFO ] After 352ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 1272/1272 transitions.
Applied a total of 0 rules in 47 ms. Remains 447 /447 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 447/447 places, 1272/1272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 1272/1272 transitions.
Applied a total of 0 rules in 46 ms. Remains 447 /447 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
[2024-05-24 05:28:50] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
[2024-05-24 05:28:50] [INFO ] Invariant cache hit.
[2024-05-24 05:28:51] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-24 05:28:51] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
[2024-05-24 05:28:51] [INFO ] Invariant cache hit.
[2024-05-24 05:28:51] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-24 05:28:52] [INFO ] Implicit Places using invariants and state equation in 888 ms returned []
Implicit Place search using SMT with State Equation took 1190 ms to find 0 implicit places.
[2024-05-24 05:28:52] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-24 05:28:52] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
[2024-05-24 05:28:52] [INFO ] Invariant cache hit.
[2024-05-24 05:28:52] [INFO ] Dead Transitions using invariants and state equation in 386 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1647 ms. Remains : 447/447 places, 1272/1272 transitions.
Ensure Unique test removed 546 transitions
Reduce isomorphic transitions removed 546 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 562 rules applied. Total rules applied 562 place count 447 transition count 710
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 578 place count 431 transition count 710
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 578 place count 431 transition count 631
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 736 place count 352 transition count 631
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 1 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 990 place count 225 transition count 504
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 1053 place count 162 transition count 378
Iterating global reduction 2 with 63 rules applied. Total rules applied 1116 place count 162 transition count 378
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1118 place count 162 transition count 376
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1180 place count 100 transition count 252
Iterating global reduction 3 with 62 rules applied. Total rules applied 1242 place count 100 transition count 252
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1304 place count 38 transition count 128
Iterating global reduction 3 with 62 rules applied. Total rules applied 1366 place count 38 transition count 128
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 3 with 62 rules applied. Total rules applied 1428 place count 38 transition count 66
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 1430 place count 37 transition count 65
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1436 place count 34 transition count 66
Applied a total of 1436 rules in 29 ms. Remains 34 /447 variables (removed 413) and now considering 66/1272 (removed 1206) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 66 rows 34 cols
[2024-05-24 05:28:52] [INFO ] Computed 3 invariants in 0 ms
[2024-05-24 05:28:52] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 05:28:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-24 05:28:52] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 05:28:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 05:28:52] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 05:28:52] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-24 05:28:52] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 107 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 639 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 639/639 places, 1658/1658 transitions.
Applied a total of 0 rules in 79 ms. Remains 639 /639 variables (removed 0) and now considering 1658/1658 (removed 0) transitions.
[2024-05-24 05:28:53] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
// Phase 1: matrix 1109 rows 639 cols
[2024-05-24 05:28:53] [INFO ] Computed 2 invariants in 15 ms
[2024-05-24 05:28:53] [INFO ] Implicit Places using invariants in 407 ms returned []
[2024-05-24 05:28:53] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2024-05-24 05:28:53] [INFO ] Invariant cache hit.
[2024-05-24 05:28:53] [INFO ] State equation strengthened by 273 read => feed constraints.
[2024-05-24 05:28:55] [INFO ] Implicit Places using invariants and state equation in 2009 ms returned []
Implicit Place search using SMT with State Equation took 2419 ms to find 0 implicit places.
[2024-05-24 05:28:55] [INFO ] Redundant transitions in 41 ms returned []
[2024-05-24 05:28:55] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2024-05-24 05:28:55] [INFO ] Invariant cache hit.
[2024-05-24 05:28:56] [INFO ] Dead Transitions using invariants and state equation in 528 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3074 ms. Remains : 639/639 places, 1658/1658 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Graph (complete) has 3686 edges and 639 vertex of which 638 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 88 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 253923 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 253923 steps, saw 164825 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 05:28:59] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2024-05-24 05:28:59] [INFO ] Invariant cache hit.
[2024-05-24 05:28:59] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 05:28:59] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:28:59] [INFO ] After 373ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 05:28:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 05:28:59] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:29:00] [INFO ] After 286ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 05:29:00] [INFO ] State equation strengthened by 273 read => feed constraints.
[2024-05-24 05:29:00] [INFO ] After 111ms SMT Verify possible using 273 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 05:29:00] [INFO ] After 219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 62 ms.
[2024-05-24 05:29:00] [INFO ] After 678ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 639 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 639/639 places, 1658/1658 transitions.
Graph (complete) has 2770 edges and 639 vertex of which 447 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 447 transition count 1274
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 447 transition count 1272
Applied a total of 387 rules in 108 ms. Remains 447 /639 variables (removed 192) and now considering 1272/1658 (removed 386) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 447/639 places, 1272/1658 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) 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.
[2024-05-24 05:29:00] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
// Phase 1: matrix 726 rows 447 cols
[2024-05-24 05:29:00] [INFO ] Computed 3 invariants in 3 ms
[2024-05-24 05:29:00] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 05:29:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 05:29:00] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 05:29:00] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-24 05:29:00] [INFO ] After 49ms SMT Verify possible using 83 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 05:29:00] [INFO ] After 88ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2024-05-24 05:29:01] [INFO ] After 359ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 1272/1272 transitions.
Applied a total of 0 rules in 47 ms. Remains 447 /447 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 447/447 places, 1272/1272 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 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 576831 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :{}
Probabilistic random walk after 576831 steps, saw 353704 distinct states, run finished after 3001 ms. (steps per millisecond=192 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 05:29:04] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
[2024-05-24 05:29:04] [INFO ] Invariant cache hit.
[2024-05-24 05:29:04] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 05:29:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 05:29:04] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 05:29:04] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-24 05:29:04] [INFO ] After 55ms SMT Verify possible using 83 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 05:29:04] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-24 05:29:04] [INFO ] After 360ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 1272/1272 transitions.
Applied a total of 0 rules in 46 ms. Remains 447 /447 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 447/447 places, 1272/1272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 1272/1272 transitions.
Applied a total of 0 rules in 45 ms. Remains 447 /447 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
[2024-05-24 05:29:04] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
[2024-05-24 05:29:04] [INFO ] Invariant cache hit.
[2024-05-24 05:29:04] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-24 05:29:04] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
[2024-05-24 05:29:04] [INFO ] Invariant cache hit.
[2024-05-24 05:29:05] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-24 05:29:05] [INFO ] Implicit Places using invariants and state equation in 833 ms returned []
Implicit Place search using SMT with State Equation took 1135 ms to find 0 implicit places.
[2024-05-24 05:29:05] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-24 05:29:05] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
[2024-05-24 05:29:05] [INFO ] Invariant cache hit.
[2024-05-24 05:29:06] [INFO ] Dead Transitions using invariants and state equation in 370 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1581 ms. Remains : 447/447 places, 1272/1272 transitions.
Ensure Unique test removed 546 transitions
Reduce isomorphic transitions removed 546 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 562 rules applied. Total rules applied 562 place count 447 transition count 710
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 578 place count 431 transition count 710
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 578 place count 431 transition count 631
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 736 place count 352 transition count 631
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 990 place count 225 transition count 504
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 1053 place count 162 transition count 378
Iterating global reduction 2 with 63 rules applied. Total rules applied 1116 place count 162 transition count 378
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1118 place count 162 transition count 376
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1180 place count 100 transition count 252
Iterating global reduction 3 with 62 rules applied. Total rules applied 1242 place count 100 transition count 252
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1304 place count 38 transition count 128
Iterating global reduction 3 with 62 rules applied. Total rules applied 1366 place count 38 transition count 128
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 3 with 62 rules applied. Total rules applied 1428 place count 38 transition count 66
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 1430 place count 37 transition count 65
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1436 place count 34 transition count 66
Applied a total of 1436 rules in 25 ms. Remains 34 /447 variables (removed 413) and now considering 66/1272 (removed 1206) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 66 rows 34 cols
[2024-05-24 05:29:06] [INFO ] Computed 3 invariants in 0 ms
[2024-05-24 05:29:06] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 05:29:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-24 05:29:06] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 05:29:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 05:29:06] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 05:29:06] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-24 05:29:06] [INFO ] After 47ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 97 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 378 ms.
Product exploration explored 100000 steps with 0 reset in 429 ms.
Built C files in :
/tmp/ltsmin6703233760684664556
[2024-05-24 05:29:07] [INFO ] Too many transitions (1658) to apply POR reductions. Disabling POR matrices.
[2024-05-24 05:29:07] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6703233760684664556
Running compilation step : cd /tmp/ltsmin6703233760684664556;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2893 ms.
Running link step : cd /tmp/ltsmin6703233760684664556;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin6703233760684664556;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9228550017497775753.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 639 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 639/639 places, 1658/1658 transitions.
Applied a total of 0 rules in 83 ms. Remains 639 /639 variables (removed 0) and now considering 1658/1658 (removed 0) transitions.
[2024-05-24 05:29:22] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
// Phase 1: matrix 1109 rows 639 cols
[2024-05-24 05:29:22] [INFO ] Computed 2 invariants in 14 ms
[2024-05-24 05:29:22] [INFO ] Implicit Places using invariants in 414 ms returned []
[2024-05-24 05:29:22] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2024-05-24 05:29:22] [INFO ] Invariant cache hit.
[2024-05-24 05:29:23] [INFO ] State equation strengthened by 273 read => feed constraints.
[2024-05-24 05:29:24] [INFO ] Implicit Places using invariants and state equation in 1672 ms returned []
Implicit Place search using SMT with State Equation took 2091 ms to find 0 implicit places.
[2024-05-24 05:29:24] [INFO ] Redundant transitions in 25 ms returned []
[2024-05-24 05:29:24] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2024-05-24 05:29:24] [INFO ] Invariant cache hit.
[2024-05-24 05:29:25] [INFO ] Dead Transitions using invariants and state equation in 493 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2700 ms. Remains : 639/639 places, 1658/1658 transitions.
Built C files in :
/tmp/ltsmin10406304495135370855
[2024-05-24 05:29:25] [INFO ] Too many transitions (1658) to apply POR reductions. Disabling POR matrices.
[2024-05-24 05:29:25] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10406304495135370855
Running compilation step : cd /tmp/ltsmin10406304495135370855;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2803 ms.
Running link step : cd /tmp/ltsmin10406304495135370855;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin10406304495135370855;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13820462342676607052.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 05:29:40] [INFO ] Flatten gal took : 62 ms
[2024-05-24 05:29:40] [INFO ] Flatten gal took : 59 ms
[2024-05-24 05:29:40] [INFO ] Time to serialize gal into /tmp/LTL9126423830170961614.gal : 11 ms
[2024-05-24 05:29:40] [INFO ] Time to serialize properties into /tmp/LTL17060872718520059413.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9126423830170961614.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13525315339903277193.hoa' '-atoms' '/tmp/LTL17060872718520059413.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17060872718520059413.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13525315339903277193.hoa
Detected timeout of ITS tools.
[2024-05-24 05:29:55] [INFO ] Flatten gal took : 48 ms
[2024-05-24 05:29:55] [INFO ] Flatten gal took : 79 ms
[2024-05-24 05:29:55] [INFO ] Time to serialize gal into /tmp/LTL2879695989712484736.gal : 8 ms
[2024-05-24 05:29:55] [INFO ] Time to serialize properties into /tmp/LTL8456033744158721278.ltl : 15 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2879695989712484736.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8456033744158721278.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((p1539>=1)||(l2616<2))")))||(G("(l1659<=l932)")))))
Formula 0 simplified : G(FG!"((p1539>=1)||(l2616<2))" & F!"(l1659<=l932)")
Detected timeout of ITS tools.
[2024-05-24 05:30:10] [INFO ] Flatten gal took : 44 ms
[2024-05-24 05:30:10] [INFO ] Applying decomposition
[2024-05-24 05:30:10] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3702008822480590033.txt' '-o' '/tmp/graph3702008822480590033.bin' '-w' '/tmp/graph3702008822480590033.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3702008822480590033.bin' '-l' '-1' '-v' '-w' '/tmp/graph3702008822480590033.weights' '-q' '0' '-e' '0.001'
[2024-05-24 05:30:11] [INFO ] Decomposing Gal with order
[2024-05-24 05:30:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 05:30:11] [INFO ] Removed a total of 616 redundant transitions.
[2024-05-24 05:30:11] [INFO ] Flatten gal took : 175 ms
[2024-05-24 05:30:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 295 labels/synchronizations in 38 ms.
[2024-05-24 05:30:11] [INFO ] Time to serialize gal into /tmp/LTL14299200745780471302.gal : 37 ms
[2024-05-24 05:30:11] [INFO ] Time to serialize properties into /tmp/LTL13585497114413030737.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14299200745780471302.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13585497114413030737.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((gi0.gu0.p1539>=1)||(gi0.gu65.l2616<2))")))||(G("(gu64.l1659<=gu64.l932)")))))
Formula 0 simplified : G(FG!"((gi0.gu0.p1539>=1)||(gi0.gu65.l2616<2))" & F!"(gu64.l1659<=gu64.l932)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2923007910453579121
[2024-05-24 05:30:26] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2923007910453579121
Running compilation step : cd /tmp/ltsmin2923007910453579121;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2843 ms.
Running link step : cd /tmp/ltsmin2923007910453579121;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin2923007910453579121;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>((LTLAPp0==true)))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c004-LTLCardinality-04 finished in 119657 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((p0||(p1&&X((F(p0)||G(p1))))))) U G(p2)))'
Support contains 3 out of 796 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 796/796 places, 2056/2056 transitions.
Graph (complete) has 4512 edges and 796 vertex of which 795 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 781 transition count 2024
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 781 transition count 2024
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 33 place count 781 transition count 2020
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 46 place count 768 transition count 1984
Iterating global reduction 1 with 13 rules applied. Total rules applied 59 place count 768 transition count 1984
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 72 place count 755 transition count 1942
Iterating global reduction 1 with 13 rules applied. Total rules applied 85 place count 755 transition count 1942
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 102 place count 738 transition count 1886
Iterating global reduction 1 with 17 rules applied. Total rules applied 119 place count 738 transition count 1886
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 136 place count 721 transition count 1840
Iterating global reduction 1 with 17 rules applied. Total rules applied 153 place count 721 transition count 1840
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 170 place count 704 transition count 1806
Iterating global reduction 1 with 17 rules applied. Total rules applied 187 place count 704 transition count 1806
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 204 place count 687 transition count 1772
Iterating global reduction 1 with 17 rules applied. Total rules applied 221 place count 687 transition count 1772
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 236 place count 672 transition count 1742
Iterating global reduction 1 with 15 rules applied. Total rules applied 251 place count 672 transition count 1742
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 263 place count 660 transition count 1718
Iterating global reduction 1 with 12 rules applied. Total rules applied 275 place count 660 transition count 1718
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 282 place count 653 transition count 1704
Iterating global reduction 1 with 7 rules applied. Total rules applied 289 place count 653 transition count 1704
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 291 place count 651 transition count 1696
Iterating global reduction 1 with 2 rules applied. Total rules applied 293 place count 651 transition count 1696
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 295 place count 649 transition count 1688
Iterating global reduction 1 with 2 rules applied. Total rules applied 297 place count 649 transition count 1688
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 299 place count 647 transition count 1684
Iterating global reduction 1 with 2 rules applied. Total rules applied 301 place count 647 transition count 1684
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 303 place count 645 transition count 1680
Iterating global reduction 1 with 2 rules applied. Total rules applied 305 place count 645 transition count 1680
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 307 place count 643 transition count 1676
Iterating global reduction 1 with 2 rules applied. Total rules applied 309 place count 643 transition count 1676
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 311 place count 641 transition count 1672
Iterating global reduction 1 with 2 rules applied. Total rules applied 313 place count 641 transition count 1672
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 315 place count 639 transition count 1668
Iterating global reduction 1 with 2 rules applied. Total rules applied 317 place count 639 transition count 1668
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 325 place count 639 transition count 1660
Applied a total of 325 rules in 405 ms. Remains 639 /796 variables (removed 157) and now considering 1660/2056 (removed 396) transitions.
[2024-05-24 05:30:42] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
// Phase 1: matrix 1111 rows 639 cols
[2024-05-24 05:30:42] [INFO ] Computed 2 invariants in 13 ms
[2024-05-24 05:30:42] [INFO ] Implicit Places using invariants in 417 ms returned []
[2024-05-24 05:30:42] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2024-05-24 05:30:42] [INFO ] Invariant cache hit.
[2024-05-24 05:30:42] [INFO ] State equation strengthened by 275 read => feed constraints.
[2024-05-24 05:30:44] [INFO ] Implicit Places using invariants and state equation in 1582 ms returned []
Implicit Place search using SMT with State Equation took 2004 ms to find 0 implicit places.
[2024-05-24 05:30:44] [INFO ] Redundant transitions in 29 ms returned []
[2024-05-24 05:30:44] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2024-05-24 05:30:44] [INFO ] Invariant cache hit.
[2024-05-24 05:30:44] [INFO ] Dead Transitions using invariants and state equation in 511 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 639/796 places, 1660/2056 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2957 ms. Remains : 639/796 places, 1660/2056 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ s537 0), p0:(GT 2 s555), p1:(GT s571 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 431 ms.
Product exploration explored 100000 steps with 0 reset in 527 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 p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 81 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-24 05:30:46] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2024-05-24 05:30:46] [INFO ] Invariant cache hit.
[2024-05-24 05:30:46] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 05:30:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:30:46] [INFO ] After 250ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-24 05:30:46] [INFO ] State equation strengthened by 275 read => feed constraints.
[2024-05-24 05:30:46] [INFO ] After 71ms SMT Verify possible using 275 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 05:30:46] [INFO ] After 421ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 05:30:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 05:30:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:30:47] [INFO ] After 285ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 05:30:47] [INFO ] After 94ms SMT Verify possible using 275 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 05:30:47] [INFO ] After 196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 58 ms.
[2024-05-24 05:30:47] [INFO ] After 644ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 639 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 639/639 places, 1660/1660 transitions.
Graph (complete) has 2769 edges and 639 vertex of which 447 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 447 transition count 1276
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 386 place count 446 transition count 1274
Iterating global reduction 1 with 1 rules applied. Total rules applied 387 place count 446 transition count 1274
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 388 place count 445 transition count 1272
Iterating global reduction 1 with 1 rules applied. Total rules applied 389 place count 445 transition count 1272
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 390 place count 444 transition count 1270
Iterating global reduction 1 with 1 rules applied. Total rules applied 391 place count 444 transition count 1270
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 392 place count 443 transition count 1268
Iterating global reduction 1 with 1 rules applied. Total rules applied 393 place count 443 transition count 1268
Applied a total of 393 rules in 74 ms. Remains 443 /639 variables (removed 196) and now considering 1268/1660 (removed 392) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 443/639 places, 1268/1660 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :1
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
Running SMT prover for 1 properties.
[2024-05-24 05:30:47] [INFO ] Flow matrix only has 722 transitions (discarded 546 similar events)
// Phase 1: matrix 722 rows 443 cols
[2024-05-24 05:30:47] [INFO ] Computed 3 invariants in 6 ms
[2024-05-24 05:30:47] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 05:30:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 05:30:47] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 05:30:47] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-05-24 05:30:47] [INFO ] After 70ms SMT Verify possible using 82 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 05:30:47] [INFO ] After 107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2024-05-24 05:30:47] [INFO ] After 361ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 443 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 443/443 places, 1268/1268 transitions.
Applied a total of 0 rules in 44 ms. Remains 443 /443 variables (removed 0) and now considering 1268/1268 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 443/443 places, 1268/1268 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Finished Best-First random walk after 8533 steps, including 2 resets, run visited all 1 properties in 6 ms. (steps per millisecond=1422 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p2)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 171 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 110 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 639 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 639/639 places, 1660/1660 transitions.
Applied a total of 0 rules in 80 ms. Remains 639 /639 variables (removed 0) and now considering 1660/1660 (removed 0) transitions.
[2024-05-24 05:30:48] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
// Phase 1: matrix 1111 rows 639 cols
[2024-05-24 05:30:48] [INFO ] Computed 2 invariants in 15 ms
[2024-05-24 05:30:48] [INFO ] Implicit Places using invariants in 398 ms returned []
[2024-05-24 05:30:48] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2024-05-24 05:30:48] [INFO ] Invariant cache hit.
[2024-05-24 05:30:49] [INFO ] State equation strengthened by 275 read => feed constraints.
[2024-05-24 05:30:50] [INFO ] Implicit Places using invariants and state equation in 1689 ms returned []
Implicit Place search using SMT with State Equation took 2094 ms to find 0 implicit places.
[2024-05-24 05:30:50] [INFO ] Redundant transitions in 30 ms returned []
[2024-05-24 05:30:50] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2024-05-24 05:30:50] [INFO ] Invariant cache hit.
[2024-05-24 05:30:51] [INFO ] Dead Transitions using invariants and state equation in 488 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2699 ms. Remains : 639/639 places, 1660/1660 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 : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 87 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10003 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 256637 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 256637 steps, saw 166589 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-24 05:30:54] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2024-05-24 05:30:54] [INFO ] Invariant cache hit.
[2024-05-24 05:30:54] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 05:30:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:30:54] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-24 05:30:55] [INFO ] After 303ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 05:30:55] [INFO ] State equation strengthened by 275 read => feed constraints.
[2024-05-24 05:30:55] [INFO ] After 156ms SMT Verify possible using 275 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 05:30:55] [INFO ] After 308ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 93 ms.
[2024-05-24 05:30:55] [INFO ] After 834ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 15 ms.
Support contains 3 out of 639 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 639/639 places, 1660/1660 transitions.
Graph (complete) has 2769 edges and 639 vertex of which 447 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 447 transition count 1276
Applied a total of 385 rules in 46 ms. Remains 447 /639 variables (removed 192) and now considering 1276/1660 (removed 384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 447/639 places, 1276/1660 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :1
Finished Best-First random walk after 2330 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=776 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p2)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 176 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 110 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 120 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 407 ms.
Product exploration explored 100000 steps with 0 reset in 455 ms.
Built C files in :
/tmp/ltsmin2901509107442165495
[2024-05-24 05:30:57] [INFO ] Too many transitions (1660) to apply POR reductions. Disabling POR matrices.
[2024-05-24 05:30:57] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2901509107442165495
Running compilation step : cd /tmp/ltsmin2901509107442165495;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2837 ms.
Running link step : cd /tmp/ltsmin2901509107442165495;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin2901509107442165495;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7270900144832855240.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 639 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 639/639 places, 1660/1660 transitions.
Applied a total of 0 rules in 73 ms. Remains 639 /639 variables (removed 0) and now considering 1660/1660 (removed 0) transitions.
[2024-05-24 05:31:12] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2024-05-24 05:31:12] [INFO ] Invariant cache hit.
[2024-05-24 05:31:12] [INFO ] Implicit Places using invariants in 422 ms returned []
[2024-05-24 05:31:12] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2024-05-24 05:31:12] [INFO ] Invariant cache hit.
[2024-05-24 05:31:12] [INFO ] State equation strengthened by 275 read => feed constraints.
[2024-05-24 05:31:14] [INFO ] Implicit Places using invariants and state equation in 1572 ms returned []
Implicit Place search using SMT with State Equation took 1995 ms to find 0 implicit places.
[2024-05-24 05:31:14] [INFO ] Redundant transitions in 30 ms returned []
[2024-05-24 05:31:14] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2024-05-24 05:31:14] [INFO ] Invariant cache hit.
[2024-05-24 05:31:14] [INFO ] Dead Transitions using invariants and state equation in 492 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2598 ms. Remains : 639/639 places, 1660/1660 transitions.
Built C files in :
/tmp/ltsmin13710436541127362744
[2024-05-24 05:31:14] [INFO ] Too many transitions (1660) to apply POR reductions. Disabling POR matrices.
[2024-05-24 05:31:14] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13710436541127362744
Running compilation step : cd /tmp/ltsmin13710436541127362744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2854 ms.
Running link step : cd /tmp/ltsmin13710436541127362744;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin13710436541127362744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18261292706604655759.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 05:31:29] [INFO ] Flatten gal took : 72 ms
[2024-05-24 05:31:29] [INFO ] Flatten gal took : 55 ms
[2024-05-24 05:31:29] [INFO ] Time to serialize gal into /tmp/LTL15960875151094942614.gal : 9 ms
[2024-05-24 05:31:29] [INFO ] Time to serialize properties into /tmp/LTL9570088972878126043.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15960875151094942614.gal' '-t' 'CGAL' '-hoa' '/tmp/aut666881552654668650.hoa' '-atoms' '/tmp/LTL9570088972878126043.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL9570088972878126043.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut666881552654668650.hoa
Detected timeout of ITS tools.
[2024-05-24 05:31:45] [INFO ] Flatten gal took : 43 ms
[2024-05-24 05:31:45] [INFO ] Flatten gal took : 45 ms
[2024-05-24 05:31:45] [INFO ] Time to serialize gal into /tmp/LTL4005153457434229055.gal : 7 ms
[2024-05-24 05:31:45] [INFO ] Time to serialize properties into /tmp/LTL6909692543278479343.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4005153457434229055.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6909692543278479343.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((X(F(("(p1719<2)")||(("(l2335>0)")&&(X((F("(p1719<2)"))||(G("(l2335>0)"))))))))U(G("(l1328<=0)"))))
Formula 0 simplified : XG(!"(p1719<2)" & (!"(l2335>0)" | X(G!"(p1719<2)" & F!"(l2335>0)"))) R F!"(l1328<=0)"
Detected timeout of ITS tools.
[2024-05-24 05:32:00] [INFO ] Flatten gal took : 45 ms
[2024-05-24 05:32:00] [INFO ] Applying decomposition
[2024-05-24 05:32:00] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10210089084650187086.txt' '-o' '/tmp/graph10210089084650187086.bin' '-w' '/tmp/graph10210089084650187086.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10210089084650187086.bin' '-l' '-1' '-v' '-w' '/tmp/graph10210089084650187086.weights' '-q' '0' '-e' '0.001'
[2024-05-24 05:32:00] [INFO ] Decomposing Gal with order
[2024-05-24 05:32:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 05:32:00] [INFO ] Removed a total of 2774 redundant transitions.
[2024-05-24 05:32:00] [INFO ] Flatten gal took : 139 ms
[2024-05-24 05:32:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 1280 labels/synchronizations in 74 ms.
[2024-05-24 05:32:00] [INFO ] Time to serialize gal into /tmp/LTL15029101912131350638.gal : 22 ms
[2024-05-24 05:32:00] [INFO ] Time to serialize properties into /tmp/LTL2712097408835861044.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15029101912131350638.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2712097408835861044.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((X(F(("(i23.i2.u156.p1719<2)")||(("(i23.i3.u162.l2335>0)")&&(X((F("(i23.i2.u156.p1719<2)"))||(G("(i23.i3.u162.l2335>0)"))))))))U(G(...183
Formula 0 simplified : XG(!"(i23.i2.u156.p1719<2)" & (!"(i23.i3.u162.l2335>0)" | X(G!"(i23.i2.u156.p1719<2)" & F!"(i23.i3.u162.l2335>0)"))) R F!"(i23.i0.u1...168
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2023114708666160665
[2024-05-24 05:32:15] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2023114708666160665
Running compilation step : cd /tmp/ltsmin2023114708666160665;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2851 ms.
Running link step : cd /tmp/ltsmin2023114708666160665;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin2023114708666160665;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(<>(((LTLAPp0==true)||((LTLAPp1==true)&&X((<>((LTLAPp0==true))||[]((LTLAPp1==true)))))))) U []((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c004-LTLCardinality-05 finished in 109122 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p0))))'
Support contains 2 out of 796 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 796/796 places, 2056/2056 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 795 transition count 2056
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 16 place count 780 transition count 2022
Iterating global reduction 1 with 15 rules applied. Total rules applied 31 place count 780 transition count 2022
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 37 place count 780 transition count 2016
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 51 place count 766 transition count 1980
Iterating global reduction 2 with 14 rules applied. Total rules applied 65 place count 766 transition count 1980
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 79 place count 752 transition count 1940
Iterating global reduction 2 with 14 rules applied. Total rules applied 93 place count 752 transition count 1940
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 112 place count 733 transition count 1878
Iterating global reduction 2 with 19 rules applied. Total rules applied 131 place count 733 transition count 1878
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 149 place count 715 transition count 1826
Iterating global reduction 2 with 18 rules applied. Total rules applied 167 place count 715 transition count 1826
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 185 place count 697 transition count 1790
Iterating global reduction 2 with 18 rules applied. Total rules applied 203 place count 697 transition count 1790
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 222 place count 678 transition count 1748
Iterating global reduction 2 with 19 rules applied. Total rules applied 241 place count 678 transition count 1748
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 258 place count 661 transition count 1710
Iterating global reduction 2 with 17 rules applied. Total rules applied 275 place count 661 transition count 1710
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 290 place count 646 transition count 1680
Iterating global reduction 2 with 15 rules applied. Total rules applied 305 place count 646 transition count 1680
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 316 place count 635 transition count 1658
Iterating global reduction 2 with 11 rules applied. Total rules applied 327 place count 635 transition count 1658
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 330 place count 632 transition count 1650
Iterating global reduction 2 with 3 rules applied. Total rules applied 333 place count 632 transition count 1650
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 336 place count 629 transition count 1642
Iterating global reduction 2 with 3 rules applied. Total rules applied 339 place count 629 transition count 1642
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 342 place count 626 transition count 1636
Iterating global reduction 2 with 3 rules applied. Total rules applied 345 place count 626 transition count 1636
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 346 place count 625 transition count 1634
Iterating global reduction 2 with 1 rules applied. Total rules applied 347 place count 625 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 348 place count 624 transition count 1632
Iterating global reduction 2 with 1 rules applied. Total rules applied 349 place count 624 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 350 place count 623 transition count 1630
Iterating global reduction 2 with 1 rules applied. Total rules applied 351 place count 623 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 352 place count 622 transition count 1628
Iterating global reduction 2 with 1 rules applied. Total rules applied 353 place count 622 transition count 1628
Applied a total of 353 rules in 220 ms. Remains 622 /796 variables (removed 174) and now considering 1628/2056 (removed 428) transitions.
[2024-05-24 05:32:31] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
// Phase 1: matrix 1087 rows 622 cols
[2024-05-24 05:32:31] [INFO ] Computed 2 invariants in 13 ms
[2024-05-24 05:32:31] [INFO ] Implicit Places using invariants in 395 ms returned []
[2024-05-24 05:32:31] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-24 05:32:31] [INFO ] Invariant cache hit.
[2024-05-24 05:32:31] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:32:33] [INFO ] Implicit Places using invariants and state equation in 1690 ms returned []
Implicit Place search using SMT with State Equation took 2087 ms to find 0 implicit places.
[2024-05-24 05:32:33] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-24 05:32:33] [INFO ] Invariant cache hit.
[2024-05-24 05:32:33] [INFO ] Dead Transitions using invariants and state equation in 543 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 622/796 places, 1628/2056 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2852 ms. Remains : 622/796 places, 1628/2056 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}]], initial=1, aps=[p0:(LEQ s550 s540)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 404 ms.
Product exploration explored 100000 steps with 0 reset in 480 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 p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 69 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) 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 486051 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :{}
Probabilistic random walk after 486051 steps, saw 315480 distinct states, run finished after 3001 ms. (steps per millisecond=161 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 05:32:37] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-24 05:32:37] [INFO ] Invariant cache hit.
[2024-05-24 05:32:38] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 05:32:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:32:38] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:32:38] [INFO ] After 250ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 05:32:38] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:32:38] [INFO ] After 71ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 05:32:38] [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 63 ms.
[2024-05-24 05:32:38] [INFO ] After 543ms 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 622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 622/622 places, 1628/1628 transitions.
Graph (complete) has 2712 edges and 622 vertex of which 430 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 430 transition count 1244
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 391 place count 430 transition count 1238
Applied a total of 391 rules in 113 ms. Remains 430 /622 variables (removed 192) and now considering 1238/1628 (removed 390) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 430/622 places, 1238/1628 transitions.
Finished random walk after 3627 steps, including 1 resets, run visited all 1 properties in 11 ms. (steps per millisecond=329 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 94 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 622/622 places, 1628/1628 transitions.
Applied a total of 0 rules in 18 ms. Remains 622 /622 variables (removed 0) and now considering 1628/1628 (removed 0) transitions.
[2024-05-24 05:32:38] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-24 05:32:38] [INFO ] Invariant cache hit.
[2024-05-24 05:32:39] [INFO ] Implicit Places using invariants in 404 ms returned []
[2024-05-24 05:32:39] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-24 05:32:39] [INFO ] Invariant cache hit.
[2024-05-24 05:32:39] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:32:41] [INFO ] Implicit Places using invariants and state equation in 1754 ms returned []
Implicit Place search using SMT with State Equation took 2163 ms to find 0 implicit places.
[2024-05-24 05:32:41] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-24 05:32:41] [INFO ] Invariant cache hit.
[2024-05-24 05:32:41] [INFO ] Dead Transitions using invariants and state equation in 501 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2683 ms. Remains : 622/622 places, 1628/1628 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 p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 80 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 6788 steps, including 2 resets, run visited all 1 properties in 20 ms. (steps per millisecond=339 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 117 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 368 ms.
Product exploration explored 100000 steps with 0 reset in 417 ms.
Built C files in :
/tmp/ltsmin13793964675524244917
[2024-05-24 05:32:43] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13793964675524244917
Running compilation step : cd /tmp/ltsmin13793964675524244917;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2859 ms.
Running link step : cd /tmp/ltsmin13793964675524244917;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin13793964675524244917;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9760792978790104842.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 622/622 places, 1628/1628 transitions.
Applied a total of 0 rules in 10 ms. Remains 622 /622 variables (removed 0) and now considering 1628/1628 (removed 0) transitions.
[2024-05-24 05:32:58] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-24 05:32:58] [INFO ] Invariant cache hit.
[2024-05-24 05:32:58] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-05-24 05:32:58] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-24 05:32:58] [INFO ] Invariant cache hit.
[2024-05-24 05:32:58] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:33:00] [INFO ] Implicit Places using invariants and state equation in 1687 ms returned []
Implicit Place search using SMT with State Equation took 2068 ms to find 0 implicit places.
[2024-05-24 05:33:00] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-24 05:33:00] [INFO ] Invariant cache hit.
[2024-05-24 05:33:00] [INFO ] Dead Transitions using invariants and state equation in 467 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2547 ms. Remains : 622/622 places, 1628/1628 transitions.
Built C files in :
/tmp/ltsmin8190017673976445114
[2024-05-24 05:33:00] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8190017673976445114
Running compilation step : cd /tmp/ltsmin8190017673976445114;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2746 ms.
Running link step : cd /tmp/ltsmin8190017673976445114;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin8190017673976445114;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8400208893698656178.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 05:33:15] [INFO ] Flatten gal took : 46 ms
[2024-05-24 05:33:16] [INFO ] Flatten gal took : 43 ms
[2024-05-24 05:33:16] [INFO ] Time to serialize gal into /tmp/LTL9558067205192772619.gal : 22 ms
[2024-05-24 05:33:16] [INFO ] Time to serialize properties into /tmp/LTL12225521343957535714.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9558067205192772619.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5564472699598217382.hoa' '-atoms' '/tmp/LTL12225521343957535714.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL12225521343957535714.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5564472699598217382.hoa
Detected timeout of ITS tools.
[2024-05-24 05:33:31] [INFO ] Flatten gal took : 35 ms
[2024-05-24 05:33:31] [INFO ] Flatten gal took : 36 ms
[2024-05-24 05:33:31] [INFO ] Time to serialize gal into /tmp/LTL15096908599449048901.gal : 6 ms
[2024-05-24 05:33:31] [INFO ] Time to serialize properties into /tmp/LTL904587344632354254.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15096908599449048901.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL904587344632354254.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(("(l2093<=l1541)")||(X("(l2093<=l1541)")))))
Formula 0 simplified : F(!"(l2093<=l1541)" & X!"(l2093<=l1541)")
Detected timeout of ITS tools.
[2024-05-24 05:33:46] [INFO ] Flatten gal took : 34 ms
[2024-05-24 05:33:46] [INFO ] Applying decomposition
[2024-05-24 05:33:46] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13134207163230822788.txt' '-o' '/tmp/graph13134207163230822788.bin' '-w' '/tmp/graph13134207163230822788.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13134207163230822788.bin' '-l' '-1' '-v' '-w' '/tmp/graph13134207163230822788.weights' '-q' '0' '-e' '0.001'
[2024-05-24 05:33:46] [INFO ] Decomposing Gal with order
[2024-05-24 05:33:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 05:33:46] [INFO ] Removed a total of 1840 redundant transitions.
[2024-05-24 05:33:46] [INFO ] Flatten gal took : 185 ms
[2024-05-24 05:33:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 486 labels/synchronizations in 36 ms.
[2024-05-24 05:33:46] [INFO ] Time to serialize gal into /tmp/LTL7336822623990836907.gal : 7 ms
[2024-05-24 05:33:46] [INFO ] Time to serialize properties into /tmp/LTL15570337769237147206.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7336822623990836907.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15570337769237147206.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("(gu103.l2093<=gu103.l1541)")||(X("(gu103.l2093<=gu103.l1541)")))))
Formula 0 simplified : F(!"(gu103.l2093<=gu103.l1541)" & X!"(gu103.l2093<=gu103.l1541)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4371418131040746027
[2024-05-24 05:34:01] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4371418131040746027
Running compilation step : cd /tmp/ltsmin4371418131040746027;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2846 ms.
Running link step : cd /tmp/ltsmin4371418131040746027;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin4371418131040746027;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true)||X((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c004-LTLCardinality-06 finished in 106027 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 796 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 796/796 places, 2056/2056 transitions.
Graph (complete) has 4512 edges and 796 vertex of which 795 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 778 transition count 2018
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 778 transition count 2018
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 41 place count 778 transition count 2012
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 57 place count 762 transition count 1970
Iterating global reduction 1 with 16 rules applied. Total rules applied 73 place count 762 transition count 1970
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 89 place count 746 transition count 1922
Iterating global reduction 1 with 16 rules applied. Total rules applied 105 place count 746 transition count 1922
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 126 place count 725 transition count 1854
Iterating global reduction 1 with 21 rules applied. Total rules applied 147 place count 725 transition count 1854
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 167 place count 705 transition count 1798
Iterating global reduction 1 with 20 rules applied. Total rules applied 187 place count 705 transition count 1798
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 207 place count 685 transition count 1758
Iterating global reduction 1 with 20 rules applied. Total rules applied 227 place count 685 transition count 1758
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 248 place count 664 transition count 1712
Iterating global reduction 1 with 21 rules applied. Total rules applied 269 place count 664 transition count 1712
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 288 place count 645 transition count 1670
Iterating global reduction 1 with 19 rules applied. Total rules applied 307 place count 645 transition count 1670
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 323 place count 629 transition count 1638
Iterating global reduction 1 with 16 rules applied. Total rules applied 339 place count 629 transition count 1638
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 350 place count 618 transition count 1616
Iterating global reduction 1 with 11 rules applied. Total rules applied 361 place count 618 transition count 1616
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 364 place count 615 transition count 1608
Iterating global reduction 1 with 3 rules applied. Total rules applied 367 place count 615 transition count 1608
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 370 place count 612 transition count 1600
Iterating global reduction 1 with 3 rules applied. Total rules applied 373 place count 612 transition count 1600
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 376 place count 609 transition count 1594
Iterating global reduction 1 with 3 rules applied. Total rules applied 379 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 380 place count 608 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 381 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 382 place count 607 transition count 1590
Iterating global reduction 1 with 1 rules applied. Total rules applied 383 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 384 place count 606 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 385 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 386 place count 605 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 387 place count 605 transition count 1586
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 389 place count 605 transition count 1584
Applied a total of 389 rules in 421 ms. Remains 605 /796 variables (removed 191) and now considering 1584/2056 (removed 472) transitions.
[2024-05-24 05:34:17] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2024-05-24 05:34:17] [INFO ] Computed 2 invariants in 7 ms
[2024-05-24 05:34:17] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-05-24 05:34:17] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-24 05:34:17] [INFO ] Invariant cache hit.
[2024-05-24 05:34:18] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-24 05:34:19] [INFO ] Implicit Places using invariants and state equation in 1584 ms returned []
Implicit Place search using SMT with State Equation took 1988 ms to find 0 implicit places.
[2024-05-24 05:34:19] [INFO ] Redundant transitions in 29 ms returned []
[2024-05-24 05:34:19] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-24 05:34:19] [INFO ] Invariant cache hit.
[2024-05-24 05:34:19] [INFO ] Dead Transitions using invariants and state equation in 513 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 605/796 places, 1584/2056 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2962 ms. Remains : 605/796 places, 1584/2056 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s564)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 386 ms.
Stack based approach found an accepted trace after 189 steps with 0 reset with depth 190 and stack size 190 in 1 ms.
FORMULA FunctionPointer-PT-c004-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c004-LTLCardinality-07 finished in 3416 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 796 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 796/796 places, 2056/2056 transitions.
Graph (complete) has 4512 edges and 796 vertex of which 795 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 17 place count 779 transition count 2020
Iterating global reduction 0 with 16 rules applied. Total rules applied 33 place count 779 transition count 2020
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 37 place count 779 transition count 2016
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 52 place count 764 transition count 1976
Iterating global reduction 1 with 15 rules applied. Total rules applied 67 place count 764 transition count 1976
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 82 place count 749 transition count 1930
Iterating global reduction 1 with 15 rules applied. Total rules applied 97 place count 749 transition count 1930
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 116 place count 730 transition count 1870
Iterating global reduction 1 with 19 rules applied. Total rules applied 135 place count 730 transition count 1870
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 153 place count 712 transition count 1822
Iterating global reduction 1 with 18 rules applied. Total rules applied 171 place count 712 transition count 1822
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 189 place count 694 transition count 1786
Iterating global reduction 1 with 18 rules applied. Total rules applied 207 place count 694 transition count 1786
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 226 place count 675 transition count 1744
Iterating global reduction 1 with 19 rules applied. Total rules applied 245 place count 675 transition count 1744
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 262 place count 658 transition count 1706
Iterating global reduction 1 with 17 rules applied. Total rules applied 279 place count 658 transition count 1706
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 293 place count 644 transition count 1678
Iterating global reduction 1 with 14 rules applied. Total rules applied 307 place count 644 transition count 1678
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 316 place count 635 transition count 1660
Iterating global reduction 1 with 9 rules applied. Total rules applied 325 place count 635 transition count 1660
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 329 place count 631 transition count 1648
Iterating global reduction 1 with 4 rules applied. Total rules applied 333 place count 631 transition count 1648
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 337 place count 627 transition count 1636
Iterating global reduction 1 with 4 rules applied. Total rules applied 341 place count 627 transition count 1636
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 345 place count 623 transition count 1628
Iterating global reduction 1 with 4 rules applied. Total rules applied 349 place count 623 transition count 1628
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 351 place count 621 transition count 1624
Iterating global reduction 1 with 2 rules applied. Total rules applied 353 place count 621 transition count 1624
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 355 place count 619 transition count 1620
Iterating global reduction 1 with 2 rules applied. Total rules applied 357 place count 619 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 359 place count 617 transition count 1616
Iterating global reduction 1 with 2 rules applied. Total rules applied 361 place count 617 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 363 place count 615 transition count 1612
Iterating global reduction 1 with 2 rules applied. Total rules applied 365 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 369 place count 615 transition count 1608
Applied a total of 369 rules in 398 ms. Remains 615 /796 variables (removed 181) and now considering 1608/2056 (removed 448) transitions.
[2024-05-24 05:34:20] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2024-05-24 05:34:20] [INFO ] Computed 2 invariants in 12 ms
[2024-05-24 05:34:21] [INFO ] Implicit Places using invariants in 393 ms returned []
[2024-05-24 05:34:21] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 05:34:21] [INFO ] Invariant cache hit.
[2024-05-24 05:34:21] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 05:34:23] [INFO ] Implicit Places using invariants and state equation in 1946 ms returned []
Implicit Place search using SMT with State Equation took 2340 ms to find 0 implicit places.
[2024-05-24 05:34:23] [INFO ] Redundant transitions in 33 ms returned []
[2024-05-24 05:34:23] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 05:34:23] [INFO ] Invariant cache hit.
[2024-05-24 05:34:23] [INFO ] Dead Transitions using invariants and state equation in 522 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 615/796 places, 1608/2056 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3303 ms. Remains : 615/796 places, 1608/2056 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s544 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 365 ms.
Product exploration explored 100000 steps with 0 reset in 415 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 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Finished Best-First random walk after 1469 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=734 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 615 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 85 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2024-05-24 05:34:25] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 05:34:25] [INFO ] Invariant cache hit.
[2024-05-24 05:34:25] [INFO ] Implicit Places using invariants in 399 ms returned []
[2024-05-24 05:34:25] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 05:34:25] [INFO ] Invariant cache hit.
[2024-05-24 05:34:25] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 05:34:27] [INFO ] Implicit Places using invariants and state equation in 1747 ms returned []
Implicit Place search using SMT with State Equation took 2149 ms to find 0 implicit places.
[2024-05-24 05:34:27] [INFO ] Redundant transitions in 29 ms returned []
[2024-05-24 05:34:27] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 05:34:27] [INFO ] Invariant cache hit.
[2024-05-24 05:34:27] [INFO ] Dead Transitions using invariants and state equation in 482 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2756 ms. Remains : 615/615 places, 1608/1608 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 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Finished Best-First random walk after 1065 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=532 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 393 ms.
Product exploration explored 100000 steps with 2 reset in 452 ms.
Built C files in :
/tmp/ltsmin5263301643459375877
[2024-05-24 05:34:29] [INFO ] Too many transitions (1608) to apply POR reductions. Disabling POR matrices.
[2024-05-24 05:34:29] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5263301643459375877
Running compilation step : cd /tmp/ltsmin5263301643459375877;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5263301643459375877;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5263301643459375877;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 615 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 71 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2024-05-24 05:34:32] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 05:34:32] [INFO ] Invariant cache hit.
[2024-05-24 05:34:32] [INFO ] Implicit Places using invariants in 387 ms returned []
[2024-05-24 05:34:32] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 05:34:32] [INFO ] Invariant cache hit.
[2024-05-24 05:34:32] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 05:34:34] [INFO ] Implicit Places using invariants and state equation in 1736 ms returned []
Implicit Place search using SMT with State Equation took 2124 ms to find 0 implicit places.
[2024-05-24 05:34:34] [INFO ] Redundant transitions in 32 ms returned []
[2024-05-24 05:34:34] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 05:34:34] [INFO ] Invariant cache hit.
[2024-05-24 05:34:34] [INFO ] Dead Transitions using invariants and state equation in 474 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2717 ms. Remains : 615/615 places, 1608/1608 transitions.
Built C files in :
/tmp/ltsmin2280231634744367345
[2024-05-24 05:34:34] [INFO ] Too many transitions (1608) to apply POR reductions. Disabling POR matrices.
[2024-05-24 05:34:34] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2280231634744367345
Running compilation step : cd /tmp/ltsmin2280231634744367345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2280231634744367345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2280231634744367345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-24 05:34:37] [INFO ] Flatten gal took : 34 ms
[2024-05-24 05:34:38] [INFO ] Flatten gal took : 35 ms
[2024-05-24 05:34:38] [INFO ] Time to serialize gal into /tmp/LTL6187336121165633207.gal : 10 ms
[2024-05-24 05:34:38] [INFO ] Time to serialize properties into /tmp/LTL1976904859217046991.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6187336121165633207.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3602599062857271938.hoa' '-atoms' '/tmp/LTL1976904859217046991.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1976904859217046991.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3602599062857271938.hoa
Detected timeout of ITS tools.
[2024-05-24 05:34:53] [INFO ] Flatten gal took : 34 ms
[2024-05-24 05:34:53] [INFO ] Flatten gal took : 34 ms
[2024-05-24 05:34:53] [INFO ] Time to serialize gal into /tmp/LTL16108741629797935383.gal : 6 ms
[2024-05-24 05:34:53] [INFO ] Time to serialize properties into /tmp/LTL14629592440592880521.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16108741629797935383.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14629592440592880521.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("(l2113<=0)"))))
Formula 0 simplified : FG!"(l2113<=0)"
Detected timeout of ITS tools.
[2024-05-24 05:35:08] [INFO ] Flatten gal took : 33 ms
[2024-05-24 05:35:08] [INFO ] Applying decomposition
[2024-05-24 05:35:08] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7841579790062189739.txt' '-o' '/tmp/graph7841579790062189739.bin' '-w' '/tmp/graph7841579790062189739.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7841579790062189739.bin' '-l' '-1' '-v' '-w' '/tmp/graph7841579790062189739.weights' '-q' '0' '-e' '0.001'
[2024-05-24 05:35:08] [INFO ] Decomposing Gal with order
[2024-05-24 05:35:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 05:35:08] [INFO ] Removed a total of 2676 redundant transitions.
[2024-05-24 05:35:08] [INFO ] Flatten gal took : 81 ms
[2024-05-24 05:35:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 1141 labels/synchronizations in 44 ms.
[2024-05-24 05:35:08] [INFO ] Time to serialize gal into /tmp/LTL12741150139466779998.gal : 14 ms
[2024-05-24 05:35:08] [INFO ] Time to serialize properties into /tmp/LTL2627550798629300117.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12741150139466779998.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2627550798629300117.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("(i24.i1.u150.l2113<=0)"))))
Formula 0 simplified : FG!"(i24.i1.u150.l2113<=0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16471778292842221211
[2024-05-24 05:35:23] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16471778292842221211
Running compilation step : cd /tmp/ltsmin16471778292842221211;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2733 ms.
Running link step : cd /tmp/ltsmin16471778292842221211;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin16471778292842221211;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c004-LTLCardinality-08 finished in 78374 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 796 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 796/796 places, 2056/2056 transitions.
Graph (complete) has 4512 edges and 796 vertex of which 795 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 16 place count 780 transition count 2022
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 780 transition count 2022
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 37 place count 780 transition count 2016
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 52 place count 765 transition count 1976
Iterating global reduction 1 with 15 rules applied. Total rules applied 67 place count 765 transition count 1976
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 82 place count 750 transition count 1932
Iterating global reduction 1 with 15 rules applied. Total rules applied 97 place count 750 transition count 1932
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 117 place count 730 transition count 1868
Iterating global reduction 1 with 20 rules applied. Total rules applied 137 place count 730 transition count 1868
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 156 place count 711 transition count 1814
Iterating global reduction 1 with 19 rules applied. Total rules applied 175 place count 711 transition count 1814
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 194 place count 692 transition count 1776
Iterating global reduction 1 with 19 rules applied. Total rules applied 213 place count 692 transition count 1776
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 233 place count 672 transition count 1732
Iterating global reduction 1 with 20 rules applied. Total rules applied 253 place count 672 transition count 1732
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 271 place count 654 transition count 1692
Iterating global reduction 1 with 18 rules applied. Total rules applied 289 place count 654 transition count 1692
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 304 place count 639 transition count 1662
Iterating global reduction 1 with 15 rules applied. Total rules applied 319 place count 639 transition count 1662
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 330 place count 628 transition count 1640
Iterating global reduction 1 with 11 rules applied. Total rules applied 341 place count 628 transition count 1640
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 344 place count 625 transition count 1632
Iterating global reduction 1 with 3 rules applied. Total rules applied 347 place count 625 transition count 1632
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 350 place count 622 transition count 1624
Iterating global reduction 1 with 3 rules applied. Total rules applied 353 place count 622 transition count 1624
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 356 place count 619 transition count 1618
Iterating global reduction 1 with 3 rules applied. Total rules applied 359 place count 619 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 360 place count 618 transition count 1616
Iterating global reduction 1 with 1 rules applied. Total rules applied 361 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 362 place count 617 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 363 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 364 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 365 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 366 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 367 place count 615 transition count 1610
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 371 place count 615 transition count 1606
Applied a total of 371 rules in 384 ms. Remains 615 /796 variables (removed 181) and now considering 1606/2056 (removed 450) transitions.
[2024-05-24 05:35:39] [INFO ] Flow matrix only has 1074 transitions (discarded 532 similar events)
// Phase 1: matrix 1074 rows 615 cols
[2024-05-24 05:35:39] [INFO ] Computed 2 invariants in 15 ms
[2024-05-24 05:35:39] [INFO ] Implicit Places using invariants in 395 ms returned []
[2024-05-24 05:35:39] [INFO ] Flow matrix only has 1074 transitions (discarded 532 similar events)
[2024-05-24 05:35:39] [INFO ] Invariant cache hit.
[2024-05-24 05:35:39] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-24 05:35:41] [INFO ] Implicit Places using invariants and state equation in 1503 ms returned []
Implicit Place search using SMT with State Equation took 1900 ms to find 0 implicit places.
[2024-05-24 05:35:41] [INFO ] Redundant transitions in 29 ms returned []
[2024-05-24 05:35:41] [INFO ] Flow matrix only has 1074 transitions (discarded 532 similar events)
[2024-05-24 05:35:41] [INFO ] Invariant cache hit.
[2024-05-24 05:35:41] [INFO ] Dead Transitions using invariants and state equation in 501 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 615/796 places, 1606/2056 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2825 ms. Remains : 615/796 places, 1606/2056 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s520 s543)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 382 ms.
Stack based approach found an accepted trace after 2095 steps with 0 reset with depth 2096 and stack size 2096 in 10 ms.
FORMULA FunctionPointer-PT-c004-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c004-LTLCardinality-09 finished in 3322 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 3 out of 796 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 796/796 places, 2056/2056 transitions.
Graph (complete) has 4512 edges and 796 vertex of which 795 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 17 place count 779 transition count 2020
Iterating global reduction 0 with 16 rules applied. Total rules applied 33 place count 779 transition count 2020
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 39 place count 779 transition count 2014
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 54 place count 764 transition count 1976
Iterating global reduction 1 with 15 rules applied. Total rules applied 69 place count 764 transition count 1976
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 84 place count 749 transition count 1932
Iterating global reduction 1 with 15 rules applied. Total rules applied 99 place count 749 transition count 1932
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 119 place count 729 transition count 1866
Iterating global reduction 1 with 20 rules applied. Total rules applied 139 place count 729 transition count 1866
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 158 place count 710 transition count 1812
Iterating global reduction 1 with 19 rules applied. Total rules applied 177 place count 710 transition count 1812
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 195 place count 692 transition count 1776
Iterating global reduction 1 with 18 rules applied. Total rules applied 213 place count 692 transition count 1776
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 232 place count 673 transition count 1734
Iterating global reduction 1 with 19 rules applied. Total rules applied 251 place count 673 transition count 1734
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 268 place count 656 transition count 1696
Iterating global reduction 1 with 17 rules applied. Total rules applied 285 place count 656 transition count 1696
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 300 place count 641 transition count 1666
Iterating global reduction 1 with 15 rules applied. Total rules applied 315 place count 641 transition count 1666
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 326 place count 630 transition count 1644
Iterating global reduction 1 with 11 rules applied. Total rules applied 337 place count 630 transition count 1644
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 340 place count 627 transition count 1636
Iterating global reduction 1 with 3 rules applied. Total rules applied 343 place count 627 transition count 1636
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 346 place count 624 transition count 1628
Iterating global reduction 1 with 3 rules applied. Total rules applied 349 place count 624 transition count 1628
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 352 place count 621 transition count 1622
Iterating global reduction 1 with 3 rules applied. Total rules applied 355 place count 621 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 356 place count 620 transition count 1620
Iterating global reduction 1 with 1 rules applied. Total rules applied 357 place count 620 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 358 place count 619 transition count 1618
Iterating global reduction 1 with 1 rules applied. Total rules applied 359 place count 619 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 360 place count 618 transition count 1616
Iterating global reduction 1 with 1 rules applied. Total rules applied 361 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 362 place count 617 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 363 place count 617 transition count 1614
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 367 place count 617 transition count 1610
Applied a total of 367 rules in 384 ms. Remains 617 /796 variables (removed 179) and now considering 1610/2056 (removed 446) transitions.
[2024-05-24 05:35:42] [INFO ] Flow matrix only has 1077 transitions (discarded 533 similar events)
// Phase 1: matrix 1077 rows 617 cols
[2024-05-24 05:35:42] [INFO ] Computed 2 invariants in 14 ms
[2024-05-24 05:35:42] [INFO ] Implicit Places using invariants in 388 ms returned []
[2024-05-24 05:35:42] [INFO ] Flow matrix only has 1077 transitions (discarded 533 similar events)
[2024-05-24 05:35:42] [INFO ] Invariant cache hit.
[2024-05-24 05:35:43] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:35:44] [INFO ] Implicit Places using invariants and state equation in 1578 ms returned []
Implicit Place search using SMT with State Equation took 1971 ms to find 0 implicit places.
[2024-05-24 05:35:44] [INFO ] Redundant transitions in 31 ms returned []
[2024-05-24 05:35:44] [INFO ] Flow matrix only has 1077 transitions (discarded 533 similar events)
[2024-05-24 05:35:44] [INFO ] Invariant cache hit.
[2024-05-24 05:35:44] [INFO ] Dead Transitions using invariants and state equation in 461 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 617/796 places, 1610/2056 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2851 ms. Remains : 617/796 places, 1610/2056 transitions.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(GT s544 s529), p0:(LEQ 1 s248)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 411 ms.
Stack based approach found an accepted trace after 180 steps with 0 reset with depth 181 and stack size 181 in 1 ms.
FORMULA FunctionPointer-PT-c004-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c004-LTLCardinality-10 finished in 3326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((p0||(p1&&X((F(p0)||G(p1))))))) U G(p2)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p0))))'
Found a Lengthening insensitive property : FunctionPointer-PT-c004-LTLCardinality-06
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 796 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 796/796 places, 2056/2056 transitions.
Graph (complete) has 4512 edges and 796 vertex of which 795 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 16 place count 780 transition count 2022
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 780 transition count 2022
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 37 place count 780 transition count 2016
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 51 place count 766 transition count 1980
Iterating global reduction 1 with 14 rules applied. Total rules applied 65 place count 766 transition count 1980
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 79 place count 752 transition count 1940
Iterating global reduction 1 with 14 rules applied. Total rules applied 93 place count 752 transition count 1940
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 112 place count 733 transition count 1878
Iterating global reduction 1 with 19 rules applied. Total rules applied 131 place count 733 transition count 1878
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 149 place count 715 transition count 1826
Iterating global reduction 1 with 18 rules applied. Total rules applied 167 place count 715 transition count 1826
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 185 place count 697 transition count 1790
Iterating global reduction 1 with 18 rules applied. Total rules applied 203 place count 697 transition count 1790
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 222 place count 678 transition count 1748
Iterating global reduction 1 with 19 rules applied. Total rules applied 241 place count 678 transition count 1748
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 258 place count 661 transition count 1710
Iterating global reduction 1 with 17 rules applied. Total rules applied 275 place count 661 transition count 1710
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 290 place count 646 transition count 1680
Iterating global reduction 1 with 15 rules applied. Total rules applied 305 place count 646 transition count 1680
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 316 place count 635 transition count 1658
Iterating global reduction 1 with 11 rules applied. Total rules applied 327 place count 635 transition count 1658
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 330 place count 632 transition count 1650
Iterating global reduction 1 with 3 rules applied. Total rules applied 333 place count 632 transition count 1650
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 336 place count 629 transition count 1642
Iterating global reduction 1 with 3 rules applied. Total rules applied 339 place count 629 transition count 1642
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 342 place count 626 transition count 1636
Iterating global reduction 1 with 3 rules applied. Total rules applied 345 place count 626 transition count 1636
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 346 place count 625 transition count 1634
Iterating global reduction 1 with 1 rules applied. Total rules applied 347 place count 625 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 348 place count 624 transition count 1632
Iterating global reduction 1 with 1 rules applied. Total rules applied 349 place count 624 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 350 place count 623 transition count 1630
Iterating global reduction 1 with 1 rules applied. Total rules applied 351 place count 623 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 352 place count 622 transition count 1628
Iterating global reduction 1 with 1 rules applied. Total rules applied 353 place count 622 transition count 1628
Applied a total of 353 rules in 266 ms. Remains 622 /796 variables (removed 174) and now considering 1628/2056 (removed 428) transitions.
[2024-05-24 05:35:45] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
// Phase 1: matrix 1087 rows 622 cols
[2024-05-24 05:35:45] [INFO ] Computed 2 invariants in 14 ms
[2024-05-24 05:35:46] [INFO ] Implicit Places using invariants in 393 ms returned []
[2024-05-24 05:35:46] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-24 05:35:46] [INFO ] Invariant cache hit.
[2024-05-24 05:35:46] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:35:48] [INFO ] Implicit Places using invariants and state equation in 2099 ms returned []
Implicit Place search using SMT with State Equation took 2497 ms to find 0 implicit places.
[2024-05-24 05:35:48] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-24 05:35:48] [INFO ] Invariant cache hit.
[2024-05-24 05:35:48] [INFO ] Dead Transitions using invariants and state equation in 513 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 622/796 places, 1628/2056 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3280 ms. Remains : 622/796 places, 1628/2056 transitions.
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}]], initial=1, aps=[p0:(LEQ s550 s540)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 392 ms.
Product exploration explored 100000 steps with 0 reset in 444 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 p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 76 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 171 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=85 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 101 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 622/622 places, 1628/1628 transitions.
Applied a total of 0 rules in 14 ms. Remains 622 /622 variables (removed 0) and now considering 1628/1628 (removed 0) transitions.
[2024-05-24 05:35:50] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-24 05:35:50] [INFO ] Invariant cache hit.
[2024-05-24 05:35:50] [INFO ] Implicit Places using invariants in 383 ms returned []
[2024-05-24 05:35:50] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-24 05:35:50] [INFO ] Invariant cache hit.
[2024-05-24 05:35:50] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:35:52] [INFO ] Implicit Places using invariants and state equation in 1721 ms returned []
Implicit Place search using SMT with State Equation took 2107 ms to find 0 implicit places.
[2024-05-24 05:35:52] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-24 05:35:52] [INFO ] Invariant cache hit.
[2024-05-24 05:35:52] [INFO ] Dead Transitions using invariants and state equation in 489 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2612 ms. Remains : 622/622 places, 1628/1628 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 p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 70 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10003 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) 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 516240 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :{}
Probabilistic random walk after 516240 steps, saw 335073 distinct states, run finished after 3001 ms. (steps per millisecond=172 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 05:35:56] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-24 05:35:56] [INFO ] Invariant cache hit.
[2024-05-24 05:35:56] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 05:35:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 05:35:56] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:35:56] [INFO ] After 243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 05:35:56] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:35:56] [INFO ] After 65ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 05:35:56] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2024-05-24 05:35:56] [INFO ] After 512ms 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 622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 622/622 places, 1628/1628 transitions.
Graph (complete) has 2712 edges and 622 vertex of which 430 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 430 transition count 1244
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 391 place count 430 transition count 1238
Applied a total of 391 rules in 88 ms. Remains 430 /622 variables (removed 192) and now considering 1238/1628 (removed 390) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 430/622 places, 1238/1628 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Finished Best-First random walk after 500 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=500 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 114 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 374 ms.
Product exploration explored 100000 steps with 0 reset in 437 ms.
Built C files in :
/tmp/ltsmin13097489765993813441
[2024-05-24 05:35:58] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13097489765993813441
Running compilation step : cd /tmp/ltsmin13097489765993813441;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2853 ms.
Running link step : cd /tmp/ltsmin13097489765993813441;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin13097489765993813441;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10155975872735515016.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 622/622 places, 1628/1628 transitions.
Applied a total of 0 rules in 16 ms. Remains 622 /622 variables (removed 0) and now considering 1628/1628 (removed 0) transitions.
[2024-05-24 05:36:13] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-24 05:36:13] [INFO ] Invariant cache hit.
[2024-05-24 05:36:13] [INFO ] Implicit Places using invariants in 372 ms returned []
[2024-05-24 05:36:13] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-24 05:36:13] [INFO ] Invariant cache hit.
[2024-05-24 05:36:13] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:36:15] [INFO ] Implicit Places using invariants and state equation in 1780 ms returned []
Implicit Place search using SMT with State Equation took 2153 ms to find 0 implicit places.
[2024-05-24 05:36:15] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-24 05:36:15] [INFO ] Invariant cache hit.
[2024-05-24 05:36:15] [INFO ] Dead Transitions using invariants and state equation in 472 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2642 ms. Remains : 622/622 places, 1628/1628 transitions.
Built C files in :
/tmp/ltsmin12101419993827159905
[2024-05-24 05:36:15] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12101419993827159905
Running compilation step : cd /tmp/ltsmin12101419993827159905;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2779 ms.
Running link step : cd /tmp/ltsmin12101419993827159905;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin12101419993827159905;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15160985413317926229.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 05:36:31] [INFO ] Flatten gal took : 33 ms
[2024-05-24 05:36:31] [INFO ] Flatten gal took : 42 ms
[2024-05-24 05:36:31] [INFO ] Time to serialize gal into /tmp/LTL10471750378621230265.gal : 10 ms
[2024-05-24 05:36:31] [INFO ] Time to serialize properties into /tmp/LTL12995866161399525998.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10471750378621230265.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5311355241140215659.hoa' '-atoms' '/tmp/LTL12995866161399525998.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12995866161399525998.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5311355241140215659.hoa
Detected timeout of ITS tools.
[2024-05-24 05:36:46] [INFO ] Flatten gal took : 35 ms
[2024-05-24 05:36:46] [INFO ] Flatten gal took : 35 ms
[2024-05-24 05:36:46] [INFO ] Time to serialize gal into /tmp/LTL12459177681006989214.gal : 6 ms
[2024-05-24 05:36:46] [INFO ] Time to serialize properties into /tmp/LTL12351486519674888448.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12459177681006989214.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12351486519674888448.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(("(l2093<=l1541)")||(X("(l2093<=l1541)")))))
Formula 0 simplified : F(!"(l2093<=l1541)" & X!"(l2093<=l1541)")
Detected timeout of ITS tools.
[2024-05-24 05:37:01] [INFO ] Flatten gal took : 32 ms
[2024-05-24 05:37:01] [INFO ] Applying decomposition
[2024-05-24 05:37:01] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14940293633154101746.txt' '-o' '/tmp/graph14940293633154101746.bin' '-w' '/tmp/graph14940293633154101746.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14940293633154101746.bin' '-l' '-1' '-v' '-w' '/tmp/graph14940293633154101746.weights' '-q' '0' '-e' '0.001'
[2024-05-24 05:37:01] [INFO ] Decomposing Gal with order
[2024-05-24 05:37:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 05:37:01] [INFO ] Removed a total of 543 redundant transitions.
[2024-05-24 05:37:01] [INFO ] Flatten gal took : 68 ms
[2024-05-24 05:37:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 260 labels/synchronizations in 7 ms.
[2024-05-24 05:37:01] [INFO ] Time to serialize gal into /tmp/LTL16637433411472502738.gal : 6 ms
[2024-05-24 05:37:01] [INFO ] Time to serialize properties into /tmp/LTL11683850507305326614.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16637433411472502738.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11683850507305326614.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(("(gu61.l2093<=gu61.l1541)")||(X("(gu61.l2093<=gu61.l1541)")))))
Formula 0 simplified : F(!"(gu61.l2093<=gu61.l1541)" & X!"(gu61.l2093<=gu61.l1541)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4821827212734133346
[2024-05-24 05:37:16] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4821827212734133346
Running compilation step : cd /tmp/ltsmin4821827212734133346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4821827212734133346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4821827212734133346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property FunctionPointer-PT-c004-LTLCardinality-06 finished in 94145 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-24 05:37:19] [INFO ] Flatten gal took : 41 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9782367920170587652
[2024-05-24 05:37:19] [INFO ] Too many transitions (2056) to apply POR reductions. Disabling POR matrices.
[2024-05-24 05:37:19] [INFO ] Applying decomposition
[2024-05-24 05:37:19] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9782367920170587652
Running compilation step : cd /tmp/ltsmin9782367920170587652;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-24 05:37:19] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17868114332752858840.txt' '-o' '/tmp/graph17868114332752858840.bin' '-w' '/tmp/graph17868114332752858840.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17868114332752858840.bin' '-l' '-1' '-v' '-w' '/tmp/graph17868114332752858840.weights' '-q' '0' '-e' '0.001'
[2024-05-24 05:37:19] [INFO ] Decomposing Gal with order
[2024-05-24 05:37:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 05:37:20] [INFO ] Removed a total of 621 redundant transitions.
[2024-05-24 05:37:20] [INFO ] Flatten gal took : 95 ms
[2024-05-24 05:37:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 327 labels/synchronizations in 9 ms.
[2024-05-24 05:37:20] [INFO ] Time to serialize gal into /tmp/LTLCardinality7590650831958536975.gal : 7 ms
[2024-05-24 05:37:20] [INFO ] Time to serialize properties into /tmp/LTLCardinality12358674725680279723.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7590650831958536975.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12358674725680279723.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 4 LTL properties
Checking formula 0 : !((F((G(F("((gi0.gu1.p1539>=1)||(gi0.gu69.l2616<2))")))||(G("(gu66.l1659<=gu66.l932)")))))
Formula 0 simplified : G(FG!"((gi0.gu1.p1539>=1)||(gi0.gu69.l2616<2))" & F!"(gu66.l1659<=gu66.l932)")
Compilation finished in 4128 ms.
Running link step : cd /tmp/ltsmin9782367920170587652;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin9782367920170587652;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([](<>((LTLAPp0==true)))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin9782367920170587652;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([](<>((LTLAPp0==true)))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9782367920170587652;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(<>(((LTLAPp2==true)||((LTLAPp3==true)&&X((<>((LTLAPp2==true))||[]((LTLAPp3==true)))))))) U []((LTLAPp4==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.010: LTL layer: formula: (X(<>(((LTLAPp2==true)||((LTLAPp3==true)&&X((<>((LTLAPp2==true))||[]((LTLAPp3==true)))))))) U []((LTLAPp4==true)))
pins2lts-mc-linux64( 2/ 8), 0.010: "(X(<>(((LTLAPp2==true)||((LTLAPp3==true)&&X((<>((LTLAPp2==true))||[]((LTLAPp3==true)))))))) U []((LTLAPp4==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.011: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.035: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.035: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.038: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.038: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.038: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.038: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.038: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.042: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.034: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.037: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.050: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.053: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.057: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.059: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.060: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 1.079: There are 2064 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.079: State length is 797, there are 2068 groups
pins2lts-mc-linux64( 0/ 8), 1.079: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.079: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.079: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 1.079: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 1.442: [Blue] ~120 levels ~960 states ~3320 transitions
pins2lts-mc-linux64( 3/ 8), 1.939: [Blue] ~240 levels ~1920 states ~8312 transitions
pins2lts-mc-linux64( 3/ 8), 2.863: [Blue] ~480 levels ~3840 states ~16760 transitions
pins2lts-mc-linux64( 2/ 8), 4.194: [Blue] ~960 levels ~7680 states ~26168 transitions
pins2lts-mc-linux64( 2/ 8), 6.014: [Blue] ~1920 levels ~15360 states ~52280 transitions
pins2lts-mc-linux64( 2/ 8), 10.749: [Blue] ~3840 levels ~30720 states ~104504 transitions
pins2lts-mc-linux64( 2/ 8), 19.653: [Blue] ~7680 levels ~61440 states ~208952 transitions
pins2lts-mc-linux64( 2/ 8), 33.829: [Blue] ~15360 levels ~122880 states ~417848 transitions
pins2lts-mc-linux64( 2/ 8), 59.265: [Blue] ~30720 levels ~245760 states ~835640 transitions
pins2lts-mc-linux64( 2/ 8), 78.460: [Blue] ~61440 levels ~491520 states ~1671224 transitions
pins2lts-mc-linux64( 2/ 8), 109.749: [Blue] ~122880 levels ~983040 states ~3342392 transitions
pins2lts-mc-linux64( 2/ 8), 172.205: [Blue] ~245760 levels ~1966080 states ~6684728 transitions
pins2lts-mc-linux64( 2/ 8), 298.707: [Blue] ~491520 levels ~3932160 states ~13369400 transitions
pins2lts-mc-linux64( 0/ 8), 448.336: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 449.305:
pins2lts-mc-linux64( 0/ 8), 449.305: Explored 4681487 states 23682175 transitions, fanout: 5.059
pins2lts-mc-linux64( 0/ 8), 449.305: Total exploration time 448.210 sec (447.240 sec minimum, 447.409 sec on average)
pins2lts-mc-linux64( 0/ 8), 449.305: States per second: 10445, Transitions per second: 52837
pins2lts-mc-linux64( 0/ 8), 449.305:
pins2lts-mc-linux64( 0/ 8), 449.305: State space has 23033561 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 449.305: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 449.305: blue states: 4681487 (20.32%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 449.305: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 449.305: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 449.305:
pins2lts-mc-linux64( 0/ 8), 449.305: Total memory used for local state coloring: 71.4MB
pins2lts-mc-linux64( 0/ 8), 449.305:
pins2lts-mc-linux64( 0/ 8), 449.305: Queue width: 8B, total height: 4681487, memory: 35.72MB
pins2lts-mc-linux64( 0/ 8), 449.305: Tree memory: 431.7MB, 19.7 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 449.305: Tree fill ratio (roots/leafs): 17.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 449.305: Stored 2134 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 449.319: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 449.321: Est. total memory use: 467.4MB (~1059.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9782367920170587652;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(<>(((LTLAPp2==true)||((LTLAPp3==true)&&X((<>((LTLAPp2==true))||[]((LTLAPp3==true)))))))) U []((LTLAPp4==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9782367920170587652;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(<>(((LTLAPp2==true)||((LTLAPp3==true)&&X((<>((LTLAPp2==true))||[]((LTLAPp3==true)))))))) U []((LTLAPp4==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-24 06:00:24] [INFO ] Flatten gal took : 140 ms
[2024-05-24 06:00:24] [INFO ] Time to serialize gal into /tmp/LTLCardinality16295467809513867289.gal : 16 ms
[2024-05-24 06:00:24] [INFO ] Time to serialize properties into /tmp/LTLCardinality2822921339211339355.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16295467809513867289.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2822921339211339355.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 4 LTL properties
Checking formula 0 : !((F((G(F("((p1539>=1)||(l2616<2))")))||(G("(l1659<=l932)")))))
Formula 0 simplified : G(FG!"((p1539>=1)||(l2616<2))" & F!"(l1659<=l932)")
Detected timeout of ITS tools.
[2024-05-24 06:23:29] [INFO ] Flatten gal took : 289 ms
[2024-05-24 06:23:42] [INFO ] Input system was already deterministic with 2056 transitions.
[2024-05-24 06:23:42] [INFO ] Transformed 796 places.
[2024-05-24 06:23:42] [INFO ] Transformed 2056 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-24 06:23:42] [INFO ] Time to serialize gal into /tmp/LTLCardinality11302701303819109345.gal : 23 ms
[2024-05-24 06:23:42] [INFO ] Time to serialize properties into /tmp/LTLCardinality5610107030823025753.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11302701303819109345.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5610107030823025753.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 4 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((G(F("((p1539>=1)||(l2616<2))")))||(G("(l1659<=l932)")))))
Formula 0 simplified : G(FG!"((p1539>=1)||(l2616<2))" & F!"(l1659<=l932)")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 8201296 kB
After kill :
MemTotal: 16393232 kB
MemFree: 15912756 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-c004"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is FunctionPointer-PT-c004, 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 r197-tall-171640625000177"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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