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/ldv-memsafety/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d4a2356 [2018-03-23 12:20:00,699 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-03-23 12:20:00,701 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-03-23 12:20:00,718 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-03-23 12:20:00,718 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-03-23 12:20:00,719 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-03-23 12:20:00,720 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-03-23 12:20:00,722 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-03-23 12:20:00,724 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-03-23 12:20:00,725 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-03-23 12:20:00,726 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-03-23 12:20:00,726 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-03-23 12:20:00,727 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-03-23 12:20:00,728 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-03-23 12:20:00,729 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-03-23 12:20:00,731 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-03-23 12:20:00,733 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-03-23 12:20:00,735 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-03-23 12:20:00,736 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-03-23 12:20:00,738 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-03-23 12:20:00,740 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-03-23 12:20:00,740 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-03-23 12:20:00,740 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-03-23 12:20:00,741 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-03-23 12:20:00,742 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-03-23 12:20:00,743 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-03-23 12:20:00,744 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-03-23 12:20:00,744 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-03-23 12:20:00,745 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-03-23 12:20:00,745 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-03-23 12:20:00,746 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-03-23 12:20:00,746 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-03-23 12:20:00,757 INFO L110 SettingsManager]: Loading preferences was successful [2018-03-23 12:20:00,757 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-03-23 12:20:00,758 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-03-23 12:20:00,758 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-03-23 12:20:00,758 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-03-23 12:20:00,759 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-03-23 12:20:00,759 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-03-23 12:20:00,760 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-03-23 12:20:00,760 INFO L133 SettingsManager]: * sizeof long=4 [2018-03-23 12:20:00,760 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-03-23 12:20:00,760 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-03-23 12:20:00,760 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-03-23 12:20:00,760 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-03-23 12:20:00,761 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-03-23 12:20:00,761 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-03-23 12:20:00,761 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-03-23 12:20:00,761 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-03-23 12:20:00,761 INFO L133 SettingsManager]: * sizeof long double=12 [2018-03-23 12:20:00,762 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-03-23 12:20:00,762 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-03-23 12:20:00,762 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-03-23 12:20:00,762 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-03-23 12:20:00,762 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-03-23 12:20:00,763 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-23 12:20:00,763 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-03-23 12:20:00,763 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-03-23 12:20:00,763 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-03-23 12:20:00,763 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-03-23 12:20:00,764 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-03-23 12:20:00,764 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-03-23 12:20:00,764 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-23 12:20:00,764 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-03-23 12:20:00,765 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-03-23 12:20:00,765 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-03-23 12:20:00,798 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-03-23 12:20:00,811 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-03-23 12:20:00,815 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-03-23 12:20:00,816 INFO L271 PluginConnector]: Initializing CDTParser... [2018-03-23 12:20:00,817 INFO L276 PluginConnector]: CDTParser initialized [2018-03-23 12:20:00,817 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c [2018-03-23 12:20:01,133 INFO L228 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG2b0a1d73d [2018-03-23 12:20:01,256 INFO L291 CDTParser]: IsIndexed: true [2018-03-23 12:20:01,256 INFO L292 CDTParser]: Found 1 translation units. [2018-03-23 12:20:01,257 INFO L171 CDTParser]: Scanning ArraysOfVariableLength6_true-valid-memsafety_true-termination.c [2018-03-23 12:20:01,258 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-03-23 12:20:01,258 INFO L215 ultiparseSymbolTable]: [2018-03-23 12:20:01,258 INFO L218 ultiparseSymbolTable]: Function table: [2018-03-23 12:20:01,258 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in ArraysOfVariableLength6_true-valid-memsafety_true-termination.c [2018-03-23 12:20:01,259 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo ('foo') in ArraysOfVariableLength6_true-valid-memsafety_true-termination.c [2018-03-23 12:20:01,259 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-03-23 12:20:01,259 INFO L233 ultiparseSymbolTable]: [2018-03-23 12:20:01,274 INFO L334 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG2b0a1d73d [2018-03-23 12:20:01,278 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-03-23 12:20:01,281 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-03-23 12:20:01,282 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-03-23 12:20:01,282 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-03-23 12:20:01,287 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-03-23 12:20:01,287 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.03 12:20:01" (1/1) ... [2018-03-23 12:20:01,289 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3167c1fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 12:20:01, skipping insertion in model container [2018-03-23 12:20:01,290 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.03 12:20:01" (1/1) ... [2018-03-23 12:20:01,304 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-23 12:20:01,317 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-23 12:20:01,450 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-23 12:20:01,474 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-23 12:20:01,478 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-03-23 12:20:01,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 12:20:01 WrapperNode [2018-03-23 12:20:01,486 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-03-23 12:20:01,487 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-03-23 12:20:01,487 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-03-23 12:20:01,487 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-03-23 12:20:01,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 12:20:01" (1/1) ... [2018-03-23 12:20:01,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 12:20:01" (1/1) ... [2018-03-23 12:20:01,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 12:20:01" (1/1) ... [2018-03-23 12:20:01,503 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 12:20:01" (1/1) ... [2018-03-23 12:20:01,507 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 12:20:01" (1/1) ... [2018-03-23 12:20:01,511 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 12:20:01" (1/1) ... [2018-03-23 12:20:01,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 12:20:01" (1/1) ... [2018-03-23 12:20:01,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-03-23 12:20:01,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-03-23 12:20:01,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-03-23 12:20:01,515 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-03-23 12:20:01,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 12:20:01" (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-03-23 12:20:01,561 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-03-23 12:20:01,562 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-03-23 12:20:01,562 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo [2018-03-23 12:20:01,562 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-03-23 12:20:01,562 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo [2018-03-23 12:20:01,562 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-03-23 12:20:01,562 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-03-23 12:20:01,562 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-03-23 12:20:01,562 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-03-23 12:20:01,563 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-03-23 12:20:01,563 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-03-23 12:20:01,563 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-03-23 12:20:01,563 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-03-23 12:20:01,829 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-03-23 12:20:01,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.03 12:20:01 BoogieIcfgContainer [2018-03-23 12:20:01,830 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-03-23 12:20:01,830 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-03-23 12:20:01,830 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-03-23 12:20:01,831 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-03-23 12:20:01,835 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.03 12:20:01" (1/1) ... [2018-03-23 12:20:01,846 INFO L112 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-03-23 12:20:01,846 INFO L113 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-03-23 12:20:01,861 INFO L255 apSepIcfgTransformer]: Heap separator: starting memloc-array-style preprocessing [2018-03-23 12:20:01,874 INFO L271 apSepIcfgTransformer]: finished MemlocArrayUpdater, created 0 location literals (each corresponds to one heap write) [2018-03-23 12:20:01,884 INFO L322 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-03-23 12:20:01,940 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-03-23 12:20:05,272 INFO L314 AbstractInterpreter]: Visited 73 different actions 344 times. Merged at 47 different actions 166 times. Never widened. Found 30 fixpoints after 11 different actions. Largest state had 21 variables. [2018-03-23 12:20:05,275 INFO L334 apSepIcfgTransformer]: finished equality analysis [2018-03-23 12:20:05,283 INFO L195 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 1 [2018-03-23 12:20:05,284 INFO L344 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-03-23 12:20:05,284 INFO L345 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-03-23 12:20:05,284 INFO L347 apSepIcfgTransformer]: select infos: Set: ((select (select |v_#memory_int_1| v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_2) (+ v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_6 v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_2)), at (SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0 * 1, 1); srcloc: L16')) [2018-03-23 12:20:05,289 INFO L311 HeapPartitionManager]: partitioning result: [2018-03-23 12:20:05,289 INFO L316 HeapPartitionManager]: location blocks for array group [#memory_int] [2018-03-23 12:20:05,289 INFO L325 HeapPartitionManager]: at dimension 0 [2018-03-23 12:20:05,290 INFO L326 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-03-23 12:20:05,290 INFO L327 HeapPartitionManager]: # location blocks :1 [2018-03-23 12:20:05,290 INFO L325 HeapPartitionManager]: at dimension 1 [2018-03-23 12:20:05,290 INFO L326 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-03-23 12:20:05,290 INFO L327 HeapPartitionManager]: # location blocks :1 [2018-03-23 12:20:05,291 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-03-23 12:20:05,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 23.03 12:20:05 BasicIcfg [2018-03-23 12:20:05,307 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-03-23 12:20:05,308 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-03-23 12:20:05,308 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-03-23 12:20:05,312 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-03-23 12:20:05,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.03 12:20:01" (1/4) ... [2018-03-23 12:20:05,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a697ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.03 12:20:05, skipping insertion in model container [2018-03-23 12:20:05,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 12:20:01" (2/4) ... [2018-03-23 12:20:05,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a697ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.03 12:20:05, skipping insertion in model container [2018-03-23 12:20:05,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.03 12:20:01" (3/4) ... [2018-03-23 12:20:05,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a697ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.03 12:20:05, skipping insertion in model container [2018-03-23 12:20:05,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 23.03 12:20:05" (4/4) ... [2018-03-23 12:20:05,316 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-03-23 12:20:05,325 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-03-23 12:20:05,333 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-03-23 12:20:05,376 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-03-23 12:20:05,377 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-03-23 12:20:05,377 INFO L370 AbstractCegarLoop]: Hoare is true [2018-03-23 12:20:05,377 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-03-23 12:20:05,377 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-03-23 12:20:05,377 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-03-23 12:20:05,378 INFO L374 AbstractCegarLoop]: Difference is false [2018-03-23 12:20:05,378 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-03-23 12:20:05,378 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-03-23 12:20:05,379 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-03-23 12:20:05,393 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-03-23 12:20:05,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-03-23 12:20:05,399 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:20:05,400 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:20:05,400 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:20:05,405 INFO L82 PathProgramCache]: Analyzing trace with hash -289603045, now seen corresponding path program 1 times [2018-03-23 12:20:05,407 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:20:05,407 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:20:05,464 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:20:05,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:20:05,465 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:20:05,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:20:05,516 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:20:05,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:20:05,599 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 12:20:05,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-03-23 12:20:05,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-03-23 12:20:05,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-03-23 12:20:05,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-23 12:20:05,614 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 3 states. [2018-03-23 12:20:05,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:20:05,757 INFO L93 Difference]: Finished difference Result 138 states and 165 transitions. [2018-03-23 12:20:05,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-03-23 12:20:05,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-03-23 12:20:05,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:20:05,774 INFO L225 Difference]: With dead ends: 138 [2018-03-23 12:20:05,774 INFO L226 Difference]: Without dead ends: 82 [2018-03-23 12:20:05,778 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-23 12:20:05,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-03-23 12:20:05,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 68. [2018-03-23 12:20:05,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-03-23 12:20:05,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2018-03-23 12:20:05,826 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 12 [2018-03-23 12:20:05,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:20:05,826 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2018-03-23 12:20:05,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-03-23 12:20:05,827 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2018-03-23 12:20:05,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-03-23 12:20:05,828 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:20:05,828 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:20:05,828 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:20:05,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1129209722, now seen corresponding path program 1 times [2018-03-23 12:20:05,828 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:20:05,829 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:20:05,830 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:20:05,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:20:05,830 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:20:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:20:05,847 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:20:05,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:20:05,929 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 12:20:05,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-03-23 12:20:05,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-23 12:20:05,931 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-23 12:20:05,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-03-23 12:20:05,932 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 6 states. [2018-03-23 12:20:06,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:20:06,083 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2018-03-23 12:20:06,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-23 12:20:06,086 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-03-23 12:20:06,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:20:06,088 INFO L225 Difference]: With dead ends: 130 [2018-03-23 12:20:06,088 INFO L226 Difference]: Without dead ends: 78 [2018-03-23 12:20:06,089 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-03-23 12:20:06,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-03-23 12:20:06,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 71. [2018-03-23 12:20:06,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-03-23 12:20:06,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2018-03-23 12:20:06,097 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 21 [2018-03-23 12:20:06,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:20:06,098 INFO L459 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2018-03-23 12:20:06,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-23 12:20:06,098 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2018-03-23 12:20:06,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-03-23 12:20:06,099 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:20:06,099 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:20:06,099 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:20:06,100 INFO L82 PathProgramCache]: Analyzing trace with hash 645763495, now seen corresponding path program 1 times [2018-03-23 12:20:06,100 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:20:06,100 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:20:06,101 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:20:06,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:20:06,101 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:20:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:20:06,111 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:20:06,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:20:06,192 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 12:20:06,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-03-23 12:20:06,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-23 12:20:06,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-23 12:20:06,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-03-23 12:20:06,193 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 6 states. [2018-03-23 12:20:06,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:20:06,340 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-03-23 12:20:06,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-23 12:20:06,340 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-03-23 12:20:06,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:20:06,342 INFO L225 Difference]: With dead ends: 71 [2018-03-23 12:20:06,342 INFO L226 Difference]: Without dead ends: 70 [2018-03-23 12:20:06,342 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-03-23 12:20:06,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-03-23 12:20:06,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-03-23 12:20:06,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-03-23 12:20:06,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2018-03-23 12:20:06,352 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 22 [2018-03-23 12:20:06,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:20:06,352 INFO L459 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2018-03-23 12:20:06,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-23 12:20:06,353 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2018-03-23 12:20:06,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-03-23 12:20:06,354 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:20:06,354 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:20:06,354 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:20:06,354 INFO L82 PathProgramCache]: Analyzing trace with hash 645763497, now seen corresponding path program 1 times [2018-03-23 12:20:06,354 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:20:06,354 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:20:06,355 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:20:06,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:20:06,356 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:20:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:20:06,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:20:06,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:20:06,500 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 12:20:06,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-03-23 12:20:06,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-03-23 12:20:06,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-03-23 12:20:06,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-03-23 12:20:06,501 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand 7 states. [2018-03-23 12:20:06,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:20:06,706 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2018-03-23 12:20:06,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-03-23 12:20:06,706 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-03-23 12:20:06,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:20:06,707 INFO L225 Difference]: With dead ends: 76 [2018-03-23 12:20:06,708 INFO L226 Difference]: Without dead ends: 75 [2018-03-23 12:20:06,708 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-03-23 12:20:06,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-03-23 12:20:06,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2018-03-23 12:20:06,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-03-23 12:20:06,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2018-03-23 12:20:06,716 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 22 [2018-03-23 12:20:06,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:20:06,717 INFO L459 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2018-03-23 12:20:06,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-03-23 12:20:06,717 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2018-03-23 12:20:06,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-03-23 12:20:06,718 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:20:06,718 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:20:06,719 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:20:06,719 INFO L82 PathProgramCache]: Analyzing trace with hash 823290080, now seen corresponding path program 1 times [2018-03-23 12:20:06,719 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:20:06,719 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:20:06,720 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:20:06,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:20:06,720 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:20:06,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:20:06,729 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:20:06,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:20:06,815 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:20:06,815 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 12:20:06,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:20:06,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:20:06,862 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:20:06,894 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:20:06,923 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-03-23 12:20:06,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2018-03-23 12:20:06,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-03-23 12:20:06,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-03-23 12:20:06,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-03-23 12:20:06,924 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 8 states. [2018-03-23 12:20:07,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:20:07,209 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2018-03-23 12:20:07,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-03-23 12:20:07,209 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-03-23 12:20:07,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:20:07,210 INFO L225 Difference]: With dead ends: 110 [2018-03-23 12:20:07,211 INFO L226 Difference]: Without dead ends: 89 [2018-03-23 12:20:07,211 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-03-23 12:20:07,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-03-23 12:20:07,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2018-03-23 12:20:07,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-03-23 12:20:07,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2018-03-23 12:20:07,220 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 23 [2018-03-23 12:20:07,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:20:07,220 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2018-03-23 12:20:07,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-03-23 12:20:07,220 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2018-03-23 12:20:07,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-03-23 12:20:07,221 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:20:07,222 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:20:07,222 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:20:07,222 INFO L82 PathProgramCache]: Analyzing trace with hash 349066383, now seen corresponding path program 1 times [2018-03-23 12:20:07,222 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:20:07,222 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:20:07,223 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:20:07,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:20:07,224 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:20:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:20:07,234 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:20:07,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:20:07,288 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:20:07,289 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 12:20:07,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:20:07,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:20:07,315 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:20:07,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:20:07,365 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:20:07,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-03-23 12:20:07,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-03-23 12:20:07,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-03-23 12:20:07,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-03-23 12:20:07,366 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand 5 states. [2018-03-23 12:20:07,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:20:07,412 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2018-03-23 12:20:07,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-23 12:20:07,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-03-23 12:20:07,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:20:07,415 INFO L225 Difference]: With dead ends: 97 [2018-03-23 12:20:07,415 INFO L226 Difference]: Without dead ends: 96 [2018-03-23 12:20:07,415 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-03-23 12:20:07,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-03-23 12:20:07,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2018-03-23 12:20:07,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-03-23 12:20:07,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2018-03-23 12:20:07,426 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 30 [2018-03-23 12:20:07,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:20:07,426 INFO L459 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2018-03-23 12:20:07,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-03-23 12:20:07,426 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2018-03-23 12:20:07,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-03-23 12:20:07,428 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:20:07,428 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:20:07,428 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:20:07,428 INFO L82 PathProgramCache]: Analyzing trace with hash -2063843532, now seen corresponding path program 1 times [2018-03-23 12:20:07,428 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:20:07,429 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:20:07,429 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:20:07,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:20:07,430 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:20:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:20:07,439 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:20:07,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:20:07,602 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:20:07,602 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 12:20:07,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:20:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:20:07,634 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:20:07,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-23 12:20:07,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:20:07,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:20:07,662 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-23 12:20:07,702 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:20:07,723 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:20:07,723 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-03-23 12:20:07,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-03-23 12:20:07,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-03-23 12:20:07,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-03-23 12:20:07,724 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 9 states. [2018-03-23 12:20:07,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:20:07,884 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2018-03-23 12:20:07,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-23 12:20:07,885 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-03-23 12:20:07,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:20:07,886 INFO L225 Difference]: With dead ends: 96 [2018-03-23 12:20:07,886 INFO L226 Difference]: Without dead ends: 95 [2018-03-23 12:20:07,886 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-03-23 12:20:07,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-03-23 12:20:07,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2018-03-23 12:20:07,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-03-23 12:20:07,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2018-03-23 12:20:07,892 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 31 [2018-03-23 12:20:07,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:20:07,893 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2018-03-23 12:20:07,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-03-23 12:20:07,893 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2018-03-23 12:20:07,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-03-23 12:20:07,894 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:20:07,894 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:20:07,894 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:20:07,895 INFO L82 PathProgramCache]: Analyzing trace with hash -713537766, now seen corresponding path program 2 times [2018-03-23 12:20:07,895 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:20:07,895 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:20:07,895 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:20:07,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:20:07,895 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:20:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:20:07,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:20:07,965 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:20:07,965 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:20:07,965 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 12:20:07,973 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 12:20:07,986 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-03-23 12:20:07,986 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 12:20:07,989 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:20:08,077 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:20:08,098 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:20:08,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 14 [2018-03-23 12:20:08,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-03-23 12:20:08,098 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-03-23 12:20:08,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-03-23 12:20:08,099 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 15 states. [2018-03-23 12:20:08,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:20:08,324 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2018-03-23 12:20:08,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-03-23 12:20:08,324 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2018-03-23 12:20:08,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:20:08,325 INFO L225 Difference]: With dead ends: 108 [2018-03-23 12:20:08,325 INFO L226 Difference]: Without dead ends: 107 [2018-03-23 12:20:08,326 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=576, Unknown=0, NotChecked=0, Total=756 [2018-03-23 12:20:08,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-03-23 12:20:08,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 87. [2018-03-23 12:20:08,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-03-23 12:20:08,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2018-03-23 12:20:08,333 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 39 [2018-03-23 12:20:08,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:20:08,334 INFO L459 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2018-03-23 12:20:08,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-03-23 12:20:08,334 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2018-03-23 12:20:08,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-03-23 12:20:08,335 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:20:08,335 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:20:08,335 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:20:08,336 INFO L82 PathProgramCache]: Analyzing trace with hash -644833783, now seen corresponding path program 2 times [2018-03-23 12:20:08,336 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:20:08,336 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:20:08,337 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:20:08,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 12:20:08,337 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:20:08,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:20:08,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:20:08,533 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:20:08,534 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:20:08,534 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 12:20:08,540 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 12:20:08,553 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-03-23 12:20:08,553 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 12:20:08,555 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:20:08,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-23 12:20:08,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:20:08,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:20:08,561 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-23 12:20:08,593 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:20:08,614 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:20:08,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-03-23 12:20:08,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-03-23 12:20:08,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-03-23 12:20:08,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-03-23 12:20:08,615 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 11 states. [2018-03-23 12:20:08,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:20:08,807 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2018-03-23 12:20:08,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-03-23 12:20:08,808 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2018-03-23 12:20:08,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:20:08,808 INFO L225 Difference]: With dead ends: 107 [2018-03-23 12:20:08,808 INFO L226 Difference]: Without dead ends: 106 [2018-03-23 12:20:08,809 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-03-23 12:20:08,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-03-23 12:20:08,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 96. [2018-03-23 12:20:08,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-03-23 12:20:08,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2018-03-23 12:20:08,817 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 40 [2018-03-23 12:20:08,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:20:08,818 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2018-03-23 12:20:08,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-03-23 12:20:08,818 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2018-03-23 12:20:08,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-03-23 12:20:08,819 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:20:08,820 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:20:08,820 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:20:08,820 INFO L82 PathProgramCache]: Analyzing trace with hash 853161830, now seen corresponding path program 1 times [2018-03-23 12:20:08,820 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:20:08,820 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:20:08,821 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:20:08,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 12:20:08,821 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:20:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:20:08,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:20:08,865 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:20:08,865 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:20:08,866 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 12:20:08,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:20:08,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:20:08,881 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:20:08,895 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:20:08,917 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:20:08,917 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-03-23 12:20:08,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-03-23 12:20:08,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-03-23 12:20:08,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-03-23 12:20:08,918 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand 9 states. [2018-03-23 12:20:09,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:20:09,047 INFO L93 Difference]: Finished difference Result 143 states and 158 transitions. [2018-03-23 12:20:09,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-03-23 12:20:09,048 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-03-23 12:20:09,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:20:09,049 INFO L225 Difference]: With dead ends: 143 [2018-03-23 12:20:09,049 INFO L226 Difference]: Without dead ends: 123 [2018-03-23 12:20:09,049 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-03-23 12:20:09,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-03-23 12:20:09,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 107. [2018-03-23 12:20:09,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-03-23 12:20:09,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2018-03-23 12:20:09,058 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 41 [2018-03-23 12:20:09,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:20:09,059 INFO L459 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2018-03-23 12:20:09,059 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-03-23 12:20:09,059 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2018-03-23 12:20:09,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-03-23 12:20:09,060 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:20:09,060 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:20:09,061 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:20:09,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1541333292, now seen corresponding path program 3 times [2018-03-23 12:20:09,061 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:20:09,061 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:20:09,061 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:20:09,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:20:09,062 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:20:09,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:20:09,072 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:20:09,318 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-03-23 12:20:09,318 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:20:09,318 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 12:20:09,324 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-03-23 12:20:09,334 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-03-23 12:20:09,334 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 12:20:09,336 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:20:09,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-23 12:20:09,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:20:09,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:20:09,343 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-23 12:20:09,459 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-03-23 12:20:09,479 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:20:09,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-03-23 12:20:09,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-03-23 12:20:09,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-03-23 12:20:09,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2018-03-23 12:20:09,481 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand 20 states. [2018-03-23 12:20:09,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:20:09,689 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2018-03-23 12:20:09,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-03-23 12:20:09,689 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 49 [2018-03-23 12:20:09,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:20:09,690 INFO L225 Difference]: With dead ends: 107 [2018-03-23 12:20:09,690 INFO L226 Difference]: Without dead ends: 106 [2018-03-23 12:20:09,691 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812 [2018-03-23 12:20:09,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-03-23 12:20:09,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 86. [2018-03-23 12:20:09,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-03-23 12:20:09,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2018-03-23 12:20:09,697 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 49 [2018-03-23 12:20:09,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:20:09,698 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2018-03-23 12:20:09,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-03-23 12:20:09,698 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2018-03-23 12:20:09,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-03-23 12:20:09,699 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:20:09,699 INFO L353 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:20:09,699 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:20:09,700 INFO L82 PathProgramCache]: Analyzing trace with hash 2112266945, now seen corresponding path program 2 times [2018-03-23 12:20:09,700 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:20:09,700 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:20:09,701 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:20:09,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 12:20:09,701 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:20:09,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:20:09,710 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:20:09,767 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:20:09,767 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:20:09,767 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 12:20:09,773 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 12:20:09,782 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-03-23 12:20:09,782 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 12:20:09,785 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:20:09,826 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_~#mask~0.base| Int)) (and (= (store |c_old(#valid)| |main_~#mask~0.base| 0) |c_#valid|) (= (select |c_old(#valid)| |main_~#mask~0.base|) 0))) is different from true [2018-03-23 12:20:09,841 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-03-23 12:20:09,876 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-03-23 12:20:09,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2018-03-23 12:20:09,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-23 12:20:09,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-23 12:20:09,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=83, Unknown=1, NotChecked=18, Total=132 [2018-03-23 12:20:09,877 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand 12 states. [2018-03-23 12:20:10,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:20:10,259 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2018-03-23 12:20:10,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-03-23 12:20:10,259 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2018-03-23 12:20:10,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:20:10,260 INFO L225 Difference]: With dead ends: 132 [2018-03-23 12:20:10,260 INFO L226 Difference]: Without dead ends: 100 [2018-03-23 12:20:10,260 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=144, Invalid=364, Unknown=2, NotChecked=42, Total=552 [2018-03-23 12:20:10,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-03-23 12:20:10,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2018-03-23 12:20:10,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-03-23 12:20:10,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2018-03-23 12:20:10,267 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 52 [2018-03-23 12:20:10,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:20:10,267 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2018-03-23 12:20:10,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-23 12:20:10,267 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-03-23 12:20:10,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-03-23 12:20:10,268 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:20:10,268 INFO L353 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:20:10,268 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:20:10,268 INFO L82 PathProgramCache]: Analyzing trace with hash 296475714, now seen corresponding path program 1 times [2018-03-23 12:20:10,268 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:20:10,269 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:20:10,269 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:20:10,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 12:20:10,270 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:20:10,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:20:10,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:20:10,384 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-03-23 12:20:10,385 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:20:10,385 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 12:20:10,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:20:10,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:20:10,428 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:20:10,660 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-03-23 12:20:10,693 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:20:10,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11] total 15 [2018-03-23 12:20:10,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-03-23 12:20:10,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-03-23 12:20:10,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-03-23 12:20:10,694 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 15 states. [2018-03-23 12:20:10,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:20:10,884 INFO L93 Difference]: Finished difference Result 130 states and 146 transitions. [2018-03-23 12:20:10,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-03-23 12:20:10,917 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2018-03-23 12:20:10,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:20:10,918 INFO L225 Difference]: With dead ends: 130 [2018-03-23 12:20:10,918 INFO L226 Difference]: Without dead ends: 118 [2018-03-23 12:20:10,919 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2018-03-23 12:20:10,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-03-23 12:20:10,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 107. [2018-03-23 12:20:10,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-03-23 12:20:10,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2018-03-23 12:20:10,926 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 65 [2018-03-23 12:20:10,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:20:10,926 INFO L459 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2018-03-23 12:20:10,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-03-23 12:20:10,926 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2018-03-23 12:20:10,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-03-23 12:20:10,927 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:20:10,927 INFO L353 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:20:10,927 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:20:10,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1585457444, now seen corresponding path program 2 times [2018-03-23 12:20:10,927 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:20:10,927 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:20:10,928 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:20:10,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:20:10,928 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:20:10,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:20:10,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:20:11,003 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-03-23 12:20:11,004 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:20:11,004 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 12:20:11,011 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 12:20:11,024 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-03-23 12:20:11,025 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 12:20:11,026 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:20:11,114 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-03-23 12:20:11,135 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:20:11,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 19 [2018-03-23 12:20:11,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-03-23 12:20:11,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-03-23 12:20:11,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-03-23 12:20:11,136 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand 19 states. [2018-03-23 12:20:11,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:20:11,403 INFO L93 Difference]: Finished difference Result 147 states and 165 transitions. [2018-03-23 12:20:11,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-03-23 12:20:11,404 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 83 [2018-03-23 12:20:11,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:20:11,404 INFO L225 Difference]: With dead ends: 147 [2018-03-23 12:20:11,404 INFO L226 Difference]: Without dead ends: 0 [2018-03-23 12:20:11,405 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=250, Invalid=940, Unknown=0, NotChecked=0, Total=1190 [2018-03-23 12:20:11,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-03-23 12:20:11,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-03-23 12:20:11,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-03-23 12:20:11,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-03-23 12:20:11,406 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2018-03-23 12:20:11,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:20:11,406 INFO L459 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-03-23 12:20:11,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-03-23 12:20:11,406 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-03-23 12:20:11,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-03-23 12:20:11,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-03-23 12:20:11,427 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-03-23 12:20:11,439 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-03-23 12:20:11,461 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-03-23 12:20:11,478 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-03-23 12:20:11,494 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-03-23 12:20:11,509 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-03-23 12:20:11,524 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-03-23 12:20:11,538 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-03-23 12:20:11,551 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-03-23 12:20:11,768 WARN L151 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 43 DAG size of output 30 [2018-03-23 12:20:11,886 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 48 DAG size of output 32 [2018-03-23 12:20:12,090 WARN L151 SmtUtils]: Spent 193ms on a formula simplification. DAG size of input: 35 DAG size of output 28 [2018-03-23 12:20:12,093 INFO L416 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-03-23 12:20:12,093 INFO L416 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-03-23 12:20:12,093 INFO L412 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-03-23 12:20:12,094 INFO L416 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-03-23 12:20:12,094 INFO L416 ceAbstractionStarter]: For program point __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooFINAL(lines 12 19) no Hoare annotation was computed. [2018-03-23 12:20:12,094 INFO L416 ceAbstractionStarter]: For program point L15''''(line 15) no Hoare annotation was computed. [2018-03-23 12:20:12,094 INFO L416 ceAbstractionStarter]: For program point L15'''''(line 15) no Hoare annotation was computed. [2018-03-23 12:20:12,094 INFO L416 ceAbstractionStarter]: For program point __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation(line 16) no Hoare annotation was computed. [2018-03-23 12:20:12,094 INFO L412 ceAbstractionStarter]: At program point L15''''''(lines 15 17) the Hoare annotation is: (or (not (= 32 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~size|)) (not (= 0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.offset|)) (not (= 1 (select |#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.base|))) (and (= 1 (select |#valid| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base)) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~size 32) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset 0) (<= 0 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0)) (= 32 (select |#length| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base))) (not (= 32 (select |#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.base|)))) [2018-03-23 12:20:12,094 INFO L416 ceAbstractionStarter]: For program point L15'''''''(lines 15 17) no Hoare annotation was computed. [2018-03-23 12:20:12,094 INFO L416 ceAbstractionStarter]: For program point L12(lines 12 19) no Hoare annotation was computed. [2018-03-23 12:20:12,094 INFO L416 ceAbstractionStarter]: For program point L15'''(lines 15 17) no Hoare annotation was computed. [2018-03-23 12:20:12,095 INFO L416 ceAbstractionStarter]: For program point L16'''(line 16) no Hoare annotation was computed. [2018-03-23 12:20:12,095 INFO L416 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-03-23 12:20:12,095 INFO L416 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-03-23 12:20:12,095 INFO L416 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-03-23 12:20:12,095 INFO L416 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-03-23 12:20:12,095 INFO L416 ceAbstractionStarter]: For program point __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX(line 16) no Hoare annotation was computed. [2018-03-23 12:20:12,095 INFO L416 ceAbstractionStarter]: For program point L15'(lines 15 17) no Hoare annotation was computed. [2018-03-23 12:20:12,095 INFO L416 ceAbstractionStarter]: For program point L16'(line 16) no Hoare annotation was computed. [2018-03-23 12:20:12,095 INFO L416 ceAbstractionStarter]: For program point __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooEXIT(lines 12 19) no Hoare annotation was computed. [2018-03-23 12:20:12,095 INFO L416 ceAbstractionStarter]: For program point L16''(line 16) no Hoare annotation was computed. [2018-03-23 12:20:12,095 INFO L416 ceAbstractionStarter]: For program point __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation(line 16) no Hoare annotation was computed. [2018-03-23 12:20:12,096 INFO L419 ceAbstractionStarter]: At program point __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooENTRY(lines 12 19) the Hoare annotation is: true [2018-03-23 12:20:12,096 INFO L419 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-03-23 12:20:12,096 INFO L419 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-03-23 12:20:12,096 INFO L416 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-03-23 12:20:12,096 INFO L416 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-03-23 12:20:12,096 INFO L416 ceAbstractionStarter]: For program point L25'''''(line 25) no Hoare annotation was computed. [2018-03-23 12:20:12,096 INFO L416 ceAbstractionStarter]: For program point mainErr0AssertViolationARRAY_INDEX(line 27) no Hoare annotation was computed. [2018-03-23 12:20:12,096 INFO L416 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-03-23 12:20:12,096 INFO L416 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-03-23 12:20:12,096 INFO L416 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-03-23 12:20:12,097 INFO L416 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-03-23 12:20:12,097 INFO L416 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-03-23 12:20:12,097 INFO L416 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-03-23 12:20:12,097 INFO L416 ceAbstractionStarter]: For program point L25'''(lines 25 28) no Hoare annotation was computed. [2018-03-23 12:20:12,097 INFO L416 ceAbstractionStarter]: For program point L29(lines 29 33) no Hoare annotation was computed. [2018-03-23 12:20:12,097 INFO L416 ceAbstractionStarter]: For program point L24''''(line 24) no Hoare annotation was computed. [2018-03-23 12:20:12,097 INFO L416 ceAbstractionStarter]: For program point L27''''(line 27) no Hoare annotation was computed. [2018-03-23 12:20:12,097 INFO L412 ceAbstractionStarter]: At program point L25''''''(lines 25 28) the Hoare annotation is: (let ((.cse0 (= |#valid| (store |old(#valid)| |main_~#mask~0.base| 1))) (.cse1 (= 32 (select |#length| |main_~#mask~0.base|))) (.cse2 (= 0 |main_~#mask~0.offset|)) (.cse3 (= (select |old(#valid)| |main_~#mask~0.base|) 0))) (or (and .cse0 .cse1 .cse2 (= main_~i~1 0) .cse3) (and (= 1 (select |#valid| main_~c~0.base)) .cse0 .cse1 .cse2 (<= 1 main_~i~1) (= 32 (select |#length| main_~c~0.base)) (= 0 main_~c~0.offset) .cse3))) [2018-03-23 12:20:12,098 INFO L412 ceAbstractionStarter]: At program point L27'(line 27) the Hoare annotation is: (let ((.cse0 (= 1 (select |#valid| main_~c~0.base))) (.cse1 (= |#valid| (store |old(#valid)| |main_~#mask~0.base| 1))) (.cse2 (= 32 (select |#length| |main_~#mask~0.base|))) (.cse3 (= 0 |main_~#mask~0.offset|)) (.cse4 (= 32 (select |#length| main_~c~0.base))) (.cse5 (= 0 main_~c~0.offset)) (.cse6 (= (select |old(#valid)| |main_~#mask~0.base|) 0))) (or (and .cse0 .cse1 (<= main_~i~1 31) .cse2 .cse3 (<= 1 main_~i~1) .cse4 .cse5 .cse6) (and .cse0 (= 0 main_~i~1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-03-23 12:20:12,098 INFO L416 ceAbstractionStarter]: For program point L25'(lines 25 28) no Hoare annotation was computed. [2018-03-23 12:20:12,098 INFO L416 ceAbstractionStarter]: For program point L27'''(line 27) no Hoare annotation was computed. [2018-03-23 12:20:12,098 INFO L416 ceAbstractionStarter]: For program point L24'''''(line 24) no Hoare annotation was computed. [2018-03-23 12:20:12,098 INFO L416 ceAbstractionStarter]: For program point L29'''(line 29) no Hoare annotation was computed. [2018-03-23 12:20:12,098 INFO L416 ceAbstractionStarter]: For program point L29''''''(lines 29 33) no Hoare annotation was computed. [2018-03-23 12:20:12,098 INFO L416 ceAbstractionStarter]: For program point L25''''(line 25) no Hoare annotation was computed. [2018-03-23 12:20:12,098 INFO L416 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-03-23 12:20:12,098 INFO L416 ceAbstractionStarter]: For program point mainFINAL(lines 21 35) no Hoare annotation was computed. [2018-03-23 12:20:12,098 INFO L416 ceAbstractionStarter]: For program point L24''(line 24) no Hoare annotation was computed. [2018-03-23 12:20:12,099 INFO L416 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-03-23 12:20:12,099 INFO L416 ceAbstractionStarter]: For program point mainEXIT(lines 21 35) no Hoare annotation was computed. [2018-03-23 12:20:12,099 INFO L416 ceAbstractionStarter]: For program point mainErr2EnsuresViolationMEMORY_LEAK(lines 21 35) no Hoare annotation was computed. [2018-03-23 12:20:12,099 INFO L412 ceAbstractionStarter]: At program point mainENTRY(lines 21 35) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-03-23 12:20:12,099 INFO L416 ceAbstractionStarter]: For program point L24'''(line 24) no Hoare annotation was computed. [2018-03-23 12:20:12,099 INFO L416 ceAbstractionStarter]: For program point L29''''(line 29) no Hoare annotation was computed. [2018-03-23 12:20:12,099 INFO L416 ceAbstractionStarter]: For program point mainErr1AssertViolationARRAY_INDEX(line 30) no Hoare annotation was computed. [2018-03-23 12:20:12,099 INFO L416 ceAbstractionStarter]: For program point L29''(lines 29 33) no Hoare annotation was computed. [2018-03-23 12:20:12,099 INFO L416 ceAbstractionStarter]: For program point L27''(line 27) no Hoare annotation was computed. [2018-03-23 12:20:12,099 INFO L416 ceAbstractionStarter]: For program point L25'''''''(lines 25 28) no Hoare annotation was computed. [2018-03-23 12:20:12,100 INFO L412 ceAbstractionStarter]: At program point L29'''''(lines 29 33) the Hoare annotation is: (let ((.cse0 (= 1 (select |#valid| main_~c~0.base))) (.cse1 (= |#valid| (store |old(#valid)| |main_~#mask~0.base| 1))) (.cse2 (= 32 (select |#length| |main_~#mask~0.base|))) (.cse3 (= 0 |main_~#mask~0.offset|)) (.cse4 (= 32 (select |#length| main_~c~0.base))) (.cse5 (= 0 main_~c~0.offset)) (.cse6 (= (select |old(#valid)| |main_~#mask~0.base|) 0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 1 main_~i~1) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= main_~i~1 0) .cse5 .cse6))) [2018-03-23 12:20:12,100 INFO L416 ceAbstractionStarter]: For program point L24'(line 24) no Hoare annotation was computed. [2018-03-23 12:20:12,100 INFO L416 ceAbstractionStarter]: For program point L30'(lines 30 32) no Hoare annotation was computed. [2018-03-23 12:20:12,106 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 12:20:12,107 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 12:20:12,108 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 12:20:12,111 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 12:20:12,112 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 12:20:12,112 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 12:20:12,114 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 12:20:12,114 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 12:20:12,115 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 12:20:12,116 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 12:20:12,117 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 12:20:12,118 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 12:20:12,118 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 12:20:12,118 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 12:20:12,120 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 12:20:12,120 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 12:20:12,121 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 12:20:12,121 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 12:20:12,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.03 12:20:12 BasicIcfg [2018-03-23 12:20:12,123 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-03-23 12:20:12,124 INFO L168 Benchmark]: Toolchain (without parser) took 10844.95 ms. Allocated memory was 297.8 MB in the beginning and 708.3 MB in the end (delta: 410.5 MB). Free memory was 242.9 MB in the beginning and 420.4 MB in the end (delta: -177.5 MB). Peak memory consumption was 233.0 MB. Max. memory is 5.3 GB. [2018-03-23 12:20:12,125 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 297.8 MB. Free memory is still 261.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-03-23 12:20:12,125 INFO L168 Benchmark]: CACSL2BoogieTranslator took 204.31 ms. Allocated memory is still 297.8 MB. Free memory was 241.9 MB in the beginning and 232.9 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 5.3 GB. [2018-03-23 12:20:12,125 INFO L168 Benchmark]: Boogie Preprocessor took 27.92 ms. Allocated memory is still 297.8 MB. Free memory was 232.9 MB in the beginning and 230.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-03-23 12:20:12,126 INFO L168 Benchmark]: RCFGBuilder took 314.96 ms. Allocated memory was 297.8 MB in the beginning and 454.6 MB in the end (delta: 156.8 MB). Free memory was 230.9 MB in the beginning and 421.0 MB in the end (delta: -190.1 MB). Peak memory consumption was 23.0 MB. Max. memory is 5.3 GB. [2018-03-23 12:20:12,126 INFO L168 Benchmark]: IcfgTransformer took 3477.13 ms. Allocated memory was 454.6 MB in the beginning and 632.8 MB in the end (delta: 178.3 MB). Free memory was 421.0 MB in the beginning and 510.3 MB in the end (delta: -89.3 MB). Peak memory consumption was 89.0 MB. Max. memory is 5.3 GB. [2018-03-23 12:20:12,126 INFO L168 Benchmark]: TraceAbstraction took 6814.85 ms. Allocated memory was 632.8 MB in the beginning and 708.3 MB in the end (delta: 75.5 MB). Free memory was 510.3 MB in the beginning and 420.4 MB in the end (delta: 89.9 MB). Peak memory consumption was 165.4 MB. Max. memory is 5.3 GB. [2018-03-23 12:20:12,128 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.17 ms. Allocated memory is still 297.8 MB. Free memory is still 261.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 204.31 ms. Allocated memory is still 297.8 MB. Free memory was 241.9 MB in the beginning and 232.9 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.92 ms. Allocated memory is still 297.8 MB. Free memory was 232.9 MB in the beginning and 230.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 314.96 ms. Allocated memory was 297.8 MB in the beginning and 454.6 MB in the end (delta: 156.8 MB). Free memory was 230.9 MB in the beginning and 421.0 MB in the end (delta: -190.1 MB). Peak memory consumption was 23.0 MB. Max. memory is 5.3 GB. * IcfgTransformer took 3477.13 ms. Allocated memory was 454.6 MB in the beginning and 632.8 MB in the end (delta: 178.3 MB). Free memory was 421.0 MB in the beginning and 510.3 MB in the end (delta: -89.3 MB). Peak memory consumption was 89.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6814.85 ms. Allocated memory was 632.8 MB in the beginning and 708.3 MB in the end (delta: 75.5 MB). Free memory was 510.3 MB in the beginning and 420.4 MB in the end (delta: 89.9 MB). Peak memory consumption was 165.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 62 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 298 LocStat_NO_SUPPORTING_DISEQUALITIES : 110 LocStat_NO_DISJUNCTIONS : -124 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 82 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 62 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 83 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.021397 RENAME_VARIABLES(MILLISECONDS) : 0.254203 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.001093 PROJECTAWAY(MILLISECONDS) : 0.152971 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.131532 DISJOIN(MILLISECONDS) : 0.159474 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.279044 ADD_EQUALITY(MILLISECONDS) : 0.071523 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.033726 #CONJOIN_DISJUNCTIVE : 460 #RENAME_VARIABLES : 978 #UNFREEZE : 0 #CONJOIN : 572 #PROJECTAWAY : 609 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 97 #RENAME_VARIABLES_DISJUNCTIVE : 973 #ADD_EQUALITY : 62 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int] : 1 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : 1 COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : 1 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_1 : 1 COUNT_BLOCKS_for_[#memory_int]_at_dim_1 : 1 COUNT_ARRAY_READS for [#memory_int] : 1 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 30]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 27]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant [2018-03-23 12:20:12,137 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 12:20:12,137 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 12:20:12,138 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 12:20:12,139 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 12:20:12,139 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 12:20:12,139 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((\valid == \old(\valid)[mask := 1] && 32 == unknown-#length-unknown[mask]) && 0 == mask) && i == 0) && \old(\valid)[mask] == 0) || (((((((1 == \valid[c] && \valid == \old(\valid)[mask := 1]) && 32 == unknown-#length-unknown[mask]) && 0 == mask) && 1 <= i) && 32 == unknown-#length-unknown[c]) && 0 == c) && \old(\valid)[mask] == 0) - InvariantResult [Line: 15]: Loop Invariant [2018-03-23 12:20:12,141 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 12:20:12,141 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 12:20:12,142 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 12:20:12,142 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((!(32 == \old(size)) || !(0 == b)) || !(1 == \valid[b])) || ((((1 == \valid[b] && size == 32) && b == 0) && 0 <= b + i) && 32 == unknown-#length-unknown[b])) || !(32 == unknown-#length-unknown[b]) - InvariantResult [Line: 29]: Loop Invariant [2018-03-23 12:20:12,144 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 12:20:12,144 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 12:20:12,144 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 12:20:12,144 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 12:20:12,146 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 12:20:12,146 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 12:20:12,146 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 12:20:12,146 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((1 == \valid[c] && \valid == \old(\valid)[mask := 1]) && 32 == unknown-#length-unknown[mask]) && 0 == mask) && 1 <= i) && 32 == unknown-#length-unknown[c]) && 0 == c) && \old(\valid)[mask] == 0) || (((((((1 == \valid[c] && \valid == \old(\valid)[mask := 1]) && 32 == unknown-#length-unknown[mask]) && 0 == mask) && 32 == unknown-#length-unknown[c]) && i == 0) && 0 == c) && \old(\valid)[mask] == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 64 locations, 6 error locations. SAFE Result, 6.7s OverallTime, 14 OverallIterations, 6 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 808 SDtfs, 1242 SDslu, 3392 SDs, 0 SdLazy, 1588 SolverSat, 142 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 629 GetRequests, 402 SyntacticMatches, 17 SemanticMatches, 210 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=10, 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.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 139 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 25 PreInvPairs, 49 NumberOfFragments, 261 HoareAnnotationTreeSize, 25 FomulaSimplifications, 2783 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 565 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 983 NumberOfCodeBlocks, 932 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 959 ConstructedInterpolants, 2 QuantifiedInterpolants, 210223 SizeOfPredicates, 58 NumberOfNonLiveVariables, 746 ConjunctsInSsa, 121 ConjunctsInUnsatCore, 24 InterpolantComputations, 6 PerfectInterpolantSequences, 336/692 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-03-23_12-20-12-152.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-03-23_12-20-12-152.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-03-23_12-20-12-152.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-03-23_12-20-12-152.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-03-23_12-20-12-152.csv Received shutdown request...