java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AbstractInterpretationC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/array-memsafety/lis_unsafe_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:20:59,097 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:20:59,099 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:20:59,114 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:20:59,115 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:20:59,116 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:20:59,117 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:20:59,118 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:20:59,120 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:20:59,121 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:20:59,122 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:20:59,123 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:20:59,123 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:20:59,125 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:20:59,126 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:20:59,128 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:20:59,131 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:20:59,133 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:20:59,134 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:20:59,136 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:20:59,138 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:20:59,138 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:20:59,138 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:20:59,139 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:20:59,140 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:20:59,142 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:20:59,142 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:20:59,143 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:20:59,143 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:20:59,143 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:20:59,144 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:20:59,144 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf [2018-01-24 16:20:59,154 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:20:59,155 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:20:59,156 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:20:59,156 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:20:59,156 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:20:59,156 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:20:59,156 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:20:59,157 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:20:59,157 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:20:59,158 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:20:59,158 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:20:59,158 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:20:59,158 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:20:59,158 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:20:59,158 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:20:59,159 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:20:59,159 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:20:59,159 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:20:59,159 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:20:59,159 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:20:59,160 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:20:59,160 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:20:59,160 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:20:59,160 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:20:59,160 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:20:59,161 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:20:59,161 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:20:59,161 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:20:59,161 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:20:59,161 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 16:20:59,161 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:20:59,162 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:20:59,162 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:20:59,163 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:20:59,163 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:20:59,198 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:20:59,212 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:20:59,216 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:20:59,217 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:20:59,217 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:20:59,218 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/lis_unsafe_false-valid-deref.i [2018-01-24 16:20:59,385 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:20:59,392 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:20:59,393 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:20:59,393 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:20:59,400 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:20:59,401 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:20:59" (1/1) ... [2018-01-24 16:20:59,404 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a446621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:20:59, skipping insertion in model container [2018-01-24 16:20:59,404 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:20:59" (1/1) ... [2018-01-24 16:20:59,425 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:20:59,469 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:20:59,596 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:20:59,620 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:20:59,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:20:59 WrapperNode [2018-01-24 16:20:59,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:20:59,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:20:59,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:20:59,628 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:20:59,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:20:59" (1/1) ... [2018-01-24 16:20:59,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:20:59" (1/1) ... [2018-01-24 16:20:59,652 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:20:59" (1/1) ... [2018-01-24 16:20:59,652 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:20:59" (1/1) ... [2018-01-24 16:20:59,655 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:20:59" (1/1) ... [2018-01-24 16:20:59,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:20:59" (1/1) ... [2018-01-24 16:20:59,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:20:59" (1/1) ... [2018-01-24 16:20:59,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:20:59,662 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:20:59,662 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:20:59,662 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:20:59,663 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:20:59" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:20:59,715 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:20:59,715 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:20:59,715 INFO L136 BoogieDeclarations]: Found implementation of procedure lis [2018-01-24 16:20:59,716 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:20:59,716 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:20:59,716 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:20:59,716 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:20:59,716 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:20:59,716 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:20:59,716 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 16:20:59,717 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:20:59,717 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:20:59,717 INFO L128 BoogieDeclarations]: Found specification of procedure lis [2018-01-24 16:20:59,717 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:20:59,717 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:20:59,717 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:21:00,045 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:21:00,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:21:00 BoogieIcfgContainer [2018-01-24 16:21:00,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:21:00,046 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2018-01-24 16:21:00,046 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2018-01-24 16:21:00,047 INFO L276 PluginConnector]: Abstract Interpretation initialized [2018-01-24 16:21:00,047 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:21:00" (1/1) ... [2018-01-24 16:21:00,103 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:21:01,762 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:21:01,791 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 16:21:01,800 INFO L268 AbstractInterpreter]: Visited 91 different actions 339 times. Merged at 65 different actions 172 times. Never widened. Found 43 fixpoints after 24 different actions. Largest state had 40 variables. [2018-01-24 16:21:01,802 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2018-01-24 16:21:01,804 INFO L168 Benchmark]: Toolchain (without parser) took 2418.42 ms. Allocated memory was 306.7 MB in the beginning and 390.6 MB in the end (delta: 83.9 MB). Free memory was 265.6 MB in the beginning and 190.5 MB in the end (delta: 75.1 MB). Peak memory consumption was 159.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:21:01,805 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 306.7 MB. Free memory is still 271.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:21:01,805 INFO L168 Benchmark]: CACSL2BoogieTranslator took 234.56 ms. Allocated memory is still 306.7 MB. Free memory was 265.6 MB in the beginning and 255.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:21:01,805 INFO L168 Benchmark]: Boogie Preprocessor took 34.06 ms. Allocated memory is still 306.7 MB. Free memory was 255.6 MB in the beginning and 253.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:21:01,806 INFO L168 Benchmark]: RCFGBuilder took 383.87 ms. Allocated memory is still 306.7 MB. Free memory was 253.7 MB in the beginning and 228.7 MB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 5.3 GB. [2018-01-24 16:21:01,806 INFO L168 Benchmark]: Abstract Interpretation took 1756.48 ms. Allocated memory was 306.7 MB in the beginning and 390.6 MB in the end (delta: 83.9 MB). Free memory was 228.7 MB in the beginning and 190.5 MB in the end (delta: 38.2 MB). Peak memory consumption was 122.1 MB. Max. memory is 5.3 GB. [2018-01-24 16:21:01,808 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 306.7 MB. Free memory is still 271.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 234.56 ms. Allocated memory is still 306.7 MB. Free memory was 265.6 MB in the beginning and 255.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.06 ms. Allocated memory is still 306.7 MB. Free memory was 255.6 MB in the beginning and 253.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 383.87 ms. Allocated memory is still 306.7 MB. Free memory was 253.7 MB in the beginning and 228.7 MB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 5.3 GB. * Abstract Interpretation took 1756.48 ms. Allocated memory was 306.7 MB in the beginning and 390.6 MB in the end (delta: 83.9 MB). Free memory was 228.7 MB in the beginning and 190.5 MB in the end (delta: 38.2 MB). Peak memory consumption was 122.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 72 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 1098 LocStat_NO_SUPPORTING_DISEQUALITIES : 199 LocStat_NO_DISJUNCTIONS : -144 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 97 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 142 TransStat_NO_SUPPORTING_DISEQUALITIES : 26 TransStat_NO_DISJUNCTIONS : 112 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.585931 RENAME_VARIABLES(MILLISECONDS) : 0.016300 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.339578 PROJECTAWAY(MILLISECONDS) : 1.300283 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001234 DISJOIN(MILLISECONDS) : 0.423895 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.034781 ADD_EQUALITY(MILLISECONDS) : 0.019678 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.021380 #CONJOIN_DISJUNCTIVE : 527 #RENAME_VARIABLES : 1112 #UNFREEZE : 0 #CONJOIN : 756 #PROJECTAWAY : 621 #ADD_WEAK_EQUALITY : 15 #DISJOIN : 77 #RENAME_VARIABLES_DISJUNCTIVE : 1020 #ADD_EQUALITY : 130 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 22 - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L559] int *a; [L560] int N = __VERIFIER_nondet_int(); [L561] CALL lis(a, N) [L542] int *best, *prev, i, j, max = 0; [L543] EXPR, FCALL malloc(sizeof(int) * N) [L543] best = (int*) malloc(sizeof(int) * N) [L544] EXPR, FCALL malloc(sizeof(int) * N) [L544] prev = (int*) malloc(sizeof(int) * N) [L545] i = 0 [L545] COND TRUE i < N [L546] FCALL best[i] = 1 - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L559] int *a; [L560] int N = __VERIFIER_nondet_int(); [L561] CALL lis(a, N) [L542] int *best, *prev, i, j, max = 0; [L543] EXPR, FCALL malloc(sizeof(int) * N) [L543] best = (int*) malloc(sizeof(int) * N) [L544] EXPR, FCALL malloc(sizeof(int) * N) [L544] prev = (int*) malloc(sizeof(int) * N) [L545] i = 0 [L545] COND TRUE i < N [L546] FCALL best[i] = 1 - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L559] int *a; [L560] int N = __VERIFIER_nondet_int(); [L561] CALL lis(a, N) [L542] int *best, *prev, i, j, max = 0; [L543] EXPR, FCALL malloc(sizeof(int) * N) [L543] best = (int*) malloc(sizeof(int) * N) [L544] EXPR, FCALL malloc(sizeof(int) * N) [L544] prev = (int*) malloc(sizeof(int) * N) [L545] i = 0 [L545] COND TRUE i < N [L546] FCALL best[i] = 1 [L546] FCALL prev[i] = i - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L559] int *a; [L560] int N = __VERIFIER_nondet_int(); [L561] CALL lis(a, N) [L542] int *best, *prev, i, j, max = 0; [L543] EXPR, FCALL malloc(sizeof(int) * N) [L543] best = (int*) malloc(sizeof(int) * N) [L544] EXPR, FCALL malloc(sizeof(int) * N) [L544] prev = (int*) malloc(sizeof(int) * N) [L545] i = 0 [L545] COND FALSE !(i < N) [L547] i = 1 [L547] COND TRUE i < N [L548] j = 0 [L548] COND TRUE j < i [L549] FCALL a[i] - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L559] int *a; [L560] int N = __VERIFIER_nondet_int(); [L561] CALL lis(a, N) [L542] int *best, *prev, i, j, max = 0; [L543] EXPR, FCALL malloc(sizeof(int) * N) [L543] best = (int*) malloc(sizeof(int) * N) [L544] EXPR, FCALL malloc(sizeof(int) * N) [L544] prev = (int*) malloc(sizeof(int) * N) [L545] i = 0 [L545] COND FALSE !(i < N) [L547] i = 1 [L547] COND TRUE i < N [L548] j = 0 [L548] COND TRUE j < i [L549] FCALL a[i] - UnprovableResult [Line: 1]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L559] int *a; [L560] int N = __VERIFIER_nondet_int(); [L561] CALL lis(a, N) [L542] int *best, *prev, i, j, max = 0; [L543] EXPR, FCALL malloc(sizeof(int) * N) [L543] best = (int*) malloc(sizeof(int) * N) [L544] EXPR, FCALL malloc(sizeof(int) * N) [L544] prev = (int*) malloc(sizeof(int) * N) [L545] i = 0 [L545] COND FALSE !(i < N) [L547] i = 1 [L547] COND FALSE !(i < N) [L551] i = 0 [L551] COND FALSE !(i < N) [L554] FCALL free(best) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L559] int *a; [L560] int N = __VERIFIER_nondet_int(); [L561] CALL lis(a, N) [L542] int *best, *prev, i, j, max = 0; [L543] EXPR, FCALL malloc(sizeof(int) * N) [L543] best = (int*) malloc(sizeof(int) * N) [L544] EXPR, FCALL malloc(sizeof(int) * N) [L544] prev = (int*) malloc(sizeof(int) * N) [L545] i = 0 [L545] COND FALSE !(i < N) [L547] i = 1 [L547] COND FALSE !(i < N) [L551] i = 0 [L551] COND TRUE i < N [L552] FCALL best[i] - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L559] int *a; [L560] int N = __VERIFIER_nondet_int(); [L561] CALL lis(a, N) [L542] int *best, *prev, i, j, max = 0; [L543] EXPR, FCALL malloc(sizeof(int) * N) [L543] best = (int*) malloc(sizeof(int) * N) [L544] EXPR, FCALL malloc(sizeof(int) * N) [L544] prev = (int*) malloc(sizeof(int) * N) [L545] i = 0 [L545] COND FALSE !(i < N) [L547] i = 1 [L547] COND FALSE !(i < N) [L551] i = 0 [L551] COND TRUE i < N [L552] FCALL best[i] - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L559] int *a; [L560] int N = __VERIFIER_nondet_int(); [L561] CALL lis(a, N) [L542] int *best, *prev, i, j, max = 0; [L543] EXPR, FCALL malloc(sizeof(int) * N) [L543] best = (int*) malloc(sizeof(int) * N) [L544] EXPR, FCALL malloc(sizeof(int) * N) [L544] prev = (int*) malloc(sizeof(int) * N) [L545] i = 0 [L545] COND FALSE !(i < N) [L547] i = 1 [L547] COND TRUE i < N [L548] j = 0 [L548] COND TRUE j < i [L549] FCALL a[i] [L549] FCALL a[j] - UnprovableResult [Line: 1]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L559] int *a; [L560] int N = __VERIFIER_nondet_int(); [L561] CALL lis(a, N) [L542] int *best, *prev, i, j, max = 0; [L543] EXPR, FCALL malloc(sizeof(int) * N) [L543] best = (int*) malloc(sizeof(int) * N) [L544] EXPR, FCALL malloc(sizeof(int) * N) [L544] prev = (int*) malloc(sizeof(int) * N) [L545] i = 0 [L545] COND FALSE !(i < N) [L547] i = 1 [L547] COND FALSE !(i < N) [L551] i = 0 [L551] COND FALSE !(i < N) [L554] FCALL free(best) [L555] FCALL free(prev) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L559] int *a; [L560] int N = __VERIFIER_nondet_int(); [L561] CALL lis(a, N) [L542] int *best, *prev, i, j, max = 0; [L543] EXPR, FCALL malloc(sizeof(int) * N) [L543] best = (int*) malloc(sizeof(int) * N) [L544] EXPR, FCALL malloc(sizeof(int) * N) [L544] prev = (int*) malloc(sizeof(int) * N) [L545] i = 0 [L545] COND FALSE !(i < N) [L547] i = 1 [L547] COND FALSE !(i < N) [L551] i = 0 [L551] COND TRUE i < N [L552] EXPR, FCALL best[i] [L552] COND TRUE max < best[i] [L553] FCALL best[i] - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L559] int *a; [L560] int N = __VERIFIER_nondet_int(); [L561] CALL lis(a, N) [L542] int *best, *prev, i, j, max = 0; [L543] EXPR, FCALL malloc(sizeof(int) * N) [L543] best = (int*) malloc(sizeof(int) * N) [L544] EXPR, FCALL malloc(sizeof(int) * N) [L544] prev = (int*) malloc(sizeof(int) * N) [L545] i = 0 [L545] COND FALSE !(i < N) [L547] i = 1 [L547] COND TRUE i < N [L548] j = 0 [L548] COND TRUE j < i [L549] EXPR, FCALL a[i] [L549] EXPR, FCALL a[j] [L549] a[i] > a[j] && best[i] < best[j] + 1 [L549] FCALL best[i] - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L559] int *a; [L560] int N = __VERIFIER_nondet_int(); [L561] CALL lis(a, N) [L542] int *best, *prev, i, j, max = 0; [L543] EXPR, FCALL malloc(sizeof(int) * N) [L543] best = (int*) malloc(sizeof(int) * N) [L544] EXPR, FCALL malloc(sizeof(int) * N) [L544] prev = (int*) malloc(sizeof(int) * N) [L545] i = 0 [L545] COND FALSE !(i < N) [L547] i = 1 [L547] COND TRUE i < N [L548] j = 0 [L548] COND TRUE j < i [L549] EXPR, FCALL a[i] [L549] EXPR, FCALL a[j] [L549] a[i] > a[j] && best[i] < best[j] + 1 [L549] FCALL best[i] - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L559] int *a; [L560] int N = __VERIFIER_nondet_int(); [L561] CALL lis(a, N) [L542] int *best, *prev, i, j, max = 0; [L543] EXPR, FCALL malloc(sizeof(int) * N) [L543] best = (int*) malloc(sizeof(int) * N) [L544] EXPR, FCALL malloc(sizeof(int) * N) [L544] prev = (int*) malloc(sizeof(int) * N) [L545] i = 0 [L545] COND FALSE !(i < N) [L547] i = 1 [L547] COND TRUE i < N [L548] j = 0 [L548] COND TRUE j < i [L549] EXPR, FCALL a[i] [L549] EXPR, FCALL a[j] [L549] a[i] > a[j] && best[i] < best[j] + 1 [L549] FCALL best[i] [L549] FCALL best[j] - UnprovableResult [Line: 558]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: abstract domain could reach this error location. Possible FailurePath: [L559] int *a; [L560] int N = __VERIFIER_nondet_int(); [L561] CALL, EXPR lis(a, N) [L542] int *best, *prev, i, j, max = 0; [L543] EXPR, FCALL malloc(sizeof(int) * N) [L543] best = (int*) malloc(sizeof(int) * N) [L544] EXPR, FCALL malloc(sizeof(int) * N) [L544] prev = (int*) malloc(sizeof(int) * N) [L545] i = 0 [L545] COND FALSE !(i < N) [L547] i = 1 [L547] COND FALSE !(i < N) [L551] i = 0 [L551] COND FALSE !(i < N) [L554] FCALL free(best) [L555] FCALL free(prev) [L556] RET return max; [L561] EXPR lis(a, N) [L561] return lis(a, N); - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L559] int *a; [L560] int N = __VERIFIER_nondet_int(); [L561] CALL lis(a, N) [L542] int *best, *prev, i, j, max = 0; [L543] EXPR, FCALL malloc(sizeof(int) * N) [L543] best = (int*) malloc(sizeof(int) * N) [L544] EXPR, FCALL malloc(sizeof(int) * N) [L544] prev = (int*) malloc(sizeof(int) * N) [L545] i = 0 [L545] COND FALSE !(i < N) [L547] i = 1 [L547] COND TRUE i < N [L548] j = 0 [L548] COND TRUE j < i [L549] EXPR, FCALL a[i] [L549] EXPR, FCALL a[j] [L549] a[i] > a[j] && best[i] < best[j] + 1 [L549] EXPR, FCALL best[i] [L549] EXPR, FCALL best[j] [L549] a[i] > a[j] && best[i] < best[j] + 1 [L549] COND TRUE a[i] > a[j] && best[i] < best[j] + 1 [L550] FCALL best[j] - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L559] int *a; [L560] int N = __VERIFIER_nondet_int(); [L561] CALL lis(a, N) [L542] int *best, *prev, i, j, max = 0; [L543] EXPR, FCALL malloc(sizeof(int) * N) [L543] best = (int*) malloc(sizeof(int) * N) [L544] EXPR, FCALL malloc(sizeof(int) * N) [L544] prev = (int*) malloc(sizeof(int) * N) [L545] i = 0 [L545] COND FALSE !(i < N) [L547] i = 1 [L547] COND TRUE i < N [L548] j = 0 [L548] COND TRUE j < i [L549] EXPR, FCALL a[i] [L549] EXPR, FCALL a[j] [L549] a[i] > a[j] && best[i] < best[j] + 1 [L549] EXPR, FCALL best[i] [L549] EXPR, FCALL best[j] [L549] a[i] > a[j] && best[i] < best[j] + 1 [L549] COND TRUE a[i] > a[j] && best[i] < best[j] + 1 [L550] EXPR, FCALL best[j] [L550] FCALL best[i] = best[j] + 1 - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L559] int *a; [L560] int N = __VERIFIER_nondet_int(); [L561] CALL lis(a, N) [L542] int *best, *prev, i, j, max = 0; [L543] EXPR, FCALL malloc(sizeof(int) * N) [L543] best = (int*) malloc(sizeof(int) * N) [L544] EXPR, FCALL malloc(sizeof(int) * N) [L544] prev = (int*) malloc(sizeof(int) * N) [L545] i = 0 [L545] COND FALSE !(i < N) [L547] i = 1 [L547] COND TRUE i < N [L548] j = 0 [L548] COND FALSE !(j < i) [L547] i++ [L547] COND TRUE i < N [L548] j = 0 [L548] COND TRUE j < i [L549] EXPR, FCALL a[i] [L549] EXPR, FCALL a[j] [L549] a[i] > a[j] && best[i] < best[j] + 1 [L549] COND TRUE a[i] > a[j] && best[i] < best[j] + 1 [L550] FCALL best[j] - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L559] int *a; [L560] int N = __VERIFIER_nondet_int(); [L561] CALL lis(a, N) [L542] int *best, *prev, i, j, max = 0; [L543] EXPR, FCALL malloc(sizeof(int) * N) [L543] best = (int*) malloc(sizeof(int) * N) [L544] EXPR, FCALL malloc(sizeof(int) * N) [L544] prev = (int*) malloc(sizeof(int) * N) [L545] i = 0 [L545] COND FALSE !(i < N) [L547] i = 1 [L547] COND TRUE i < N [L548] j = 0 [L548] COND TRUE j < i [L549] EXPR, FCALL a[i] [L549] EXPR, FCALL a[j] [L549] a[i] > a[j] && best[i] < best[j] + 1 [L549] EXPR, FCALL best[i] [L549] EXPR, FCALL best[j] [L549] a[i] > a[j] && best[i] < best[j] + 1 [L549] COND TRUE a[i] > a[j] && best[i] < best[j] + 1 [L550] EXPR, FCALL best[j] [L550] FCALL best[i] = best[j] + 1 [L550] FCALL prev[i] = j - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-Benchmark-0-2018-01-24_16-21-01-820.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-21-01-820.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-21-01-820.csv Received shutdown request...