scripts/cpa.sh -svcomp23 -heap 4000M -benchmark -timelimit '900 s' -stats -spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp -64 /mnt/goblint-svcomp/goblint-bench/bench/concrat/phpspy/main.c


--------------------------------------------------------------------------------


Running CPAchecker with Java heap of size 4000M.
Running CPAchecker with default stack size (1024k). Specify a larger value with -stack if needed.
Language C detected and set for analysis (CPAMain.detectFrontendLanguageIfNecessary, INFO)

Using the following resource limits: CPU-time limit of 900s (ResourceLimitChecker.fromConfiguration, INFO)

CPAchecker 2.2 (OpenJDK 64-Bit Server VM 17.0.8.1) started (CPAchecker.run, INFO)

Parsing CFA from file(s) "/mnt/goblint-svcomp/goblint-bench/bench/concrat/phpspy/main.c" (CPAchecker.parse, INFO)

Inline assembler ignored, analysis is probably unsound! (CFABuilder.createCFA, WARNING)

line 4500: Function pointer *fn with type int (*)(struct tb_event *, size_t *) is called, but no possible target functions were found. (CFunctionPointerResolver.getTargets, WARNING)

program contains concurrency, cloning functions... (CFACreator.postProcessingOnMutableCFAs, INFO)

Using predicate analysis with MathSAT5 version 5.6.8 (27814677e16f) (Jun 28 2022 17:03:19, gmp 6.1.2, gcc 6.3.0, 64-bit, reentrant) and JFactory 1.21. (PredicateCPA:PredicateCPA.<init>, INFO)

Starting analysis ... (CPAchecker.runAlgorithm, INFO)

Assuming external function getopt_long to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO)

line 5495: Ignoring parameters passed as varargs to function log_error: log_error("Expected pid (-p), pgrep (-P), or command\n\n") (PredicateCPA:CtoFormulaConverter.makeFunctionCall, WARNING)

Assuming external function __builtin_va_start to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO)

Cannot get declaration of function __builtin_va_start, ignoring calls to it. (PredicateCPA:ExpressionToFormulaVisitor.visit, WARNING)

Assuming external function fork to be a constant function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO)

Assuming external function vfprintf to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO)

Assuming external function strtoull to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO)

Assuming external function __errno_location to be a constant function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO)

Assuming external function perror to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO)

Assuming external function waitpid to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO)

Assuming external function strtol to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO)

line 6167: Ignoring parameters passed as varargs to function log_error: log_error("main_fork: Expected SIGTRAP from child\n") (PredicateCPA:CtoFormulaConverter.makeFunctionCall, WARNING)

line 5618: Ignoring parameters passed as varargs to function log_error: log_error("Expected integer for %s, got \'%s\'\n", name, str) (PredicateCPA:CtoFormulaConverter.makeFunctionCall, WARNING)

line 6170: Ignoring parameters passed as varargs to function log_error: log_error("main_fork: Expected SIGTRAP from child\n") (PredicateCPA:CtoFormulaConverter.makeFunctionCall, WARNING)

line 5622: Ignoring parameters passed as varargs to function log_error: log_error("Expected integer for %s, got \'%s\'\n", name, str) (PredicateCPA:CtoFormulaConverter.makeFunctionCall, WARNING)

Assuming external function ptrace to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO)

line 5626: Ignoring parameters passed as varargs to function log_error: log_error("Expected integer >= %d for %s, got \'%s\'\n", min, name, str) (PredicateCPA:CtoFormulaConverter.makeFunctionCall, WARNING)

Error: line 16286: Unrecognized C code (unsupported thread assignment): (pthread_t *)(&signal_thread) (ThreadingTransferRelation.startNewThread, SEVERE)


PredicateCPA statistics
-----------------------
Number of abstractions:            67 (4% of all post computations)
  Times abstraction was reused:    0
  Because of function entry/exit:  53 (79%)
  Because of loop head:            14 (21%)
  Because of join nodes:           0 (0%)
  Because of threshold:            0 (0%)
  Because of target state:         0 (0%)
  Times precision was empty:       67 (100%)
  Times precision was {false}:     0 (0%)
  Times result was cached:         0 (0%)
  Times cartesian abs was used:    0 (0%)
  Times boolean abs was used:      0 (0%)
  Times result was 'false':        0 (0%)
Number of strengthen sat checks:   0
Number of coverage checks:         227
  BDD entailment checks:           111
Number of SMT sat checks:          0
  trivial:                         0
  cached:                          0

Max ABE block size:                       89
Avg ABE block size:                                10.01 (sum: 671, count: 67, min: 0, max: 89)
Number of predicates discovered:          0

Time for post operator:                                0.848s
  Time for path formula creation:                      0.828s
Time for strengthen operator:                          0.029s
Time for prec operator:                                0.028s
  Time for abstraction:                  0.001s (Max:     0.001s, Count: 67)
    Solving time:                        0.000s (Max:     0.000s)
    Model enumeration time:              0.000s
    Time for BDD construction:           0.000s (Max:     0.000s)
