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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
13715.472 3600000.00 11078212.00 8685.70 ?FFFTFFTFTTFTFTT 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-165472282200406.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-a064, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282200406
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 5.7K Jun 7 17:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Jun 7 17:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 7 17:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 7 17:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 15:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 6 15:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 6 15:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 8.0K Jun 7 17:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Jun 7 17:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Jun 7 17:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Jun 7 17:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:26 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 34K 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-a064-ReachabilityCardinality-00
FORMULA_NAME FunctionPointer-PT-a064-ReachabilityCardinality-01
FORMULA_NAME FunctionPointer-PT-a064-ReachabilityCardinality-02
FORMULA_NAME FunctionPointer-PT-a064-ReachabilityCardinality-03
FORMULA_NAME FunctionPointer-PT-a064-ReachabilityCardinality-04
FORMULA_NAME FunctionPointer-PT-a064-ReachabilityCardinality-05
FORMULA_NAME FunctionPointer-PT-a064-ReachabilityCardinality-06
FORMULA_NAME FunctionPointer-PT-a064-ReachabilityCardinality-07
FORMULA_NAME FunctionPointer-PT-a064-ReachabilityCardinality-08
FORMULA_NAME FunctionPointer-PT-a064-ReachabilityCardinality-09
FORMULA_NAME FunctionPointer-PT-a064-ReachabilityCardinality-10
FORMULA_NAME FunctionPointer-PT-a064-ReachabilityCardinality-11
FORMULA_NAME FunctionPointer-PT-a064-ReachabilityCardinality-12
FORMULA_NAME FunctionPointer-PT-a064-ReachabilityCardinality-13
FORMULA_NAME FunctionPointer-PT-a064-ReachabilityCardinality-14
FORMULA_NAME FunctionPointer-PT-a064-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654824494616

