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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/list-ext-properties/test-0158_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 02:20:16,027 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 02:20:16,028 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 02:20:16,044 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 02:20:16,044 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 02:20:16,045 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 02:20:16,046 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 02:20:16,048 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 02:20:16,050 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 02:20:16,050 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 02:20:16,051 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 02:20:16,051 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 02:20:16,052 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 02:20:16,052 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 02:20:16,053 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 02:20:16,056 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 02:20:16,058 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 02:20:16,060 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 02:20:16,062 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 02:20:16,063 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 02:20:16,066 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 02:20:16,066 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 02:20:16,066 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 02:20:16,067 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 02:20:16,068 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 02:20:16,070 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 02:20:16,070 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 02:20:16,070 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 02:20:16,071 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 02:20:16,071 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 02:20:16,072 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 02:20:16,072 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_SS.epf [2018-01-30 02:20:16,082 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 02:20:16,082 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 02:20:16,083 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 02:20:16,083 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 02:20:16,083 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 02:20:16,083 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 02:20:16,084 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 02:20:16,084 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 02:20:16,084 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 02:20:16,085 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 02:20:16,085 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 02:20:16,085 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 02:20:16,085 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 02:20:16,085 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 02:20:16,085 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 02:20:16,086 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 02:20:16,086 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 02:20:16,086 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 02:20:16,086 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 02:20:16,086 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 02:20:16,087 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 02:20:16,087 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 02:20:16,087 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 02:20:16,087 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 02:20:16,087 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 02:20:16,088 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 02:20:16,088 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 02:20:16,088 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 02:20:16,088 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 02:20:16,088 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 02:20:16,089 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 02:20:16,089 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 02:20:16,090 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 02:20:16,090 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 02:20:16,138 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 02:20:16,154 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 02:20:16,158 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 02:20:16,160 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 02:20:16,161 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 02:20:16,162 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0158_1_false-valid-memtrack_true-termination.i [2018-01-30 02:20:16,366 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 02:20:16,382 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-30 02:20:16,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 02:20:16,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 02:20:16,389 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 02:20:16,390 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:20:16" (1/1) ... [2018-01-30 02:20:16,393 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46867162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:20:16, skipping insertion in model container [2018-01-30 02:20:16,393 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:20:16" (1/1) ... [2018-01-30 02:20:16,409 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 02:20:16,447 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 02:20:16,576 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 02:20:16,592 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 02:20:16,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:20:16 WrapperNode [2018-01-30 02:20:16,607 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 02:20:16,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 02:20:16,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 02:20:16,610 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 02:20:16,626 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:20:16" (1/1) ... [2018-01-30 02:20:16,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:20:16" (1/1) ... [2018-01-30 02:20:16,634 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:20:16" (1/1) ... [2018-01-30 02:20:16,635 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:20:16" (1/1) ... [2018-01-30 02:20:16,638 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:20:16" (1/1) ... [2018-01-30 02:20:16,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:20:16" (1/1) ... [2018-01-30 02:20:16,641 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:20:16" (1/1) ... [2018-01-30 02:20:16,642 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 02:20:16,643 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 02:20:16,643 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 02:20:16,643 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 02:20:16,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:20:16" (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-30 02:20:16,701 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 02:20:16,701 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 02:20:16,701 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 02:20:16,701 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-30 02:20:16,701 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-30 02:20:16,701 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-30 02:20:16,701 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-30 02:20:16,701 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 02:20:16,702 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 02:20:16,702 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 02:20:16,702 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-30 02:20:16,702 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 02:20:16,702 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 02:20:16,702 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 02:20:16,702 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 02:20:16,890 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 02:20:16,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:20:16 BoogieIcfgContainer [2018-01-30 02:20:16,891 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 02:20:16,891 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-30 02:20:16,892 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-30 02:20:16,893 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-30 02:20:16,896 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:20:16" (1/1) ... [2018-01-30 02:20:16,903 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-30 02:20:16,904 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2018-01-30 02:20:16,904 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-30 02:20:16,940 INFO L162 apSepIcfgTransformer]: finished StoreIndexFreezer, created 12 freeze vars and freeze var literals (each corresponds to one heap write) [2018-01-30 02:20:16,980 INFO L221 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-30 02:20:17,050 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-30 02:21:12,839 INFO L311 AbstractInterpreter]: Visited 40 different actions 65 times. Merged at 13 different actions 22 times. Never widened. Never found a fixpoint. Largest state had 57 variables. [2018-01-30 02:21:12,841 INFO L229 apSepIcfgTransformer]: finished equality analysis [2018-01-30 02:21:12,852 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_$Pointer$.offset] : 7 [2018-01-30 02:21:12,852 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_$Pointer$.base] : 7 [2018-01-30 02:21:12,852 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 6 [2018-01-30 02:21:12,852 INFO L241 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-30 02:21:12,853 INFO L242 apSepIcfgTransformer]: array groups: Set: [#memory_$Pointer$.offset] [#memory_$Pointer$.base] [#memory_int] [2018-01-30 02:21:12,853 INFO L244 apSepIcfgTransformer]: select infos: Set: ((select (select |v_#memory_int_3| |v_main_~#data~3.base_2|) |v_main_~#data~3.offset_2|), at (SUMMARY for call write~$Pointer$(#t~malloc0.base, #t~malloc0.offset, ~#data~3.base, ~#data~3.offset + 0, 4); srcloc: L630)) ((select (select |v_#memory_$Pointer$.offset_9| |v_main_~#data~3.base_14|) (+ |v_main_~#data~3.offset_10| 1)), at (SUMMARY for call write~int(4, ~#data~3.base, ~#data~3.offset + 0 + 0 + 1, 1); srcloc: L637)) ((select (select |v_#memory_$Pointer$.base_9| |v_main_~#data~3.base_14|) (+ |v_main_~#data~3.offset_10| 1)), at (SUMMARY for call write~int(4, ~#data~3.base, ~#data~3.offset + 0 + 0 + 1, 1); srcloc: L637)) ((select |v_#memory_$Pointer$.offset_6| |v_main_~#data~3.base_5|), at (SUMMARY for call write~int(20, ~#data~3.base, ~#data~3.offset + 0 + 6, 4); srcloc: L632)) ((select |v_#memory_$Pointer$.offset_8| |v_main_~#data~3.base_8|), at (SUMMARY for call write~int(30, ~#data~3.base, ~#data~3.offset + 0 + 6, 4); srcloc: L634)) ((select (select |v_#memory_$Pointer$.base_7| |v_main_~#data~3.base_8|) (+ |v_main_~#data~3.offset_6| 6)), at (SUMMARY for call write~int(30, ~#data~3.base, ~#data~3.offset + 0 + 6, 4); srcloc: L634)) ((select (select |v_#memory_$Pointer$.offset_7| |v_main_~#data~3.base_8|) (+ |v_main_~#data~3.offset_6| 6)), at (SUMMARY for call write~int(30, ~#data~3.base, ~#data~3.offset + 0 + 6, 4); srcloc: L634)) ((select |v_#memory_int_11| |v_main_~#data~3.base_14|), at (SUMMARY for call write~int(4, ~#data~3.base, ~#data~3.offset + 0 + 0 + 1, 1); srcloc: L637)) ((select (select |v_#memory_int_9| |v_main_~#data~3.base_11|) (+ |v_main_~#data~3.offset_8| 6)), at (SUMMARY for call #t~mem5 := read~int(~#data~3.base, ~#data~3.offset + 0 + 6, 4); srcloc: L634')) ((select |v_#memory_$Pointer$.base_4| |v_main_~#data~3.base_2|), at (SUMMARY for call write~$Pointer$(#t~malloc0.base, #t~malloc0.offset, ~#data~3.base, ~#data~3.offset + 0, 4); srcloc: L630)) ((select |v_#memory_$Pointer$.offset_10| |v_main_~#data~3.base_14|), at (SUMMARY for call write~int(4, ~#data~3.base, ~#data~3.offset + 0 + 0 + 1, 1); srcloc: L637)) ((select |v_#memory_$Pointer$.base_6| |v_main_~#data~3.base_5|), at (SUMMARY for call write~int(20, ~#data~3.base, ~#data~3.offset + 0 + 6, 4); srcloc: L632)) ((select (select |v_#memory_$Pointer$.offset_5| |v_main_~#data~3.base_5|) (+ |v_main_~#data~3.offset_4| 6)), at (SUMMARY for call write~int(20, ~#data~3.base, ~#data~3.offset + 0 + 6, 4); srcloc: L632)) ((select |v_#memory_int_6| |v_main_~#data~3.base_5|), at (SUMMARY for call write~int(20, ~#data~3.base, ~#data~3.offset + 0 + 6, 4); srcloc: L632)) ((select |v_#memory_$Pointer$.base_8| |v_main_~#data~3.base_8|), at (SUMMARY for call write~int(30, ~#data~3.base, ~#data~3.offset + 0 + 6, 4); srcloc: L634)) ((select |v_#memory_int_8| |v_main_~#data~3.base_8|), at (SUMMARY for call write~int(30, ~#data~3.base, ~#data~3.offset + 0 + 6, 4); srcloc: L634)) ((select |v_#memory_int_4| |v_main_~#data~3.base_2|), at (SUMMARY for call write~$Pointer$(#t~malloc0.base, #t~malloc0.offset, ~#data~3.base, ~#data~3.offset + 0, 4); srcloc: L630)) ((select (select |v_#memory_$Pointer$.base_5| |v_main_~#data~3.base_5|) (+ |v_main_~#data~3.offset_4| 6)), at (SUMMARY for call write~int(20, ~#data~3.base, ~#data~3.offset + 0 + 6, 4); srcloc: L632)) ((select |v_#memory_$Pointer$.offset_4| |v_main_~#data~3.base_2|), at (SUMMARY for call write~$Pointer$(#t~malloc0.base, #t~malloc0.offset, ~#data~3.base, ~#data~3.offset + 0, 4); srcloc: L630)) ((select |v_#memory_$Pointer$.base_10| |v_main_~#data~3.base_14|), at (SUMMARY for call write~int(4, ~#data~3.base, ~#data~3.offset + 0 + 0 + 1, 1); srcloc: L637)) [2018-01-30 02:21:13,300 INFO L547 PartitionManager]: partitioning result: [2018-01-30 02:21:13,322 INFO L552 PartitionManager]: location blocks for array group [#memory_$Pointer$.base] [2018-01-30 02:21:13,322 INFO L561 PartitionManager]: at dimension 0 [2018-01-30 02:21:13,322 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 4 [2018-01-30 02:21:13,322 INFO L563 PartitionManager]: # location blocks :2 [2018-01-30 02:21:13,323 INFO L561 PartitionManager]: at dimension 1 [2018-01-30 02:21:13,323 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 4 [2018-01-30 02:21:13,323 INFO L563 PartitionManager]: # location blocks :1 [2018-01-30 02:21:13,323 INFO L552 PartitionManager]: location blocks for array group [#memory_int] [2018-01-30 02:21:13,323 INFO L561 PartitionManager]: at dimension 0 [2018-01-30 02:21:13,324 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 4 [2018-01-30 02:21:13,324 INFO L563 PartitionManager]: # location blocks :2 [2018-01-30 02:21:13,324 INFO L561 PartitionManager]: at dimension 1 [2018-01-30 02:21:13,324 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 5 [2018-01-30 02:21:13,324 INFO L563 PartitionManager]: # location blocks :2 [2018-01-30 02:21:13,325 INFO L552 PartitionManager]: location blocks for array group [#memory_$Pointer$.offset] [2018-01-30 02:21:13,325 INFO L561 PartitionManager]: at dimension 0 [2018-01-30 02:21:13,325 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 4 [2018-01-30 02:21:13,325 INFO L563 PartitionManager]: # location blocks :2 [2018-01-30 02:21:13,325 INFO L561 PartitionManager]: at dimension 1 [2018-01-30 02:21:13,325 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 4 [2018-01-30 02:21:13,325 INFO L563 PartitionManager]: # location blocks :1 [2018-01-30 02:21:13,326 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-30 02:21:13,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 02:21:13 BasicIcfg [2018-01-30 02:21:13,345 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-30 02:21:13,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 02:21:13,346 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 02:21:13,349 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 02:21:13,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 02:20:16" (1/4) ... [2018-01-30 02:21:13,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@149ca050 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:21:13, skipping insertion in model container [2018-01-30 02:21:13,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:20:16" (2/4) ... [2018-01-30 02:21:13,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@149ca050 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:21:13, skipping insertion in model container [2018-01-30 02:21:13,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:20:16" (3/4) ... [2018-01-30 02:21:13,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@149ca050 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 02:21:13, skipping insertion in model container [2018-01-30 02:21:13,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 02:21:13" (4/4) ... [2018-01-30 02:21:13,353 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-30 02:21:13,361 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 02:21:13,367 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-01-30 02:21:13,455 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 02:21:13,455 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 02:21:13,455 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 02:21:13,455 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 02:21:13,455 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 02:21:13,455 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 02:21:13,455 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 02:21:13,456 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 02:21:13,456 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 02:21:13,466 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-01-30 02:21:13,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-01-30 02:21:13,471 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:21:13,472 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-01-30 02:21:13,472 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-30 02:21:13,476 INFO L82 PathProgramCache]: Analyzing trace with hash 186280272, now seen corresponding path program 1 times [2018-01-30 02:21:13,477 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:21:13,478 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:21:13,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:21:13,546 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:21:13,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:21:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:21:13,593 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:21:13,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:21:13,703 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:21:13,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 02:21:13,705 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:21:13,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:21:13,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:21:13,714 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2018-01-30 02:21:13,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:21:13,850 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-01-30 02:21:13,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:21:13,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-01-30 02:21:13,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:21:13,880 INFO L225 Difference]: With dead ends: 38 [2018-01-30 02:21:13,880 INFO L226 Difference]: Without dead ends: 30 [2018-01-30 02:21:13,888 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:21:13,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-01-30 02:21:13,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-01-30 02:21:13,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-01-30 02:21:13,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-01-30 02:21:13,932 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 5 [2018-01-30 02:21:13,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:21:13,933 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-01-30 02:21:13,933 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:21:13,933 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-01-30 02:21:13,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-01-30 02:21:13,934 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:21:13,934 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-01-30 02:21:13,934 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-30 02:21:13,934 INFO L82 PathProgramCache]: Analyzing trace with hash 186280274, now seen corresponding path program 1 times [2018-01-30 02:21:13,934 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:21:13,934 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:21:13,936 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:21:13,936 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:21:13,936 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:21:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:21:13,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:21:14,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:21:14,043 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:21:14,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 02:21:14,044 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:21:14,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:21:14,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:21:14,045 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 4 states. [2018-01-30 02:21:14,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:21:14,173 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-01-30 02:21:14,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:21:14,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-01-30 02:21:14,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:21:14,174 INFO L225 Difference]: With dead ends: 30 [2018-01-30 02:21:14,174 INFO L226 Difference]: Without dead ends: 25 [2018-01-30 02:21:14,175 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:21:14,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-01-30 02:21:14,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-01-30 02:21:14,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-01-30 02:21:14,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-01-30 02:21:14,184 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 5 [2018-01-30 02:21:14,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:21:14,184 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-01-30 02:21:14,184 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:21:14,184 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-01-30 02:21:14,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-30 02:21:14,187 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:21:14,187 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:21:14,187 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-30 02:21:14,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1987176405, now seen corresponding path program 1 times [2018-01-30 02:21:14,187 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:21:14,188 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:21:14,189 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:21:14,189 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:21:14,189 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:21:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:21:14,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:21:14,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:21:14,296 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:21:14,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:21:14,297 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:21:14,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:21:14,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:21:14,297 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 4 states. [2018-01-30 02:21:14,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:21:14,349 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-01-30 02:21:14,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:21:14,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-30 02:21:14,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:21:14,350 INFO L225 Difference]: With dead ends: 38 [2018-01-30 02:21:14,350 INFO L226 Difference]: Without dead ends: 32 [2018-01-30 02:21:14,351 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:21:14,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-01-30 02:21:14,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2018-01-30 02:21:14,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-01-30 02:21:14,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-01-30 02:21:14,354 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 16 [2018-01-30 02:21:14,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:21:14,354 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-01-30 02:21:14,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:21:14,354 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-01-30 02:21:14,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-30 02:21:14,355 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:21:14,355 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:21:14,355 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-30 02:21:14,355 INFO L82 PathProgramCache]: Analyzing trace with hash 166782373, now seen corresponding path program 1 times [2018-01-30 02:21:14,355 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:21:14,355 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:21:14,356 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:21:14,356 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:21:14,356 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:21:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-30 02:21:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-30 02:21:14,406 INFO L409 BasicCegarLoop]: Counterexample might be feasible [2018-01-30 02:21:14,409 INFO L84 mationBacktranslator]: Skipped ATE [165] [165] ULTIMATE.startENTRY-->L1: Formula: true InVars {} OutVars{#NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] [2018-01-30 02:21:14,409 INFO L84 mationBacktranslator]: Skipped ATE [171] [171] L1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-30 02:21:14,409 INFO L84 mationBacktranslator]: Skipped ATE [177] [177] mainENTRY-->L622: Formula: (and (= |v_#valid_7| (store |v_#valid_8| |v_main_~#data~3.base_1| 1)) (= 0 (select |v_#valid_8| |v_main_~#data~3.base_1|)) (= |v_#length_3| (store |v_#length_4| |v_main_~#data~3.base_1| 10)) (= |v_main_~#data~3.offset_1| 0) (not (= 0 |v_main_~#data~3.base_1|))) InVars {#length=|v_#length_4|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_3|, main_~#data~3.offset=|v_main_~#data~3.offset_1|, main_~#data~3.base=|v_main_~#data~3.base_1|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[main_~#data~3.base, #valid, #length, main_~#data~3.offset] [2018-01-30 02:21:14,409 INFO L84 mationBacktranslator]: Skipped ATE [181] [181] L622-->L630: Formula: (and (not (= 0 |v_main_#t~malloc0.base_1|)) (= |v_main_#t~malloc0.offset_1| 0) (= |v_#length_5| (store |v_#length_6| |v_main_#t~malloc0.base_1| 37)) (= (select |v_#valid_10| |v_main_#t~malloc0.base_1|) 0) (= |v_#valid_9| (store |v_#valid_10| |v_main_#t~malloc0.base_1| 1))) InVars {#length=|v_#length_6|, #valid=|v_#valid_10|} OutVars{#length=|v_#length_5|, main_#t~malloc0.base=|v_main_#t~malloc0.base_1|, main_#t~malloc0.offset=|v_main_#t~malloc0.offset_1|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[main_#t~malloc0.base, #valid, #length, main_#t~malloc0.offset] [2018-01-30 02:21:14,409 INFO L84 mationBacktranslator]: Skipped ATE [185] [185] L630-->L630': Formula: (and (<= 0 |v_main_~#data~3.offset_2|) (= 1 (select |v_#valid_11| |v_main_~#data~3.base_2|)) (and (= |v_#memory_$Pointer$.offset_part_locs_30_locs_52_2| |v_#memory_$Pointer$.offset_part_locs_30_locs_52_1|) (= |v_#memory_$Pointer$.offset_part_locs_8_locs_52_1| (store |v_#memory_$Pointer$.offset_part_locs_8_locs_52_2| |v_main_~#data~3.base_2| (store (select |v_#memory_$Pointer$.offset_part_locs_30_locs_52_1| |v_main_~#data~3.base_2|) |v_main_~#data~3.offset_2| |v_main_#t~malloc0.offset_2|)))) (<= (+ |v_main_~#data~3.offset_2| 4) (select |v_#length_7| |v_main_~#data~3.base_2|)) (and (= |v_#memory_$Pointer$.base_part_locs_30_locs_52_2| |v_#memory_$Pointer$.base_part_locs_30_locs_52_1|) (= |v_#memory_$Pointer$.base_part_locs_8_locs_52_1| (store |v_#memory_$Pointer$.base_part_locs_8_locs_52_2| |v_main_~#data~3.base_2| (store (select |v_#memory_$Pointer$.base_part_locs_30_locs_52_1| |v_main_~#data~3.base_2|) |v_main_~#data~3.offset_2| |v_main_#t~malloc0.base_2|)))) (and (= |v_#memory_int_part_locs_8_locs_52_1| (store |v_#memory_int_part_locs_8_locs_52_2| |v_main_~#data~3.base_2| (store (select |v_#memory_int_part_locs_30_locs_52_2| |v_main_~#data~3.base_2|) |v_main_~#data~3.offset_2| (select (select |v_#memory_int_part_locs_30_locs_30_1| |v_main_~#data~3.base_2|) |v_main_~#data~3.offset_2|)))) (= |v_#memory_int_part_locs_30_locs_30_1| |v_#memory_int_part_locs_30_locs_30_2|) (= |v_#memory_int_part_locs_30_locs_52_1| |v_#memory_int_part_locs_30_locs_52_2|) (= |v_#memory_int_part_locs_8_locs_30_1| (store |v_#memory_int_part_locs_8_locs_30_2| |v_main_~#data~3.base_2| (select |v_#memory_int_part_locs_30_locs_30_2| |v_main_~#data~3.base_2|))))) InVars {#memory_$Pointer$.base_part_locs_30_locs_52=|v_#memory_$Pointer$.base_part_locs_30_locs_52_1|, #memory_$Pointer$.offset_part_locs_30_locs_52=|v_#memory_$Pointer$.offset_part_locs_30_locs_52_1|, #memory_int_part_locs_8_locs_30=|v_#memory_int_part_locs_8_locs_30_2|, #memory_int_part_locs_8_locs_52=|v_#memory_int_part_locs_8_locs_52_2|, main_#t~malloc0.offset=|v_main_#t~malloc0.offset_2|, #memory_int_part_locs_30_locs_30=|v_#memory_int_part_locs_30_locs_30_2|, #memory_int_part_locs_30_locs_52=|v_#memory_int_part_locs_30_locs_52_2|, #memory_$Pointer$.base_part_locs_8_locs_52=|v_#memory_$Pointer$.base_part_locs_8_locs_52_2|, main_#t~malloc0.base=|v_main_#t~malloc0.base_2|, main_~#data~3.base=|v_main_~#data~3.base_2|, #valid=|v_#valid_11|, #memory_$Pointer$.offset_part_locs_8_locs_52=|v_#memory_$Pointer$.offset_part_locs_8_locs_52_2|, #length=|v_#length_7|, main_~#data~3.offset=|v_main_~#data~3.offset_2|} OutVars{#memory_$Pointer$.base_part_locs_30_locs_52=|v_#memory_$Pointer$.base_part_locs_30_locs_52_2|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_3|, #memory_$Pointer$.offset_part_locs_30_locs_52=|v_#memory_$Pointer$.offset_part_locs_30_locs_52_2|, #memory_int_part_locs_8_locs_30=|v_#memory_int_part_locs_8_locs_30_1|, #memory_int_part_locs_8_locs_52=|v_#memory_int_part_locs_8_locs_52_1|, main_#t~malloc0.offset=|v_main_#t~malloc0.offset_2|, #memory_int_part_locs_30_locs_30=|v_#memory_int_part_locs_30_locs_30_1|, #memory_int_part_locs_30_locs_52=|v_#memory_int_part_locs_30_locs_52_1|, #memory_$Pointer$.base_part_locs_8_locs_52=|v_#memory_$Pointer$.base_part_locs_8_locs_52_1|, main_#t~malloc0.base=|v_main_#t~malloc0.base_2|, main_~#data~3.base=|v_main_~#data~3.base_2|, #valid=|v_#valid_11|, #memory_$Pointer$.offset_part_locs_8_locs_52=|v_#memory_$Pointer$.offset_part_locs_8_locs_52_1|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, main_~#data~3.offset=|v_main_~#data~3.offset_2|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_3|} AuxVars[] AssignedVars[#memory_$Pointer$.base_part_locs_30_locs_52, #memory_$Pointer$.base, #memory_$Pointer$.offset_part_locs_30_locs_52, #memory_$Pointer$.offset_part_locs_8_locs_52, #memory_int_part_locs_8_locs_30, #memory_int_part_locs_8_locs_52, #memory_int, #memory_int_part_locs_30_locs_30, #memory_int_part_locs_30_locs_52, #memory_$Pointer$.base_part_locs_8_locs_52, #memory_$Pointer$.offset] [2018-01-30 02:21:14,409 INFO L84 mationBacktranslator]: Skipped ATE [191] [191] L630'-->L631: Formula: (and (<= |v_main_#t~nondet2_1| 2147483647) (<= 0 (+ |v_main_#t~nondet2_1| 2147483648))) InVars {main_#t~nondet2=|v_main_#t~nondet2_1|} OutVars{main_#t~nondet2=|v_main_#t~nondet2_1|} AuxVars[] AssignedVars[] [2018-01-30 02:21:14,409 INFO L84 mationBacktranslator]: Skipped ATE [195] [195] L631-->L631'': Formula: (= |v_main_#t~nondet2_4| 0) InVars {main_#t~nondet2=|v_main_#t~nondet2_4|} OutVars{main_#t~nondet2=|v_main_#t~nondet2_4|} AuxVars[] AssignedVars[] [2018-01-30 02:21:14,410 INFO L84 mationBacktranslator]: Skipped ATE [199] [199] L631''-->L634: Formula: true InVars {} OutVars{main_#t~nondet2=|v_main_#t~nondet2_5|} AuxVars[] AssignedVars[main_#t~nondet2] [2018-01-30 02:21:14,410 INFO L84 mationBacktranslator]: Skipped ATE [207] [207] L634-->L634': Formula: (let ((.cse0 (+ |v_main_~#data~3.offset_6| 6))) (and (<= 0 .cse0) (= (select |v_#valid_15| |v_main_~#data~3.base_8|) 1) (and (= |v_#memory_$Pointer$.offset_part_locs_30_locs_52_5| |v_#memory_$Pointer$.offset_part_locs_30_locs_52_6|) (= |v_#memory_$Pointer$.offset_part_locs_8_locs_52_5| (store |v_#memory_$Pointer$.offset_part_locs_8_locs_52_6| |v_main_~#data~3.base_8| (store (select |v_#memory_$Pointer$.offset_part_locs_8_locs_52_6| |v_main_~#data~3.base_8|) .cse0 (select (select |v_#memory_$Pointer$.offset_part_locs_8_locs_52_5| |v_main_~#data~3.base_8|) .cse0))))) (<= (+ |v_main_~#data~3.offset_6| 10) (select |v_#length_11| |v_main_~#data~3.base_8|)) (and (= (store |v_#memory_int_part_locs_8_locs_30_5| |v_main_~#data~3.base_8| (select |v_#memory_int_part_locs_8_locs_30_5| |v_main_~#data~3.base_8|)) |v_#memory_int_part_locs_8_locs_30_6|) (= (store |v_#memory_int_part_locs_8_locs_52_5| |v_main_~#data~3.base_8| (store (select |v_#memory_int_part_locs_8_locs_52_5| |v_main_~#data~3.base_8|) .cse0 30)) |v_#memory_int_part_locs_8_locs_52_6|) (= |v_#memory_int_part_locs_30_locs_52_5| |v_#memory_int_part_locs_30_locs_52_6|) (= |v_#memory_int_part_locs_30_locs_30_5| |v_#memory_int_part_locs_30_locs_30_6|)) (and (= |v_#memory_$Pointer$.base_part_locs_8_locs_52_5| (store |v_#memory_$Pointer$.base_part_locs_8_locs_52_6| |v_main_~#data~3.base_8| (store (select |v_#memory_$Pointer$.base_part_locs_8_locs_52_6| |v_main_~#data~3.base_8|) .cse0 (select (select |v_#memory_$Pointer$.base_part_locs_8_locs_52_5| |v_main_~#data~3.base_8|) .cse0)))) (= |v_#memory_$Pointer$.base_part_locs_30_locs_52_5| |v_#memory_$Pointer$.base_part_locs_30_locs_52_6|)))) InVars {#memory_$Pointer$.base_part_locs_30_locs_52=|v_#memory_$Pointer$.base_part_locs_30_locs_52_6|, #memory_$Pointer$.offset_part_locs_30_locs_52=|v_#memory_$Pointer$.offset_part_locs_30_locs_52_6|, #memory_int_part_locs_8_locs_30=|v_#memory_int_part_locs_8_locs_30_5|, #memory_int_part_locs_8_locs_52=|v_#memory_int_part_locs_8_locs_52_5|, #memory_int_part_locs_30_locs_30=|v_#memory_int_part_locs_30_locs_30_5|, #memory_int_part_locs_30_locs_52=|v_#memory_int_part_locs_30_locs_52_5|, #memory_$Pointer$.base_part_locs_8_locs_52=|v_#memory_$Pointer$.base_part_locs_8_locs_52_6|, main_~#data~3.base=|v_main_~#data~3.base_8|, #valid=|v_#valid_15|, #memory_$Pointer$.offset_part_locs_8_locs_52=|v_#memory_$Pointer$.offset_part_locs_8_locs_52_6|, #length=|v_#length_11|, main_~#data~3.offset=|v_main_~#data~3.offset_6|} OutVars{#memory_$Pointer$.base_part_locs_30_locs_52=|v_#memory_$Pointer$.base_part_locs_30_locs_52_5|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_7|, #memory_$Pointer$.offset_part_locs_30_locs_52=|v_#memory_$Pointer$.offset_part_locs_30_locs_52_5|, #memory_int_part_locs_8_locs_30=|v_#memory_int_part_locs_8_locs_30_6|, #memory_int_part_locs_8_locs_52=|v_#memory_int_part_locs_8_locs_52_6|, #memory_int_part_locs_30_locs_30=|v_#memory_int_part_locs_30_locs_30_6|, #memory_int_part_locs_30_locs_52=|v_#memory_int_part_locs_30_locs_52_6|, #memory_$Pointer$.base_part_locs_8_locs_52=|v_#memory_$Pointer$.base_part_locs_8_locs_52_5|, main_~#data~3.base=|v_main_~#data~3.base_8|, #valid=|v_#valid_15|, #memory_$Pointer$.offset_part_locs_8_locs_52=|v_#memory_$Pointer$.offset_part_locs_8_locs_52_5|, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, main_~#data~3.offset=|v_main_~#data~3.offset_6|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_7|} AuxVars[] AssignedVars[#memory_$Pointer$.base_part_locs_30_locs_52, #memory_$Pointer$.base, #memory_$Pointer$.offset_part_locs_30_locs_52, #memory_$Pointer$.offset_part_locs_8_locs_52, #memory_int_part_locs_8_locs_30, #memory_int_part_locs_8_locs_52, #memory_int, #memory_int_part_locs_30_locs_30, #memory_int_part_locs_30_locs_52, #memory_$Pointer$.base_part_locs_8_locs_52, #memory_$Pointer$.offset] [2018-01-30 02:21:14,410 INFO L84 mationBacktranslator]: Skipped ATE [213] [213] L634'-->L636: Formula: (let ((.cse0 (+ |v_main_~#data~3.offset_8| 6))) (and (<= 0 .cse0) (<= (+ |v_main_~#data~3.offset_8| 10) (select |v_#length_13| |v_main_~#data~3.base_11|)) (= |v_main_#t~mem5_1| (select (select |v_#memory_int_part_locs_8_locs_52_7| |v_main_~#data~3.base_11|) .cse0)) (= (select |v_#valid_17| |v_main_~#data~3.base_11|) 1))) InVars {#memory_int_part_locs_8_locs_52=|v_#memory_int_part_locs_8_locs_52_7|, #length=|v_#length_13|, main_~#data~3.offset=|v_main_~#data~3.offset_8|, main_~#data~3.base=|v_main_~#data~3.base_11|, #valid=|v_#valid_17|} OutVars{main_~#data~3.base=|v_main_~#data~3.base_11|, #valid=|v_#valid_17|, #memory_int_part_locs_8_locs_52=|v_#memory_int_part_locs_8_locs_52_7|, main_#t~mem5=|v_main_#t~mem5_1|, #length=|v_#length_13|, main_~#data~3.offset=|v_main_~#data~3.offset_8|} AuxVars[] AssignedVars[main_#t~mem5] [2018-01-30 02:21:14,410 INFO L84 mationBacktranslator]: Skipped ATE [221] [221] L636-->L636'': Formula: (not (< |v_main_#t~mem5_4| 25)) InVars {main_#t~mem5=|v_main_#t~mem5_4|} OutVars{main_#t~mem5=|v_main_#t~mem5_4|} AuxVars[] AssignedVars[] [2018-01-30 02:21:14,410 INFO L84 mationBacktranslator]: Skipped ATE [225] [225] L636''-->L636''': Formula: true InVars {} OutVars{main_#t~mem5=|v_main_#t~mem5_5|} AuxVars[] AssignedVars[main_#t~mem5] [2018-01-30 02:21:14,411 INFO L84 mationBacktranslator]: Skipped ATE [233] [233] L636'''-->L622': Formula: (= |v_main_#res_1| 0) InVars {} OutVars{main_#res=|v_main_#res_1|} AuxVars[] AssignedVars[main_#res] [2018-01-30 02:21:14,411 INFO L84 mationBacktranslator]: Skipped ATE [235] [235] L622'-->L622'': Formula: (= (store |v_#valid_22| |v_main_~#data~3.base_17| 0) |v_#valid_21|) InVars {main_~#data~3.base=|v_main_~#data~3.base_17|, #valid=|v_#valid_22|} OutVars{main_~#data~3.base=|v_main_~#data~3.base_17|, #valid=|v_#valid_21|} AuxVars[] AssignedVars[#valid] [2018-01-30 02:21:14,411 INFO L84 mationBacktranslator]: Skipped ATE [237] [237] L622''-->mainFINAL: Formula: true InVars {} OutVars{main_~#data~3.offset=|v_main_~#data~3.offset_13|, main_~#data~3.base=|v_main_~#data~3.base_18|} AuxVars[] AssignedVars[main_~#data~3.base, main_~#data~3.offset] [2018-01-30 02:21:14,411 INFO L84 mationBacktranslator]: Skipped ATE [241] [241] mainFINAL-->mainErr10EnsuresViolation: Formula: (not (= |v_#valid_24| |old(#valid)|)) InVars {#valid=|v_#valid_24|, old(#valid)=|old(#valid)|} OutVars{#valid=|v_#valid_24|, old(#valid)=|old(#valid)|} AuxVars[] AssignedVars[] [2018-01-30 02:21:14,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 02:21:14 BasicIcfg [2018-01-30 02:21:14,417 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 02:21:14,418 INFO L168 Benchmark]: Toolchain (without parser) took 58041.89 ms. Allocated memory was 304.1 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 262.0 MB in the beginning and 2.1 GB in the end (delta: -1.9 GB). Peak memory consumption was 67.4 MB. Max. memory is 5.3 GB. [2018-01-30 02:21:14,419 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 304.1 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 02:21:14,419 INFO L168 Benchmark]: CACSL2BoogieTranslator took 225.95 ms. Allocated memory is still 304.1 MB. Free memory was 261.0 MB in the beginning and 250.9 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-30 02:21:14,419 INFO L168 Benchmark]: Boogie Preprocessor took 33.31 ms. Allocated memory is still 304.1 MB. Free memory was 250.9 MB in the beginning and 248.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-30 02:21:14,419 INFO L168 Benchmark]: RCFGBuilder took 248.33 ms. Allocated memory is still 304.1 MB. Free memory was 248.9 MB in the beginning and 232.9 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 5.3 GB. [2018-01-30 02:21:14,420 INFO L168 Benchmark]: IcfgTransformer took 56453.78 ms. Allocated memory was 304.1 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 232.9 MB in the beginning and 344.0 MB in the end (delta: -111.2 MB). Peak memory consumption was 1.7 GB. Max. memory is 5.3 GB. [2018-01-30 02:21:14,420 INFO L168 Benchmark]: TraceAbstraction took 1071.30 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 98.0 MB). Free memory was 344.0 MB in the beginning and 2.1 GB in the end (delta: -1.8 GB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 02:21:14,421 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.18 ms. Allocated memory is still 304.1 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 225.95 ms. Allocated memory is still 304.1 MB. Free memory was 261.0 MB in the beginning and 250.9 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.31 ms. Allocated memory is still 304.1 MB. Free memory was 250.9 MB in the beginning and 248.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 248.33 ms. Allocated memory is still 304.1 MB. Free memory was 248.9 MB in the beginning and 232.9 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 5.3 GB. * IcfgTransformer took 56453.78 ms. Allocated memory was 304.1 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 232.9 MB in the beginning and 344.0 MB in the end (delta: -111.2 MB). Peak memory consumption was 1.7 GB. Max. memory is 5.3 GB. * TraceAbstraction took 1071.30 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 98.0 MB). Free memory was 344.0 MB in the beginning and 2.1 GB in the end (delta: -1.8 GB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 31 LocStat_MAX_WEQGRAPH_SIZE : 8 LocStat_MAX_SIZEOF_WEQEDGELABEL : 12 LocStat_NO_SUPPORTING_EQUALITIES : 913 LocStat_NO_SUPPORTING_DISEQUALITIES : 1194 LocStat_NO_DISJUNCTIONS : -62 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 45 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 2 TransStat_NO_SUPPORTING_EQUALITIES : 138 TransStat_NO_SUPPORTING_DISEQUALITIES : 15 TransStat_NO_DISJUNCTIONS : 50 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 674.032514 RENAME_VARIABLES(MILLISECONDS) : 107.029539 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 673.956355 PROJECTAWAY(MILLISECONDS) : 0.190464 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.063181 DISJOIN(MILLISECONDS) : 119.172518 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 107.113619 ADD_EQUALITY(MILLISECONDS) : 0.045409 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007229 #CONJOIN_DISJUNCTIVE : 108 #RENAME_VARIABLES : 196 #UNFREEZE : 0 #CONJOIN : 245 #PROJECTAWAY : 137 #ADD_WEAK_EQUALITY : 30 #DISJOIN : 33 #RENAME_VARIABLES_DISJUNCTIVE : 187 #ADD_EQUALITY : 157 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 9 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_$Pointer$.base] : 2 #COUNT_NEW_ARRAY_VARS_[#memory_int] : 4 #COUNT_NEW_ARRAY_VARS_[#memory_$Pointer$.offset] : 2 COUNT_ARRAY_WRITES_for_[#memory_$Pointer$.offset]_at_dim_0 : 4 COUNT_BLOCKS_for_[#memory_$Pointer$.offset]_at_dim_0 : 2 COUNT_ARRAY_WRITES_for_[#memory_$Pointer$.offset]_at_dim_1 : 4 COUNT_BLOCKS_for_[#memory_$Pointer$.offset]_at_dim_1 : 1 COUNT_ARRAY_WRITES_for_[#memory_$Pointer$.base]_at_dim_0 : 4 COUNT_BLOCKS_for_[#memory_$Pointer$.base]_at_dim_0 : 2 COUNT_ARRAY_WRITES_for_[#memory_$Pointer$.base]_at_dim_1 : 4 COUNT_BLOCKS_for_[#memory_$Pointer$.base]_at_dim_1 : 1 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : 4 COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : 2 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_1 : 5 COUNT_BLOCKS_for_[#memory_int]_at_dim_1 : 2 COUNT_ARRAY_READS for [#memory_$Pointer$.offset] : 7 COUNT_ARRAY_READS for [#memory_$Pointer$.base] : 7 COUNT_ARRAY_READS for [#memory_int] : 6 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 620]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 620. Possible FailurePath: - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 38 locations, 11 error locations. UNSAFE Result, 0.9s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 70 SDtfs, 41 SDslu, 62 SDs, 0 SdLazy, 51 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 42 NumberOfCodeBlocks, 42 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 23 ConstructedInterpolants, 0 QuantifiedInterpolants, 547 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 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/test-0158_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-30_02-21-14-430.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0158_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-01-30_02-21-14-430.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0158_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-01-30_02-21-14-430.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0158_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-01-30_02-21-14-430.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0158_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_02-21-14-430.csv Received shutdown request...