Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 5.4K Jun 7 17:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Jun 7 17:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 7 17:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 7 17:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Jun 6 15:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 14K Jun 7 17:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Jun 7 17:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 7 17:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Jun 7 17:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 4.2M Jun 6 12:11 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-c008-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1654857038705

Running Version 202205111006
[2022-06-10 10:30:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-10 10:30:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 10:30:40] [INFO ] Load time of PNML (sax parser for PT used): 469 ms
[2022-06-10 10:30:40] [INFO ] Transformed 2826 places.
[2022-06-10 10:30:40] [INFO ] Transformed 8960 transitions.
[2022-06-10 10:30:40] [INFO ] Parsed PT model containing 2826 places and 8960 transitions in 624 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1198 places in 39 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c008-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1611 transition count 5962
Discarding 298 places :
Symmetric choice reduction at 1 with 298 rule applications. Total rules 315 place count 1313 transition count 3672
Iterating global reduction 1 with 298 rules applied. Total rules applied 613 place count 1313 transition count 3672
Ensure Unique test removed 346 transitions
Reduce isomorphic transitions removed 346 transitions.
Iterating post reduction 1 with 346 rules applied. Total rules applied 959 place count 1313 transition count 3326
Discarding 155 places :
Symmetric choice reduction at 2 with 155 rule applications. Total rules 1114 place count 1158 transition count 3016
Iterating global reduction 2 with 155 rules applied. Total rules applied 1269 place count 1158 transition count 3016
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 2 with 60 rules applied. Total rules applied 1329 place count 1158 transition count 2956
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1343 place count 1144 transition count 2928
Iterating global reduction 3 with 14 rules applied. Total rules applied 1357 place count 1144 transition count 2928
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1371 place count 1130 transition count 2900
Iterating global reduction 3 with 14 rules applied. Total rules applied 1385 place count 1130 transition count 2900
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1399 place count 1116 transition count 2872
Iterating global reduction 3 with 14 rules applied. Total rules applied 1413 place count 1116 transition count 2872
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1426 place count 1103 transition count 2846
Iterating global reduction 3 with 13 rules applied. Total rules applied 1439 place count 1103 transition count 2846
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1452 place count 1090 transition count 2820
Iterating global reduction 3 with 13 rules applied. Total rules applied 1465 place count 1090 transition count 2820
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1477 place count 1078 transition count 2796
Iterating global reduction 3 with 12 rules applied. Total rules applied 1489 place count 1078 transition count 2796
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1500 place count 1067 transition count 2774
Iterating global reduction 3 with 11 rules applied. Total rules applied 1511 place count 1067 transition count 2774
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 1556 place count 1022 transition count 2606
Iterating global reduction 3 with 45 rules applied. Total rules applied 1601 place count 1022 transition count 2606
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 1658 place count 965 transition count 2378
Iterating global reduction 3 with 57 rules applied. Total rules applied 1715 place count 965 transition count 2378
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 1770 place count 910 transition count 2232
Iterating global reduction 3 with 55 rules applied. Total rules applied 1825 place count 910 transition count 2232
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 1880 place count 855 transition count 2122
Iterating global reduction 3 with 55 rules applied. Total rules applied 1935 place count 855 transition count 2122
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 1988 place count 802 transition count 2016
Iterating global reduction 3 with 53 rules applied. Total rules applied 2041 place count 802 transition count 2016
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 2094 place count 749 transition count 1910
Iterating global reduction 3 with 53 rules applied. Total rules applied 2147 place count 749 transition count 1910
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 2198 place count 698 transition count 1808
Iterating global reduction 3 with 51 rules applied. Total rules applied 2249 place count 698 transition count 1808
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 2266 place count 681 transition count 1774
Iterating global reduction 3 with 17 rules applied. Total rules applied 2283 place count 681 transition count 1774
Applied a total of 2283 rules in 1326 ms. Remains 681 /1628 variables (removed 947) and now considering 1774/5962 (removed 4188) transitions.
[2022-06-10 10:30:42] [INFO ] Flow matrix only has 1194 transitions (discarded 580 similar events)
// Phase 1: matrix 1194 rows 681 cols
[2022-06-10 10:30:42] [INFO ] Computed 2 place invariants in 40 ms
[2022-06-10 10:30:43] [INFO ] Implicit Places using invariants in 1096 ms returned []
[2022-06-10 10:30:43] [INFO ] Flow matrix only has 1194 transitions (discarded 580 similar events)
// Phase 1: matrix 1194 rows 681 cols
[2022-06-10 10:30:43] [INFO ] Computed 2 place invariants in 17 ms
[2022-06-10 10:30:43] [INFO ] State equation strengthened by 295 read => feed constraints.
[2022-06-10 10:30:45] [INFO ] Implicit Places using invariants and state equation in 2239 ms returned []
Implicit Place search using SMT with State Equation took 3364 ms to find 0 implicit places.
[2022-06-10 10:30:45] [INFO ] Flow matrix only has 1194 transitions (discarded 580 similar events)
// Phase 1: matrix 1194 rows 681 cols
[2022-06-10 10:30:45] [INFO ] Computed 2 place invariants in 15 ms
[2022-06-10 10:30:46] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 681/1628 places, 1774/5962 transitions.
Finished structural reductions, in 1 iterations. Remains : 681/1628 places, 1774/5962 transitions.
Support contains 12 out of 681 places after structural reductions.
[2022-06-10 10:30:46] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-06-10 10:30:46] [INFO ] Flatten gal took : 141 ms
[2022-06-10 10:30:46] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
FORMULA FunctionPointer-PT-c008-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-06-10 10:30:46] [INFO ] Flatten gal took : 97 ms
[2022-06-10 10:30:46] [INFO ] Input system was already deterministic with 1774 transitions.
Support contains 10 out of 681 places (down from 12) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-06-10 10:30:47] [INFO ] Flow matrix only has 1194 transitions (discarded 580 similar events)
// Phase 1: matrix 1194 rows 681 cols
[2022-06-10 10:30:47] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-10 10:30:47] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 10:30:47] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-10 10:30:47] [INFO ] After 238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-10 10:30:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-10 10:30:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-10 10:30:48] [INFO ] After 552ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-10 10:30:48] [INFO ] State equation strengthened by 295 read => feed constraints.
[2022-06-10 10:30:48] [INFO ] After 243ms SMT Verify possible using 295 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-06-10 10:30:48] [INFO ] After 615ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 215 ms.
[2022-06-10 10:30:49] [INFO ] After 1691ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 1 properties in 33 ms.
Support contains 6 out of 681 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 681/681 places, 1774/1774 transitions.
Graph (complete) has 2931 edges and 681 vertex of which 489 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.8 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 489 transition count 1390
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 390 place count 484 transition count 1380
Iterating global reduction 1 with 5 rules applied. Total rules applied 395 place count 484 transition count 1380
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 399 place count 484 transition count 1376
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 404 place count 479 transition count 1366
Iterating global reduction 2 with 5 rules applied. Total rules applied 409 place count 479 transition count 1366
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 413 place count 475 transition count 1358
Iterating global reduction 2 with 4 rules applied. Total rules applied 417 place count 475 transition count 1358
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 422 place count 470 transition count 1342
Iterating global reduction 2 with 5 rules applied. Total rules applied 427 place count 470 transition count 1342
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 431 place count 466 transition count 1328
Iterating global reduction 2 with 4 rules applied. Total rules applied 435 place count 466 transition count 1328
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 438 place count 463 transition count 1322
Iterating global reduction 2 with 3 rules applied. Total rules applied 441 place count 463 transition count 1322
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 444 place count 460 transition count 1316
Iterating global reduction 2 with 3 rules applied. Total rules applied 447 place count 460 transition count 1316
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 450 place count 457 transition count 1310
Iterating global reduction 2 with 3 rules applied. Total rules applied 453 place count 457 transition count 1310
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 456 place count 454 transition count 1304
Iterating global reduction 2 with 3 rules applied. Total rules applied 459 place count 454 transition count 1304
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 462 place count 451 transition count 1298
Iterating global reduction 2 with 3 rules applied. Total rules applied 465 place count 451 transition count 1298
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 473 place count 451 transition count 1290
Applied a total of 473 rules in 428 ms. Remains 451 /681 variables (removed 230) and now considering 1290/1774 (removed 484) transitions.
Finished structural reductions, in 1 iterations. Remains : 451/681 places, 1290/1774 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-06-10 10:30:49] [INFO ] Flow matrix only has 738 transitions (discarded 552 similar events)
// Phase 1: matrix 738 rows 451 cols
[2022-06-10 10:30:49] [INFO ] Computed 3 place invariants in 9 ms
[2022-06-10 10:30:49] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-10 10:30:49] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-10 10:30:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-10 10:30:50] [INFO ] After 212ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-10 10:30:50] [INFO ] State equation strengthened by 86 read => feed constraints.
[2022-06-10 10:30:50] [INFO ] After 85ms SMT Verify possible using 86 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-10 10:30:50] [INFO ] After 213ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 74 ms.
[2022-06-10 10:30:50] [INFO ] After 617ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 9 ms.
Support contains 3 out of 451 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 451/451 places, 1290/1290 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 449 transition count 1286
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 449 transition count 1286
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 448 transition count 1284
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 448 transition count 1284
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 447 transition count 1282
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 447 transition count 1282
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 446 transition count 1280
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 446 transition count 1280
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 445 transition count 1278
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 445 transition count 1278
Applied a total of 12 rules in 116 ms. Remains 445 /451 variables (removed 6) and now considering 1278/1290 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 445/451 places, 1278/1290 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) 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.
[2022-06-10 10:30:50] [INFO ] Flow matrix only has 726 transitions (discarded 552 similar events)
// Phase 1: matrix 726 rows 445 cols
[2022-06-10 10:30:50] [INFO ] Computed 3 place invariants in 7 ms
[2022-06-10 10:30:50] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 10:30:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-10 10:30:51] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 10:30:51] [INFO ] State equation strengthened by 81 read => feed constraints.
[2022-06-10 10:30:51] [INFO ] After 68ms SMT Verify possible using 81 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 10:30:51] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2022-06-10 10:30:51] [INFO ] After 403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 445 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 445/445 places, 1278/1278 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 443 transition count 1274
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 443 transition count 1274
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 443 transition count 1270
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 11 place count 440 transition count 1264
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 440 transition count 1264
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 18 place count 440 transition count 1260
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 438 transition count 1256
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 438 transition count 1256
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 436 transition count 1252
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 436 transition count 1252
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 434 transition count 1246
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 434 transition count 1246
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 432 transition count 1240
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 432 transition count 1240
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 430 transition count 1236
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 430 transition count 1236
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 428 transition count 1232
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 428 transition count 1232
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 426 transition count 1228
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 426 transition count 1228
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 424 transition count 1224
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 424 transition count 1224
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 422 transition count 1220
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 422 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 421 transition count 1218
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 421 transition count 1218
Applied a total of 56 rules in 201 ms. Remains 421 /445 variables (removed 24) and now considering 1218/1278 (removed 60) transitions.
Finished structural reductions, in 1 iterations. Remains : 421/445 places, 1218/1278 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
Finished Best-First random walk after 7791 steps, including 2 resets, run visited all 1 properties in 7 ms. (steps per millisecond=1113 )
Computed a total of 192 stabilizing places and 512 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(G(X(p0))))))'
Support contains 1 out of 681 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 681/681 places, 1774/1774 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 671 transition count 1754
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 671 transition count 1754
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 28 place count 671 transition count 1746
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 38 place count 661 transition count 1724
Iterating global reduction 1 with 10 rules applied. Total rules applied 48 place count 661 transition count 1724
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 52 place count 661 transition count 1720
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 60 place count 653 transition count 1702
Iterating global reduction 2 with 8 rules applied. Total rules applied 68 place count 653 transition count 1702
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 77 place count 644 transition count 1678
Iterating global reduction 2 with 9 rules applied. Total rules applied 86 place count 644 transition count 1678
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 94 place count 636 transition count 1654
Iterating global reduction 2 with 8 rules applied. Total rules applied 102 place count 636 transition count 1654
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 108 place count 630 transition count 1638
Iterating global reduction 2 with 6 rules applied. Total rules applied 114 place count 630 transition count 1638
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 120 place count 624 transition count 1624
Iterating global reduction 2 with 6 rules applied. Total rules applied 126 place count 624 transition count 1624
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 132 place count 618 transition count 1612
Iterating global reduction 2 with 6 rules applied. Total rules applied 138 place count 618 transition count 1612
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 143 place count 613 transition count 1602
Iterating global reduction 2 with 5 rules applied. Total rules applied 148 place count 613 transition count 1602
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 153 place count 608 transition count 1592
Iterating global reduction 2 with 5 rules applied. Total rules applied 158 place count 608 transition count 1592
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 160 place count 606 transition count 1588
Iterating global reduction 2 with 2 rules applied. Total rules applied 162 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 163 place count 605 transition count 1586
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 605 transition count 1586
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 166 place count 605 transition count 1584
Applied a total of 166 rules in 533 ms. Remains 605 /681 variables (removed 76) and now considering 1584/1774 (removed 190) transitions.
[2022-06-10 10:30:52] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2022-06-10 10:30:52] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-10 10:30:52] [INFO ] Implicit Places using invariants in 401 ms returned []
[2022-06-10 10:30:52] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2022-06-10 10:30:52] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 10:30:52] [INFO ] State equation strengthened by 262 read => feed constraints.
[2022-06-10 10:30:54] [INFO ] Implicit Places using invariants and state equation in 2252 ms returned []
Implicit Place search using SMT with State Equation took 2660 ms to find 0 implicit places.
[2022-06-10 10:30:54] [INFO ] Redundant transitions in 117 ms returned []
[2022-06-10 10:30:54] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2022-06-10 10:30:54] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-10 10:30:55] [INFO ] Dead Transitions using invariants and state equation in 525 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 605/681 places, 1584/1774 transitions.
Finished structural reductions, in 1 iterations. Remains : 605/681 places, 1584/1774 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-01 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 2 s95)], 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 633 ms.
Product exploration explored 100000 steps with 0 reset in 544 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Detected a total of 192/605 stabilizing places and 512/1584 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 161 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Incomplete random walk after 10004 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) 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 471926 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :{}
Probabilistic random walk after 471926 steps, saw 306314 distinct states, run finished after 3002 ms. (steps per millisecond=157 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 10:31:00] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2022-06-10 10:31:00] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-10 10:31:00] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-10 10:31:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 7 ms returned sat
[2022-06-10 10:31:00] [INFO ] After 258ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-10 10:31:00] [INFO ] State equation strengthened by 262 read => feed constraints.
[2022-06-10 10:31:00] [INFO ] After 68ms SMT Verify possible using 262 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-06-10 10:31:00] [INFO ] After 126ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2022-06-10 10:31:00] [INFO ] After 545ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 193 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Support contains 1 out of 605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 605/605 places, 1584/1584 transitions.
Applied a total of 0 rules in 96 ms. Remains 605 /605 variables (removed 0) and now considering 1584/1584 (removed 0) transitions.
[2022-06-10 10:31:01] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2022-06-10 10:31:01] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-10 10:31:01] [INFO ] Implicit Places using invariants in 424 ms returned []
[2022-06-10 10:31:01] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2022-06-10 10:31:01] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 10:31:01] [INFO ] State equation strengthened by 262 read => feed constraints.
[2022-06-10 10:31:03] [INFO ] Implicit Places using invariants and state equation in 1703 ms returned []
Implicit Place search using SMT with State Equation took 2133 ms to find 0 implicit places.
[2022-06-10 10:31:03] [INFO ] Redundant transitions in 88 ms returned []
[2022-06-10 10:31:03] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2022-06-10 10:31:03] [INFO ] Computed 2 place invariants in 13 ms
[2022-06-10 10:31:03] [INFO ] Dead Transitions using invariants and state equation in 527 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 605/605 places, 1584/1584 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Detected a total of 192/605 stabilizing places and 512/1584 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 153 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 3397 steps, including 1 resets, run visited all 1 properties in 10 ms. (steps per millisecond=339 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 196 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 421 ms.
Product exploration explored 100000 steps with 0 reset in 472 ms.
Built C files in :
/tmp/ltsmin16880575507077271130
[2022-06-10 10:31:05] [INFO ] Too many transitions (1584) to apply POR reductions. Disabling POR matrices.
[2022-06-10 10:31:05] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16880575507077271130
Running compilation step : cd /tmp/ltsmin16880575507077271130;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2905 ms.
Running link step : cd /tmp/ltsmin16880575507077271130;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin16880575507077271130;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3483574552917395469.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 605/605 places, 1584/1584 transitions.
Applied a total of 0 rules in 101 ms. Remains 605 /605 variables (removed 0) and now considering 1584/1584 (removed 0) transitions.
[2022-06-10 10:31:20] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2022-06-10 10:31:20] [INFO ] Computed 2 place invariants in 14 ms
[2022-06-10 10:31:20] [INFO ] Implicit Places using invariants in 397 ms returned []
[2022-06-10 10:31:20] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2022-06-10 10:31:20] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 10:31:21] [INFO ] State equation strengthened by 262 read => feed constraints.
[2022-06-10 10:31:22] [INFO ] Implicit Places using invariants and state equation in 2166 ms returned []
Implicit Place search using SMT with State Equation took 2564 ms to find 0 implicit places.
[2022-06-10 10:31:22] [INFO ] Redundant transitions in 28 ms returned []
[2022-06-10 10:31:22] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2022-06-10 10:31:23] [INFO ] Computed 2 place invariants in 11 ms
[2022-06-10 10:31:23] [INFO ] Dead Transitions using invariants and state equation in 544 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 605/605 places, 1584/1584 transitions.
Built C files in :
/tmp/ltsmin14768687077059172494
[2022-06-10 10:31:23] [INFO ] Too many transitions (1584) to apply POR reductions. Disabling POR matrices.
[2022-06-10 10:31:23] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14768687077059172494
Running compilation step : cd /tmp/ltsmin14768687077059172494;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2733 ms.
Running link step : cd /tmp/ltsmin14768687077059172494;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14768687077059172494;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5803206270791772545.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-10 10:31:38] [INFO ] Flatten gal took : 132 ms
[2022-06-10 10:31:39] [INFO ] Flatten gal took : 106 ms
[2022-06-10 10:31:39] [INFO ] Time to serialize gal into /tmp/LTL14084302708060899641.gal : 28 ms
[2022-06-10 10:31:39] [INFO ] Time to serialize properties into /tmp/LTL6678082271361455950.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14084302708060899641.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6678082271361455950.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1408430...267
Read 1 LTL properties
Checking formula 0 : !((G(F(G(G(X("(l473<2)")))))))
Formula 0 simplified : !GFGX"(l473<2)"
Detected timeout of ITS tools.
[2022-06-10 10:31:54] [INFO ] Flatten gal took : 99 ms
[2022-06-10 10:31:54] [INFO ] Applying decomposition
[2022-06-10 10:31:54] [INFO ] Flatten gal took : 85 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2937755745890280482.txt' '-o' '/tmp/graph2937755745890280482.bin' '-w' '/tmp/graph2937755745890280482.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2937755745890280482.bin' '-l' '-1' '-v' '-w' '/tmp/graph2937755745890280482.weights' '-q' '0' '-e' '0.001'
[2022-06-10 10:31:54] [INFO ] Decomposing Gal with order
[2022-06-10 10:31:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 10:31:54] [INFO ] Removed a total of 2624 redundant transitions.
[2022-06-10 10:31:54] [INFO ] Flatten gal took : 184 ms
[2022-06-10 10:31:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 1071 labels/synchronizations in 85 ms.
[2022-06-10 10:31:55] [INFO ] Time to serialize gal into /tmp/LTL17345585044099124893.gal : 14 ms
[2022-06-10 10:31:55] [INFO ] Time to serialize properties into /tmp/LTL4130260720611174373.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17345585044099124893.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4130260720611174373.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1734558...246
Read 1 LTL properties
Checking formula 0 : !((G(F(G(G(X("(i15.u21.l473<2)")))))))
Formula 0 simplified : !GFGX"(i15.u21.l473<2)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16197256346553413551
[2022-06-10 10:32:10] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16197256346553413551
Running compilation step : cd /tmp/ltsmin16197256346553413551;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2752 ms.
Running link step : cd /tmp/ltsmin16197256346553413551;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16197256346553413551;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>([]([](X((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c008-LTLCardinality-01 finished in 93602 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(G(X(p0)) U !X(p1)))'
Support contains 4 out of 681 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 681/681 places, 1774/1774 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 675 transition count 1762
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 675 transition count 1762
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 18 place count 675 transition count 1756
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 668 transition count 1740
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 668 transition count 1740
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 36 place count 668 transition count 1736
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 42 place count 662 transition count 1722
Iterating global reduction 2 with 6 rules applied. Total rules applied 48 place count 662 transition count 1722
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 55 place count 655 transition count 1702
Iterating global reduction 2 with 7 rules applied. Total rules applied 62 place count 655 transition count 1702
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 68 place count 649 transition count 1682
Iterating global reduction 2 with 6 rules applied. Total rules applied 74 place count 649 transition count 1682
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 80 place count 643 transition count 1666
Iterating global reduction 2 with 6 rules applied. Total rules applied 86 place count 643 transition count 1666
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 92 place count 637 transition count 1652
Iterating global reduction 2 with 6 rules applied. Total rules applied 98 place count 637 transition count 1652
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 104 place count 631 transition count 1640
Iterating global reduction 2 with 6 rules applied. Total rules applied 110 place count 631 transition count 1640
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 115 place count 626 transition count 1630
Iterating global reduction 2 with 5 rules applied. Total rules applied 120 place count 626 transition count 1630
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 125 place count 621 transition count 1620
Iterating global reduction 2 with 5 rules applied. Total rules applied 130 place count 621 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 132 place count 619 transition count 1616
Iterating global reduction 2 with 2 rules applied. Total rules applied 134 place count 619 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 135 place count 618 transition count 1614
Iterating global reduction 2 with 1 rules applied. Total rules applied 136 place count 618 transition count 1614
Applied a total of 136 rules in 191 ms. Remains 618 /681 variables (removed 63) and now considering 1614/1774 (removed 160) transitions.
[2022-06-10 10:32:25] [INFO ] Flow matrix only has 1084 transitions (discarded 530 similar events)
// Phase 1: matrix 1084 rows 618 cols
[2022-06-10 10:32:25] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 10:32:25] [INFO ] Implicit Places using invariants in 585 ms returned []
[2022-06-10 10:32:26] [INFO ] Flow matrix only has 1084 transitions (discarded 530 similar events)
// Phase 1: matrix 1084 rows 618 cols
[2022-06-10 10:32:26] [INFO ] Computed 2 place invariants in 29 ms
[2022-06-10 10:32:26] [INFO ] State equation strengthened by 272 read => feed constraints.
[2022-06-10 10:32:27] [INFO ] Implicit Places using invariants and state equation in 1914 ms returned []
Implicit Place search using SMT with State Equation took 2526 ms to find 0 implicit places.
[2022-06-10 10:32:27] [INFO ] Flow matrix only has 1084 transitions (discarded 530 similar events)
// Phase 1: matrix 1084 rows 618 cols
[2022-06-10 10:32:27] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 10:32:28] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 618/681 places, 1614/1774 transitions.
Finished structural reductions, in 1 iterations. Remains : 618/681 places, 1614/1774 transitions.
Stuttering acceptance computed with spot in 188 ms :[true, p0, (NOT p1), (NOT p1), (AND p0 (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(LEQ s525 s534), p1:(LEQ s519 s535)], 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, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 436 ms.
Product exploration explored 100000 steps with 0 reset in 553 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 (AND p0 p1)), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 249 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 116 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2022-06-10 10:32:30] [INFO ] Flow matrix only has 1084 transitions (discarded 530 similar events)
// Phase 1: matrix 1084 rows 618 cols
[2022-06-10 10:32:30] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 10:32:30] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 10:32:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-10 10:32:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 10:32:30] [INFO ] After 245ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 10:32:30] [INFO ] State equation strengthened by 272 read => feed constraints.
[2022-06-10 10:32:30] [INFO ] After 92ms SMT Verify possible using 272 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 10:32:30] [INFO ] After 169ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-06-10 10:32:31] [INFO ] After 542ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 618 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 618/618 places, 1614/1614 transitions.
Graph (complete) has 2697 edges and 618 vertex of which 426 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.10 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 426 transition count 1230
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 387 place count 424 transition count 1226
Iterating global reduction 1 with 2 rules applied. Total rules applied 389 place count 424 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 390 place count 423 transition count 1224
Iterating global reduction 1 with 1 rules applied. Total rules applied 391 place count 423 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 392 place count 422 transition count 1222
Iterating global reduction 1 with 1 rules applied. Total rules applied 393 place count 422 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 394 place count 421 transition count 1220
Iterating global reduction 1 with 1 rules applied. Total rules applied 395 place count 421 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 396 place count 420 transition count 1218
Iterating global reduction 1 with 1 rules applied. Total rules applied 397 place count 420 transition count 1218
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 399 place count 420 transition count 1216
Applied a total of 399 rules in 223 ms. Remains 420 /618 variables (removed 198) and now considering 1216/1614 (removed 398) transitions.
Finished structural reductions, in 1 iterations. Remains : 420/618 places, 1216/1614 transitions.
Incomplete random walk after 10001 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 1433 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=716 )
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 273 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 100 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 168 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 1614/1614 transitions.
Applied a total of 0 rules in 13 ms. Remains 618 /618 variables (removed 0) and now considering 1614/1614 (removed 0) transitions.
[2022-06-10 10:32:31] [INFO ] Flow matrix only has 1084 transitions (discarded 530 similar events)
// Phase 1: matrix 1084 rows 618 cols
[2022-06-10 10:32:31] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 10:32:32] [INFO ] Implicit Places using invariants in 405 ms returned []
[2022-06-10 10:32:32] [INFO ] Flow matrix only has 1084 transitions (discarded 530 similar events)
// Phase 1: matrix 1084 rows 618 cols
[2022-06-10 10:32:32] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 10:32:32] [INFO ] State equation strengthened by 272 read => feed constraints.
[2022-06-10 10:32:33] [INFO ] Implicit Places using invariants and state equation in 1690 ms returned []
Implicit Place search using SMT with State Equation took 2120 ms to find 0 implicit places.
[2022-06-10 10:32:33] [INFO ] Flow matrix only has 1084 transitions (discarded 530 similar events)
// Phase 1: matrix 1084 rows 618 cols
[2022-06-10 10:32:33] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-10 10:32:34] [INFO ] Dead Transitions using invariants and state equation in 575 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 618/618 places, 1614/1614 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 p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 207 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 109 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2022-06-10 10:32:35] [INFO ] Flow matrix only has 1084 transitions (discarded 530 similar events)
// Phase 1: matrix 1084 rows 618 cols
[2022-06-10 10:32:35] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 10:32:35] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 10:32:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 10:32:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 10:32:35] [INFO ] After 258ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 10:32:35] [INFO ] State equation strengthened by 272 read => feed constraints.
[2022-06-10 10:32:35] [INFO ] After 97ms SMT Verify possible using 272 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 10:32:35] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-06-10 10:32:35] [INFO ] After 591ms 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 618 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 618/618 places, 1614/1614 transitions.
Graph (complete) has 2697 edges and 618 vertex of which 426 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 426 transition count 1230
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 387 place count 424 transition count 1226
Iterating global reduction 1 with 2 rules applied. Total rules applied 389 place count 424 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 390 place count 423 transition count 1224
Iterating global reduction 1 with 1 rules applied. Total rules applied 391 place count 423 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 392 place count 422 transition count 1222
Iterating global reduction 1 with 1 rules applied. Total rules applied 393 place count 422 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 394 place count 421 transition count 1220
Iterating global reduction 1 with 1 rules applied. Total rules applied 395 place count 421 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 396 place count 420 transition count 1218
Iterating global reduction 1 with 1 rules applied. Total rules applied 397 place count 420 transition count 1218
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 399 place count 420 transition count 1216
Applied a total of 399 rules in 165 ms. Remains 420 /618 variables (removed 198) and now considering 1216/1614 (removed 398) transitions.
Finished structural reductions, in 1 iterations. Remains : 420/618 places, 1216/1614 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Finished Best-First random walk after 4294 steps, including 1 resets, run visited all 1 properties in 4 ms. (steps per millisecond=1073 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p1 p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 6 factoid took 268 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 92 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 106 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 93 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 454 ms.
Product exploration explored 100000 steps with 0 reset in 511 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 104 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 618/618 places, 1614/1614 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 618 transition count 1612
Applied a total of 2 rules in 208 ms. Remains 618 /618 variables (removed 0) and now considering 1612/1614 (removed 2) transitions.
[2022-06-10 10:32:38] [INFO ] Redundant transitions in 24 ms returned []
[2022-06-10 10:32:38] [INFO ] Flow matrix only has 1083 transitions (discarded 529 similar events)
// Phase 1: matrix 1083 rows 618 cols
[2022-06-10 10:32:38] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 10:32:38] [INFO ] Dead Transitions using invariants and state equation in 731 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 618/618 places, 1612/1614 transitions.
Finished structural reductions, in 1 iterations. Remains : 618/618 places, 1612/1614 transitions.
Product exploration explored 100000 steps with 0 reset in 432 ms.
Product exploration explored 100000 steps with 0 reset in 513 ms.
Built C files in :
/tmp/ltsmin10018606139563820782
[2022-06-10 10:32:39] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10018606139563820782
Running compilation step : cd /tmp/ltsmin10018606139563820782;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2853 ms.
Running link step : cd /tmp/ltsmin10018606139563820782;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin10018606139563820782;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13712419244130104537.hoa' '--buchi-type=spotba'
LTSmin run took 6197 ms.
FORMULA FunctionPointer-PT-c008-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FunctionPointer-PT-c008-LTLCardinality-03 finished in 23684 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&X(p0))))'
Support contains 2 out of 681 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 681/681 places, 1774/1774 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 673 transition count 1758
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 673 transition count 1758
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 673 transition count 1754
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 27 place count 666 transition count 1738
Iterating global reduction 1 with 7 rules applied. Total rules applied 34 place count 666 transition count 1738
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 40 place count 660 transition count 1724
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 660 transition count 1724
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 53 place count 653 transition count 1704
Iterating global reduction 1 with 7 rules applied. Total rules applied 60 place count 653 transition count 1704
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 66 place count 647 transition count 1686
Iterating global reduction 1 with 6 rules applied. Total rules applied 72 place count 647 transition count 1686
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 76 place count 643 transition count 1678
Iterating global reduction 1 with 4 rules applied. Total rules applied 80 place count 643 transition count 1678
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 84 place count 639 transition count 1670
Iterating global reduction 1 with 4 rules applied. Total rules applied 88 place count 639 transition count 1670
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 92 place count 635 transition count 1662
Iterating global reduction 1 with 4 rules applied. Total rules applied 96 place count 635 transition count 1662
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 99 place count 632 transition count 1656
Iterating global reduction 1 with 3 rules applied. Total rules applied 102 place count 632 transition count 1656
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 105 place count 629 transition count 1650
Iterating global reduction 1 with 3 rules applied. Total rules applied 108 place count 629 transition count 1650
Applied a total of 108 rules in 177 ms. Remains 629 /681 variables (removed 52) and now considering 1650/1774 (removed 124) transitions.
[2022-06-10 10:32:49] [INFO ] Flow matrix only has 1098 transitions (discarded 552 similar events)
// Phase 1: matrix 1098 rows 629 cols
[2022-06-10 10:32:49] [INFO ] Computed 2 place invariants in 14 ms
[2022-06-10 10:32:49] [INFO ] Implicit Places using invariants in 410 ms returned []
[2022-06-10 10:32:49] [INFO ] Flow matrix only has 1098 transitions (discarded 552 similar events)
// Phase 1: matrix 1098 rows 629 cols
[2022-06-10 10:32:49] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 10:32:49] [INFO ] State equation strengthened by 268 read => feed constraints.
[2022-06-10 10:32:51] [INFO ] Implicit Places using invariants and state equation in 1660 ms returned []
Implicit Place search using SMT with State Equation took 2074 ms to find 0 implicit places.
[2022-06-10 10:32:51] [INFO ] Flow matrix only has 1098 transitions (discarded 552 similar events)
// Phase 1: matrix 1098 rows 629 cols
[2022-06-10 10:32:51] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-10 10:32:51] [INFO ] Dead Transitions using invariants and state equation in 530 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 629/681 places, 1650/1774 transitions.
Finished structural reductions, in 1 iterations. Remains : 629/681 places, 1650/1774 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-06 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 s558 s560)], 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 859 ms.
Product exploration explored 100000 steps with 50000 reset in 842 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 :(X p0)
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA FunctionPointer-PT-c008-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c008-LTLCardinality-06 finished in 4678 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!(F(X(p0)) U p1)))&&G(F(p1))))'
Support contains 2 out of 681 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 681/681 places, 1774/1774 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 672 transition count 1756
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 672 transition count 1756
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 24 place count 672 transition count 1750
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 33 place count 663 transition count 1730
Iterating global reduction 1 with 9 rules applied. Total rules applied 42 place count 663 transition count 1730
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 46 place count 663 transition count 1726
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 53 place count 656 transition count 1710
Iterating global reduction 2 with 7 rules applied. Total rules applied 60 place count 656 transition count 1710
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 66 place count 650 transition count 1698
Iterating global reduction 2 with 6 rules applied. Total rules applied 72 place count 650 transition count 1698
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 78 place count 644 transition count 1682
Iterating global reduction 2 with 6 rules applied. Total rules applied 84 place count 644 transition count 1682
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 89 place count 639 transition count 1664
Iterating global reduction 2 with 5 rules applied. Total rules applied 94 place count 639 transition count 1664
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 99 place count 634 transition count 1650
Iterating global reduction 2 with 5 rules applied. Total rules applied 104 place count 634 transition count 1650
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 109 place count 629 transition count 1640
Iterating global reduction 2 with 5 rules applied. Total rules applied 114 place count 629 transition count 1640
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 118 place count 625 transition count 1632
Iterating global reduction 2 with 4 rules applied. Total rules applied 122 place count 625 transition count 1632
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 126 place count 621 transition count 1624
Iterating global reduction 2 with 4 rules applied. Total rules applied 130 place count 621 transition count 1624
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 134 place count 617 transition count 1616
Iterating global reduction 2 with 4 rules applied. Total rules applied 138 place count 617 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 140 place count 615 transition count 1612
Iterating global reduction 2 with 2 rules applied. Total rules applied 142 place count 615 transition count 1612
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 146 place count 615 transition count 1608
Applied a total of 146 rules in 342 ms. Remains 615 /681 variables (removed 66) and now considering 1608/1774 (removed 166) transitions.
[2022-06-10 10:32:53] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2022-06-10 10:32:53] [INFO ] Computed 2 place invariants in 14 ms
[2022-06-10 10:32:54] [INFO ] Implicit Places using invariants in 399 ms returned []
[2022-06-10 10:32:54] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2022-06-10 10:32:54] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 10:32:54] [INFO ] State equation strengthened by 265 read => feed constraints.
[2022-06-10 10:32:56] [INFO ] Implicit Places using invariants and state equation in 1769 ms returned []
Implicit Place search using SMT with State Equation took 2173 ms to find 0 implicit places.
[2022-06-10 10:32:56] [INFO ] Redundant transitions in 31 ms returned []
[2022-06-10 10:32:56] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2022-06-10 10:32:56] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-10 10:32:56] [INFO ] Dead Transitions using invariants and state equation in 537 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 615/681 places, 1608/1774 transitions.
Finished structural reductions, in 1 iterations. Remains : 615/681 places, 1608/1774 transitions.
Stuttering acceptance computed with spot in 200 ms :[true, (NOT p1), p1, (AND p1 p0), (AND p1 p0)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}], [{ cond=p1, acceptance={0, 1} source=2 dest: 2}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={1} source=3 dest: 4}], [{ cond=(AND p1 p0), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ s537 0), p0:(GT s75 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 74 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c008-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c008-LTLCardinality-07 finished in 3319 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 681 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 681/681 places, 1774/1774 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 672 transition count 1756
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 672 transition count 1756
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 26 place count 672 transition count 1748
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 35 place count 663 transition count 1730
Iterating global reduction 1 with 9 rules applied. Total rules applied 44 place count 663 transition count 1730
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 48 place count 663 transition count 1726
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 55 place count 656 transition count 1712
Iterating global reduction 2 with 7 rules applied. Total rules applied 62 place count 656 transition count 1712
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 70 place count 648 transition count 1690
Iterating global reduction 2 with 8 rules applied. Total rules applied 78 place count 648 transition count 1690
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 85 place count 641 transition count 1668
Iterating global reduction 2 with 7 rules applied. Total rules applied 92 place count 641 transition count 1668
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 97 place count 636 transition count 1654
Iterating global reduction 2 with 5 rules applied. Total rules applied 102 place count 636 transition count 1654
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 107 place count 631 transition count 1642
Iterating global reduction 2 with 5 rules applied. Total rules applied 112 place count 631 transition count 1642
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 117 place count 626 transition count 1632
Iterating global reduction 2 with 5 rules applied. Total rules applied 122 place count 626 transition count 1632
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 127 place count 621 transition count 1622
Iterating global reduction 2 with 5 rules applied. Total rules applied 132 place count 621 transition count 1622
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 137 place count 616 transition count 1612
Iterating global reduction 2 with 5 rules applied. Total rules applied 142 place count 616 transition count 1612
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 144 place count 614 transition count 1608
Iterating global reduction 2 with 2 rules applied. Total rules applied 146 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 147 place count 613 transition count 1606
Iterating global reduction 2 with 1 rules applied. Total rules applied 148 place count 613 transition count 1606
Applied a total of 148 rules in 161 ms. Remains 613 /681 variables (removed 68) and now considering 1606/1774 (removed 168) transitions.
[2022-06-10 10:32:57] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2022-06-10 10:32:57] [INFO ] Computed 2 place invariants in 11 ms
[2022-06-10 10:32:57] [INFO ] Implicit Places using invariants in 419 ms returned []
[2022-06-10 10:32:57] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2022-06-10 10:32:57] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 10:32:57] [INFO ] State equation strengthened by 265 read => feed constraints.
[2022-06-10 10:32:59] [INFO ] Implicit Places using invariants and state equation in 1585 ms returned []
Implicit Place search using SMT with State Equation took 2005 ms to find 0 implicit places.
[2022-06-10 10:32:59] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2022-06-10 10:32:59] [INFO ] Computed 2 place invariants in 13 ms
[2022-06-10 10:32:59] [INFO ] Dead Transitions using invariants and state equation in 501 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 613/681 places, 1606/1774 transitions.
Finished structural reductions, in 1 iterations. Remains : 613/681 places, 1606/1774 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-14 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 s540 0)], 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 797 ms.
Product exploration explored 100000 steps with 50000 reset in 813 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 :(X p0)
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA FunctionPointer-PT-c008-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c008-LTLCardinality-14 finished in 4437 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(G(X(p0))))))'
[2022-06-10 10:33:01] [INFO ] Flatten gal took : 50 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin18241207710709941160
[2022-06-10 10:33:01] [INFO ] Too many transitions (1774) to apply POR reductions. Disabling POR matrices.
[2022-06-10 10:33:01] [INFO ] Applying decomposition
[2022-06-10 10:33:01] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18241207710709941160
Running compilation step : cd /tmp/ltsmin18241207710709941160;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-10 10:33:01] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10665851680917550799.txt' '-o' '/tmp/graph10665851680917550799.bin' '-w' '/tmp/graph10665851680917550799.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10665851680917550799.bin' '-l' '-1' '-v' '-w' '/tmp/graph10665851680917550799.weights' '-q' '0' '-e' '0.001'
[2022-06-10 10:33:01] [INFO ] Decomposing Gal with order
[2022-06-10 10:33:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 10:33:01] [INFO ] Removed a total of 2993 redundant transitions.
[2022-06-10 10:33:01] [INFO ] Flatten gal took : 89 ms
[2022-06-10 10:33:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 1267 labels/synchronizations in 84 ms.
[2022-06-10 10:33:01] [INFO ] Time to serialize gal into /tmp/LTLCardinality12966993756632301648.gal : 7 ms
[2022-06-10 10:33:01] [INFO ] Time to serialize properties into /tmp/LTLCardinality3281315827575871243.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality12966993756632301648.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3281315827575871243.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...268
Read 1 LTL properties
Checking formula 0 : !((G(F(G(G(X("(i3.u24.l473<2)")))))))
Formula 0 simplified : !GFGX"(i3.u24.l473<2)"
Compilation finished in 3461 ms.
Running link step : cd /tmp/ltsmin18241207710709941160;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin18241207710709941160;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>([]([](X((LTLAPp0==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: LTL layer: formula: [](<>([]([](X((LTLAPp0==true))))))
pins2lts-mc-linux64( 0/ 8), 0.005: "[](<>([]([](X((LTLAPp0==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.005: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.027: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.027: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.028: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.028: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.028: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.030: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.032: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.040: buchi has 2 states
pins2lts-mc-linux64( 0/ 8), 0.488: There are 1776 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.488: State length is 682, there are 1778 groups
pins2lts-mc-linux64( 0/ 8), 0.488: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.488: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.488: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.488: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.863: [Blue] ~120 levels ~960 states ~5048 transitions
pins2lts-mc-linux64( 5/ 8), 1.350: [Blue] ~240 levels ~1920 states ~9584 transitions
pins2lts-mc-linux64( 5/ 8), 2.392: [Blue] ~480 levels ~3840 states ~18648 transitions
pins2lts-mc-linux64( 5/ 8), 4.141: [Blue] ~960 levels ~7680 states ~36824 transitions
pins2lts-mc-linux64( 5/ 8), 6.823: [Blue] ~1920 levels ~15360 states ~73136 transitions
pins2lts-mc-linux64( 5/ 8), 12.483: [Blue] ~3840 levels ~30720 states ~145736 transitions
pins2lts-mc-linux64( 5/ 8), 20.490: [Blue] ~7680 levels ~61440 states ~290960 transitions
pins2lts-mc-linux64( 5/ 8), 31.196: [Blue] ~15360 levels ~122880 states ~581408 transitions
pins2lts-mc-linux64( 4/ 8), 49.568: [Blue] ~30720 levels ~245760 states ~986264 transitions
pins2lts-mc-linux64( 5/ 8), 72.666: [Blue] ~61440 levels ~491520 states ~2324072 transitions
pins2lts-mc-linux64( 4/ 8), 105.980: [Blue] ~122880 levels ~983040 states ~3935384 transitions
pins2lts-mc-linux64( 1/ 8), 173.259: [Blue] ~245760 levels ~1966080 states ~8848008 transitions
pins2lts-mc-linux64( 7/ 8), 310.962: [Blue] ~491520 levels ~3932160 states ~18679328 transitions
pins2lts-mc-linux64( 1/ 8), 346.399: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 346.637:
pins2lts-mc-linux64( 0/ 8), 346.637: Explored 4122338 states 25531708 transitions, fanout: 6.194
pins2lts-mc-linux64( 0/ 8), 346.637: Total exploration time 346.100 sec (345.910 sec minimum, 346.009 sec on average)
pins2lts-mc-linux64( 0/ 8), 346.637: States per second: 11911, Transitions per second: 73770
pins2lts-mc-linux64( 0/ 8), 346.637:
pins2lts-mc-linux64( 0/ 8), 346.637: State space has 23399764 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 346.637: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 346.637: blue states: 4122338 (17.62%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 346.637: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 346.637: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 346.637:
pins2lts-mc-linux64( 0/ 8), 346.637: Total memory used for local state coloring: 62.9MB
pins2lts-mc-linux64( 0/ 8), 346.637:
pins2lts-mc-linux64( 0/ 8), 346.637: Queue width: 8B, total height: 4122330, memory: 31.45MB
pins2lts-mc-linux64( 0/ 8), 346.637: Tree memory: 434.5MB, 19.5 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 346.637: Tree fill ratio (roots/leafs): 17.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 346.637: Stored 1801 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 346.637: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 346.637: Est. total memory use: 466.0MB (~1055.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin18241207710709941160;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>([]([](X((LTLAPp0==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin18241207710709941160;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>([]([](X((LTLAPp0==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-06-10 10:53:49] [INFO ] Flatten gal took : 66 ms
[2022-06-10 10:53:49] [INFO ] Time to serialize gal into /tmp/LTLCardinality11434786880272367075.gal : 13 ms
[2022-06-10 10:53:49] [INFO ] Time to serialize properties into /tmp/LTLCardinality6670227118444999715.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11434786880272367075.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6670227118444999715.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 1 LTL properties
Checking formula 0 : !((G(F(G(G(X("(l473<2)")))))))
Formula 0 simplified : !GFGX"(l473<2)"
Detected timeout of ITS tools.
[2022-06-10 11:14:46] [INFO ] Flatten gal took : 404 ms
[2022-06-10 11:14:48] [INFO ] Input system was already deterministic with 1774 transitions.
[2022-06-10 11:14:48] [INFO ] Transformed 681 places.
[2022-06-10 11:14:48] [INFO ] Transformed 1774 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/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//..//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
[2022-06-10 11:14:49] [INFO ] Time to serialize gal into /tmp/LTLCardinality7402043089235610755.gal : 24 ms
[2022-06-10 11:14:49] [INFO ] Time to serialize properties into /tmp/LTLCardinality8906975637734272810.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7402043089235610755.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8906975637734272810.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...333
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(G(G(X("(l473<2)")))))))
Formula 0 simplified : !GFGX"(l473<2)"

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-c008"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is FunctionPointer-PT-c008, 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 r312-tall-165472282300491"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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