Running Version 202205111006
[2022-06-10 01:28:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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 01:28:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 01:28:15] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2022-06-10 01:28:15] [INFO ] Transformed 40 places.
[2022-06-10 01:28:15] [INFO ] Transformed 70 transitions.
[2022-06-10 01:28:15] [INFO ] Parsed PT model containing 40 places and 70 transitions in 167 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 4 transitions.
FORMULA FunctionPointer-PT-a064-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a064-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10011 steps, including 15 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 14) seen :5
FORMULA FunctionPointer-PT-a064-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a064-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a064-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a064-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a064-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 9) seen :1
FORMULA FunctionPointer-PT-a064-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 8) seen :1
FORMULA FunctionPointer-PT-a064-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :1
FORMULA FunctionPointer-PT-a064-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 19 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 21 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 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 01:28:16] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
// Phase 1: matrix 46 rows 34 cols
[2022-06-10 01:28:16] [INFO ] Computed 4 place invariants in 14 ms
[2022-06-10 01:28:16] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-10 01:28:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 01:28:16] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 01:28:16] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :3
[2022-06-10 01:28:16] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-06-10 01:28:17] [INFO ] After 13ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :3 sat :3
[2022-06-10 01:28:17] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 4 ms to minimize.
[2022-06-10 01:28:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2022-06-10 01:28:17] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :3
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-06-10 01:28:17] [INFO ] After 192ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :3
FORMULA FunctionPointer-PT-a064-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FunctionPointer-PT-a064-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FunctionPointer-PT-a064-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3724 ms.
Support contains 14 out of 34 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 34/34 places, 66/66 transitions.
Graph (complete) has 118 edges and 34 vertex of which 32 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 32 transition count 64
Applied a total of 3 rules in 15 ms. Remains 32 /34 variables (removed 2) and now considering 64/66 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 32/34 places, 64/66 transitions.
Incomplete random walk after 1000019 steps, including 2200 resets, run finished after 4319 ms. (steps per millisecond=231 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1561 resets, run finished after 1674 ms. (steps per millisecond=597 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1916 resets, run finished after 1421 ms. (steps per millisecond=703 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2103 resets, run finished after 1219 ms. (steps per millisecond=820 ) properties (out of 3) seen :1
FORMULA FunctionPointer-PT-a064-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
[2022-06-10 01:28:29] [INFO ] Flow matrix only has 45 transitions (discarded 19 similar events)
// Phase 1: matrix 45 rows 32 cols
[2022-06-10 01:28:29] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 01:28:29] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-10 01:28:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 01:28:29] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-10 01:28:29] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-06-10 01:28:29] [INFO ] After 10ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-10 01:28:29] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-10 01:28:29] [INFO ] After 76ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1398 ms.
Support contains 14 out of 32 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 32/32 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 32 /32 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 32/32 places, 64/64 transitions.
Incomplete random walk after 1000002 steps, including 2165 resets, run finished after 2899 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1608 resets, run finished after 1352 ms. (steps per millisecond=739 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1820 resets, run finished after 1051 ms. (steps per millisecond=951 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 3056048 steps, run timeout after 15001 ms. (steps per millisecond=203 ) properties seen :{}
Probabilistic random walk after 3056048 steps, saw 2062762 distinct states, run finished after 15002 ms. (steps per millisecond=203 ) properties seen :0
Running SMT prover for 2 properties.
[2022-06-10 01:28:51] [INFO ] Flow matrix only has 45 transitions (discarded 19 similar events)
// Phase 1: matrix 45 rows 32 cols
[2022-06-10 01:28:51] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 01:28:51] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-10 01:28:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-06-10 01:28:51] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-10 01:28:51] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-06-10 01:28:51] [INFO ] After 12ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-10 01:28:51] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-10 01:28:51] [INFO ] After 95ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1694 ms.
Support contains 14 out of 32 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 32/32 places, 64/64 transitions.
Applied a total of 0 rules in 15 ms. Remains 32 /32 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 32/32 places, 64/64 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 32/32 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 32 /32 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2022-06-10 01:28:53] [INFO ] Flow matrix only has 45 transitions (discarded 19 similar events)
// Phase 1: matrix 45 rows 32 cols
[2022-06-10 01:28:53] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 01:28:53] [INFO ] Implicit Places using invariants in 37 ms returned []
[2022-06-10 01:28:53] [INFO ] Flow matrix only has 45 transitions (discarded 19 similar events)
// Phase 1: matrix 45 rows 32 cols
[2022-06-10 01:28:53] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-10 01:28:53] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-06-10 01:28:53] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2022-06-10 01:28:53] [INFO ] Redundant transitions in 0 ms returned []
[2022-06-10 01:28:53] [INFO ] Flow matrix only has 45 transitions (discarded 19 similar events)
// Phase 1: matrix 45 rows 32 cols
[2022-06-10 01:28:53] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 01:28:53] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32/32 places, 64/64 transitions.
Incomplete random walk after 1000001 steps, including 2194 resets, run finished after 3133 ms. (steps per millisecond=319 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1594 resets, run finished after 1238 ms. (steps per millisecond=807 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1877 resets, run finished after 955 ms. (steps per millisecond=1047 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 2914790 steps, run timeout after 15001 ms. (steps per millisecond=194 ) properties seen :{}
Probabilistic random walk after 2914790 steps, saw 1986701 distinct states, run finished after 15001 ms. (steps per millisecond=194 ) properties seen :0
Running SMT prover for 2 properties.
[2022-06-10 01:29:13] [INFO ] Flow matrix only has 45 transitions (discarded 19 similar events)
// Phase 1: matrix 45 rows 32 cols
[2022-06-10 01:29:13] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 01:29:13] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-10 01:29:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 01:29:13] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-10 01:29:13] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-06-10 01:29:13] [INFO ] After 10ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-10 01:29:13] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-06-10 01:29:13] [INFO ] After 88ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1240 ms.
Support contains 14 out of 32 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 32/32 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 32 /32 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 32/32 places, 64/64 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 32/32 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2022-06-10 01:29:14] [INFO ] Flow matrix only has 45 transitions (discarded 19 similar events)
// Phase 1: matrix 45 rows 32 cols
[2022-06-10 01:29:14] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 01:29:14] [INFO ] Implicit Places using invariants in 32 ms returned []
[2022-06-10 01:29:14] [INFO ] Flow matrix only has 45 transitions (discarded 19 similar events)
// Phase 1: matrix 45 rows 32 cols
[2022-06-10 01:29:15] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 01:29:15] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-06-10 01:29:15] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2022-06-10 01:29:15] [INFO ] Redundant transitions in 0 ms returned []
[2022-06-10 01:29:15] [INFO ] Flow matrix only has 45 transitions (discarded 19 similar events)
// Phase 1: matrix 45 rows 32 cols
[2022-06-10 01:29:15] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 01:29:15] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32/32 places, 64/64 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 32 transition count 45
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 19 place count 32 transition count 42
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 29 transition count 42
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 1 with 2 rules applied. Total rules applied 27 place count 28 transition count 41
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 28 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 29 place count 27 transition count 40
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 27 transition count 39
Applied a total of 30 rules in 10 ms. Remains 27 /32 variables (removed 5) and now considering 39/64 (removed 25) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 39 rows 27 cols
[2022-06-10 01:29:15] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 01:29:15] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-10 01:29:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 01:29:15] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-10 01:29:15] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-10 01:29:15] [INFO ] After 53ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-10 01:29:15] [INFO ] Flatten gal took : 24 ms
[2022-06-10 01:29:15] [INFO ] Flatten gal took : 7 ms
[2022-06-10 01:29:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3723342073652939983.gal : 5 ms
[2022-06-10 01:29:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality514611377104977597.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3723342073652939983.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality514611377104977597.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/ReachabilityCardinality514611377104977597.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 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :315 after 6435
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :6435 after 3.01461e+07
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3.01461e+07 after 2.312e+08
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2.312e+08 after 1.07342e+09
Detected timeout of ITS tools.
[2022-06-10 01:29:30] [INFO ] Flatten gal took : 6 ms
[2022-06-10 01:29:30] [INFO ] Applying decomposition
[2022-06-10 01:29:30] [INFO ] Flatten gal took : 5 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/graph7802402393800209371.txt' '-o' '/tmp/graph7802402393800209371.bin' '-w' '/tmp/graph7802402393800209371.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7802402393800209371.bin' '-l' '-1' '-v' '-w' '/tmp/graph7802402393800209371.weights' '-q' '0' '-e' '0.001'
[2022-06-10 01:29:30] [INFO ] Decomposing Gal with order
[2022-06-10 01:29:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 01:29:30] [INFO ] Removed a total of 21 redundant transitions.
[2022-06-10 01:29:30] [INFO ] Flatten gal took : 35 ms
[2022-06-10 01:29:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2022-06-10 01:29:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1216529570107808172.gal : 2 ms
[2022-06-10 01:29:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality191854123132652955.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1216529570107808172.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality191854123132652955.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/ReachabilityCardinality191854123132652955.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 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :315 after 14883
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :14883 after 1.06348e+08
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.06348e+08 after 3.33042e+09
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3.33042e+09 after 3.24967e+10
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8939418915419250338
[2022-06-10 01:29:45] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8939418915419250338
Running compilation step : cd /tmp/ltsmin8939418915419250338;'/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 185 ms.
Running link step : cd /tmp/ltsmin8939418915419250338;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin8939418915419250338;'/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' 'FunctionPointerPTa064ReachabilityCardinality00==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-10 01:30:00] [INFO ] Flatten gal took : 6 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12678455103762135088
[2022-06-10 01:30:00] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2022-06-10 01:30:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 01:30:00] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2022-06-10 01:30:00] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 01:30:00] [INFO ] Applying decomposition
[2022-06-10 01:30:00] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2022-06-10 01:30:00] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 01:30:00] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12678455103762135088
[2022-06-10 01:30:00] [INFO ] Flatten gal took : 6 ms
[2022-06-10 01:30:00] [INFO ] Flatten gal took : 5 ms
Running compilation step : cd /tmp/ltsmin12678455103762135088;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' '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'
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/graph2600784231716996362.txt' '-o' '/tmp/graph2600784231716996362.bin' '-w' '/tmp/graph2600784231716996362.weights'
[2022-06-10 01:30:00] [INFO ] Input system was already deterministic with 64 transitions.
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2600784231716996362.bin' '-l' '-1' '-v' '-w' '/tmp/graph2600784231716996362.weights' '-q' '0' '-e' '0.001'
[2022-06-10 01:30:00] [INFO ] Decomposing Gal with order
[2022-06-10 01:30:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 01:30:00] [INFO ] Removed a total of 34 redundant transitions.
[2022-06-10 01:30:00] [INFO ] Flatten gal took : 9 ms
[2022-06-10 01:30:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 2 ms.
[2022-06-10 01:30:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12083601634081050414.gal : 2 ms
[2022-06-10 01:30:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18074282010969639896.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12083601634081050414.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18074282010969639896.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...321
Loading property file /tmp/ReachabilityCardinality18074282010969639896.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 10
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :10 after 31
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :31 after 101
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :101 after 343
[2022-06-10 01:30:00] [INFO ] Ran tautology test, simplified 0 / 2 in 94 ms.
[2022-06-10 01:30:00] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(UNSAT) depth K=0 took 20 ms
[2022-06-10 01:30:00] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(UNSAT) depth K=0 took 1 ms
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :343 after 1216
[2022-06-10 01:30:00] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(UNSAT) depth K=1 took 2 ms
[2022-06-10 01:30:00] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(UNSAT) depth K=1 took 0 ms
[2022-06-10 01:30:00] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(UNSAT) depth K=2 took 11 ms
[2022-06-10 01:30:00] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(UNSAT) depth K=2 took 2 ms
Compilation finished in 191 ms.
Running link step : cd /tmp/ltsmin12678455103762135088;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 45 out of 64 initially.
// Phase 1: matrix 45 rows 32 cols
[2022-06-10 01:30:00] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 01:30:00] [INFO ] Computed 3 place invariants in 2 ms
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin12678455103762135088;'/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' '-i' 'FunctionPointerPTa064ReachabilityCardinality00==true'
[2022-06-10 01:30:00] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(UNSAT) depth K=3 took 68 ms
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1216 after 32897
[2022-06-10 01:30:00] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(UNSAT) depth K=3 took 34 ms
[2022-06-10 01:30:00] [INFO ] Proved 32 variables to be positive in 97 ms
[2022-06-10 01:30:00] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a064-ReachabilityCardinality-00
[2022-06-10 01:30:00] [INFO ] KInduction solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(SAT) depth K=0 took 3 ms
[2022-06-10 01:30:00] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a064-ReachabilityCardinality-11
[2022-06-10 01:30:00] [INFO ] KInduction solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(SAT) depth K=0 took 1 ms
[2022-06-10 01:30:01] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a064-ReachabilityCardinality-00
[2022-06-10 01:30:01] [INFO ] KInduction solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(SAT) depth K=1 took 21 ms
[2022-06-10 01:30:01] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a064-ReachabilityCardinality-11
[2022-06-10 01:30:01] [INFO ] KInduction solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(SAT) depth K=1 took 3 ms
[2022-06-10 01:30:01] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a064-ReachabilityCardinality-00
[2022-06-10 01:30:01] [INFO ] KInduction solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(SAT) depth K=2 took 137 ms
[2022-06-10 01:30:01] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a064-ReachabilityCardinality-11
[2022-06-10 01:30:01] [INFO ] KInduction solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(SAT) depth K=2 took 23 ms
[2022-06-10 01:30:01] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(UNSAT) depth K=4 took 271 ms
[2022-06-10 01:30:01] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a064-ReachabilityCardinality-00
[2022-06-10 01:30:01] [INFO ] KInduction solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(SAT) depth K=3 took 173 ms
[2022-06-10 01:30:01] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(UNSAT) depth K=4 took 163 ms
[2022-06-10 01:30:01] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a064-ReachabilityCardinality-11
[2022-06-10 01:30:01] [INFO ] KInduction solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(SAT) depth K=3 took 193 ms
[2022-06-10 01:30:01] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a064-ReachabilityCardinality-00
[2022-06-10 01:30:01] [INFO ] KInduction solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(SAT) depth K=4 took 221 ms
[2022-06-10 01:30:01] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a064-ReachabilityCardinality-11
[2022-06-10 01:30:01] [INFO ] KInduction solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(SAT) depth K=4 took 119 ms
[2022-06-10 01:30:02] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a064-ReachabilityCardinality-00
[2022-06-10 01:30:02] [INFO ] KInduction solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(SAT) depth K=5 took 103 ms
[2022-06-10 01:30:02] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a064-ReachabilityCardinality-11
[2022-06-10 01:30:02] [INFO ] KInduction solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(SAT) depth K=5 took 654 ms
[2022-06-10 01:30:02] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(UNSAT) depth K=5 took 1271 ms
[2022-06-10 01:30:03] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a064-ReachabilityCardinality-00
[2022-06-10 01:30:03] [INFO ] KInduction solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(SAT) depth K=6 took 644 ms
[2022-06-10 01:30:03] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(UNSAT) depth K=5 took 784 ms
[2022-06-10 01:30:03] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a064-ReachabilityCardinality-11
[2022-06-10 01:30:03] [INFO ] KInduction solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(SAT) depth K=6 took 515 ms
[2022-06-10 01:30:04] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a064-ReachabilityCardinality-00
[2022-06-10 01:30:04] [INFO ] KInduction solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(SAT) depth K=7 took 600 ms
[2022-06-10 01:30:06] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a064-ReachabilityCardinality-11
[2022-06-10 01:30:06] [INFO ] KInduction solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(SAT) depth K=7 took 2241 ms
[2022-06-10 01:30:06] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(UNSAT) depth K=6 took 3289 ms
[2022-06-10 01:30:07] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(UNSAT) depth K=6 took 1150 ms
[2022-06-10 01:30:07] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a064-ReachabilityCardinality-00
[2022-06-10 01:30:07] [INFO ] KInduction solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(SAT) depth K=8 took 1333 ms
[2022-06-10 01:30:11] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(UNSAT) depth K=7 took 3208 ms
[2022-06-10 01:30:13] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(UNSAT) depth K=7 took 2220 ms
[2022-06-10 01:30:14] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a064-ReachabilityCardinality-11
[2022-06-10 01:30:14] [INFO ] KInduction solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(SAT) depth K=8 took 6305 ms
[2022-06-10 01:30:19] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a064-ReachabilityCardinality-00
[2022-06-10 01:30:19] [INFO ] KInduction solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(SAT) depth K=9 took 5108 ms
[2022-06-10 01:30:23] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(UNSAT) depth K=8 took 10320 ms
[2022-06-10 01:30:25] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a064-ReachabilityCardinality-11
[2022-06-10 01:30:25] [INFO ] KInduction solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(SAT) depth K=9 took 5651 ms
[2022-06-10 01:30:27] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(UNSAT) depth K=8 took 3456 ms
[2022-06-10 01:30:35] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(UNSAT) depth K=9 took 8443 ms
[2022-06-10 01:30:40] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(UNSAT) depth K=9 took 4632 ms
[2022-06-10 01:30:43] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a064-ReachabilityCardinality-00
[2022-06-10 01:30:43] [INFO ] KInduction solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(SAT) depth K=10 took 18887 ms
[2022-06-10 01:31:00] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(UNSAT) depth K=10 took 20332 ms
[2022-06-10 01:31:02] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a064-ReachabilityCardinality-11
[2022-06-10 01:31:02] [INFO ] KInduction solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(SAT) depth K=10 took 18239 ms
[2022-06-10 01:31:09] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(UNSAT) depth K=10 took 9437 ms
[2022-06-10 01:31:35] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(UNSAT) depth K=11 took 25248 ms
[2022-06-10 01:31:46] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(UNSAT) depth K=11 took 11003 ms
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :32897 after 3.78301e+11
[2022-06-10 01:32:17] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(UNSAT) depth K=12 took 30979 ms
[2022-06-10 01:32:20] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a064-ReachabilityCardinality-00
[2022-06-10 01:32:20] [INFO ] KInduction solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(SAT) depth K=11 took 78239 ms
[2022-06-10 01:32:37] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(UNSAT) depth K=12 took 19977 ms
[2022-06-10 01:32:39] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a064-ReachabilityCardinality-11
[2022-06-10 01:32:39] [INFO ] KInduction solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(SAT) depth K=11 took 19194 ms
[2022-06-10 01:33:19] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(UNSAT) depth K=13 took 41940 ms
[2022-06-10 01:33:41] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(UNSAT) depth K=13 took 22198 ms
[2022-06-10 01:34:27] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(UNSAT) depth K=14 took 46028 ms
[2022-06-10 01:34:42] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(UNSAT) depth K=14 took 14821 ms
[2022-06-10 01:35:29] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(UNSAT) depth K=15 took 47712 ms
[2022-06-10 01:36:04] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(UNSAT) depth K=15 took 34388 ms
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.007: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: 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( 3/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: Initializing POR dependencies: labels 66, guards 64
pins2lts-mc-linux64( 0/ 8), 0.016: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 2/ 8), 0.020: "FunctionPointerPTa064ReachabilityCardinality00==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.018: "FunctionPointerPTa064ReachabilityCardinality00==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.025: "FunctionPointerPTa064ReachabilityCardinality00==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.031: "FunctionPointerPTa064ReachabilityCardinality00==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.025: There are 66 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.025: State length is 32, there are 64 groups
pins2lts-mc-linux64( 0/ 8), 0.025: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.025: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.025: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.025: Visible groups: 0 / 64, labels: 1 / 66
pins2lts-mc-linux64( 0/ 8), 0.025: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 0.025: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.031: "FunctionPointerPTa064ReachabilityCardinality00==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.027: "FunctionPointerPTa064ReachabilityCardinality00==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.020: "FunctionPointerPTa064ReachabilityCardinality00==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.018: "FunctionPointerPTa064ReachabilityCardinality00==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.050: ~9 levels ~960 states ~3192 transitions
pins2lts-mc-linux64( 0/ 8), 0.062: ~11 levels ~1920 states ~6944 transitions
pins2lts-mc-linux64( 0/ 8), 0.126: ~13 levels ~3840 states ~15656 transitions
pins2lts-mc-linux64( 0/ 8), 0.164: ~14 levels ~7680 states ~30152 transitions
pins2lts-mc-linux64( 2/ 8), 0.271: ~10 levels ~15360 states ~77384 transitions
pins2lts-mc-linux64( 4/ 8), 0.466: ~10 levels ~30720 states ~135816 transitions
pins2lts-mc-linux64( 2/ 8), 0.743: ~13 levels ~61440 states ~311528 transitions
pins2lts-mc-linux64( 2/ 8), 1.194: ~14 levels ~122880 states ~625128 transitions
pins2lts-mc-linux64( 2/ 8), 2.001: ~15 levels ~245760 states ~1252048 transitions
pins2lts-mc-linux64( 4/ 8), 3.241: ~17 levels ~491520 states ~2180792 transitions
pins2lts-mc-linux64( 4/ 8), 4.971: ~19 levels ~983040 states ~4210672 transitions
pins2lts-mc-linux64( 4/ 8), 8.320: ~21 levels ~1966080 states ~8837552 transitions
pins2lts-mc-linux64( 1/ 8), 14.420: ~19 levels ~3932160 states ~17660888 transitions
pins2lts-mc-linux64( 4/ 8), 26.751: ~26 levels ~7864320 states ~33196072 transitions
pins2lts-mc-linux64( 0/ 8), 52.964: ~38 levels ~15728640 states ~69812304 transitions
pins2lts-mc-linux64( 1/ 8), 101.342: ~27 levels ~31457280 states ~136687696 transitions
pins2lts-mc-linux64( 6/ 8), 212.128: ~34 levels ~62914560 states ~290427728 transitions
pins2lts-mc-linux64( 6/ 8), 365.263: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 365.308:
pins2lts-mc-linux64( 0/ 8), 365.308: mean standard work distribution: 5.4% (states) 1.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 365.308:
pins2lts-mc-linux64( 0/ 8), 365.308: Explored 100690548 states 477739879 transitions, fanout: 4.745
pins2lts-mc-linux64( 0/ 8), 365.308: Total exploration time 365.280 sec (365.240 sec minimum, 365.259 sec on average)
pins2lts-mc-linux64( 0/ 8), 365.308: States per second: 275653, Transitions per second: 1307873
pins2lts-mc-linux64( 0/ 8), 365.308: Ignoring proviso: 0
pins2lts-mc-linux64( 0/ 8), 365.308:
pins2lts-mc-linux64( 0/ 8), 365.308: Queue width: 8B, total height: 34400234, memory: 262.45MB
pins2lts-mc-linux64( 0/ 8), 365.308: Tree memory: 1114.2MB, 8.7 B/state, compr.: 6.7%
pins2lts-mc-linux64( 0/ 8), 365.308: Tree fill ratio (roots/leafs): 99.0%/35.0%
pins2lts-mc-linux64( 0/ 8), 365.308: Stored 66 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 365.308: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 365.308: Est. total memory use: 1376.7MB (~1286.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12678455103762135088;'/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' '-i' 'FunctionPointerPTa064ReachabilityCardinality00==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12678455103762135088;'/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' '-i' 'FunctionPointerPTa064ReachabilityCardinality00==true'
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)
[2022-06-10 01:36:09] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a064-ReachabilityCardinality-00
[2022-06-10 01:36:09] [INFO ] KInduction solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(SAT) depth K=12 took 209845 ms
[2022-06-10 01:36:38] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(UNSAT) depth K=16 took 34058 ms
[2022-06-10 01:36:46] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a064-ReachabilityCardinality-11
[2022-06-10 01:36:46] [INFO ] KInduction solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(SAT) depth K=12 took 36629 ms
[2022-06-10 01:36:56] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(UNSAT) depth K=16 took 18092 ms
[2022-06-10 01:37:20] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(UNSAT) depth K=17 took 24118 ms
[2022-06-10 01:37:33] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(UNSAT) depth K=17 took 13245 ms
[2022-06-10 01:38:03] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(UNSAT) depth K=18 took 29813 ms
[2022-06-10 01:38:20] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(UNSAT) depth K=18 took 16405 ms
[2022-06-10 01:38:57] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a064-ReachabilityCardinality-00
[2022-06-10 01:38:57] [INFO ] KInduction solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(SAT) depth K=13 took 131060 ms
[2022-06-10 01:38:59] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(UNSAT) depth K=19 took 39863 ms
[2022-06-10 01:39:11] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a064-ReachabilityCardinality-11
[2022-06-10 01:39:11] [INFO ] KInduction solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(SAT) depth K=13 took 14015 ms
[2022-06-10 01:39:19] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(UNSAT) depth K=19 took 19952 ms
[2022-06-10 01:40:13] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(UNSAT) depth K=20 took 53245 ms
[2022-06-10 01:40:44] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(UNSAT) depth K=20 took 31660 ms
[2022-06-10 01:41:17] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(UNSAT) depth K=21 took 33077 ms
[2022-06-10 01:41:47] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(UNSAT) depth K=21 took 30049 ms
[2022-06-10 01:43:13] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(UNSAT) depth K=22 took 85939 ms
[2022-06-10 01:44:05] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(UNSAT) depth K=22 took 51193 ms
[2022-06-10 01:44:25] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a064-ReachabilityCardinality-00
[2022-06-10 01:44:25] [INFO ] KInduction solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(SAT) depth K=14 took 314131 ms
[2022-06-10 01:45:08] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(UNSAT) depth K=23 took 63707 ms
[2022-06-10 01:46:16] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(UNSAT) depth K=23 took 67324 ms
SDD proceeding with computation,2 properties remain. new max is 512
[2022-06-10 01:47:23] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(UNSAT) depth K=24 took 67240 ms
SDD size :3.78301e+11 after 5.09181e+14
[2022-06-10 01:47:46] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a064-ReachabilityCardinality-11
[2022-06-10 01:47:46] [INFO ] KInduction solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(SAT) depth K=14 took 200892 ms
[2022-06-10 01:48:33] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(UNSAT) depth K=24 took 69839 ms
[2022-06-10 01:49:21] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(UNSAT) depth K=25 took 48667 ms
Detected timeout of ITS tools.
[2022-06-10 01:50:35] [INFO ] Applying decomposition
[2022-06-10 01:50:35] [INFO ] Flatten gal took : 5 ms
[2022-06-10 01:50:35] [INFO ] Decomposing Gal with order
[2022-06-10 01:50:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 01:50:35] [INFO ] Could not find partition element corresponding to l4 in partition [s4, l11],[s0, s1, s2, s3, s5, l8, l10, l14, l24],[l0, l1, l2],[s8, l3, l5],[l16, l17, l21],[l18, l19],[l22, l23],[l9, l13, l20],

[2022-06-10 01:50:35] [INFO ] Could not find partition element corresponding to l12 in partition [s4, l11],[s0, s1, s2, s3, s5, l8, l10, l14, l24],[l0, l1, l2],[s8, l3, l5],[l16, l17, l21],[l18, l19],[l22, l23],[l9, l13, l20],

[2022-06-10 01:50:35] [INFO ] Could not find partition element corresponding to l15 in partition [s4, l11],[s0, s1, s2, s3, s5, l8, l10, l14, l24],[l0, l1, l2],[s8, l3, l5],[l16, l17, l21],[l18, l19],[l22, l23],[l9, l13, l20],

[2022-06-10 01:50:35] [INFO ] Could not find partition element corresponding to l25 in partition [s4, l11],[s0, s1, s2, s3, s5, l8, l10, l14, l24],[l0, l1, l2],[s8, l3, l5],[l16, l17, l21],[l18, l19],[l22, l23],[l9, l13, l20],

[2022-06-10 01:50:35] [INFO ] Could not find partition element corresponding to l27 in partition [s4, l11],[s0, s1, s2, s3, s5, l8, l10, l14, l24],[l0, l1, l2],[s8, l3, l5],[l16, l17, l21],[l18, l19],[l22, l23],[l9, l13, l20],

[2022-06-10 01:50:35] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.ArrayIndexOutOfBoundsException: Index -1 out of bounds for length 10
at org.eclipse.emf.common.util.BasicEList.get(BasicEList.java:348)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:564)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:231)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:264)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:116)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:957)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-06-10 01:50:35] [INFO ] Flatten gal took : 17 ms
[2022-06-10 01:50:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1192090628363501839.gal : 2 ms
[2022-06-10 01:50:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18260231050507862705.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1192090628363501839.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18260231050507862705.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/ReachabilityCardinality18260231050507862705.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 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 509
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :509 after 416435
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :416435 after 9.26693e+06
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :9.26693e+06 after 1.104e+08
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.104e+08 after 1.05486e+09
[2022-06-10 01:50:44] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(UNSAT) depth K=25 took 82708 ms
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.05486e+09 after 9.17396e+09
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :9.17396e+09 after 7.63991e+10
[2022-06-10 01:53:17] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(UNSAT) depth K=26 took 153113 ms
[2022-06-10 01:53:24] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a064-ReachabilityCardinality-00
[2022-06-10 01:53:24] [INFO ] KInduction solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(SAT) depth K=15 took 337893 ms
[2022-06-10 01:54:40] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(UNSAT) depth K=26 took 82685 ms
[2022-06-10 01:56:25] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(UNSAT) depth K=27 took 105304 ms
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :7.63991e+10 after 6.23235e+11
[2022-06-10 01:58:05] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(UNSAT) depth K=27 took 99994 ms
[2022-06-10 01:59:23] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a064-ReachabilityCardinality-11
[2022-06-10 01:59:23] [INFO ] KInduction solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(SAT) depth K=15 took 359770 ms
[2022-06-10 02:00:18] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(UNSAT) depth K=28 took 132517 ms
[2022-06-10 02:02:50] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(UNSAT) depth K=28 took 152096 ms
[2022-06-10 02:04:38] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(UNSAT) depth K=29 took 108296 ms
[2022-06-10 02:07:43] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(UNSAT) depth K=29 took 184962 ms
Detected timeout of ITS tools.
[2022-06-10 02:11:09] [INFO ] Flatten gal took : 5 ms
[2022-06-10 02:11:09] [INFO ] Input system was already deterministic with 64 transitions.
[2022-06-10 02:11:09] [INFO ] Transformed 32 places.
[2022-06-10 02:11:09] [INFO ] Transformed 64 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 02:11:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15393513973664091381.gal : 1 ms
[2022-06-10 02:11:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5760240065389990399.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15393513973664091381.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5760240065389990399.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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...365
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityCardinality5760240065389990399.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 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 383
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :383 after 1.57324e+06
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.57324e+06 after 3.08256e+09
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3.08256e+09 after 6.90402e+12
[2022-06-10 02:11:58] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(UNSAT) depth K=30 took 254984 ms
[2022-06-10 02:15:55] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(UNSAT) depth K=30 took 237463 ms
[2022-06-10 02:17:02] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFunctionPointer-PT-a064-ReachabilityCardinality-00
[2022-06-10 02:17:02] [INFO ] KInduction solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(SAT) depth K=16 took 1058463 ms
[2022-06-10 02:17:57] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(UNSAT) depth K=31 took 121128 ms
Invariant property FunctionPointer-PT-a064-ReachabilityCardinality-11 does not hold.
FORMULA FunctionPointer-PT-a064-ReachabilityCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6.90402e+12 after 1.9969e+16
[2022-06-10 02:20:19] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-11(UNSAT) depth K=31 took 142580 ms
[2022-06-10 02:23:41] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(UNSAT) depth K=32 took 202304 ms
[2022-06-10 02:26:07] [INFO ] BMC solution for property FunctionPointer-PT-a064-ReachabilityCardinality-00(UNSAT) depth K=33 took 145658 ms

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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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-a064"
export BK_EXAMINATION="ReachabilityCardinality"
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-a064, examination is ReachabilityCardinality"
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-165472282200406"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-a064.tgz
mv FunctionPointer-PT-a064 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;