fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r312-tall-165472282300483
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for FunctionPointer-PT-c004

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16223.168 3600000.00 3989932.00 314975.70 FTTFFTTFFFF?FTFT normal

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-165472282300483.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-c004, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282300483
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 7.1K Jun 7 17:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 7 17:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Jun 7 17:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Jun 7 17:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Jun 6 15:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Jun 7 17:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 7 17:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 7 17:22 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-c004-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1654853300016

Running Version 202205111006
[2022-06-10 09:28:21] [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 09:28:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 09:28:21] [INFO ] Load time of PNML (sax parser for PT used): 380 ms
[2022-06-10 09:28:21] [INFO ] Transformed 2826 places.
[2022-06-10 09:28:21] [INFO ] Transformed 8960 transitions.
[2022-06-10 09:28:21] [INFO ] Parsed PT model containing 2826 places and 8960 transitions in 529 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1198 places in 38 ms
Reduce places removed 1198 places and 2998 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-c004-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 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 297 places :
Symmetric choice reduction at 1 with 297 rule applications. Total rules 314 place count 1314 transition count 3688
Iterating global reduction 1 with 297 rules applied. Total rules applied 611 place count 1314 transition count 3688
Ensure Unique test removed 356 transitions
Reduce isomorphic transitions removed 356 transitions.
Iterating post reduction 1 with 356 rules applied. Total rules applied 967 place count 1314 transition count 3332
Discarding 154 places :
Symmetric choice reduction at 2 with 154 rule applications. Total rules 1121 place count 1160 transition count 3024
Iterating global reduction 2 with 154 rules applied. Total rules applied 1275 place count 1160 transition count 3024
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 2 with 64 rules applied. Total rules applied 1339 place count 1160 transition count 2960
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1352 place count 1147 transition count 2934
Iterating global reduction 3 with 13 rules applied. Total rules applied 1365 place count 1147 transition count 2934
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1378 place count 1134 transition count 2908
Iterating global reduction 3 with 13 rules applied. Total rules applied 1391 place count 1134 transition count 2908
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1404 place count 1121 transition count 2882
Iterating global reduction 3 with 13 rules applied. Total rules applied 1417 place count 1121 transition count 2882
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1430 place count 1108 transition count 2856
Iterating global reduction 3 with 13 rules applied. Total rules applied 1443 place count 1108 transition count 2856
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1456 place count 1095 transition count 2830
Iterating global reduction 3 with 13 rules applied. Total rules applied 1469 place count 1095 transition count 2830
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1481 place count 1083 transition count 2806
Iterating global reduction 3 with 12 rules applied. Total rules applied 1493 place count 1083 transition count 2806
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1505 place count 1071 transition count 2782
Iterating global reduction 3 with 12 rules applied. Total rules applied 1517 place count 1071 transition count 2782
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 1561 place count 1027 transition count 2620
Iterating global reduction 3 with 44 rules applied. Total rules applied 1605 place count 1027 transition count 2620
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 1662 place count 970 transition count 2392
Iterating global reduction 3 with 57 rules applied. Total rules applied 1719 place count 970 transition count 2392
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 1775 place count 914 transition count 2240
Iterating global reduction 3 with 56 rules applied. Total rules applied 1831 place count 914 transition count 2240
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 1887 place count 858 transition count 2128
Iterating global reduction 3 with 56 rules applied. Total rules applied 1943 place count 858 transition count 2128
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 1996 place count 805 transition count 2022
Iterating global reduction 3 with 53 rules applied. Total rules applied 2049 place count 805 transition count 2022
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 2102 place count 752 transition count 1916
Iterating global reduction 3 with 53 rules applied. Total rules applied 2155 place count 752 transition count 1916
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 2206 place count 701 transition count 1814
Iterating global reduction 3 with 51 rules applied. Total rules applied 2257 place count 701 transition count 1814
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 2275 place count 683 transition count 1778
Iterating global reduction 3 with 18 rules applied. Total rules applied 2293 place count 683 transition count 1778
Applied a total of 2293 rules in 1468 ms. Remains 683 /1628 variables (removed 945) and now considering 1778/5962 (removed 4184) transitions.
[2022-06-10 09:28:23] [INFO ] Flow matrix only has 1199 transitions (discarded 579 similar events)
// Phase 1: matrix 1199 rows 683 cols
[2022-06-10 09:28:23] [INFO ] Computed 2 place invariants in 30 ms
[2022-06-10 09:28:24] [INFO ] Implicit Places using invariants in 1083 ms returned []
[2022-06-10 09:28:24] [INFO ] Flow matrix only has 1199 transitions (discarded 579 similar events)
// Phase 1: matrix 1199 rows 683 cols
[2022-06-10 09:28:24] [INFO ] Computed 2 place invariants in 13 ms
[2022-06-10 09:28:24] [INFO ] State equation strengthened by 297 read => feed constraints.
[2022-06-10 09:28:26] [INFO ] Implicit Places using invariants and state equation in 1880 ms returned []
Implicit Place search using SMT with State Equation took 2994 ms to find 0 implicit places.
[2022-06-10 09:28:26] [INFO ] Flow matrix only has 1199 transitions (discarded 579 similar events)
// Phase 1: matrix 1199 rows 683 cols
[2022-06-10 09:28:26] [INFO ] Computed 2 place invariants in 15 ms
[2022-06-10 09:28:27] [INFO ] Dead Transitions using invariants and state equation in 575 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 683/1628 places, 1778/5962 transitions.
Finished structural reductions, in 1 iterations. Remains : 683/1628 places, 1778/5962 transitions.
Support contains 23 out of 683 places after structural reductions.
[2022-06-10 09:28:27] [INFO ] Flatten gal took : 135 ms
[2022-06-10 09:28:27] [INFO ] Flatten gal took : 94 ms
[2022-06-10 09:28:27] [INFO ] Input system was already deterministic with 1778 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 629 ms. (steps per millisecond=15 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 12) seen :1
Running SMT prover for 11 properties.
[2022-06-10 09:28:28] [INFO ] Flow matrix only has 1199 transitions (discarded 579 similar events)
// Phase 1: matrix 1199 rows 683 cols
[2022-06-10 09:28:28] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-10 09:28:28] [INFO ] After 251ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-06-10 09:28:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 09:28:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 09:28:29] [INFO ] After 617ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-06-10 09:28:29] [INFO ] State equation strengthened by 297 read => feed constraints.
[2022-06-10 09:28:29] [INFO ] After 440ms SMT Verify possible using 297 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2022-06-10 09:28:30] [INFO ] Deduced a trap composed of 131 places in 169 ms of which 4 ms to minimize.
[2022-06-10 09:28:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2022-06-10 09:28:30] [INFO ] After 1420ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 444 ms.
[2022-06-10 09:28:31] [INFO ] After 2835ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 13 ms.
Support contains 16 out of 683 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 683/683 places, 1778/1778 transitions.
Graph (complete) has 2938 edges and 683 vertex of which 503 are kept as prefixes of interest. Removing 180 places using SCC suffix rule.9 ms
Discarding 180 places :
Also discarding 0 output transitions
Drop transitions removed 362 transitions
Reduce isomorphic transitions removed 362 transitions.
Iterating post reduction 0 with 362 rules applied. Total rules applied 363 place count 503 transition count 1416
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 365 place count 501 transition count 1412
Iterating global reduction 1 with 2 rules applied. Total rules applied 367 place count 501 transition count 1412
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 369 place count 499 transition count 1408
Iterating global reduction 1 with 2 rules applied. Total rules applied 371 place count 499 transition count 1408
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 373 place count 497 transition count 1404
Iterating global reduction 1 with 2 rules applied. Total rules applied 375 place count 497 transition count 1404
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 376 place count 496 transition count 1402
Iterating global reduction 1 with 1 rules applied. Total rules applied 377 place count 496 transition count 1402
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 378 place count 495 transition count 1400
Iterating global reduction 1 with 1 rules applied. Total rules applied 379 place count 495 transition count 1400
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 1 with 14 rules applied. Total rules applied 393 place count 495 transition count 1386
Applied a total of 393 rules in 370 ms. Remains 495 /683 variables (removed 188) and now considering 1386/1778 (removed 392) transitions.
Finished structural reductions, in 1 iterations. Remains : 495/683 places, 1386/1778 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) 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 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2022-06-10 09:28:32] [INFO ] Flow matrix only has 817 transitions (discarded 569 similar events)
// Phase 1: matrix 817 rows 495 cols
[2022-06-10 09:28:32] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-10 09:28:32] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 09:28:32] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 09:28:32] [INFO ] After 324ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:3
[2022-06-10 09:28:32] [INFO ] State equation strengthened by 114 read => feed constraints.
[2022-06-10 09:28:32] [INFO ] After 105ms SMT Verify possible using 114 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-10 09:28:33] [INFO ] After 605ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-10 09:28:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-10 09:28:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 09:28:33] [INFO ] After 325ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-06-10 09:28:33] [INFO ] After 178ms SMT Verify possible using 114 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-06-10 09:28:33] [INFO ] Deduced a trap composed of 135 places in 185 ms of which 1 ms to minimize.
[2022-06-10 09:28:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 247 ms
[2022-06-10 09:28:34] [INFO ] After 654ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 157 ms.
[2022-06-10 09:28:34] [INFO ] After 1287ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 30 ms.
Support contains 8 out of 495 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 495/495 places, 1386/1386 transitions.
Graph (complete) has 2361 edges and 495 vertex of which 486 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 486 transition count 1370
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 481 transition count 1358
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 481 transition count 1358
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 481 transition count 1356
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 35 place count 475 transition count 1342
Iterating global reduction 2 with 6 rules applied. Total rules applied 41 place count 475 transition count 1342
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 45 place count 475 transition count 1338
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 50 place count 470 transition count 1326
Iterating global reduction 3 with 5 rules applied. Total rules applied 55 place count 470 transition count 1326
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 59 place count 466 transition count 1318
Iterating global reduction 3 with 4 rules applied. Total rules applied 63 place count 466 transition count 1318
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 67 place count 462 transition count 1308
Iterating global reduction 3 with 4 rules applied. Total rules applied 71 place count 462 transition count 1308
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 75 place count 458 transition count 1300
Iterating global reduction 3 with 4 rules applied. Total rules applied 79 place count 458 transition count 1300
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 83 place count 454 transition count 1292
Iterating global reduction 3 with 4 rules applied. Total rules applied 87 place count 454 transition count 1292
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 90 place count 451 transition count 1286
Iterating global reduction 3 with 3 rules applied. Total rules applied 93 place count 451 transition count 1286
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 95 place count 449 transition count 1282
Iterating global reduction 3 with 2 rules applied. Total rules applied 97 place count 449 transition count 1282
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 98 place count 448 transition count 1280
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 448 transition count 1280
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 100 place count 447 transition count 1278
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 447 transition count 1278
Applied a total of 101 rules in 221 ms. Remains 447 /495 variables (removed 48) and now considering 1278/1386 (removed 108) transitions.
Finished structural reductions, in 1 iterations. Remains : 447/495 places, 1278/1386 transitions.
Incomplete random walk after 10006 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-06-10 09:28:34] [INFO ] Flow matrix only has 736 transitions (discarded 542 similar events)
// Phase 1: matrix 736 rows 447 cols
[2022-06-10 09:28:34] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-10 09:28:34] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 09:28:34] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 09:28:35] [INFO ] After 249ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:3
[2022-06-10 09:28:35] [INFO ] State equation strengthened by 91 read => feed constraints.
[2022-06-10 09:28:35] [INFO ] After 81ms SMT Verify possible using 91 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-10 09:28:35] [INFO ] After 468ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-10 09:28:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-10 09:28:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 09:28:35] [INFO ] After 268ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-10 09:28:35] [INFO ] After 165ms SMT Verify possible using 91 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-06-10 09:28:36] [INFO ] After 366ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 100 ms.
[2022-06-10 09:28:36] [INFO ] After 859ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 7 out of 447 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 447/447 places, 1278/1278 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 446 transition count 1276
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 446 transition count 1276
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 446 transition count 1274
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 445 transition count 1272
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 445 transition count 1272
Applied a total of 6 rules in 76 ms. Remains 445 /447 variables (removed 2) and now considering 1272/1278 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 445/447 places, 1272/1278 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) 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 :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-06-10 09:28:36] [INFO ] Flow matrix only has 731 transitions (discarded 541 similar events)
// Phase 1: matrix 731 rows 445 cols
[2022-06-10 09:28:36] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-10 09:28:36] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 09:28:36] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 09:28:36] [INFO ] After 234ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2022-06-10 09:28:36] [INFO ] State equation strengthened by 89 read => feed constraints.
[2022-06-10 09:28:37] [INFO ] After 69ms SMT Verify possible using 89 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-10 09:28:37] [INFO ] After 410ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-10 09:28:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 09:28:37] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 09:28:37] [INFO ] After 240ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-10 09:28:37] [INFO ] After 129ms SMT Verify possible using 89 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-10 09:28:37] [INFO ] After 290ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 90 ms.
[2022-06-10 09:28:37] [INFO ] After 725ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 7 out of 445 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 445/445 places, 1272/1272 transitions.
Applied a total of 0 rules in 53 ms. Remains 445 /445 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 445/445 places, 1272/1272 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 189024 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 189024 steps, saw 115924 distinct states, run finished after 3002 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 4 properties.
[2022-06-10 09:28:41] [INFO ] Flow matrix only has 731 transitions (discarded 541 similar events)
// Phase 1: matrix 731 rows 445 cols
[2022-06-10 09:28:41] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 09:28:41] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 09:28:41] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 09:28:41] [INFO ] After 262ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2022-06-10 09:28:41] [INFO ] State equation strengthened by 89 read => feed constraints.
[2022-06-10 09:28:41] [INFO ] After 57ms SMT Verify possible using 89 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-10 09:28:41] [INFO ] After 441ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-10 09:28:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-06-10 09:28:41] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 09:28:41] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-10 09:28:41] [INFO ] After 153ms SMT Verify possible using 89 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-10 09:28:42] [INFO ] After 330ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 97 ms.
[2022-06-10 09:28:42] [INFO ] After 751ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 7 out of 445 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 445/445 places, 1272/1272 transitions.
Applied a total of 0 rules in 52 ms. Remains 445 /445 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 445/445 places, 1272/1272 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 445/445 places, 1272/1272 transitions.
Applied a total of 0 rules in 56 ms. Remains 445 /445 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
[2022-06-10 09:28:42] [INFO ] Flow matrix only has 731 transitions (discarded 541 similar events)
// Phase 1: matrix 731 rows 445 cols
[2022-06-10 09:28:42] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 09:28:42] [INFO ] Implicit Places using invariants in 325 ms returned []
[2022-06-10 09:28:42] [INFO ] Flow matrix only has 731 transitions (discarded 541 similar events)
// Phase 1: matrix 731 rows 445 cols
[2022-06-10 09:28:42] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-10 09:28:42] [INFO ] State equation strengthened by 89 read => feed constraints.
[2022-06-10 09:28:43] [INFO ] Implicit Places using invariants and state equation in 984 ms returned []
Implicit Place search using SMT with State Equation took 1311 ms to find 0 implicit places.
[2022-06-10 09:28:43] [INFO ] Redundant transitions in 93 ms returned []
[2022-06-10 09:28:43] [INFO ] Flow matrix only has 731 transitions (discarded 541 similar events)
// Phase 1: matrix 731 rows 445 cols
[2022-06-10 09:28:43] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-10 09:28:44] [INFO ] Dead Transitions using invariants and state equation in 425 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 445/445 places, 1272/1272 transitions.
Ensure Unique test removed 541 transitions
Reduce isomorphic transitions removed 541 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 556 rules applied. Total rules applied 556 place count 445 transition count 716
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 572 place count 430 transition count 715
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 573 place count 429 transition count 715
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 573 place count 429 transition count 643
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 717 place count 357 transition count 643
Performed 132 Post agglomeration using F-continuation condition.Transition count delta: 132
Deduced a syphon composed of 132 places in 0 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 264 rules applied. Total rules applied 981 place count 225 transition count 511
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1044 place count 162 transition count 385
Iterating global reduction 3 with 63 rules applied. Total rules applied 1107 place count 162 transition count 385
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1109 place count 162 transition count 383
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 1171 place count 100 transition count 259
Iterating global reduction 4 with 62 rules applied. Total rules applied 1233 place count 100 transition count 259
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 1295 place count 38 transition count 135
Iterating global reduction 4 with 62 rules applied. Total rules applied 1357 place count 38 transition count 135
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 4 with 62 rules applied. Total rules applied 1419 place count 38 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1421 place count 37 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1425 place count 35 transition count 73
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 1431 place count 35 transition count 67
Applied a total of 1431 rules in 54 ms. Remains 35 /445 variables (removed 410) and now considering 67/1272 (removed 1205) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 67 rows 35 cols
[2022-06-10 09:28:44] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 09:28:44] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-10 09:28:44] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 09:28:44] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-10 09:28:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-10 09:28:44] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 09:28:44] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-10 09:28:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 09:28:44] [INFO ] After 15ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-10 09:28:44] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-10 09:28:44] [INFO ] After 95ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2022-06-10 09:28:44] [INFO ] Flatten gal took : 4 ms
[2022-06-10 09:28:44] [INFO ] Flatten gal took : 5 ms
[2022-06-10 09:28:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7014211140013960698.gal : 2 ms
[2022-06-10 09:28:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1531673310746390462.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms5055807782245382098;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7014211140013960698.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1531673310746390462.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality1531673310746390462.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 25
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :25 after 70
Reachability property AtomicPropp14 is true.
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :70 after 3970
Reachability property AtomicPropp12 is true.
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :3970 after 11980
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :11980 after 22260
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :22260 after 51984
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :51984 after 148732
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :148732 after 491939
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :491939 after 1.77738e+06
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.77738e+06 after 6.77135e+06
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :6.77135e+06 after 2.63307e+07
Detected timeout of ITS tools.
[2022-06-10 09:28:59] [INFO ] Flatten gal took : 12 ms
[2022-06-10 09:28:59] [INFO ] Applying decomposition
[2022-06-10 09:28:59] [INFO ] Flatten gal took : 3 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/graph15995977678994089627.txt' '-o' '/tmp/graph15995977678994089627.bin' '-w' '/tmp/graph15995977678994089627.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15995977678994089627.bin' '-l' '-1' '-v' '-w' '/tmp/graph15995977678994089627.weights' '-q' '0' '-e' '0.001'
[2022-06-10 09:28:59] [INFO ] Decomposing Gal with order
[2022-06-10 09:28:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 09:28:59] [INFO ] Removed a total of 74 redundant transitions.
[2022-06-10 09:28:59] [INFO ] Flatten gal took : 39 ms
[2022-06-10 09:28:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2022-06-10 09:28:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5470474392735147589.gal : 2 ms
[2022-06-10 09:28:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14479035801777149230.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms5055807782245382098;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5470474392735147589.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14479035801777149230.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality14479035801777149230.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 140
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :140 after 13480
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :13480 after 503025
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :503025 after 3.89336e+06
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3.89336e+06 after 2.02587e+07
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2.02587e+07 after 9.13279e+07
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :9.13279e+07 after 3.8682e+08
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9227100845584098191
[2022-06-10 09:29:14] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9227100845584098191
Running compilation step : cd /tmp/ltsmin9227100845584098191;'/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 204 ms.
Running link step : cd /tmp/ltsmin9227100845584098191;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin9227100845584098191;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp6==true'
LTSmin run took 7347 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin9227100845584098191;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp15==true'
LTSmin run took 325 ms.
Found Violation
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' '!(X(G(X((G(p0) U (p1 U p2))))))'
Support contains 5 out of 683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 1778/1778 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 671 transition count 1752
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 671 transition count 1752
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 32 place count 671 transition count 1744
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 45 place count 658 transition count 1714
Iterating global reduction 1 with 13 rules applied. Total rules applied 58 place count 658 transition count 1714
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 62 place count 658 transition count 1710
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 71 place count 649 transition count 1688
Iterating global reduction 2 with 9 rules applied. Total rules applied 80 place count 649 transition count 1688
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 87 place count 642 transition count 1672
Iterating global reduction 2 with 7 rules applied. Total rules applied 94 place count 642 transition count 1672
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 636 transition count 1658
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 636 transition count 1658
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 111 place count 631 transition count 1646
Iterating global reduction 2 with 5 rules applied. Total rules applied 116 place count 631 transition count 1646
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 121 place count 626 transition count 1636
Iterating global reduction 2 with 5 rules applied. Total rules applied 126 place count 626 transition count 1636
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 130 place count 622 transition count 1626
Iterating global reduction 2 with 4 rules applied. Total rules applied 134 place count 622 transition count 1626
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 137 place count 619 transition count 1618
Iterating global reduction 2 with 3 rules applied. Total rules applied 140 place count 619 transition count 1618
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 142 place count 617 transition count 1614
Iterating global reduction 2 with 2 rules applied. Total rules applied 144 place count 617 transition count 1614
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 146 place count 615 transition count 1610
Iterating global reduction 2 with 2 rules applied. Total rules applied 148 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 149 place count 614 transition count 1608
Iterating global reduction 2 with 1 rules applied. Total rules applied 150 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 151 place count 613 transition count 1606
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 613 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 612 transition count 1604
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 612 transition count 1604
Applied a total of 154 rules in 232 ms. Remains 612 /683 variables (removed 71) and now considering 1604/1778 (removed 174) transitions.
[2022-06-10 09:29:23] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 612 cols
[2022-06-10 09:29:23] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-10 09:29:23] [INFO ] Implicit Places using invariants in 406 ms returned []
[2022-06-10 09:29:23] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 612 cols
[2022-06-10 09:29:23] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 09:29:23] [INFO ] State equation strengthened by 265 read => feed constraints.
[2022-06-10 09:29:25] [INFO ] Implicit Places using invariants and state equation in 1698 ms returned []
Implicit Place search using SMT with State Equation took 2107 ms to find 0 implicit places.
[2022-06-10 09:29:25] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 612 cols
[2022-06-10 09:29:25] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-10 09:29:25] [INFO ] Dead Transitions using invariants and state equation in 537 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 612/683 places, 1604/1778 transitions.
Finished structural reductions, in 1 iterations. Remains : 612/683 places, 1604/1778 transitions.
Stuttering acceptance computed with spot in 406 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p2 p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(LEQ s61 0), p1:(LEQ s531 s277), p0:(LEQ s267 s420)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 579 ms.
Product exploration explored 100000 steps with 0 reset in 558 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/612 stabilizing places and 512/1604 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (OR p2 p1 p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 443 ms. Reduced automaton from 7 states, 16 edges and 3 AP to 7 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 271 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p0), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2022-06-10 09:29:28] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 612 cols
[2022-06-10 09:29:28] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 09:29:28] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-10 09:29:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 09:29:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-10 09:29:29] [INFO ] After 439ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-06-10 09:29:29] [INFO ] State equation strengthened by 265 read => feed constraints.
[2022-06-10 09:29:29] [INFO ] After 279ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-06-10 09:29:29] [INFO ] After 637ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 227 ms.
[2022-06-10 09:29:30] [INFO ] After 1506ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 21 ms.
Support contains 5 out of 612 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 612/612 places, 1604/1604 transitions.
Graph (complete) has 2676 edges and 612 vertex of which 426 are kept as prefixes of interest. Removing 186 places using SCC suffix rule.1 ms
Discarding 186 places :
Also discarding 0 output transitions
Drop transitions removed 372 transitions
Reduce isomorphic transitions removed 372 transitions.
Iterating post reduction 0 with 372 rules applied. Total rules applied 373 place count 426 transition count 1232
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 377 place count 426 transition count 1228
Applied a total of 377 rules in 111 ms. Remains 426 /612 variables (removed 186) and now considering 1228/1604 (removed 376) transitions.
Finished structural reductions, in 1 iterations. Remains : 426/612 places, 1228/1604 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 6) 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 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-06-10 09:29:30] [INFO ] Flow matrix only has 699 transitions (discarded 529 similar events)
// Phase 1: matrix 699 rows 426 cols
[2022-06-10 09:29:30] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-10 09:29:30] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-10 09:29:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-10 09:29:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 09:29:31] [INFO ] After 281ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-10 09:29:31] [INFO ] State equation strengthened by 81 read => feed constraints.
[2022-06-10 09:29:31] [INFO ] After 141ms SMT Verify possible using 81 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-06-10 09:29:31] [INFO ] After 369ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 120 ms.
[2022-06-10 09:29:31] [INFO ] After 898ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 31 ms.
Support contains 5 out of 426 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 426/426 places, 1228/1228 transitions.
Applied a total of 0 rules in 67 ms. Remains 426 /426 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 426/426 places, 1228/1228 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 202097 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 202097 steps, saw 123939 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 5 properties.
[2022-06-10 09:29:34] [INFO ] Flow matrix only has 699 transitions (discarded 529 similar events)
// Phase 1: matrix 699 rows 426 cols
[2022-06-10 09:29:34] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 09:29:35] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-10 09:29:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 09:29:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 09:29:35] [INFO ] After 265ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-10 09:29:35] [INFO ] State equation strengthened by 81 read => feed constraints.
[2022-06-10 09:29:35] [INFO ] After 153ms SMT Verify possible using 81 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-06-10 09:29:35] [INFO ] After 379ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 118 ms.
[2022-06-10 09:29:35] [INFO ] After 880ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 31 ms.
Support contains 5 out of 426 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 426/426 places, 1228/1228 transitions.
Applied a total of 0 rules in 51 ms. Remains 426 /426 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 426/426 places, 1228/1228 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 426/426 places, 1228/1228 transitions.
Applied a total of 0 rules in 60 ms. Remains 426 /426 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
[2022-06-10 09:29:36] [INFO ] Flow matrix only has 699 transitions (discarded 529 similar events)
// Phase 1: matrix 699 rows 426 cols
[2022-06-10 09:29:36] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-10 09:29:36] [INFO ] Implicit Places using invariants in 310 ms returned []
[2022-06-10 09:29:36] [INFO ] Flow matrix only has 699 transitions (discarded 529 similar events)
// Phase 1: matrix 699 rows 426 cols
[2022-06-10 09:29:36] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-10 09:29:36] [INFO ] State equation strengthened by 81 read => feed constraints.
[2022-06-10 09:29:37] [INFO ] Implicit Places using invariants and state equation in 859 ms returned []
Implicit Place search using SMT with State Equation took 1171 ms to find 0 implicit places.
[2022-06-10 09:29:37] [INFO ] Redundant transitions in 24 ms returned []
[2022-06-10 09:29:37] [INFO ] Flow matrix only has 699 transitions (discarded 529 similar events)
// Phase 1: matrix 699 rows 426 cols
[2022-06-10 09:29:37] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 09:29:37] [INFO ] Dead Transitions using invariants and state equation in 404 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 426/426 places, 1228/1228 transitions.
Ensure Unique test removed 529 transitions
Reduce isomorphic transitions removed 529 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 539 rules applied. Total rules applied 539 place count 426 transition count 689
Reduce places removed 10 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 12 rules applied. Total rules applied 551 place count 416 transition count 687
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 553 place count 414 transition count 687
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 553 place count 414 transition count 616
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 695 place count 343 transition count 616
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 1 ms
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 3 with 248 rules applied. Total rules applied 943 place count 219 transition count 492
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1006 place count 156 transition count 366
Iterating global reduction 3 with 63 rules applied. Total rules applied 1069 place count 156 transition count 366
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1071 place count 156 transition count 364
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 1133 place count 94 transition count 240
Iterating global reduction 4 with 62 rules applied. Total rules applied 1195 place count 94 transition count 240
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 1257 place count 32 transition count 116
Iterating global reduction 4 with 62 rules applied. Total rules applied 1319 place count 32 transition count 116
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 4 with 60 rules applied. Total rules applied 1379 place count 32 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1381 place count 31 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1383 place count 30 transition count 58
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1386 place count 30 transition count 55
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1387 place count 30 transition count 55
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1388 place count 30 transition count 54
Applied a total of 1388 rules in 32 ms. Remains 30 /426 variables (removed 396) and now considering 54/1228 (removed 1174) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 54 rows 30 cols
[2022-06-10 09:29:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 09:29:37] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-10 09:29:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-10 09:29:37] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 09:29:37] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-10 09:29:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 09:29:37] [INFO ] After 13ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-06-10 09:29:37] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-06-10 09:29:37] [INFO ] After 106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2022-06-10 09:29:37] [INFO ] Flatten gal took : 3 ms
[2022-06-10 09:29:37] [INFO ] Flatten gal took : 2 ms
[2022-06-10 09:29:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17793843774996561657.gal : 1 ms
[2022-06-10 09:29:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7605034625195122050.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms1864292778693363448;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17793843774996561657.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7605034625195122050.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality7605034625195122050.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :10 after 55
Reachability property apf3 is true.
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :55 after 2335
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :2335 after 11928
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :11928 after 53508
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :53508 after 228060
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :228060 after 921564
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :921564 after 3.67777e+06
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :3.67777e+06 after 1.47237e+07
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :1.47237e+07 after 5.88643e+07
Detected timeout of ITS tools.
[2022-06-10 09:29:52] [INFO ] Flatten gal took : 2 ms
[2022-06-10 09:29:52] [INFO ] Applying decomposition
[2022-06-10 09:29:52] [INFO ] Flatten gal took : 2 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/graph13710255966644915466.txt' '-o' '/tmp/graph13710255966644915466.bin' '-w' '/tmp/graph13710255966644915466.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13710255966644915466.bin' '-l' '-1' '-v' '-w' '/tmp/graph13710255966644915466.weights' '-q' '0' '-e' '0.001'
[2022-06-10 09:29:52] [INFO ] Decomposing Gal with order
[2022-06-10 09:29:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 09:29:52] [INFO ] Removed a total of 36 redundant transitions.
[2022-06-10 09:29:52] [INFO ] Flatten gal took : 6 ms
[2022-06-10 09:29:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 2 ms.
[2022-06-10 09:29:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9775483737727690931.gal : 1 ms
[2022-06-10 09:29:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality811019439748843688.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms1864292778693363448;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9775483737727690931.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality811019439748843688.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...318
Loading property file /tmp/ReachabilityCardinality811019439748843688.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 25
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :25 after 120
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :120 after 3077
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :3077 after 14420
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :14420 after 58716
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :58716 after 228143
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :228143 after 921641
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :921641 after 3.67777e+06
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :3.67777e+06 after 1.4695e+07
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8759873442290518700
[2022-06-10 09:30:07] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8759873442290518700
Running compilation step : cd /tmp/ltsmin8759873442290518700;'/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 116 ms.
Running link step : cd /tmp/ltsmin8759873442290518700;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin8759873442290518700;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
LTSmin run took 476 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin8759873442290518700;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf1==true'
LTSmin run took 307 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin8759873442290518700;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf2==true'
LTSmin run took 153 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin8759873442290518700;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf6==true'
LTSmin run took 111 ms.
Found Violation
Knowledge obtained : [(AND p2 p1 p0), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (OR p2 p1 p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F (NOT p0)), (F (AND (NOT p2) p1))]
Knowledge based reduction with 7 factoid took 432 ms. Reduced automaton from 7 states, 16 edges and 3 AP to 7 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 294 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p0), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 283 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p0), (NOT p2), (NOT p2)]
Support contains 5 out of 612 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1604/1604 transitions.
Applied a total of 0 rules in 18 ms. Remains 612 /612 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2022-06-10 09:30:10] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 612 cols
[2022-06-10 09:30:10] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-10 09:30:10] [INFO ] Implicit Places using invariants in 406 ms returned []
[2022-06-10 09:30:10] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 612 cols
[2022-06-10 09:30:10] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 09:30:10] [INFO ] State equation strengthened by 265 read => feed constraints.
[2022-06-10 09:30:12] [INFO ] Implicit Places using invariants and state equation in 1905 ms returned []
Implicit Place search using SMT with State Equation took 2316 ms to find 0 implicit places.
[2022-06-10 09:30:12] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 612 cols
[2022-06-10 09:30:12] [INFO ] Computed 2 place invariants in 13 ms
[2022-06-10 09:30:13] [INFO ] Dead Transitions using invariants and state equation in 572 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 612/612 places, 1604/1604 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/612 stabilizing places and 512/1604 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1), (X (X (OR p0 p2 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 345 ms. Reduced automaton from 7 states, 16 edges and 3 AP to 7 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 285 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p0), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2022-06-10 09:30:14] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 612 cols
[2022-06-10 09:30:14] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-10 09:30:14] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-10 09:30:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 09:30:14] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 09:30:14] [INFO ] After 401ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-06-10 09:30:14] [INFO ] State equation strengthened by 265 read => feed constraints.
[2022-06-10 09:30:15] [INFO ] After 268ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-06-10 09:30:15] [INFO ] After 621ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 221 ms.
[2022-06-10 09:30:15] [INFO ] After 1427ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 21 ms.
Support contains 5 out of 612 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 612/612 places, 1604/1604 transitions.
Graph (complete) has 2676 edges and 612 vertex of which 426 are kept as prefixes of interest. Removing 186 places using SCC suffix rule.1 ms
Discarding 186 places :
Also discarding 0 output transitions
Drop transitions removed 372 transitions
Reduce isomorphic transitions removed 372 transitions.
Iterating post reduction 0 with 372 rules applied. Total rules applied 373 place count 426 transition count 1232
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 377 place count 426 transition count 1228
Applied a total of 377 rules in 104 ms. Remains 426 /612 variables (removed 186) and now considering 1228/1604 (removed 376) transitions.
Finished structural reductions, in 1 iterations. Remains : 426/612 places, 1228/1604 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) 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 4) seen :0
Running SMT prover for 4 properties.
[2022-06-10 09:30:16] [INFO ] Flow matrix only has 699 transitions (discarded 529 similar events)
// Phase 1: matrix 699 rows 426 cols
[2022-06-10 09:30:16] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 09:30:16] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-10 09:30:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-10 09:30:16] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 09:30:16] [INFO ] After 248ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-10 09:30:16] [INFO ] State equation strengthened by 81 read => feed constraints.
[2022-06-10 09:30:16] [INFO ] After 136ms SMT Verify possible using 81 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-10 09:30:16] [INFO ] After 299ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 99 ms.
[2022-06-10 09:30:16] [INFO ] After 762ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 13 ms.
Support contains 5 out of 426 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 426/426 places, 1228/1228 transitions.
Applied a total of 0 rules in 54 ms. Remains 426 /426 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 426/426 places, 1228/1228 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) 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 4) seen :0
Interrupted probabilistic random walk after 198954 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 198954 steps, saw 122013 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 4 properties.
[2022-06-10 09:30:20] [INFO ] Flow matrix only has 699 transitions (discarded 529 similar events)
// Phase 1: matrix 699 rows 426 cols
[2022-06-10 09:30:20] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 09:30:20] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-10 09:30:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 09:30:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 09:30:20] [INFO ] After 244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-10 09:30:20] [INFO ] State equation strengthened by 81 read => feed constraints.
[2022-06-10 09:30:20] [INFO ] After 125ms SMT Verify possible using 81 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-10 09:30:21] [INFO ] After 291ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 96 ms.
[2022-06-10 09:30:21] [INFO ] After 742ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 22 ms.
Support contains 5 out of 426 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 426/426 places, 1228/1228 transitions.
Applied a total of 0 rules in 57 ms. Remains 426 /426 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 426/426 places, 1228/1228 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 426/426 places, 1228/1228 transitions.
Applied a total of 0 rules in 48 ms. Remains 426 /426 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
[2022-06-10 09:30:21] [INFO ] Flow matrix only has 699 transitions (discarded 529 similar events)
// Phase 1: matrix 699 rows 426 cols
[2022-06-10 09:30:21] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 09:30:21] [INFO ] Implicit Places using invariants in 284 ms returned []
[2022-06-10 09:30:21] [INFO ] Flow matrix only has 699 transitions (discarded 529 similar events)
// Phase 1: matrix 699 rows 426 cols
[2022-06-10 09:30:21] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-10 09:30:21] [INFO ] State equation strengthened by 81 read => feed constraints.
[2022-06-10 09:30:22] [INFO ] Implicit Places using invariants and state equation in 833 ms returned []
Implicit Place search using SMT with State Equation took 1119 ms to find 0 implicit places.
[2022-06-10 09:30:22] [INFO ] Redundant transitions in 17 ms returned []
[2022-06-10 09:30:22] [INFO ] Flow matrix only has 699 transitions (discarded 529 similar events)
// Phase 1: matrix 699 rows 426 cols
[2022-06-10 09:30:22] [INFO ] Computed 2 place invariants in 14 ms
[2022-06-10 09:30:22] [INFO ] Dead Transitions using invariants and state equation in 420 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 426/426 places, 1228/1228 transitions.
Ensure Unique test removed 529 transitions
Reduce isomorphic transitions removed 529 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 539 rules applied. Total rules applied 539 place count 426 transition count 689
Reduce places removed 10 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 12 rules applied. Total rules applied 551 place count 416 transition count 687
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 553 place count 414 transition count 687
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 553 place count 414 transition count 616
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 695 place count 343 transition count 616
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 0 ms
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 3 with 248 rules applied. Total rules applied 943 place count 219 transition count 492
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1006 place count 156 transition count 366
Iterating global reduction 3 with 63 rules applied. Total rules applied 1069 place count 156 transition count 366
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1071 place count 156 transition count 364
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 1133 place count 94 transition count 240
Iterating global reduction 4 with 62 rules applied. Total rules applied 1195 place count 94 transition count 240
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 1257 place count 32 transition count 116
Iterating global reduction 4 with 62 rules applied. Total rules applied 1319 place count 32 transition count 116
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 4 with 60 rules applied. Total rules applied 1379 place count 32 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1381 place count 31 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1383 place count 30 transition count 58
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1386 place count 30 transition count 55
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1387 place count 30 transition count 55
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1388 place count 30 transition count 54
Applied a total of 1388 rules in 30 ms. Remains 30 /426 variables (removed 396) and now considering 54/1228 (removed 1174) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 54 rows 30 cols
[2022-06-10 09:30:22] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 09:30:22] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-10 09:30:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-10 09:30:22] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 09:30:22] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-10 09:30:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 09:30:22] [INFO ] After 10ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-10 09:30:22] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-10 09:30:22] [INFO ] After 78ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2022-06-10 09:30:22] [INFO ] Flatten gal took : 3 ms
[2022-06-10 09:30:22] [INFO ] Flatten gal took : 2 ms
[2022-06-10 09:30:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2674257326232467337.gal : 1 ms
[2022-06-10 09:30:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6561692766833615409.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms3549533093337531302;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2674257326232467337.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6561692766833615409.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality6561692766833615409.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 55
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :55 after 2335
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :2335 after 28308
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :28308 after 168420
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :168420 after 796908
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :796908 after 3.45164e+06
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :3.45164e+06 after 1.42677e+07
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :1.42677e+07 after 5.78923e+07
Detected timeout of ITS tools.
[2022-06-10 09:30:37] [INFO ] Flatten gal took : 2 ms
[2022-06-10 09:30:37] [INFO ] Applying decomposition
[2022-06-10 09:30:37] [INFO ] Flatten gal took : 2 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/graph2635199820109531434.txt' '-o' '/tmp/graph2635199820109531434.bin' '-w' '/tmp/graph2635199820109531434.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2635199820109531434.bin' '-l' '-1' '-v' '-w' '/tmp/graph2635199820109531434.weights' '-q' '0' '-e' '0.001'
[2022-06-10 09:30:37] [INFO ] Decomposing Gal with order
[2022-06-10 09:30:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 09:30:37] [INFO ] Removed a total of 34 redundant transitions.
[2022-06-10 09:30:37] [INFO ] Flatten gal took : 5 ms
[2022-06-10 09:30:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 7 ms.
[2022-06-10 09:30:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2892803844022699835.gal : 8 ms
[2022-06-10 09:30:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17316215675922915233.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms3549533093337531302;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2892803844022699835.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17316215675922915233.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality17316215675922915233.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 25
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :25 after 120
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :120 after 3077
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :3077 after 14420
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :14420 after 58716
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :58716 after 228143
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :228143 after 921641
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :921641 after 3.67777e+06
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :3.67777e+06 after 1.4695e+07
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin647322887572307951
[2022-06-10 09:30:53] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin647322887572307951
Running compilation step : cd /tmp/ltsmin647322887572307951;'/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 125 ms.
Running link step : cd /tmp/ltsmin647322887572307951;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin647322887572307951;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
LTSmin run took 400 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin647322887572307951;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf1==true'
LTSmin run took 345 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin647322887572307951;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf2==true'
LTSmin run took 165 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin647322887572307951;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf6==true'
LTSmin run took 142 ms.
Found Violation
Knowledge obtained : [(AND p0 p2 p1), (X (X (OR p0 p2 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2) p1)), (F (NOT p0)), (F (AND (NOT p2) p1))]
Knowledge based reduction with 7 factoid took 492 ms. Reduced automaton from 7 states, 16 edges and 3 AP to 7 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 273 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p0), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 255 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p0), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 258 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p0), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 449 ms.
Product exploration explored 100000 steps with 0 reset in 513 ms.
Applying partial POR strategy [false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 270 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p0), (NOT p2), (NOT p2)]
Support contains 5 out of 612 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 612/612 places, 1604/1604 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 612 transition count 1602
Applied a total of 2 rules in 319 ms. Remains 612 /612 variables (removed 0) and now considering 1602/1604 (removed 2) transitions.
[2022-06-10 09:30:57] [INFO ] Redundant transitions in 25 ms returned []
[2022-06-10 09:30:57] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 612 cols
[2022-06-10 09:30:57] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 09:30:57] [INFO ] Dead Transitions using invariants and state equation in 551 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 612/612 places, 1602/1604 transitions.
Finished structural reductions, in 1 iterations. Remains : 612/612 places, 1602/1604 transitions.
Product exploration explored 100000 steps with 0 reset in 467 ms.
Product exploration explored 100000 steps with 0 reset in 592 ms.
Built C files in :
/tmp/ltsmin7940268356751822942
[2022-06-10 09:30:59] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7940268356751822942
Running compilation step : cd /tmp/ltsmin7940268356751822942;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7940268356751822942;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7940268356751822942;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 5 out of 612 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1604/1604 transitions.
Applied a total of 0 rules in 18 ms. Remains 612 /612 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2022-06-10 09:31:02] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 612 cols
[2022-06-10 09:31:02] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 09:31:02] [INFO ] Implicit Places using invariants in 409 ms returned []
[2022-06-10 09:31:02] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 612 cols
[2022-06-10 09:31:02] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 09:31:02] [INFO ] State equation strengthened by 265 read => feed constraints.
[2022-06-10 09:31:04] [INFO ] Implicit Places using invariants and state equation in 1927 ms returned []
Implicit Place search using SMT with State Equation took 2340 ms to find 0 implicit places.
[2022-06-10 09:31:04] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 612 cols
[2022-06-10 09:31:04] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-10 09:31:04] [INFO ] Dead Transitions using invariants and state equation in 558 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 612/612 places, 1604/1604 transitions.
Built C files in :
/tmp/ltsmin16691669435461018333
[2022-06-10 09:31:05] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16691669435461018333
Running compilation step : cd /tmp/ltsmin16691669435461018333;'/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 2796 ms.
Running link step : cd /tmp/ltsmin16691669435461018333;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin16691669435461018333;'/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/stateBased278222906752309058.hoa' '--buchi-type=spotba'
LTSmin run took 341 ms.
FORMULA FunctionPointer-PT-c004-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FunctionPointer-PT-c004-LTLCardinality-00 finished in 105554 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&(F(p1) U !X(X(!p0))))))'
Support contains 1 out of 683 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 1778/1778 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 671 transition count 1750
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 671 transition count 1750
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 30 place count 671 transition count 1744
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 43 place count 658 transition count 1712
Iterating global reduction 1 with 13 rules applied. Total rules applied 56 place count 658 transition count 1712
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 60 place count 658 transition count 1708
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 70 place count 648 transition count 1684
Iterating global reduction 2 with 10 rules applied. Total rules applied 80 place count 648 transition count 1684
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 88 place count 640 transition count 1666
Iterating global reduction 2 with 8 rules applied. Total rules applied 96 place count 640 transition count 1666
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 103 place count 633 transition count 1650
Iterating global reduction 2 with 7 rules applied. Total rules applied 110 place count 633 transition count 1650
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 116 place count 627 transition count 1636
Iterating global reduction 2 with 6 rules applied. Total rules applied 122 place count 627 transition count 1636
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 128 place count 621 transition count 1624
Iterating global reduction 2 with 6 rules applied. Total rules applied 134 place count 621 transition count 1624
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 138 place count 617 transition count 1614
Iterating global reduction 2 with 4 rules applied. Total rules applied 142 place count 617 transition count 1614
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 145 place count 614 transition count 1606
Iterating global reduction 2 with 3 rules applied. Total rules applied 148 place count 614 transition count 1606
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 150 place count 612 transition count 1602
Iterating global reduction 2 with 2 rules applied. Total rules applied 152 place count 612 transition count 1602
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 154 place count 610 transition count 1598
Iterating global reduction 2 with 2 rules applied. Total rules applied 156 place count 610 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 157 place count 609 transition count 1596
Iterating global reduction 2 with 1 rules applied. Total rules applied 158 place count 609 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 159 place count 608 transition count 1594
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 608 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 161 place count 607 transition count 1592
Iterating global reduction 2 with 1 rules applied. Total rules applied 162 place count 607 transition count 1592
Applied a total of 162 rules in 163 ms. Remains 607 /683 variables (removed 76) and now considering 1592/1778 (removed 186) transitions.
[2022-06-10 09:31:08] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
// Phase 1: matrix 1063 rows 607 cols
[2022-06-10 09:31:08] [INFO ] Computed 2 place invariants in 13 ms
[2022-06-10 09:31:08] [INFO ] Implicit Places using invariants in 382 ms returned []
[2022-06-10 09:31:08] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
// Phase 1: matrix 1063 rows 607 cols
[2022-06-10 09:31:08] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 09:31:09] [INFO ] State equation strengthened by 264 read => feed constraints.
[2022-06-10 09:31:10] [INFO ] Implicit Places using invariants and state equation in 1517 ms returned []
Implicit Place search using SMT with State Equation took 1901 ms to find 0 implicit places.
[2022-06-10 09:31:10] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
// Phase 1: matrix 1063 rows 607 cols
[2022-06-10 09:31:10] [INFO ] Computed 2 place invariants in 11 ms
[2022-06-10 09:31:10] [INFO ] Dead Transitions using invariants and state equation in 553 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 607/683 places, 1592/1778 transitions.
Finished structural reductions, in 1 iterations. Remains : 607/683 places, 1592/1778 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s218 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c004-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c004-LTLCardinality-03 finished in 2737 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0) U X(p1))))'
Support contains 2 out of 683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 1778/1778 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 672 transition count 1754
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 672 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 30 place count 672 transition count 1746
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 42 place count 660 transition count 1718
Iterating global reduction 1 with 12 rules applied. Total rules applied 54 place count 660 transition count 1718
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 58 place count 660 transition count 1714
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 66 place count 652 transition count 1694
Iterating global reduction 2 with 8 rules applied. Total rules applied 74 place count 652 transition count 1694
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 80 place count 646 transition count 1680
Iterating global reduction 2 with 6 rules applied. Total rules applied 86 place count 646 transition count 1680
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 92 place count 640 transition count 1666
Iterating global reduction 2 with 6 rules applied. Total rules applied 98 place count 640 transition count 1666
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 103 place count 635 transition count 1654
Iterating global reduction 2 with 5 rules applied. Total rules applied 108 place count 635 transition count 1654
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 113 place count 630 transition count 1644
Iterating global reduction 2 with 5 rules applied. Total rules applied 118 place count 630 transition count 1644
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 122 place count 626 transition count 1634
Iterating global reduction 2 with 4 rules applied. Total rules applied 126 place count 626 transition count 1634
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 129 place count 623 transition count 1626
Iterating global reduction 2 with 3 rules applied. Total rules applied 132 place count 623 transition count 1626
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 134 place count 621 transition count 1622
Iterating global reduction 2 with 2 rules applied. Total rules applied 136 place count 621 transition count 1622
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 138 place count 619 transition count 1618
Iterating global reduction 2 with 2 rules applied. Total rules applied 140 place count 619 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 618 transition count 1616
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 617 transition count 1614
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 145 place count 616 transition count 1612
Iterating global reduction 2 with 1 rules applied. Total rules applied 146 place count 616 transition count 1612
Applied a total of 146 rules in 188 ms. Remains 616 /683 variables (removed 67) and now considering 1612/1778 (removed 166) transitions.
[2022-06-10 09:31:11] [INFO ] Flow matrix only has 1078 transitions (discarded 534 similar events)
// Phase 1: matrix 1078 rows 616 cols
[2022-06-10 09:31:11] [INFO ] Computed 2 place invariants in 11 ms
[2022-06-10 09:31:11] [INFO ] Implicit Places using invariants in 388 ms returned []
[2022-06-10 09:31:11] [INFO ] Flow matrix only has 1078 transitions (discarded 534 similar events)
// Phase 1: matrix 1078 rows 616 cols
[2022-06-10 09:31:11] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 09:31:11] [INFO ] State equation strengthened by 268 read => feed constraints.
[2022-06-10 09:31:13] [INFO ] Implicit Places using invariants and state equation in 1639 ms returned []
Implicit Place search using SMT with State Equation took 2028 ms to find 0 implicit places.
[2022-06-10 09:31:13] [INFO ] Flow matrix only has 1078 transitions (discarded 534 similar events)
// Phase 1: matrix 1078 rows 616 cols
[2022-06-10 09:31:13] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-10 09:31:13] [INFO ] Dead Transitions using invariants and state equation in 509 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 616/683 places, 1612/1778 transitions.
Finished structural reductions, in 1 iterations. Remains : 616/683 places, 1612/1778 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 3 s535), p1:(AND (LEQ 1 s529) (LEQ 3 s535))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c004-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c004-LTLCardinality-04 finished in 2939 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(X(p0))&&F(p1))))'
Support contains 4 out of 683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 1778/1778 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 672 transition count 1752
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 672 transition count 1752
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 30 place count 672 transition count 1744
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 42 place count 660 transition count 1714
Iterating global reduction 1 with 12 rules applied. Total rules applied 54 place count 660 transition count 1714
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 58 place count 660 transition count 1710
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 66 place count 652 transition count 1692
Iterating global reduction 2 with 8 rules applied. Total rules applied 74 place count 652 transition count 1692
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 81 place count 645 transition count 1678
Iterating global reduction 2 with 7 rules applied. Total rules applied 88 place count 645 transition count 1678
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 94 place count 639 transition count 1664
Iterating global reduction 2 with 6 rules applied. Total rules applied 100 place count 639 transition count 1664
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 105 place count 634 transition count 1652
Iterating global reduction 2 with 5 rules applied. Total rules applied 110 place count 634 transition count 1652
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 115 place count 629 transition count 1642
Iterating global reduction 2 with 5 rules applied. Total rules applied 120 place count 629 transition count 1642
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 123 place count 626 transition count 1634
Iterating global reduction 2 with 3 rules applied. Total rules applied 126 place count 626 transition count 1634
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 128 place count 624 transition count 1628
Iterating global reduction 2 with 2 rules applied. Total rules applied 130 place count 624 transition count 1628
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 132 place count 622 transition count 1624
Iterating global reduction 2 with 2 rules applied. Total rules applied 134 place count 622 transition count 1624
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 136 place count 620 transition count 1620
Iterating global reduction 2 with 2 rules applied. Total rules applied 138 place count 620 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 619 transition count 1618
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 619 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 618 transition count 1616
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 617 transition count 1614
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 617 transition count 1614
Applied a total of 144 rules in 189 ms. Remains 617 /683 variables (removed 66) and now considering 1614/1778 (removed 164) transitions.
[2022-06-10 09:31:14] [INFO ] Flow matrix only has 1079 transitions (discarded 535 similar events)
// Phase 1: matrix 1079 rows 617 cols
[2022-06-10 09:31:14] [INFO ] Computed 2 place invariants in 14 ms
[2022-06-10 09:31:14] [INFO ] Implicit Places using invariants in 425 ms returned []
[2022-06-10 09:31:14] [INFO ] Flow matrix only has 1079 transitions (discarded 535 similar events)
// Phase 1: matrix 1079 rows 617 cols
[2022-06-10 09:31:14] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-10 09:31:14] [INFO ] State equation strengthened by 267 read => feed constraints.
[2022-06-10 09:31:17] [INFO ] Implicit Places using invariants and state equation in 3098 ms returned []
Implicit Place search using SMT with State Equation took 3525 ms to find 0 implicit places.
[2022-06-10 09:31:17] [INFO ] Flow matrix only has 1079 transitions (discarded 535 similar events)
// Phase 1: matrix 1079 rows 617 cols
[2022-06-10 09:31:17] [INFO ] Computed 2 place invariants in 11 ms
[2022-06-10 09:31:18] [INFO ] Dead Transitions using invariants and state equation in 518 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 617/683 places, 1614/1778 transitions.
Finished structural reductions, in 1 iterations. Remains : 617/683 places, 1614/1778 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), true]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s525 s386), p0:(LEQ s545 s235)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33331 reset in 659 ms.
Product exploration explored 100000 steps with 33431 reset in 651 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 p1 p0), (X p0), (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 182 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), true]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2022-06-10 09:31:20] [INFO ] Flow matrix only has 1079 transitions (discarded 535 similar events)
// Phase 1: matrix 1079 rows 617 cols
[2022-06-10 09:31:20] [INFO ] Computed 2 place invariants in 15 ms
[2022-06-10 09:31:20] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 09:31:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2022-06-10 09:31:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 09:31:20] [INFO ] After 241ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 09:31:20] [INFO ] State equation strengthened by 267 read => feed constraints.
[2022-06-10 09:31:20] [INFO ] After 67ms SMT Verify possible using 267 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 09:31:20] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2022-06-10 09:31:20] [INFO ] After 499ms 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 617 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 617/617 places, 1614/1614 transitions.
Graph (complete) has 2693 edges and 617 vertex of which 428 are kept as prefixes of interest. Removing 189 places using SCC suffix rule.0 ms
Discarding 189 places :
Also discarding 0 output transitions
Drop transitions removed 379 transitions
Reduce isomorphic transitions removed 379 transitions.
Iterating post reduction 0 with 379 rules applied. Total rules applied 380 place count 428 transition count 1235
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 381 place count 427 transition count 1233
Iterating global reduction 1 with 1 rules applied. Total rules applied 382 place count 427 transition count 1233
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 383 place count 426 transition count 1231
Iterating global reduction 1 with 1 rules applied. Total rules applied 384 place count 426 transition count 1231
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 385 place count 425 transition count 1229
Iterating global reduction 1 with 1 rules applied. Total rules applied 386 place count 425 transition count 1229
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 390 place count 425 transition count 1225
Applied a total of 390 rules in 130 ms. Remains 425 /617 variables (removed 192) and now considering 1225/1614 (removed 389) transitions.
Finished structural reductions, in 1 iterations. Remains : 425/617 places, 1225/1614 transitions.
Finished random walk after 64 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=64 )
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 5 factoid took 375 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA FunctionPointer-PT-c004-LTLCardinality-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c004-LTLCardinality-07 finished in 7307 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(X(((p0 U p1)&&p2)))))'
Support contains 3 out of 683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 1778/1778 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 672 transition count 1752
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 672 transition count 1752
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 28 place count 672 transition count 1746
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 39 place count 661 transition count 1720
Iterating global reduction 1 with 11 rules applied. Total rules applied 50 place count 661 transition count 1720
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 58 place count 653 transition count 1702
Iterating global reduction 1 with 8 rules applied. Total rules applied 66 place count 653 transition count 1702
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 72 place count 647 transition count 1688
Iterating global reduction 1 with 6 rules applied. Total rules applied 78 place count 647 transition count 1688
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 83 place count 642 transition count 1678
Iterating global reduction 1 with 5 rules applied. Total rules applied 88 place count 642 transition count 1678
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 92 place count 638 transition count 1670
Iterating global reduction 1 with 4 rules applied. Total rules applied 96 place count 638 transition count 1670
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 100 place count 634 transition count 1662
Iterating global reduction 1 with 4 rules applied. Total rules applied 104 place count 634 transition count 1662
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 106 place count 632 transition count 1656
Iterating global reduction 1 with 2 rules applied. Total rules applied 108 place count 632 transition count 1656
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 110 place count 630 transition count 1650
Iterating global reduction 1 with 2 rules applied. Total rules applied 112 place count 630 transition count 1650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 629 transition count 1648
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 629 transition count 1648
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 628 transition count 1646
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 628 transition count 1646
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 627 transition count 1644
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 627 transition count 1644
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 626 transition count 1642
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 626 transition count 1642
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 625 transition count 1640
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 625 transition count 1640
Applied a total of 122 rules in 190 ms. Remains 625 /683 variables (removed 58) and now considering 1640/1778 (removed 138) transitions.
[2022-06-10 09:31:21] [INFO ] Flow matrix only has 1093 transitions (discarded 547 similar events)
// Phase 1: matrix 1093 rows 625 cols
[2022-06-10 09:31:21] [INFO ] Computed 2 place invariants in 11 ms
[2022-06-10 09:31:21] [INFO ] Implicit Places using invariants in 394 ms returned []
[2022-06-10 09:31:21] [INFO ] Flow matrix only has 1093 transitions (discarded 547 similar events)
// Phase 1: matrix 1093 rows 625 cols
[2022-06-10 09:31:21] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 09:31:22] [INFO ] State equation strengthened by 268 read => feed constraints.
[2022-06-10 09:31:24] [INFO ] Implicit Places using invariants and state equation in 2186 ms returned []
Implicit Place search using SMT with State Equation took 2582 ms to find 0 implicit places.
[2022-06-10 09:31:24] [INFO ] Flow matrix only has 1093 transitions (discarded 547 similar events)
// Phase 1: matrix 1093 rows 625 cols
[2022-06-10 09:31:24] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-10 09:31:24] [INFO ] Dead Transitions using invariants and state equation in 615 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 625/683 places, 1640/1778 transitions.
Finished structural reductions, in 1 iterations. Remains : 625/683 places, 1640/1778 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 2 s30), p2:(LEQ 1 s555), p1:(LEQ s547 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, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 430 ms.
Stack based approach found an accepted trace after 74 steps with 0 reset with depth 75 and stack size 75 in 1 ms.
FORMULA FunctionPointer-PT-c004-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c004-LTLCardinality-08 finished in 3984 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 3 out of 683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 1778/1778 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 672 transition count 1752
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 672 transition count 1752
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 28 place count 672 transition count 1746
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 40 place count 660 transition count 1716
Iterating global reduction 1 with 12 rules applied. Total rules applied 52 place count 660 transition count 1716
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 56 place count 660 transition count 1712
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 65 place count 651 transition count 1690
Iterating global reduction 2 with 9 rules applied. Total rules applied 74 place count 651 transition count 1690
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 81 place count 644 transition count 1674
Iterating global reduction 2 with 7 rules applied. Total rules applied 88 place count 644 transition count 1674
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 94 place count 638 transition count 1660
Iterating global reduction 2 with 6 rules applied. Total rules applied 100 place count 638 transition count 1660
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 105 place count 633 transition count 1648
Iterating global reduction 2 with 5 rules applied. Total rules applied 110 place count 633 transition count 1648
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 115 place count 628 transition count 1638
Iterating global reduction 2 with 5 rules applied. Total rules applied 120 place count 628 transition count 1638
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 123 place count 625 transition count 1632
Iterating global reduction 2 with 3 rules applied. Total rules applied 126 place count 625 transition count 1632
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 128 place count 623 transition count 1628
Iterating global reduction 2 with 2 rules applied. Total rules applied 130 place count 623 transition count 1628
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 131 place count 622 transition count 1626
Iterating global reduction 2 with 1 rules applied. Total rules applied 132 place count 622 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 133 place count 621 transition count 1624
Iterating global reduction 2 with 1 rules applied. Total rules applied 134 place count 621 transition count 1624
Applied a total of 134 rules in 147 ms. Remains 621 /683 variables (removed 62) and now considering 1624/1778 (removed 154) transitions.
[2022-06-10 09:31:25] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 621 cols
[2022-06-10 09:31:25] [INFO ] Computed 2 place invariants in 17 ms
[2022-06-10 09:31:25] [INFO ] Implicit Places using invariants in 397 ms returned []
[2022-06-10 09:31:25] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 621 cols
[2022-06-10 09:31:25] [INFO ] Computed 2 place invariants in 14 ms
[2022-06-10 09:31:26] [INFO ] State equation strengthened by 268 read => feed constraints.
[2022-06-10 09:31:27] [INFO ] Implicit Places using invariants and state equation in 1812 ms returned []
Implicit Place search using SMT with State Equation took 2210 ms to find 0 implicit places.
[2022-06-10 09:31:27] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 621 cols
[2022-06-10 09:31:27] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 09:31:28] [INFO ] Dead Transitions using invariants and state equation in 499 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 621/683 places, 1624/1778 transitions.
Finished structural reductions, in 1 iterations. Remains : 621/683 places, 1624/1778 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LEQ 3 s474) (LEQ s523 s554))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c004-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c004-LTLCardinality-09 finished in 2972 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(G(p0)))))'
Support contains 2 out of 683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 683/683 places, 1778/1778 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 672 transition count 1752
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 672 transition count 1752
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 30 place count 672 transition count 1744
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 42 place count 660 transition count 1714
Iterating global reduction 1 with 12 rules applied. Total rules applied 54 place count 660 transition count 1714
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 58 place count 660 transition count 1710
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 66 place count 652 transition count 1690
Iterating global reduction 2 with 8 rules applied. Total rules applied 74 place count 652 transition count 1690
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 81 place count 645 transition count 1674
Iterating global reduction 2 with 7 rules applied. Total rules applied 88 place count 645 transition count 1674
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 94 place count 639 transition count 1660
Iterating global reduction 2 with 6 rules applied. Total rules applied 100 place count 639 transition count 1660
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 106 place count 633 transition count 1646
Iterating global reduction 2 with 6 rules applied. Total rules applied 112 place count 633 transition count 1646
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 118 place count 627 transition count 1634
Iterating global reduction 2 with 6 rules applied. Total rules applied 124 place count 627 transition count 1634
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 128 place count 623 transition count 1624
Iterating global reduction 2 with 4 rules applied. Total rules applied 132 place count 623 transition count 1624
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 135 place count 620 transition count 1616
Iterating global reduction 2 with 3 rules applied. Total rules applied 138 place count 620 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 140 place count 618 transition count 1612
Iterating global reduction 2 with 2 rules applied. Total rules applied 142 place count 618 transition count 1612
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 144 place count 616 transition count 1608
Iterating global reduction 2 with 2 rules applied. Total rules applied 146 place count 616 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 147 place count 615 transition count 1606
Iterating global reduction 2 with 1 rules applied. Total rules applied 148 place count 615 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 149 place count 614 transition count 1604
Iterating global reduction 2 with 1 rules applied. Total rules applied 150 place count 614 transition count 1604
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 151 place count 613 transition count 1602
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 613 transition count 1602
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 154 place count 613 transition count 1600
Applied a total of 154 rules in 374 ms. Remains 613 /683 variables (removed 70) and now considering 1600/1778 (removed 178) transitions.
[2022-06-10 09:31:28] [INFO ] Flow matrix only has 1072 transitions (discarded 528 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2022-06-10 09:31:28] [INFO ] Computed 2 place invariants in 13 ms
[2022-06-10 09:31:29] [INFO ] Implicit Places using invariants in 407 ms returned []
[2022-06-10 09:31:29] [INFO ] Flow matrix only has 1072 transitions (discarded 528 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2022-06-10 09:31:29] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-10 09:31:29] [INFO ] State equation strengthened by 267 read => feed constraints.
[2022-06-10 09:31:30] [INFO ] Implicit Places using invariants and state equation in 1602 ms returned []
Implicit Place search using SMT with State Equation took 2015 ms to find 0 implicit places.
[2022-06-10 09:31:30] [INFO ] Redundant transitions in 22 ms returned []
[2022-06-10 09:31:30] [INFO ] Flow matrix only has 1072 transitions (discarded 528 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2022-06-10 09:31:30] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 09:31:31] [INFO ] Dead Transitions using invariants and state equation in 530 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 613/683 places, 1600/1778 transitions.
Finished structural reductions, in 1 iterations. Remains : 613/683 places, 1600/1778 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LEQ s530 0) (LEQ 2 s526))], 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 419 ms.
Product exploration explored 100000 steps with 0 reset in 513 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 478 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 6860 steps, including 2 resets, run visited all 1 properties in 28 ms. (steps per millisecond=245 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 132 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 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Support contains 2 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 1600/1600 transitions.
Applied a total of 0 rules in 84 ms. Remains 613 /613 variables (removed 0) and now considering 1600/1600 (removed 0) transitions.
[2022-06-10 09:31:33] [INFO ] Flow matrix only has 1072 transitions (discarded 528 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2022-06-10 09:31:33] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 09:31:33] [INFO ] Implicit Places using invariants in 406 ms returned []
[2022-06-10 09:31:33] [INFO ] Flow matrix only has 1072 transitions (discarded 528 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2022-06-10 09:31:33] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-10 09:31:33] [INFO ] State equation strengthened by 267 read => feed constraints.
[2022-06-10 09:31:35] [INFO ] Implicit Places using invariants and state equation in 1660 ms returned []
Implicit Place search using SMT with State Equation took 2069 ms to find 0 implicit places.
[2022-06-10 09:31:35] [INFO ] Redundant transitions in 26 ms returned []
[2022-06-10 09:31:35] [INFO ] Flow matrix only has 1072 transitions (discarded 528 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2022-06-10 09:31:35] [INFO ] Computed 2 place invariants in 13 ms
[2022-06-10 09:31:35] [INFO ] Dead Transitions using invariants and state equation in 498 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 613/613 places, 1600/1600 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 120 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 31 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Finished Best-First random walk after 7291 steps, including 2 resets, run visited all 1 properties in 8 ms. (steps per millisecond=911 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 160 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 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 404 ms.
Product exploration explored 100000 steps with 0 reset in 496 ms.
Built C files in :
/tmp/ltsmin4973345622605397068
[2022-06-10 09:31:37] [INFO ] Too many transitions (1600) to apply POR reductions. Disabling POR matrices.
[2022-06-10 09:31:37] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4973345622605397068
Running compilation step : cd /tmp/ltsmin4973345622605397068;'/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 2944 ms.
Running link step : cd /tmp/ltsmin4973345622605397068;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4973345622605397068;'/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/stateBased7389612289842742651.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 1600/1600 transitions.
Applied a total of 0 rules in 74 ms. Remains 613 /613 variables (removed 0) and now considering 1600/1600 (removed 0) transitions.
[2022-06-10 09:31:52] [INFO ] Flow matrix only has 1072 transitions (discarded 528 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2022-06-10 09:31:52] [INFO ] Computed 2 place invariants in 14 ms
[2022-06-10 09:31:52] [INFO ] Implicit Places using invariants in 429 ms returned []
[2022-06-10 09:31:52] [INFO ] Flow matrix only has 1072 transitions (discarded 528 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2022-06-10 09:31:52] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 09:31:52] [INFO ] State equation strengthened by 267 read => feed constraints.
[2022-06-10 09:31:54] [INFO ] Implicit Places using invariants and state equation in 1548 ms returned []
Implicit Place search using SMT with State Equation took 1978 ms to find 0 implicit places.
[2022-06-10 09:31:54] [INFO ] Redundant transitions in 23 ms returned []
[2022-06-10 09:31:54] [INFO ] Flow matrix only has 1072 transitions (discarded 528 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2022-06-10 09:31:54] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 09:31:54] [INFO ] Dead Transitions using invariants and state equation in 503 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 613/613 places, 1600/1600 transitions.
Built C files in :
/tmp/ltsmin13817721579867967621
[2022-06-10 09:31:55] [INFO ] Too many transitions (1600) to apply POR reductions. Disabling POR matrices.
[2022-06-10 09:31:55] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13817721579867967621
Running compilation step : cd /tmp/ltsmin13817721579867967621;'/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 2868 ms.
Running link step : cd /tmp/ltsmin13817721579867967621;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin13817721579867967621;'/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/stateBased4426788821866367452.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-10 09:32:10] [INFO ] Flatten gal took : 58 ms
[2022-06-10 09:32:10] [INFO ] Flatten gal took : 65 ms
[2022-06-10 09:32:10] [INFO ] Time to serialize gal into /tmp/LTL152226011984157296.gal : 9 ms
[2022-06-10 09:32:10] [INFO ] Time to serialize properties into /tmp/LTL3528139534353839071.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/LTL152226011984157296.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3528139534353839071.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/LTL1522260...265
Read 1 LTL properties
Checking formula 0 : !((F(X(F(G("((l1381<=0)||(l1272>=2))"))))))
Formula 0 simplified : !FXFG"((l1381<=0)||(l1272>=2))"
Detected timeout of ITS tools.
[2022-06-10 09:32:25] [INFO ] Flatten gal took : 51 ms
[2022-06-10 09:32:25] [INFO ] Applying decomposition
[2022-06-10 09:32:25] [INFO ] Flatten gal took : 52 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/graph9092155838012789482.txt' '-o' '/tmp/graph9092155838012789482.bin' '-w' '/tmp/graph9092155838012789482.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9092155838012789482.bin' '-l' '-1' '-v' '-w' '/tmp/graph9092155838012789482.weights' '-q' '0' '-e' '0.001'
[2022-06-10 09:32:25] [INFO ] Decomposing Gal with order
[2022-06-10 09:32:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 09:32:25] [INFO ] Removed a total of 2655 redundant transitions.
[2022-06-10 09:32:25] [INFO ] Flatten gal took : 116 ms
[2022-06-10 09:32:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 1204 labels/synchronizations in 84 ms.
[2022-06-10 09:32:25] [INFO ] Time to serialize gal into /tmp/LTL17207100171316150839.gal : 15 ms
[2022-06-10 09:32:25] [INFO ] Time to serialize properties into /tmp/LTL3425677584869521382.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/LTL17207100171316150839.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3425677584869521382.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/LTL1720710...246
Read 1 LTL properties
Checking formula 0 : !((F(X(F(G("((i26.u141.l1381<=0)||(i27.i0.u139.l1272>=2))"))))))
Formula 0 simplified : !FXFG"((i26.u141.l1381<=0)||(i27.i0.u139.l1272>=2))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12410250990173232779
[2022-06-10 09:32:40] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12410250990173232779
Running compilation step : cd /tmp/ltsmin12410250990173232779;'/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 2821 ms.
Running link step : cd /tmp/ltsmin12410250990173232779;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin12410250990173232779;'/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-c004-LTLCardinality-11 finished in 87781 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(p0))))'
Support contains 1 out of 683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 1778/1778 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 670 transition count 1748
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 670 transition count 1748
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 34 place count 670 transition count 1740
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 48 place count 656 transition count 1706
Iterating global reduction 1 with 14 rules applied. Total rules applied 62 place count 656 transition count 1706
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 66 place count 656 transition count 1702
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 76 place count 646 transition count 1678
Iterating global reduction 2 with 10 rules applied. Total rules applied 86 place count 646 transition count 1678
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 94 place count 638 transition count 1660
Iterating global reduction 2 with 8 rules applied. Total rules applied 102 place count 638 transition count 1660
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 109 place count 631 transition count 1644
Iterating global reduction 2 with 7 rules applied. Total rules applied 116 place count 631 transition count 1644
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 122 place count 625 transition count 1630
Iterating global reduction 2 with 6 rules applied. Total rules applied 128 place count 625 transition count 1630
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 134 place count 619 transition count 1618
Iterating global reduction 2 with 6 rules applied. Total rules applied 140 place count 619 transition count 1618
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 144 place count 615 transition count 1608
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 615 transition count 1608
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 151 place count 612 transition count 1600
Iterating global reduction 2 with 3 rules applied. Total rules applied 154 place count 612 transition count 1600
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 156 place count 610 transition count 1596
Iterating global reduction 2 with 2 rules applied. Total rules applied 158 place count 610 transition count 1596
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 160 place count 608 transition count 1592
Iterating global reduction 2 with 2 rules applied. Total rules applied 162 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 163 place count 607 transition count 1590
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 165 place count 606 transition count 1588
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 605 transition count 1586
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 605 transition count 1586
Applied a total of 168 rules in 178 ms. Remains 605 /683 variables (removed 78) and now considering 1586/1778 (removed 192) transitions.
[2022-06-10 09:32:56] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2022-06-10 09:32:56] [INFO ] Computed 2 place invariants in 11 ms
[2022-06-10 09:32:56] [INFO ] Implicit Places using invariants in 416 ms returned []
[2022-06-10 09:32:56] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2022-06-10 09:32:56] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 09:32:56] [INFO ] State equation strengthened by 262 read => feed constraints.
[2022-06-10 09:32:58] [INFO ] Implicit Places using invariants and state equation in 1648 ms returned []
Implicit Place search using SMT with State Equation took 2065 ms to find 0 implicit places.
[2022-06-10 09:32:58] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2022-06-10 09:32:58] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-10 09:32:58] [INFO ] Dead Transitions using invariants and state equation in 483 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 605/683 places, 1586/1778 transitions.
Finished structural reductions, in 1 iterations. Remains : 605/683 places, 1586/1778 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c004-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 2 s265)], 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 0 reset in 375 ms.
Stack based approach found an accepted trace after 1378 steps with 0 reset with depth 1379 and stack size 1379 in 6 ms.
FORMULA FunctionPointer-PT-c004-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c004-LTLCardinality-14 finished in 3207 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(p0))))'
Support contains 1 out of 683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 1778/1778 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 671 transition count 1750
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 671 transition count 1750
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 30 place count 671 transition count 1744
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 43 place count 658 transition count 1712
Iterating global reduction 1 with 13 rules applied. Total rules applied 56 place count 658 transition count 1712
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 60 place count 658 transition count 1708
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 70 place count 648 transition count 1684
Iterating global reduction 2 with 10 rules applied. Total rules applied 80 place count 648 transition count 1684
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 88 place count 640 transition count 1666
Iterating global reduction 2 with 8 rules applied. Total rules applied 96 place count 640 transition count 1666
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 103 place count 633 transition count 1650
Iterating global reduction 2 with 7 rules applied. Total rules applied 110 place count 633 transition count 1650
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 116 place count 627 transition count 1636
Iterating global reduction 2 with 6 rules applied. Total rules applied 122 place count 627 transition count 1636
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 128 place count 621 transition count 1624
Iterating global reduction 2 with 6 rules applied. Total rules applied 134 place count 621 transition count 1624
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 138 place count 617 transition count 1614
Iterating global reduction 2 with 4 rules applied. Total rules applied 142 place count 617 transition count 1614
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 145 place count 614 transition count 1606
Iterating global reduction 2 with 3 rules applied. Total rules applied 148 place count 614 transition count 1606
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 150 place count 612 transition count 1602
Iterating global reduction 2 with 2 rules applied. Total rules applied 152 place count 612 transition count 1602
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 154 place count 610 transition count 1598
Iterating global reduction 2 with 2 rules applied. Total rules applied 156 place count 610 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 157 place count 609 transition count 1596
Iterating global reduction 2 with 1 rules applied. Total rules applied 158 place count 609 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 159 place count 608 transition count 1594
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 608 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 161 place count 607 transition count 1592
Iterating global reduction 2 with 1 rules applied. Total rules applied 162 place count 607 transition count 1592
Applied a total of 162 rules in 171 ms. Remains 607 /683 variables (removed 76) and now considering 1592/1778 (removed 186) transitions.
[2022-06-10 09:32:59] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
// Phase 1: matrix 1063 rows 607 cols
[2022-06-10 09:32:59] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-10 09:32:59] [INFO ] Implicit Places using invariants in 389 ms returned []
[2022-06-10 09:32:59] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
// Phase 1: matrix 1063 rows 607 cols
[2022-06-10 09:32:59] [INFO ] Computed 2 place invariants in 14 ms
[2022-06-10 09:33:00] [INFO ] State equation strengthened by 264 read => feed constraints.
[2022-06-10 09:33:01] [INFO ] Implicit Places using invariants and state equation in 1569 ms returned []
Implicit Place search using SMT with State Equation took 1960 ms to find 0 implicit places.
[2022-06-10 09:33:01] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
// Phase 1: matrix 1063 rows 607 cols
[2022-06-10 09:33:01] [INFO ] Computed 2 place invariants in 13 ms
[2022-06-10 09:33:01] [INFO ] Dead Transitions using invariants and state equation in 533 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 607/683 places, 1592/1778 transitions.
Finished structural reductions, in 1 iterations. Remains : 607/683 places, 1592/1778 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 3 s521)], 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 715 ms.
Product exploration explored 100000 steps with 50000 reset in 726 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 64 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA FunctionPointer-PT-c004-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c004-LTLCardinality-15 finished in 4272 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(G(p0)))))'
[2022-06-10 09:33:03] [INFO ] Flatten gal took : 52 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11919674128989551839
[2022-06-10 09:33:03] [INFO ] Too many transitions (1778) to apply POR reductions. Disabling POR matrices.
[2022-06-10 09:33:03] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11919674128989551839
Running compilation step : cd /tmp/ltsmin11919674128989551839;'/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 09:33:03] [INFO ] Applying decomposition
[2022-06-10 09:33:03] [INFO ] Flatten gal took : 55 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/graph9657877332028831005.txt' '-o' '/tmp/graph9657877332028831005.bin' '-w' '/tmp/graph9657877332028831005.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9657877332028831005.bin' '-l' '-1' '-v' '-w' '/tmp/graph9657877332028831005.weights' '-q' '0' '-e' '0.001'
[2022-06-10 09:33:03] [INFO ] Decomposing Gal with order
[2022-06-10 09:33:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 09:33:04] [INFO ] Removed a total of 2990 redundant transitions.
[2022-06-10 09:33:04] [INFO ] Flatten gal took : 101 ms
[2022-06-10 09:33:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 1272 labels/synchronizations in 81 ms.
[2022-06-10 09:33:04] [INFO ] Time to serialize gal into /tmp/LTLCardinality14012451338058532503.gal : 9 ms
[2022-06-10 09:33:04] [INFO ] Time to serialize properties into /tmp/LTLCardinality16639016403798879608.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/LTLCardinality14012451338058532503.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16639016403798879608.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...269
Read 1 LTL properties
Checking formula 0 : !((F(X(F(G("((i24.u157.l1381<=0)||(i20.u152.l1272>=2))"))))))
Formula 0 simplified : !FXFG"((i24.u157.l1381<=0)||(i20.u152.l1272>=2))"
Compilation finished in 3461 ms.
Running link step : cd /tmp/ltsmin11919674128989551839;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11919674128989551839;'/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.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: LTL layer: formula: <>(X(<>([]((LTLAPp0==true)))))
pins2lts-mc-linux64( 6/ 8), 0.009: "<>(X(<>([]((LTLAPp0==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.032: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.139: There are 1780 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.139: State length is 684, there are 1782 groups
pins2lts-mc-linux64( 0/ 8), 0.139: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.139: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.139: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.139: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.215: [Blue] ~120 levels ~960 states ~4504 transitions
pins2lts-mc-linux64( 1/ 8), 0.324: [Blue] ~204 levels ~1920 states ~8352 transitions
pins2lts-mc-linux64( 7/ 8), 0.481: [Blue] ~480 levels ~3840 states ~16032 transitions
pins2lts-mc-linux64( 0/ 8), 0.838: [Blue] ~960 levels ~7680 states ~25360 transitions
pins2lts-mc-linux64( 0/ 8), 1.420: [Blue] ~1920 levels ~15360 states ~50320 transitions
pins2lts-mc-linux64( 7/ 8), 3.828: [Blue] ~3840 levels ~30720 states ~123552 transitions
pins2lts-mc-linux64( 7/ 8), 5.724: [Blue] ~7680 levels ~61440 states ~246432 transitions
pins2lts-mc-linux64( 0/ 8), 9.208: [Blue] ~15360 levels ~122880 states ~399760 transitions
pins2lts-mc-linux64( 7/ 8), 15.545: [Blue] ~30720 levels ~245760 states ~983712 transitions
pins2lts-mc-linux64( 7/ 8), 27.994: [Blue] ~61440 levels ~491520 states ~1966752 transitions
pins2lts-mc-linux64( 7/ 8), 53.233: [Blue] ~122880 levels ~983040 states ~3932832 transitions
pins2lts-mc-linux64( 7/ 8), 103.605: [Blue] ~245760 levels ~1966080 states ~7864992 transitions
pins2lts-mc-linux64( 7/ 8), 203.282: [Blue] ~491520 levels ~3932160 states ~15729312 transitions
pins2lts-mc-linux64( 6/ 8), 217.605: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 217.834:
pins2lts-mc-linux64( 0/ 8), 217.834: Explored 4038143 states 20252689 transitions, fanout: 5.015
pins2lts-mc-linux64( 0/ 8), 217.834: Total exploration time 217.670 sec (217.490 sec minimum, 217.560 sec on average)
pins2lts-mc-linux64( 0/ 8), 217.834: States per second: 18552, Transitions per second: 93043
pins2lts-mc-linux64( 0/ 8), 217.834:
pins2lts-mc-linux64( 0/ 8), 217.834: State space has 19486991 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 217.834: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 217.834: blue states: 4038143 (20.72%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 217.834: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 217.834: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 217.834:
pins2lts-mc-linux64( 0/ 8), 217.834: Total memory used for local state coloring: 58.6MB
pins2lts-mc-linux64( 0/ 8), 217.834:
pins2lts-mc-linux64( 0/ 8), 217.834: Queue width: 8B, total height: 3838257, memory: 29.28MB
pins2lts-mc-linux64( 0/ 8), 217.834: Tree memory: 404.7MB, 21.8 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 217.834: Tree fill ratio (roots/leafs): 14.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 217.834: Stored 1811 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 217.835: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 217.835: Est. total memory use: 434.0MB (~1053.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11919674128989551839;'/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/ltsmin11919674128989551839;'/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 09:54:38] [INFO ] Flatten gal took : 48 ms
[2022-06-10 09:54:38] [INFO ] Time to serialize gal into /tmp/LTLCardinality15099425740540678305.gal : 6 ms
[2022-06-10 09:54:38] [INFO ] Time to serialize properties into /tmp/LTLCardinality14941270280129796838.ltl : 0 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/LTLCardinality15099425740540678305.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14941270280129796838.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...290
Read 1 LTL properties
Checking formula 0 : !((F(X(F(G("((l1381<=0)||(l1272>=2))"))))))
Formula 0 simplified : !FXFG"((l1381<=0)||(l1272>=2))"
Detected timeout of ITS tools.
[2022-06-10 10:16:24] [INFO ] Flatten gal took : 413 ms
[2022-06-10 10:16:25] [INFO ] Input system was already deterministic with 1778 transitions.
[2022-06-10 10:16:25] [INFO ] Transformed 683 places.
[2022-06-10 10:16:25] [INFO ] Transformed 1778 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 10:16:26] [INFO ] Time to serialize gal into /tmp/LTLCardinality6127400396054371884.gal : 8 ms
[2022-06-10 10:16:26] [INFO ] Time to serialize properties into /tmp/LTLCardinality11016769683918470491.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/LTLCardinality6127400396054371884.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11016769683918470491.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...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(X(F(G("((l1381<=0)||(l1272>=2))"))))))
Formula 0 simplified : !FXFG"((l1381<=0)||(l1272>=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-c004"
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-c004, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r312-tall-165472282300483"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c004.tgz
mv FunctionPointer-PT-c004 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;