Time for merge operator:                               0.034s
Time for coverage checks:                              0.004s
  Time for BDD entailment checks:                      0.004s
Total time for SMT solver (w/o itp):     0.000s

Number of path formula cache hits:   132 (8%)

Inside post operator:                  
  Inside path formula creation:        
    Time for path formula computation:     0.797s

Total number of created targets for pointer analysis: 0


Number of BDD nodes:                               202
Size of BDD node table:                            202729
Size of BDD cache:                                 20287
Size of BDD node cleanup queue:                    0.00 (sum: 0, count: 179, min: 0, max: 0)
Time for BDD node cleanup:                             0.001s
Time for BDD garbage collection:                       0.000s (in 0 runs)

KeyValue statistics
-------------------
Init. function predicates:                         0
Init. global predicates:                           0
Init. location predicates:                         0

Invariant Generation statistics
-------------------------------

ValueAnalysisCPA statistics
---------------------------
Number of variables per state:                     49.12 (sum: 78747, count: 1603, min: 0, max: 145)
Number of global variables per state:              21.76 (sum: 34885, count: 1603, min: 0, max: 45)
Number of assumptions:                                  226
Number of deterministic assumptions:                      0
Level of Determinism:                              0%

ValueAnalysisPrecisionAdjustment statistics
-------------------------------------------
Number of abstraction computations:                    1621
Total time for liveness abstraction:                   0.000s
Total time for abstraction computation:                0.007s
Total time for path thresholds:                        0.000s

ConstraintsStrengthenOperator statistics
----------------------------------------
Total time for strengthening by ConstraintsCPA:     0.000s
Replaced symbolic expressions: 0

AutomatonAnalysis (DataRace) statistics
---------------------------------------
Number of states:                                  1
Total time for successor computation:                  0.007s
Total time for strengthen operator:                    0.254s
Automaton transfers with branching:                0
Automaton transfer successors:                     1.00 (sum: 1621, count: 1621, min: 1, max: 1) [1 x 1621]
Number of states with assumption transitions:      0

AutomatonAnalysis (svcompTerminatingFunctions) statistics
---------------------------------------------------------
Number of states:                                  1
Total time for successor computation:                  0.012s
Automaton transfers with branching:                0
Automaton transfer successors:                     1.00 (sum: 1621, count: 1621, min: 1, max: 1) [1 x 1621]
Number of states with assumption transitions:      0

CPA algorithm statistics
------------------------
Number of iterations:            1552
Max size of waitlist:            56
Average size of waitlist:        9
Number of computed successors:   1621
Max successors for one state:    2
Number of times merged:          8
Number of times stopped:         19
Number of times breaked:         0

Total time for CPA algorithm:         1.741s (Max:     1.741s)
  Time for choose from waitlist:      0.025s
  Time for precision adjustment:      0.097s
  Time for transfer relation:         1.454s
  Time for merge operator:            0.073s
  Time for stop operator:             0.032s
  Time for adding to reached set:     0.020s

CPAchecker general statistics
-----------------------------
Number of program locations:                       95644
Number of CFA edges (per node):                      110528 (count: 95644, min: 0, max: 149, avg: 1.16)
Number of relevant variables:                      14451
Number of functions:                               1591
Number of loops (and loop nodes):                       966 (sum: 49248, min: 3, max: 897, avg: 50.98)
Size of reached set:             1603
  Number of partitions:          1574
    Avg size of partitions:      1
    Max size of partitions:      10 (with key [{main=N3059 (after line 5813) Function parse_opts called from node N2754, stack depth 2 [44d92d7a], stack [main, parse_opts] @@ 0}, ABS2: true])
  Number of target states:       0
  Size of final wait list:       56

Time for analysis setup:         11.919s
  Time for loading CPAs:          1.588s
  Time for loading parser:        0.276s
  Time for CFA construction:      9.931s
    Time for parsing file(s):     1.030s
    Time for AST to CFA:          2.067s
    Time for CFA sanity check:    0.001s
    Time for post-processing:     6.563s
      Time for function pointers resolving:            0.046s
        Function calls via function pointers:            54 (count: 1, min: 54, max: 54, avg: 54.00)
        Instrumented function pointer calls:             53 (count: 1, min: 53, max: 53, avg: 53.00)
        Function calls with function pointer arguments:        0 (count: 1, min: 0, max: 0, avg: 0.00)
        Instrumented function pointer arguments:          0 (count: 1, min: 0, max: 0, avg: 0.00)
      Time for classifying variables:                  3.794s
        Time for collecting variables:                 2.558s
        Time for solving dependencies:                 0.097s
        Time for building hierarchy:                   0.031s
        Time for building classification:              1.090s
        Time for exporting data:                       0.000s
Time for Analysis:                1.742s
CPU time for analysis:            1.750s
Total time for CPAchecker:       13.662s
Total CPU time for CPAchecker:   13.670s
Time for statistics:              0.136s

Time for Garbage Collector:       1.473s (in 30 runs)
Garbage Collector(s) used:    Copy, MarkSweepCompact

Verification result: UNKNOWN, incomplete analysis.
More details about the verification run can be found in the directory "./output".
