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/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d4a2356 [2018-03-23 12:17:23,938 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-03-23 12:17:23,940 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-03-23 12:17:23,957 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-03-23 12:17:23,957 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-03-23 12:17:23,958 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-03-23 12:17:23,959 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-03-23 12:17:23,961 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-03-23 12:17:23,963 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-03-23 12:17:23,964 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-03-23 12:17:23,965 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-03-23 12:17:23,965 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-03-23 12:17:23,966 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-03-23 12:17:23,968 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-03-23 12:17:23,969 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-03-23 12:17:23,971 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-03-23 12:17:23,973 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-03-23 12:17:23,975 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-03-23 12:17:23,977 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-03-23 12:17:23,978 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-03-23 12:17:23,980 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-03-23 12:17:23,980 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-03-23 12:17:23,981 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-03-23 12:17:23,982 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-03-23 12:17:23,983 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-03-23 12:17:23,984 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-03-23 12:17:23,984 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-03-23 12:17:23,985 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-03-23 12:17:23,985 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-03-23 12:17:23,986 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-03-23 12:17:23,986 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-03-23 12:17:23,986 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:17:23,997 INFO L110 SettingsManager]: Loading preferences was successful [2018-03-23 12:17:23,997 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-03-23 12:17:23,998 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-03-23 12:17:23,998 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-03-23 12:17:23,998 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-03-23 12:17:23,999 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-03-23 12:17:23,999 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-03-23 12:17:23,999 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-03-23 12:17:24,000 INFO L133 SettingsManager]: * sizeof long=4 [2018-03-23 12:17:24,000 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-03-23 12:17:24,000 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-03-23 12:17:24,000 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-03-23 12:17:24,000 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-03-23 12:17:24,001 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-03-23 12:17:24,001 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-03-23 12:17:24,001 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-03-23 12:17:24,001 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-03-23 12:17:24,001 INFO L133 SettingsManager]: * sizeof long double=12 [2018-03-23 12:17:24,002 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-03-23 12:17:24,002 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-03-23 12:17:24,002 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-03-23 12:17:24,002 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-03-23 12:17:24,002 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-03-23 12:17:24,002 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-23 12:17:24,003 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-03-23 12:17:24,003 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-03-23 12:17:24,003 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-03-23 12:17:24,003 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-03-23 12:17:24,003 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-03-23 12:17:24,004 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-03-23 12:17:24,004 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-23 12:17:24,004 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-03-23 12:17:24,005 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-03-23 12:17:24,005 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-03-23 12:17:24,040 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-03-23 12:17:24,052 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-03-23 12:17:24,056 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-03-23 12:17:24,058 INFO L271 PluginConnector]: Initializing CDTParser... [2018-03-23 12:17:24,058 INFO L276 PluginConnector]: CDTParser initialized [2018-03-23 12:17:24,059 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-03-23 12:17:24,408 INFO L228 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG943563c42 [2018-03-23 12:17:24,516 INFO L291 CDTParser]: IsIndexed: true [2018-03-23 12:17:24,516 INFO L292 CDTParser]: Found 1 translation units. [2018-03-23 12:17:24,517 INFO L171 CDTParser]: Scanning ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-03-23 12:17:24,518 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-03-23 12:17:24,518 INFO L215 ultiparseSymbolTable]: [2018-03-23 12:17:24,518 INFO L218 ultiparseSymbolTable]: Function table: [2018-03-23 12:17:24,518 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo ('foo') in ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-03-23 12:17:24,519 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-03-23 12:17:24,519 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-03-23 12:17:24,519 INFO L233 ultiparseSymbolTable]: [2018-03-23 12:17:24,533 INFO L334 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG943563c42 [2018-03-23 12:17:24,538 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-03-23 12:17:24,540 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-03-23 12:17:24,541 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-03-23 12:17:24,541 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-03-23 12:17:24,546 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-03-23 12:17:24,547 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.03 12:17:24" (1/1) ... [2018-03-23 12:17:24,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18146058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 12:17:24, skipping insertion in model container [2018-03-23 12:17:24,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.03 12:17:24" (1/1) ... [2018-03-23 12:17:24,564 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-23 12:17:24,576 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-23 12:17:24,714 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-23 12:17:24,738 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-23 12:17:24,743 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-03-23 12:17:24,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 12:17:24 WrapperNode [2018-03-23 12:17:24,751 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-03-23 12:17:24,751 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-03-23 12:17:24,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-03-23 12:17:24,752 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-03-23 12:17:24,763 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 12:17:24" (1/1) ... [2018-03-23 12:17:24,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 12:17:24" (1/1) ... [2018-03-23 12:17:24,770 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 12:17:24" (1/1) ... [2018-03-23 12:17:24,770 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 12:17:24" (1/1) ... [2018-03-23 12:17:24,775 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 12:17:24" (1/1) ... [2018-03-23 12:17:24,780 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 12:17:24" (1/1) ... [2018-03-23 12:17:24,781 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 12:17:24" (1/1) ... [2018-03-23 12:17:24,783 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-03-23 12:17:24,784 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-03-23 12:17:24,784 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-03-23 12:17:24,784 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-03-23 12:17:24,785 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 12:17:24" (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:17:24,842 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-03-23 12:17:24,842 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-03-23 12:17:24,842 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo [2018-03-23 12:17:24,842 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-03-23 12:17:24,843 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo [2018-03-23 12:17:24,843 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-03-23 12:17:24,843 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-03-23 12:17:24,843 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-03-23 12:17:24,843 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-03-23 12:17:24,843 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-03-23 12:17:24,843 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-03-23 12:17:24,844 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-03-23 12:17:24,844 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-03-23 12:17:25,127 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-03-23 12:17:25,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.03 12:17:25 BoogieIcfgContainer [2018-03-23 12:17:25,128 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-03-23 12:17:25,128 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-03-23 12:17:25,128 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-03-23 12:17:25,129 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-03-23 12:17:25,131 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.03 12:17:25" (1/1) ... [2018-03-23 12:17:25,139 INFO L112 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-03-23 12:17:25,139 INFO L113 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-03-23 12:17:25,155 INFO L255 apSepIcfgTransformer]: Heap separator: starting memloc-array-style preprocessing [2018-03-23 12:17:25,168 INFO L271 apSepIcfgTransformer]: finished MemlocArrayUpdater, created 0 location literals (each corresponds to one heap write) [2018-03-23 12:17:25,177 INFO L322 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-03-23 12:17:25,231 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-03-23 12:17:27,670 INFO L314 AbstractInterpreter]: Visited 70 different actions 337 times. Merged at 46 different actions 163 times. Never widened. Found 29 fixpoints after 12 different actions. Largest state had 21 variables. [2018-03-23 12:17:27,672 INFO L334 apSepIcfgTransformer]: finished equality analysis [2018-03-23 12:17:27,679 INFO L195 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 1 [2018-03-23 12:17:27,679 INFO L344 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-03-23 12:17:27,680 INFO L345 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-03-23 12:17:27,680 INFO L347 apSepIcfgTransformer]: select infos: Set: ((select (select |v_#memory_int_1| v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.base_2) (+ v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.offset_2 v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0_6)), at (SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0 * 1, 1); srcloc: L18')) [2018-03-23 12:17:27,683 INFO L311 HeapPartitionManager]: partitioning result: [2018-03-23 12:17:27,683 INFO L316 HeapPartitionManager]: location blocks for array group [#memory_int] [2018-03-23 12:17:27,684 INFO L325 HeapPartitionManager]: at dimension 0 [2018-03-23 12:17:27,684 INFO L326 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-03-23 12:17:27,684 INFO L327 HeapPartitionManager]: # location blocks :1 [2018-03-23 12:17:27,684 INFO L325 HeapPartitionManager]: at dimension 1 [2018-03-23 12:17:27,684 INFO L326 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-03-23 12:17:27,685 INFO L327 HeapPartitionManager]: # location blocks :1 [2018-03-23 12:17:27,685 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-03-23 12:17:27,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 23.03 12:17:27 BasicIcfg [2018-03-23 12:17:27,700 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-03-23 12:17:27,701 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-03-23 12:17:27,701 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-03-23 12:17:27,705 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-03-23 12:17:27,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.03 12:17:24" (1/4) ... [2018-03-23 12:17:27,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b11ac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.03 12:17:27, skipping insertion in model container [2018-03-23 12:17:27,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 12:17:24" (2/4) ... [2018-03-23 12:17:27,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b11ac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.03 12:17:27, skipping insertion in model container [2018-03-23 12:17:27,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.03 12:17:25" (3/4) ... [2018-03-23 12:17:27,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b11ac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.03 12:17:27, skipping insertion in model container [2018-03-23 12:17:27,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 23.03 12:17:27" (4/4) ... [2018-03-23 12:17:27,710 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-03-23 12:17:27,718 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-03-23 12:17:27,724 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-03-23 12:17:27,758 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-03-23 12:17:27,758 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-03-23 12:17:27,759 INFO L370 AbstractCegarLoop]: Hoare is true [2018-03-23 12:17:27,759 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-03-23 12:17:27,759 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-03-23 12:17:27,759 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-03-23 12:17:27,759 INFO L374 AbstractCegarLoop]: Difference is false [2018-03-23 12:17:27,759 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-03-23 12:17:27,759 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-03-23 12:17:27,760 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-03-23 12:17:27,771 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-03-23 12:17:27,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-03-23 12:17:27,776 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:17:27,777 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:17:27,777 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:17:27,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1068910584, now seen corresponding path program 1 times [2018-03-23 12:17:27,782 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:17:27,783 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:17:27,823 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:27,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:17:27,824 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:17:27,864 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:17:27,946 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:17:27,950 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 12:17:27,950 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-03-23 12:17:27,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-03-23 12:17:27,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-03-23 12:17:27,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-23 12:17:27,967 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 3 states. [2018-03-23 12:17:28,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:17:28,102 INFO L93 Difference]: Finished difference Result 133 states and 160 transitions. [2018-03-23 12:17:28,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-03-23 12:17:28,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-03-23 12:17:28,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:17:28,113 INFO L225 Difference]: With dead ends: 133 [2018-03-23 12:17:28,113 INFO L226 Difference]: Without dead ends: 78 [2018-03-23 12:17:28,116 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:17:28,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-03-23 12:17:28,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2018-03-23 12:17:28,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-03-23 12:17:28,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-03-23 12:17:28,161 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 9 [2018-03-23 12:17:28,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:17:28,161 INFO L459 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-03-23 12:17:28,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-03-23 12:17:28,161 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-03-23 12:17:28,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-03-23 12:17:28,162 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:17:28,162 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:17:28,162 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:17:28,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1115648547, now seen corresponding path program 1 times [2018-03-23 12:17:28,162 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:17:28,162 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:17:28,163 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:28,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:17:28,163 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:17:28,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:17:28,214 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:17:28,215 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 12:17:28,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-03-23 12:17:28,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-03-23 12:17:28,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-03-23 12:17:28,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-23 12:17:28,217 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 3 states. [2018-03-23 12:17:28,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:17:28,274 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2018-03-23 12:17:28,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-03-23 12:17:28,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-03-23 12:17:28,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:17:28,278 INFO L225 Difference]: With dead ends: 78 [2018-03-23 12:17:28,278 INFO L226 Difference]: Without dead ends: 77 [2018-03-23 12:17:28,279 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-23 12:17:28,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-03-23 12:17:28,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2018-03-23 12:17:28,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-03-23 12:17:28,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-03-23 12:17:28,288 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 18 [2018-03-23 12:17:28,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:17:28,288 INFO L459 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-03-23 12:17:28,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-03-23 12:17:28,289 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-03-23 12:17:28,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-03-23 12:17:28,290 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:17:28,290 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:17:28,290 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:17:28,290 INFO L82 PathProgramCache]: Analyzing trace with hash -225366126, now seen corresponding path program 1 times [2018-03-23 12:17:28,290 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:17:28,290 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:17:28,291 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:28,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:17:28,292 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:17:28,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:17:28,354 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:17:28,354 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 12:17:28,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-03-23 12:17:28,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-03-23 12:17:28,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-03-23 12:17:28,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-03-23 12:17:28,355 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 5 states. [2018-03-23 12:17:28,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:17:28,476 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-03-23 12:17:28,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-23 12:17:28,476 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-03-23 12:17:28,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:17:28,477 INFO L225 Difference]: With dead ends: 67 [2018-03-23 12:17:28,477 INFO L226 Difference]: Without dead ends: 66 [2018-03-23 12:17:28,478 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-03-23 12:17:28,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-03-23 12:17:28,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-03-23 12:17:28,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-03-23 12:17:28,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-03-23 12:17:28,485 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 19 [2018-03-23 12:17:28,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:17:28,485 INFO L459 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-03-23 12:17:28,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-03-23 12:17:28,485 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-03-23 12:17:28,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-03-23 12:17:28,486 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:17:28,486 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:17:28,486 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:17:28,487 INFO L82 PathProgramCache]: Analyzing trace with hash -225366124, now seen corresponding path program 1 times [2018-03-23 12:17:28,487 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:17:28,487 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:17:28,488 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:28,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:17:28,488 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:17:28,496 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:17:28,625 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:17:28,625 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 12:17:28,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-03-23 12:17:28,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-23 12:17:28,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-23 12:17:28,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-03-23 12:17:28,626 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 6 states. [2018-03-23 12:17:28,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:17:28,830 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-03-23 12:17:28,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-23 12:17:28,830 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-03-23 12:17:28,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:17:28,832 INFO L225 Difference]: With dead ends: 75 [2018-03-23 12:17:28,832 INFO L226 Difference]: Without dead ends: 74 [2018-03-23 12:17:28,832 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-03-23 12:17:28,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-03-23 12:17:28,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 67. [2018-03-23 12:17:28,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-03-23 12:17:28,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-03-23 12:17:28,840 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 19 [2018-03-23 12:17:28,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:17:28,841 INFO L459 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-03-23 12:17:28,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-23 12:17:28,841 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-03-23 12:17:28,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-03-23 12:17:28,842 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:17:28,842 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:17:28,842 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:17:28,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1537306562, now seen corresponding path program 1 times [2018-03-23 12:17:28,842 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:17:28,842 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:17:28,843 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:28,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:17:28,844 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:28,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:17:28,851 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:17:28,910 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:17:28,911 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:17:28,911 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:17:28,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:17:28,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:17:28,941 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:17:28,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:17:29,034 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-03-23 12:17:29,034 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2018-03-23 12:17:29,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-03-23 12:17:29,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-03-23 12:17:29,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-03-23 12:17:29,035 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 8 states. [2018-03-23 12:17:29,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:17:29,206 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2018-03-23 12:17:29,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-03-23 12:17:29,207 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-03-23 12:17:29,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:17:29,208 INFO L225 Difference]: With dead ends: 106 [2018-03-23 12:17:29,208 INFO L226 Difference]: Without dead ends: 85 [2018-03-23 12:17:29,209 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 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:17:29,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-03-23 12:17:29,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 75. [2018-03-23 12:17:29,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-03-23 12:17:29,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2018-03-23 12:17:29,217 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 19 [2018-03-23 12:17:29,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:17:29,217 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2018-03-23 12:17:29,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-03-23 12:17:29,218 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2018-03-23 12:17:29,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-03-23 12:17:29,220 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:17:29,220 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] [2018-03-23 12:17:29,220 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:17:29,220 INFO L82 PathProgramCache]: Analyzing trace with hash 184823418, now seen corresponding path program 1 times [2018-03-23 12:17:29,220 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:17:29,220 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:17:29,221 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:29,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:17:29,222 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:17:29,231 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:17:29,295 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:17:29,296 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:17:29,296 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:17:29,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:17:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:17:29,327 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:17:29,361 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:17:29,398 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:17:29,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-03-23 12:17:29,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-03-23 12:17:29,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-03-23 12:17:29,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-03-23 12:17:29,399 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand 5 states. [2018-03-23 12:17:29,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:17:29,500 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2018-03-23 12:17:29,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-23 12:17:29,500 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-03-23 12:17:29,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:17:29,501 INFO L225 Difference]: With dead ends: 96 [2018-03-23 12:17:29,502 INFO L226 Difference]: Without dead ends: 95 [2018-03-23 12:17:29,502 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 3 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:17:29,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-03-23 12:17:29,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2018-03-23 12:17:29,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-03-23 12:17:29,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2018-03-23 12:17:29,513 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 27 [2018-03-23 12:17:29,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:17:29,514 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2018-03-23 12:17:29,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-03-23 12:17:29,514 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2018-03-23 12:17:29,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-03-23 12:17:29,515 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:17:29,515 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] [2018-03-23 12:17:29,515 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:17:29,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1434559127, now seen corresponding path program 1 times [2018-03-23 12:17:29,515 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:17:29,515 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:17:29,516 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:29,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:17:29,517 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:17:29,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:17:29,674 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:17:29,674 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:17:29,674 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:17:29,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:17:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:17:29,697 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:17:29,717 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:17:29,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:17:29,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:17:29,726 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-23 12:17:29,769 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:17:29,791 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:17:29,791 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-03-23 12:17:29,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-03-23 12:17:29,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-03-23 12:17:29,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-03-23 12:17:29,792 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 8 states. [2018-03-23 12:17:29,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:17:29,992 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2018-03-23 12:17:29,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-03-23 12:17:29,993 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-03-23 12:17:29,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:17:29,994 INFO L225 Difference]: With dead ends: 95 [2018-03-23 12:17:29,994 INFO L226 Difference]: Without dead ends: 94 [2018-03-23 12:17:29,994 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-03-23 12:17:29,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-03-23 12:17:30,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2018-03-23 12:17:30,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-03-23 12:17:30,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2018-03-23 12:17:30,003 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 28 [2018-03-23 12:17:30,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:17:30,003 INFO L459 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2018-03-23 12:17:30,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-03-23 12:17:30,004 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2018-03-23 12:17:30,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-03-23 12:17:30,005 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:17:30,005 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] [2018-03-23 12:17:30,005 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:17:30,006 INFO L82 PathProgramCache]: Analyzing trace with hash -123801987, now seen corresponding path program 2 times [2018-03-23 12:17:30,006 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:17:30,006 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:17:30,007 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:30,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:17:30,007 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:30,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:17:30,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:17:30,138 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:17:30,138 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:17:30,138 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:17:30,153 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 12:17:30,175 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-03-23 12:17:30,175 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 12:17:30,177 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:17:30,350 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:17:30,372 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-03-23 12:17:30,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2018-03-23 12:17:30,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-03-23 12:17:30,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-03-23 12:17:30,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-03-23 12:17:30,373 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 18 states. [2018-03-23 12:17:30,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:17:30,564 INFO L93 Difference]: Finished difference Result 190 states and 208 transitions. [2018-03-23 12:17:30,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-03-23 12:17:30,564 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2018-03-23 12:17:30,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:17:30,566 INFO L225 Difference]: With dead ends: 190 [2018-03-23 12:17:30,566 INFO L226 Difference]: Without dead ends: 120 [2018-03-23 12:17:30,567 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=490, Unknown=0, NotChecked=0, Total=650 [2018-03-23 12:17:30,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-03-23 12:17:30,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 112. [2018-03-23 12:17:30,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-03-23 12:17:30,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2018-03-23 12:17:30,576 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 36 [2018-03-23 12:17:30,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:17:30,577 INFO L459 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2018-03-23 12:17:30,577 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-03-23 12:17:30,577 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2018-03-23 12:17:30,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-03-23 12:17:30,579 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:17:30,579 INFO L353 BasicCegarLoop]: trace histogram [3, 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] [2018-03-23 12:17:30,579 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:17:30,579 INFO L82 PathProgramCache]: Analyzing trace with hash 729468996, now seen corresponding path program 1 times [2018-03-23 12:17:30,579 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:17:30,579 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:17:30,580 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:30,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 12:17:30,580 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:17:30,590 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:17:30,630 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:17:30,630 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:17:30,630 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:17:30,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:17:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:17:30,647 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:17:30,661 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:17:30,683 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:17:30,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-03-23 12:17:30,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-03-23 12:17:30,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-03-23 12:17:30,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-03-23 12:17:30,684 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 9 states. [2018-03-23 12:17:30,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:17:30,755 INFO L93 Difference]: Finished difference Result 157 states and 172 transitions. [2018-03-23 12:17:30,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-03-23 12:17:30,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-03-23 12:17:30,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:17:30,757 INFO L225 Difference]: With dead ends: 157 [2018-03-23 12:17:30,757 INFO L226 Difference]: Without dead ends: 137 [2018-03-23 12:17:30,757 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 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:17:30,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-03-23 12:17:30,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 122. [2018-03-23 12:17:30,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-03-23 12:17:30,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2018-03-23 12:17:30,768 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 37 [2018-03-23 12:17:30,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:17:30,769 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2018-03-23 12:17:30,769 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-03-23 12:17:30,769 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2018-03-23 12:17:30,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-03-23 12:17:30,771 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:17:30,771 INFO L353 BasicCegarLoop]: trace histogram [3, 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, 1, 1] [2018-03-23 12:17:30,771 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:17:30,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1381672071, now seen corresponding path program 1 times [2018-03-23 12:17:30,772 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:17:30,772 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:17:30,773 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:30,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:17:30,773 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:17:30,784 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:17:30,892 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:17:30,892 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:17:30,892 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:17:30,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:17:30,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:17:30,911 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:17:30,955 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-03-23 12:17:30,977 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:17:30,977 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 16 [2018-03-23 12:17:30,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-03-23 12:17:30,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-03-23 12:17:30,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-03-23 12:17:30,977 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand 17 states. [2018-03-23 12:17:31,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:17:31,555 INFO L93 Difference]: Finished difference Result 204 states and 220 transitions. [2018-03-23 12:17:31,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-03-23 12:17:31,555 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2018-03-23 12:17:31,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:17:31,557 INFO L225 Difference]: With dead ends: 204 [2018-03-23 12:17:31,557 INFO L226 Difference]: Without dead ends: 203 [2018-03-23 12:17:31,557 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=1074, Unknown=0, NotChecked=0, Total=1260 [2018-03-23 12:17:31,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-03-23 12:17:31,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 160. [2018-03-23 12:17:31,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-03-23 12:17:31,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 175 transitions. [2018-03-23 12:17:31,566 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 175 transitions. Word has length 46 [2018-03-23 12:17:31,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:17:31,567 INFO L459 AbstractCegarLoop]: Abstraction has 160 states and 175 transitions. [2018-03-23 12:17:31,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-03-23 12:17:31,567 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 175 transitions. [2018-03-23 12:17:31,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-03-23 12:17:31,568 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:17:31,568 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1] [2018-03-23 12:17:31,568 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:17:31,568 INFO L82 PathProgramCache]: Analyzing trace with hash -117838294, now seen corresponding path program 1 times [2018-03-23 12:17:31,568 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:17:31,569 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:17:31,569 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:31,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:17:31,569 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:31,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:17:31,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:17:31,859 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:17:31,860 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:17:31,860 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:17:31,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:17:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:17:31,879 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:17:31,882 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:17:31,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:17:31,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:17:31,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-23 12:17:31,973 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-03-23 12:17:31,995 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:17:31,995 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 20 [2018-03-23 12:17:31,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-03-23 12:17:31,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-03-23 12:17:31,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2018-03-23 12:17:31,996 INFO L87 Difference]: Start difference. First operand 160 states and 175 transitions. Second operand 21 states. [2018-03-23 12:17:32,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:17:32,727 INFO L93 Difference]: Finished difference Result 200 states and 217 transitions. [2018-03-23 12:17:32,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-03-23 12:17:32,727 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 47 [2018-03-23 12:17:32,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:17:32,728 INFO L225 Difference]: With dead ends: 200 [2018-03-23 12:17:32,729 INFO L226 Difference]: Without dead ends: 199 [2018-03-23 12:17:32,729 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=339, Invalid=1731, Unknown=0, NotChecked=0, Total=2070 [2018-03-23 12:17:32,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-03-23 12:17:32,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 148. [2018-03-23 12:17:32,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-03-23 12:17:32,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2018-03-23 12:17:32,737 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 47 [2018-03-23 12:17:32,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:17:32,738 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2018-03-23 12:17:32,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-03-23 12:17:32,738 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2018-03-23 12:17:32,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-03-23 12:17:32,740 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:17:32,740 INFO L353 BasicCegarLoop]: trace histogram [4, 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] [2018-03-23 12:17:32,740 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:17:32,740 INFO L82 PathProgramCache]: Analyzing trace with hash 154524538, now seen corresponding path program 2 times [2018-03-23 12:17:32,741 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:17:32,741 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:17:32,742 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:32,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:17:32,742 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:17:32,752 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:17:32,813 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:17:32,813 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:17:32,813 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:17:32,823 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 12:17:32,835 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-03-23 12:17:32,835 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 12:17:32,837 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:17:32,875 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:17:32,884 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-03-23 12:17:32,919 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-03-23 12:17:32,919 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2018-03-23 12:17:32,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-23 12:17:32,920 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-23 12:17:32,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=83, Unknown=1, NotChecked=18, Total=132 [2018-03-23 12:17:32,920 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 12 states. [2018-03-23 12:17:33,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:17:33,399 INFO L93 Difference]: Finished difference Result 192 states and 212 transitions. [2018-03-23 12:17:33,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-03-23 12:17:33,399 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-03-23 12:17:33,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:17:33,400 INFO L225 Difference]: With dead ends: 192 [2018-03-23 12:17:33,400 INFO L226 Difference]: Without dead ends: 160 [2018-03-23 12:17:33,401 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=364, Unknown=2, NotChecked=42, Total=552 [2018-03-23 12:17:33,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-03-23 12:17:33,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 150. [2018-03-23 12:17:33,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-03-23 12:17:33,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 163 transitions. [2018-03-23 12:17:33,414 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 163 transitions. Word has length 47 [2018-03-23 12:17:33,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:17:33,414 INFO L459 AbstractCegarLoop]: Abstraction has 150 states and 163 transitions. [2018-03-23 12:17:33,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-23 12:17:33,414 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 163 transitions. [2018-03-23 12:17:33,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-03-23 12:17:33,416 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:17:33,416 INFO L353 BasicCegarLoop]: trace histogram [5, 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] [2018-03-23 12:17:33,416 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:17:33,416 INFO L82 PathProgramCache]: Analyzing trace with hash 245732012, now seen corresponding path program 1 times [2018-03-23 12:17:33,416 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:17:33,416 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:17:33,417 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:33,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 12:17:33,418 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:17:33,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:17:33,503 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-03-23 12:17:33,503 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:17:33,503 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:17:33,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:17:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:17:33,543 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:17:33,651 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-03-23 12:17:33,672 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:17:33,673 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11] total 15 [2018-03-23 12:17:33,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-03-23 12:17:33,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-03-23 12:17:33,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-03-23 12:17:33,673 INFO L87 Difference]: Start difference. First operand 150 states and 163 transitions. Second operand 15 states. [2018-03-23 12:17:33,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:17:33,873 INFO L93 Difference]: Finished difference Result 189 states and 208 transitions. [2018-03-23 12:17:33,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-03-23 12:17:33,874 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2018-03-23 12:17:33,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:17:33,875 INFO L225 Difference]: With dead ends: 189 [2018-03-23 12:17:33,875 INFO L226 Difference]: Without dead ends: 177 [2018-03-23 12:17:33,876 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2018-03-23 12:17:33,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-03-23 12:17:33,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 167. [2018-03-23 12:17:33,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-03-23 12:17:33,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 182 transitions. [2018-03-23 12:17:33,886 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 182 transitions. Word has length 59 [2018-03-23 12:17:33,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:17:33,886 INFO L459 AbstractCegarLoop]: Abstraction has 167 states and 182 transitions. [2018-03-23 12:17:33,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-03-23 12:17:33,886 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 182 transitions. [2018-03-23 12:17:33,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-03-23 12:17:33,887 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:17:33,887 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:17:33,887 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:17:33,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1928929082, now seen corresponding path program 2 times [2018-03-23 12:17:33,888 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:17:33,888 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:17:33,888 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:33,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:17:33,888 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:17:33,898 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:17:34,001 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-03-23 12:17:34,001 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:17:34,001 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:17:34,008 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 12:17:34,025 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-03-23 12:17:34,025 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 12:17:34,028 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:17:34,068 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-03-23 12:17:34,092 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:17:34,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-03-23 12:17:34,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-03-23 12:17:34,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-03-23 12:17:34,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-03-23 12:17:34,093 INFO L87 Difference]: Start difference. First operand 167 states and 182 transitions. Second operand 9 states. [2018-03-23 12:17:34,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:17:34,315 INFO L93 Difference]: Finished difference Result 244 states and 272 transitions. [2018-03-23 12:17:34,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-03-23 12:17:34,315 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2018-03-23 12:17:34,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:17:34,317 INFO L225 Difference]: With dead ends: 244 [2018-03-23 12:17:34,317 INFO L226 Difference]: Without dead ends: 243 [2018-03-23 12:17:34,318 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-03-23 12:17:34,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-03-23 12:17:34,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 175. [2018-03-23 12:17:34,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-03-23 12:17:34,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 191 transitions. [2018-03-23 12:17:34,334 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 191 transitions. Word has length 65 [2018-03-23 12:17:34,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:17:34,334 INFO L459 AbstractCegarLoop]: Abstraction has 175 states and 191 transitions. [2018-03-23 12:17:34,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-03-23 12:17:34,334 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 191 transitions. [2018-03-23 12:17:34,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-03-23 12:17:34,335 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:17:34,335 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:17:34,336 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:17:34,336 INFO L82 PathProgramCache]: Analyzing trace with hash 332741067, now seen corresponding path program 2 times [2018-03-23 12:17:34,336 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:17:34,336 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:17:34,337 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:34,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 12:17:34,337 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:17:34,348 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:17:34,578 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-03-23 12:17:34,578 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:17:34,578 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 12:17:34,583 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 12:17:34,597 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-03-23 12:17:34,597 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 12:17:34,599 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:17:34,601 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:17:34,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:17:34,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:17:34,605 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-23 12:17:34,637 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-03-23 12:17:34,658 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:17:34,659 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-03-23 12:17:34,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-23 12:17:34,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-23 12:17:34,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-03-23 12:17:34,659 INFO L87 Difference]: Start difference. First operand 175 states and 191 transitions. Second operand 12 states. [2018-03-23 12:17:34,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:17:34,970 INFO L93 Difference]: Finished difference Result 243 states and 271 transitions. [2018-03-23 12:17:34,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-03-23 12:17:34,970 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-03-23 12:17:34,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:17:34,971 INFO L225 Difference]: With dead ends: 243 [2018-03-23 12:17:34,971 INFO L226 Difference]: Without dead ends: 242 [2018-03-23 12:17:34,972 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2018-03-23 12:17:34,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-03-23 12:17:34,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 176. [2018-03-23 12:17:34,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-03-23 12:17:34,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 192 transitions. [2018-03-23 12:17:34,984 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 192 transitions. Word has length 66 [2018-03-23 12:17:34,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:17:34,984 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 192 transitions. [2018-03-23 12:17:34,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-23 12:17:34,984 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 192 transitions. [2018-03-23 12:17:34,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-03-23 12:17:34,985 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:17:34,985 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:17:34,985 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:17:34,985 INFO L82 PathProgramCache]: Analyzing trace with hash 793907633, now seen corresponding path program 3 times [2018-03-23 12:17:34,986 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:17:34,986 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:17:34,986 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:34,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 12:17:34,986 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:17:34,995 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:17:35,172 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 22 proven. 45 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-03-23 12:17:35,172 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:17:35,172 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 12:17:35,182 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-03-23 12:17:35,194 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-03-23 12:17:35,195 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 12:17:35,196 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:17:35,434 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-03-23 12:17:35,456 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:17:35,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 26 [2018-03-23 12:17:35,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-03-23 12:17:35,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-03-23 12:17:35,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2018-03-23 12:17:35,458 INFO L87 Difference]: Start difference. First operand 176 states and 192 transitions. Second operand 27 states. [2018-03-23 12:17:36,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:17:36,086 INFO L93 Difference]: Finished difference Result 260 states and 284 transitions. [2018-03-23 12:17:36,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-03-23 12:17:36,086 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 74 [2018-03-23 12:17:36,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:17:36,087 INFO L225 Difference]: With dead ends: 260 [2018-03-23 12:17:36,088 INFO L226 Difference]: Without dead ends: 259 [2018-03-23 12:17:36,088 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=494, Invalid=2158, Unknown=0, NotChecked=0, Total=2652 [2018-03-23 12:17:36,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-03-23 12:17:36,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 223. [2018-03-23 12:17:36,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-03-23 12:17:36,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 244 transitions. [2018-03-23 12:17:36,105 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 244 transitions. Word has length 74 [2018-03-23 12:17:36,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:17:36,106 INFO L459 AbstractCegarLoop]: Abstraction has 223 states and 244 transitions. [2018-03-23 12:17:36,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-03-23 12:17:36,106 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 244 transitions. [2018-03-23 12:17:36,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-03-23 12:17:36,107 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:17:36,107 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:17:36,107 INFO L408 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:17:36,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1158666688, now seen corresponding path program 3 times [2018-03-23 12:17:36,108 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:17:36,108 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:17:36,109 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:36,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 12:17:36,109 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:36,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:17:36,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:17:36,466 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 45 proven. 26 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-03-23 12:17:36,466 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:17:36,466 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 12:17:36,472 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-03-23 12:17:36,487 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-03-23 12:17:36,487 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 12:17:36,489 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:17:36,495 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:17:36,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:17:36,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:17:36,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-23 12:17:36,767 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-03-23 12:17:36,788 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:17:36,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 29 [2018-03-23 12:17:36,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-03-23 12:17:36,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-03-23 12:17:36,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=751, Unknown=0, NotChecked=0, Total=870 [2018-03-23 12:17:36,790 INFO L87 Difference]: Start difference. First operand 223 states and 244 transitions. Second operand 30 states. [2018-03-23 12:17:37,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:17:37,376 INFO L93 Difference]: Finished difference Result 256 states and 278 transitions. [2018-03-23 12:17:37,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-03-23 12:17:37,376 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 75 [2018-03-23 12:17:37,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:17:37,377 INFO L225 Difference]: With dead ends: 256 [2018-03-23 12:17:37,378 INFO L226 Difference]: Without dead ends: 255 [2018-03-23 12:17:37,379 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=375, Invalid=1695, Unknown=0, NotChecked=0, Total=2070 [2018-03-23 12:17:37,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-03-23 12:17:37,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 192. [2018-03-23 12:17:37,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-03-23 12:17:37,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 208 transitions. [2018-03-23 12:17:37,393 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 208 transitions. Word has length 75 [2018-03-23 12:17:37,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:17:37,393 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 208 transitions. [2018-03-23 12:17:37,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-03-23 12:17:37,394 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 208 transitions. [2018-03-23 12:17:37,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-03-23 12:17:37,395 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:17:37,395 INFO L353 BasicCegarLoop]: trace histogram [6, 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] [2018-03-23 12:17:37,395 INFO L408 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:17:37,396 INFO L82 PathProgramCache]: Analyzing trace with hash -337153039, now seen corresponding path program 2 times [2018-03-23 12:17:37,396 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:17:37,396 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:17:37,396 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:37,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 12:17:37,397 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:17:37,405 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:17:37,464 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-03-23 12:17:37,464 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:17:37,464 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 12:17:37,476 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 12:17:37,489 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-03-23 12:17:37,489 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 12:17:37,491 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:17:37,581 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-03-23 12:17:37,603 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:17:37,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 19 [2018-03-23 12:17:37,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-03-23 12:17:37,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-03-23 12:17:37,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-03-23 12:17:37,604 INFO L87 Difference]: Start difference. First operand 192 states and 208 transitions. Second operand 19 states. [2018-03-23 12:17:37,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:17:37,812 INFO L93 Difference]: Finished difference Result 230 states and 252 transitions. [2018-03-23 12:17:37,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-03-23 12:17:37,838 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 76 [2018-03-23 12:17:37,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:17:37,839 INFO L225 Difference]: With dead ends: 230 [2018-03-23 12:17:37,839 INFO L226 Difference]: Without dead ends: 190 [2018-03-23 12:17:37,840 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 65 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:17:37,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-03-23 12:17:37,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 155. [2018-03-23 12:17:37,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-03-23 12:17:37,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 168 transitions. [2018-03-23 12:17:37,849 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 168 transitions. Word has length 76 [2018-03-23 12:17:37,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:17:37,850 INFO L459 AbstractCegarLoop]: Abstraction has 155 states and 168 transitions. [2018-03-23 12:17:37,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-03-23 12:17:37,850 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 168 transitions. [2018-03-23 12:17:37,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-03-23 12:17:37,851 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:17:37,851 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:17:37,851 INFO L408 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:17:37,851 INFO L82 PathProgramCache]: Analyzing trace with hash -448849674, now seen corresponding path program 4 times [2018-03-23 12:17:37,852 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:17:37,852 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:17:37,852 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:37,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 12:17:37,853 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:17:37,864 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:17:38,135 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-03-23 12:17:38,135 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:17:38,135 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 12:17:38,141 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-03-23 12:17:38,156 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-03-23 12:17:38,156 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 12:17:38,158 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:17:38,160 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:17:38,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:17:38,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:17:38,163 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-23 12:17:38,375 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-03-23 12:17:38,396 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:17:38,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 29 [2018-03-23 12:17:38,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-03-23 12:17:38,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-03-23 12:17:38,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2018-03-23 12:17:38,397 INFO L87 Difference]: Start difference. First operand 155 states and 168 transitions. Second operand 30 states. [2018-03-23 12:17:40,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:17:40,052 INFO L93 Difference]: Finished difference Result 408 states and 443 transitions. [2018-03-23 12:17:40,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-03-23 12:17:40,053 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 85 [2018-03-23 12:17:40,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:17:40,055 INFO L225 Difference]: With dead ends: 408 [2018-03-23 12:17:40,055 INFO L226 Difference]: Without dead ends: 407 [2018-03-23 12:17:40,057 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2037 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=857, Invalid=5305, Unknown=0, NotChecked=0, Total=6162 [2018-03-23 12:17:40,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-03-23 12:17:40,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 200. [2018-03-23 12:17:40,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-03-23 12:17:40,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 217 transitions. [2018-03-23 12:17:40,075 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 217 transitions. Word has length 85 [2018-03-23 12:17:40,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:17:40,075 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 217 transitions. [2018-03-23 12:17:40,075 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-03-23 12:17:40,075 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 217 transitions. [2018-03-23 12:17:40,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-03-23 12:17:40,076 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:17:40,077 INFO L353 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:17:40,077 INFO L408 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:17:40,077 INFO L82 PathProgramCache]: Analyzing trace with hash 419061132, now seen corresponding path program 5 times [2018-03-23 12:17:40,077 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:17:40,077 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:17:40,078 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:40,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 12:17:40,078 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:40,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:17:40,092 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:17:40,559 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 77 proven. 88 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-03-23 12:17:40,560 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:17:40,560 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 12:17:40,565 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-03-23 12:17:40,616 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-03-23 12:17:40,616 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 12:17:40,618 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:17:40,977 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 159 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:17:40,998 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:17:40,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 26] total 45 [2018-03-23 12:17:40,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-03-23 12:17:40,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-03-23 12:17:40,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1752, Unknown=0, NotChecked=0, Total=1980 [2018-03-23 12:17:40,999 INFO L87 Difference]: Start difference. First operand 200 states and 217 transitions. Second operand 45 states. [2018-03-23 12:17:42,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:17:42,531 INFO L93 Difference]: Finished difference Result 638 states and 697 transitions. [2018-03-23 12:17:42,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-03-23 12:17:42,531 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 113 [2018-03-23 12:17:42,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:17:42,534 INFO L225 Difference]: With dead ends: 638 [2018-03-23 12:17:42,534 INFO L226 Difference]: Without dead ends: 495 [2018-03-23 12:17:42,536 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1824 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=975, Invalid=5031, Unknown=0, NotChecked=0, Total=6006 [2018-03-23 12:17:42,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2018-03-23 12:17:42,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 415. [2018-03-23 12:17:42,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-03-23 12:17:42,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 454 transitions. [2018-03-23 12:17:42,573 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 454 transitions. Word has length 113 [2018-03-23 12:17:42,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:17:42,573 INFO L459 AbstractCegarLoop]: Abstraction has 415 states and 454 transitions. [2018-03-23 12:17:42,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-03-23 12:17:42,574 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 454 transitions. [2018-03-23 12:17:42,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-03-23 12:17:42,576 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:17:42,576 INFO L353 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:17:42,576 INFO L408 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:17:42,576 INFO L82 PathProgramCache]: Analyzing trace with hash -382494782, now seen corresponding path program 6 times [2018-03-23 12:17:42,576 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:17:42,576 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:17:42,577 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:42,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 12:17:42,577 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:17:42,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:17:43,066 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 108 proven. 132 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-03-23 12:17:43,067 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:17:43,067 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 12:17:43,072 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-03-23 12:17:43,096 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-03-23 12:17:43,097 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 12:17:43,099 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:17:43,102 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:17:43,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:17:43,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:17:43,107 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-23 12:17:43,475 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 37 proven. 132 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-03-23 12:17:43,508 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:17:43,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20] total 43 [2018-03-23 12:17:43,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-03-23 12:17:43,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-03-23 12:17:43,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1646, Unknown=0, NotChecked=0, Total=1892 [2018-03-23 12:17:43,510 INFO L87 Difference]: Start difference. First operand 415 states and 454 transitions. Second operand 44 states. [2018-03-23 12:17:44,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:17:44,719 INFO L93 Difference]: Finished difference Result 545 states and 592 transitions. [2018-03-23 12:17:44,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-03-23 12:17:44,719 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 123 [2018-03-23 12:17:44,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:17:44,721 INFO L225 Difference]: With dead ends: 545 [2018-03-23 12:17:44,721 INFO L226 Difference]: Without dead ends: 544 [2018-03-23 12:17:44,723 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1733 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=771, Invalid=4059, Unknown=0, NotChecked=0, Total=4830 [2018-03-23 12:17:44,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-03-23 12:17:44,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 442. [2018-03-23 12:17:44,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-03-23 12:17:44,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 483 transitions. [2018-03-23 12:17:44,763 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 483 transitions. Word has length 123 [2018-03-23 12:17:44,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:17:44,763 INFO L459 AbstractCegarLoop]: Abstraction has 442 states and 483 transitions. [2018-03-23 12:17:44,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-03-23 12:17:44,764 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 483 transitions. [2018-03-23 12:17:44,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-03-23 12:17:44,766 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:17:44,766 INFO L353 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:17:44,766 INFO L408 AbstractCegarLoop]: === Iteration 22 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:17:44,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1091959176, now seen corresponding path program 7 times [2018-03-23 12:17:44,767 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:17:44,767 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:17:44,767 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:44,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 12:17:44,768 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:17:44,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:17:45,452 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 0 proven. 159 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-03-23 12:17:45,452 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:17:45,452 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 12:17:45,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:17:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:17:45,481 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:17:45,483 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:17:45,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:17:45,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:17:45,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-23 12:17:45,691 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 0 proven. 159 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-03-23 12:17:45,712 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:17:45,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 29 [2018-03-23 12:17:45,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-03-23 12:17:45,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-03-23 12:17:45,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=719, Unknown=0, NotChecked=0, Total=870 [2018-03-23 12:17:45,714 INFO L87 Difference]: Start difference. First operand 442 states and 483 transitions. Second operand 30 states. [2018-03-23 12:17:46,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:17:46,403 INFO L93 Difference]: Finished difference Result 635 states and 684 transitions. [2018-03-23 12:17:46,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-03-23 12:17:46,404 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 133 [2018-03-23 12:17:46,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:17:46,406 INFO L225 Difference]: With dead ends: 635 [2018-03-23 12:17:46,406 INFO L226 Difference]: Without dead ends: 634 [2018-03-23 12:17:46,407 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 118 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=422, Invalid=2028, Unknown=0, NotChecked=0, Total=2450 [2018-03-23 12:17:46,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2018-03-23 12:17:46,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 451. [2018-03-23 12:17:46,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-03-23 12:17:46,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 493 transitions. [2018-03-23 12:17:46,446 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 493 transitions. Word has length 133 [2018-03-23 12:17:46,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:17:46,447 INFO L459 AbstractCegarLoop]: Abstraction has 451 states and 493 transitions. [2018-03-23 12:17:46,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-03-23 12:17:46,447 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 493 transitions. [2018-03-23 12:17:46,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-03-23 12:17:46,449 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:17:46,449 INFO L353 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:17:46,449 INFO L408 AbstractCegarLoop]: === Iteration 23 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:17:46,449 INFO L82 PathProgramCache]: Analyzing trace with hash -501068749, now seen corresponding path program 8 times [2018-03-23 12:17:46,450 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:17:46,450 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:17:46,450 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:46,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:17:46,451 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:17:46,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:17:46,902 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 44 proven. 188 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2018-03-23 12:17:46,903 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:17:46,903 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 12:17:46,908 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 12:17:46,930 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-03-23 12:17:46,930 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 12:17:46,933 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:17:46,935 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:17:46,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:17:46,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:17:46,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-23 12:17:47,274 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-03-23 12:17:47,295 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:17:47,295 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 39 [2018-03-23 12:17:47,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-03-23 12:17:47,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-03-23 12:17:47,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1401, Unknown=0, NotChecked=0, Total=1560 [2018-03-23 12:17:47,296 INFO L87 Difference]: Start difference. First operand 451 states and 493 transitions. Second operand 40 states. [2018-03-23 12:17:49,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:17:49,788 INFO L93 Difference]: Finished difference Result 786 states and 849 transitions. [2018-03-23 12:17:49,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-03-23 12:17:49,788 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 142 [2018-03-23 12:17:49,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:17:49,791 INFO L225 Difference]: With dead ends: 786 [2018-03-23 12:17:49,791 INFO L226 Difference]: Without dead ends: 785 [2018-03-23 12:17:49,795 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4393 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1187, Invalid=11245, Unknown=0, NotChecked=0, Total=12432 [2018-03-23 12:17:49,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-03-23 12:17:49,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 487. [2018-03-23 12:17:49,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-03-23 12:17:49,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 532 transitions. [2018-03-23 12:17:49,827 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 532 transitions. Word has length 142 [2018-03-23 12:17:49,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:17:49,827 INFO L459 AbstractCegarLoop]: Abstraction has 487 states and 532 transitions. [2018-03-23 12:17:49,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-03-23 12:17:49,828 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 532 transitions. [2018-03-23 12:17:49,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-03-23 12:17:49,830 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:17:49,830 INFO L353 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:17:49,830 INFO L408 AbstractCegarLoop]: === Iteration 24 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:17:49,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1765856626, now seen corresponding path program 9 times [2018-03-23 12:17:49,830 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:17:49,830 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:17:49,831 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:49,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 12:17:49,831 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:17:49,848 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:17:50,422 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 51 proven. 254 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-03-23 12:17:50,422 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:17:50,422 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 12:17:50,428 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-03-23 12:17:50,465 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-03-23 12:17:50,465 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 12:17:50,469 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:17:50,480 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:17:50,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:17:50,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:17:50,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-23 12:17:50,863 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 51 proven. 254 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-03-23 12:17:50,884 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:17:50,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2018-03-23 12:17:50,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-03-23 12:17:50,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-03-23 12:17:50,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=1936, Unknown=0, NotChecked=0, Total=2256 [2018-03-23 12:17:50,885 INFO L87 Difference]: Start difference. First operand 487 states and 532 transitions. Second operand 48 states. [2018-03-23 12:17:51,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:17:51,632 INFO L93 Difference]: Finished difference Result 624 states and 681 transitions. [2018-03-23 12:17:51,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-03-23 12:17:51,632 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 161 [2018-03-23 12:17:51,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:17:51,634 INFO L225 Difference]: With dead ends: 624 [2018-03-23 12:17:51,634 INFO L226 Difference]: Without dead ends: 623 [2018-03-23 12:17:51,635 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 138 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1778 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=822, Invalid=4008, Unknown=0, NotChecked=0, Total=4830 [2018-03-23 12:17:51,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2018-03-23 12:17:51,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 514. [2018-03-23 12:17:51,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2018-03-23 12:17:51,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 561 transitions. [2018-03-23 12:17:51,667 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 561 transitions. Word has length 161 [2018-03-23 12:17:51,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:17:51,667 INFO L459 AbstractCegarLoop]: Abstraction has 514 states and 561 transitions. [2018-03-23 12:17:51,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-03-23 12:17:51,667 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 561 transitions. [2018-03-23 12:17:51,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-03-23 12:17:51,668 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:17:51,669 INFO L353 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:17:51,669 INFO L408 AbstractCegarLoop]: === Iteration 25 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:17:51,669 INFO L82 PathProgramCache]: Analyzing trace with hash -991764284, now seen corresponding path program 10 times [2018-03-23 12:17:51,669 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:17:51,669 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:17:51,669 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:51,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 12:17:51,670 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:17:51,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:17:52,448 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 109 proven. 328 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2018-03-23 12:17:52,448 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:17:52,449 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 12:17:52,454 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-03-23 12:17:52,484 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-03-23 12:17:52,484 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 12:17:52,488 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:17:52,491 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:17:52,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:17:52,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:17:52,495 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-23 12:17:52,952 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 0 proven. 284 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-03-23 12:17:52,973 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:17:52,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 22] total 49 [2018-03-23 12:17:52,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-03-23 12:17:52,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-03-23 12:17:52,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=2210, Unknown=0, NotChecked=0, Total=2450 [2018-03-23 12:17:52,974 INFO L87 Difference]: Start difference. First operand 514 states and 561 transitions. Second operand 50 states. [2018-03-23 12:17:56,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:17:56,456 INFO L93 Difference]: Finished difference Result 1090 states and 1178 transitions. [2018-03-23 12:17:56,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-03-23 12:17:56,456 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 171 [2018-03-23 12:17:56,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:17:56,459 INFO L225 Difference]: With dead ends: 1090 [2018-03-23 12:17:56,459 INFO L226 Difference]: Without dead ends: 1089 [2018-03-23 12:17:56,460 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6450 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1549, Invalid=16007, Unknown=0, NotChecked=0, Total=17556 [2018-03-23 12:17:56,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2018-03-23 12:17:56,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 550. [2018-03-23 12:17:56,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2018-03-23 12:17:56,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 600 transitions. [2018-03-23 12:17:56,491 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 600 transitions. Word has length 171 [2018-03-23 12:17:56,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:17:56,491 INFO L459 AbstractCegarLoop]: Abstraction has 550 states and 600 transitions. [2018-03-23 12:17:56,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-03-23 12:17:56,491 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 600 transitions. [2018-03-23 12:17:56,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-03-23 12:17:56,492 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:17:56,492 INFO L353 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:17:56,492 INFO L408 AbstractCegarLoop]: === Iteration 26 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:17:56,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1859389809, now seen corresponding path program 11 times [2018-03-23 12:17:56,493 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:17:56,493 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:17:56,493 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:56,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 12:17:56,494 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:17:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:17:56,507 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:17:57,367 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 125 proven. 414 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-03-23 12:17:57,367 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:17:57,367 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 12:17:57,372 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-03-23 12:17:57,411 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-03-23 12:17:57,411 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 12:17:57,415 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:17:57,418 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:17:57,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:17:57,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:17:57,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-23 12:17:57,844 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2018-03-23 12:17:57,864 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:17:57,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 23] total 51 [2018-03-23 12:17:57,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-03-23 12:17:57,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-03-23 12:17:57,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=2406, Unknown=0, NotChecked=0, Total=2652 [2018-03-23 12:17:57,866 INFO L87 Difference]: Start difference. First operand 550 states and 600 transitions. Second operand 52 states. [2018-03-23 12:18:02,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:18:02,192 INFO L93 Difference]: Finished difference Result 1296 states and 1401 transitions. [2018-03-23 12:18:02,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-03-23 12:18:02,193 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 190 [2018-03-23 12:18:02,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:18:02,197 INFO L225 Difference]: With dead ends: 1296 [2018-03-23 12:18:02,197 INFO L226 Difference]: Without dead ends: 1295 [2018-03-23 12:18:02,200 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 168 SyntacticMatches, 2 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7656 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1720, Invalid=18872, Unknown=0, NotChecked=0, Total=20592 [2018-03-23 12:18:02,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2018-03-23 12:18:02,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 586. [2018-03-23 12:18:02,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2018-03-23 12:18:02,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 639 transitions. [2018-03-23 12:18:02,252 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 639 transitions. Word has length 190 [2018-03-23 12:18:02,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:18:02,252 INFO L459 AbstractCegarLoop]: Abstraction has 586 states and 639 transitions. [2018-03-23 12:18:02,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-03-23 12:18:02,252 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 639 transitions. [2018-03-23 12:18:02,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-03-23 12:18:02,254 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:18:02,255 INFO L353 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:18:02,255 INFO L408 AbstractCegarLoop]: === Iteration 27 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:18:02,255 INFO L82 PathProgramCache]: Analyzing trace with hash 967372560, now seen corresponding path program 12 times [2018-03-23 12:18:02,255 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:18:02,255 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:18:02,256 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:18:02,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 12:18:02,256 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:18:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:18:02,275 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:18:03,180 INFO L134 CoverageAnalysis]: Checked inductivity of 935 backedges. 65 proven. 510 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2018-03-23 12:18:03,180 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:18:03,180 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 12:18:03,185 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-03-23 12:18:03,229 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-03-23 12:18:03,229 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 12:18:03,233 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:18:03,239 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:18:03,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:18:03,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:18:03,254 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-23 12:18:03,738 INFO L134 CoverageAnalysis]: Checked inductivity of 935 backedges. 0 proven. 445 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-03-23 12:18:03,759 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:18:03,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26] total 55 [2018-03-23 12:18:03,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-03-23 12:18:03,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-03-23 12:18:03,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=2713, Unknown=0, NotChecked=0, Total=3080 [2018-03-23 12:18:03,760 INFO L87 Difference]: Start difference. First operand 586 states and 639 transitions. Second operand 56 states. [2018-03-23 12:18:07,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:18:07,984 INFO L93 Difference]: Finished difference Result 1526 states and 1650 transitions. [2018-03-23 12:18:07,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-03-23 12:18:07,984 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 209 [2018-03-23 12:18:07,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:18:07,988 INFO L225 Difference]: With dead ends: 1526 [2018-03-23 12:18:07,988 INFO L226 Difference]: Without dead ends: 1525 [2018-03-23 12:18:07,990 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 184 SyntacticMatches, 1 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9190 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=3776, Invalid=20716, Unknown=0, NotChecked=0, Total=24492 [2018-03-23 12:18:07,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2018-03-23 12:18:08,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 622. [2018-03-23 12:18:08,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-03-23 12:18:08,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 678 transitions. [2018-03-23 12:18:08,024 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 678 transitions. Word has length 209 [2018-03-23 12:18:08,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:18:08,025 INFO L459 AbstractCegarLoop]: Abstraction has 622 states and 678 transitions. [2018-03-23 12:18:08,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-03-23 12:18:08,025 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 678 transitions. [2018-03-23 12:18:08,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-03-23 12:18:08,027 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:18:08,027 INFO L353 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:18:08,027 INFO L408 AbstractCegarLoop]: === Iteration 28 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:18:08,027 INFO L82 PathProgramCache]: Analyzing trace with hash 989034789, now seen corresponding path program 13 times [2018-03-23 12:18:08,027 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:18:08,027 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:18:08,028 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:18:08,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 12:18:08,028 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:18:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:18:08,042 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:18:09,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1133 backedges. 233 proven. 616 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2018-03-23 12:18:09,113 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:18:09,113 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 12:18:09,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:18:09,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:18:09,159 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:18:09,161 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:18:09,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:18:09,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:18:09,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-23 12:18:09,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1133 backedges. 0 proven. 539 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2018-03-23 12:18:09,848 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:18:09,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 27] total 61 [2018-03-23 12:18:09,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-03-23 12:18:09,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-03-23 12:18:09,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=3458, Unknown=0, NotChecked=0, Total=3782 [2018-03-23 12:18:09,850 INFO L87 Difference]: Start difference. First operand 622 states and 678 transitions. Second operand 62 states. [2018-03-23 12:18:15,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:18:15,807 INFO L93 Difference]: Finished difference Result 1780 states and 1925 transitions. [2018-03-23 12:18:15,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-03-23 12:18:15,807 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 228 [2018-03-23 12:18:15,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:18:15,813 INFO L225 Difference]: With dead ends: 1780 [2018-03-23 12:18:15,813 INFO L226 Difference]: Without dead ends: 1779 [2018-03-23 12:18:15,816 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 202 SyntacticMatches, 2 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11166 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2234, Invalid=27178, Unknown=0, NotChecked=0, Total=29412 [2018-03-23 12:18:15,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2018-03-23 12:18:15,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 658. [2018-03-23 12:18:15,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2018-03-23 12:18:15,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 717 transitions. [2018-03-23 12:18:15,880 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 717 transitions. Word has length 228 [2018-03-23 12:18:15,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:18:15,881 INFO L459 AbstractCegarLoop]: Abstraction has 658 states and 717 transitions. [2018-03-23 12:18:15,881 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-03-23 12:18:15,881 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 717 transitions. [2018-03-23 12:18:15,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-03-23 12:18:15,884 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:18:15,884 INFO L353 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:18:15,884 INFO L408 AbstractCegarLoop]: === Iteration 29 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:18:15,884 INFO L82 PathProgramCache]: Analyzing trace with hash 492564828, now seen corresponding path program 14 times [2018-03-23 12:18:15,884 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:18:15,885 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:18:15,885 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:18:15,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:18:15,885 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:18:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:18:15,905 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:18:17,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1350 backedges. 0 proven. 642 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2018-03-23 12:18:17,210 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:18:17,247 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 12:18:17,252 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 12:18:17,288 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-03-23 12:18:17,289 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 12:18:17,293 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:18:17,296 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:18:17,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:18:17,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:18:17,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-23 12:18:17,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1350 backedges. 0 proven. 642 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2018-03-23 12:18:17,911 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:18:17,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 53 [2018-03-23 12:18:17,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-03-23 12:18:17,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-03-23 12:18:17,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=433, Invalid=2429, Unknown=0, NotChecked=0, Total=2862 [2018-03-23 12:18:17,912 INFO L87 Difference]: Start difference. First operand 658 states and 717 transitions. Second operand 54 states. [2018-03-23 12:18:19,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:18:19,790 INFO L93 Difference]: Finished difference Result 1871 states and 2022 transitions. [2018-03-23 12:18:19,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-03-23 12:18:19,790 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 247 [2018-03-23 12:18:19,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:18:19,794 INFO L225 Difference]: With dead ends: 1871 [2018-03-23 12:18:19,794 INFO L226 Difference]: Without dead ends: 1870 [2018-03-23 12:18:19,795 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 220 SyntacticMatches, 5 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2275 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1151, Invalid=7221, Unknown=0, NotChecked=0, Total=8372 [2018-03-23 12:18:19,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2018-03-23 12:18:19,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 667. [2018-03-23 12:18:19,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2018-03-23 12:18:19,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 727 transitions. [2018-03-23 12:18:19,861 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 727 transitions. Word has length 247 [2018-03-23 12:18:19,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:18:19,861 INFO L459 AbstractCegarLoop]: Abstraction has 667 states and 727 transitions. [2018-03-23 12:18:19,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-03-23 12:18:19,862 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 727 transitions. [2018-03-23 12:18:19,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-03-23 12:18:19,864 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:18:19,864 INFO L353 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:18:19,864 INFO L408 AbstractCegarLoop]: === Iteration 30 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:18:19,865 INFO L82 PathProgramCache]: Analyzing trace with hash -442474033, now seen corresponding path program 15 times [2018-03-23 12:18:19,865 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:18:19,865 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:18:19,865 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:18:19,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 12:18:19,866 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:18:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:18:19,887 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:18:21,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1462 backedges. 0 proven. 754 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2018-03-23 12:18:21,137 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:18:21,137 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 12:18:21,142 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-03-23 12:18:21,200 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-03-23 12:18:21,200 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 12:18:21,205 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:18:21,208 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:18:21,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:18:21,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:18:21,216 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-23 12:18:21,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1462 backedges. 86 proven. 734 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2018-03-23 12:18:21,873 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:18:21,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 34] total 65 [2018-03-23 12:18:21,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-03-23 12:18:21,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-03-23 12:18:21,875 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=3853, Unknown=0, NotChecked=0, Total=4290 [2018-03-23 12:18:21,875 INFO L87 Difference]: Start difference. First operand 667 states and 727 transitions. Second operand 66 states. [2018-03-23 12:18:29,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:18:29,536 INFO L93 Difference]: Finished difference Result 2166 states and 2343 transitions. [2018-03-23 12:18:29,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-03-23 12:18:29,536 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 256 [2018-03-23 12:18:29,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:18:29,540 INFO L225 Difference]: With dead ends: 2166 [2018-03-23 12:18:29,540 INFO L226 Difference]: Without dead ends: 2165 [2018-03-23 12:18:29,543 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 223 SyntacticMatches, 1 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16180 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=5391, Invalid=36839, Unknown=0, NotChecked=0, Total=42230 [2018-03-23 12:18:29,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2165 states. [2018-03-23 12:18:29,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2165 to 703. [2018-03-23 12:18:29,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2018-03-23 12:18:29,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 766 transitions. [2018-03-23 12:18:29,588 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 766 transitions. Word has length 256 [2018-03-23 12:18:29,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:18:29,588 INFO L459 AbstractCegarLoop]: Abstraction has 703 states and 766 transitions. [2018-03-23 12:18:29,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-03-23 12:18:29,589 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 766 transitions. [2018-03-23 12:18:29,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-03-23 12:18:29,600 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:18:29,600 INFO L353 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:18:29,601 INFO L408 AbstractCegarLoop]: === Iteration 31 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:18:29,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1409688846, now seen corresponding path program 16 times [2018-03-23 12:18:29,601 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:18:29,601 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:18:29,602 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:18:29,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 12:18:29,602 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:18:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:18:29,617 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:18:30,167 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 17 DAG size of output 12 [2018-03-23 12:18:30,303 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 18 DAG size of output 13 [2018-03-23 12:18:31,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1707 backedges. 0 proven. 875 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2018-03-23 12:18:31,244 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:18:31,244 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 12:18:31,249 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-03-23 12:18:31,299 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-03-23 12:18:31,299 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 12:18:31,304 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:18:31,306 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:18:31,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:18:31,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:18:31,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-23 12:18:32,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1707 backedges. 0 proven. 875 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2018-03-23 12:18:32,129 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:18:32,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 65 [2018-03-23 12:18:32,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-03-23 12:18:32,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-03-23 12:18:32,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=629, Invalid=3661, Unknown=0, NotChecked=0, Total=4290 [2018-03-23 12:18:32,131 INFO L87 Difference]: Start difference. First operand 703 states and 766 transitions. Second operand 66 states. [2018-03-23 12:18:34,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:18:34,923 INFO L93 Difference]: Finished difference Result 2269 states and 2453 transitions. [2018-03-23 12:18:34,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-03-23 12:18:34,923 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 275 [2018-03-23 12:18:34,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:18:34,928 INFO L225 Difference]: With dead ends: 2269 [2018-03-23 12:18:34,928 INFO L226 Difference]: Without dead ends: 2268 [2018-03-23 12:18:34,929 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 242 SyntacticMatches, 3 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3451 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1626, Invalid=10364, Unknown=0, NotChecked=0, Total=11990 [2018-03-23 12:18:34,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2018-03-23 12:18:34,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 712. [2018-03-23 12:18:34,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2018-03-23 12:18:34,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 776 transitions. [2018-03-23 12:18:34,971 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 776 transitions. Word has length 275 [2018-03-23 12:18:34,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:18:34,972 INFO L459 AbstractCegarLoop]: Abstraction has 712 states and 776 transitions. [2018-03-23 12:18:34,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-03-23 12:18:34,972 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 776 transitions. [2018-03-23 12:18:34,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-03-23 12:18:34,973 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:18:34,974 INFO L353 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:18:34,974 INFO L408 AbstractCegarLoop]: === Iteration 32 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:18:34,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1923145977, now seen corresponding path program 17 times [2018-03-23 12:18:34,974 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:18:34,974 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:18:34,975 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:18:34,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 12:18:34,975 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:18:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:18:34,990 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:18:36,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1837 backedges. 0 proven. 1005 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2018-03-23 12:18:36,351 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:18:36,351 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 12:18:36,356 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-03-23 12:18:36,433 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-03-23 12:18:36,434 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 12:18:36,439 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:18:37,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1837 backedges. 1005 proven. 832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:18:37,775 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:18:37,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 62] total 97 [2018-03-23 12:18:37,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-03-23 12:18:37,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-03-23 12:18:37,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=847, Invalid=8465, Unknown=0, NotChecked=0, Total=9312 [2018-03-23 12:18:37,776 INFO L87 Difference]: Start difference. First operand 712 states and 776 transitions. Second operand 97 states. [2018-03-23 12:18:50,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:18:50,019 INFO L93 Difference]: Finished difference Result 2796 states and 3039 transitions. [2018-03-23 12:18:50,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-03-23 12:18:50,019 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 284 [2018-03-23 12:18:50,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:18:50,024 INFO L225 Difference]: With dead ends: 2796 [2018-03-23 12:18:50,024 INFO L226 Difference]: Without dead ends: 2437 [2018-03-23 12:18:50,027 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 224 SyntacticMatches, 1 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22149 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=7193, Invalid=54559, Unknown=0, NotChecked=0, Total=61752 [2018-03-23 12:18:50,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2018-03-23 12:18:50,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 1900. [2018-03-23 12:18:50,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1900 states. [2018-03-23 12:18:50,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 2093 transitions. [2018-03-23 12:18:50,307 INFO L78 Accepts]: Start accepts. Automaton has 1900 states and 2093 transitions. Word has length 284 [2018-03-23 12:18:50,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:18:50,308 INFO L459 AbstractCegarLoop]: Abstraction has 1900 states and 2093 transitions. [2018-03-23 12:18:50,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-03-23 12:18:50,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 2093 transitions. [2018-03-23 12:18:50,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-03-23 12:18:50,312 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:18:50,312 INFO L353 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 16, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:18:50,312 INFO L408 AbstractCegarLoop]: === Iteration 33 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:18:50,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1888813560, now seen corresponding path program 18 times [2018-03-23 12:18:50,313 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:18:50,313 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:18:50,313 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:18:50,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 12:18:50,314 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:18:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:18:50,338 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:18:51,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2110 backedges. 0 proven. 1144 refuted. 0 times theorem prover too weak. 966 trivial. 0 not checked. [2018-03-23 12:18:51,901 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:18:51,901 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 12:18:51,906 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-03-23 12:18:52,025 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2018-03-23 12:18:52,025 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 12:18:52,030 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:18:53,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2110 backedges. 1144 proven. 966 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:18:53,379 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:18:53,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 66] total 103 [2018-03-23 12:18:53,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-03-23 12:18:53,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-03-23 12:18:53,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=894, Invalid=9612, Unknown=0, NotChecked=0, Total=10506 [2018-03-23 12:18:53,380 INFO L87 Difference]: Start difference. First operand 1900 states and 2093 transitions. Second operand 103 states. [2018-03-23 12:19:05,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:19:05,682 INFO L93 Difference]: Finished difference Result 2828 states and 3060 transitions. [2018-03-23 12:19:05,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-03-23 12:19:05,683 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 303 [2018-03-23 12:19:05,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:19:05,688 INFO L225 Difference]: With dead ends: 2828 [2018-03-23 12:19:05,688 INFO L226 Difference]: Without dead ends: 2661 [2018-03-23 12:19:05,691 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 239 SyntacticMatches, 1 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24871 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=7461, Invalid=62499, Unknown=0, NotChecked=0, Total=69960 [2018-03-23 12:19:05,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2661 states. [2018-03-23 12:19:05,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2661 to 2073. [2018-03-23 12:19:05,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2073 states. [2018-03-23 12:19:05,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2073 states to 2073 states and 2284 transitions. [2018-03-23 12:19:05,914 INFO L78 Accepts]: Start accepts. Automaton has 2073 states and 2284 transitions. Word has length 303 [2018-03-23 12:19:05,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:19:05,914 INFO L459 AbstractCegarLoop]: Abstraction has 2073 states and 2284 transitions. [2018-03-23 12:19:05,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-03-23 12:19:05,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2073 states and 2284 transitions. [2018-03-23 12:19:05,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-03-23 12:19:05,917 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:19:05,917 INFO L353 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:19:05,917 INFO L408 AbstractCegarLoop]: === Iteration 34 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 12:19:05,917 INFO L82 PathProgramCache]: Analyzing trace with hash -2095062099, now seen corresponding path program 19 times [2018-03-23 12:19:05,917 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:19:05,917 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:19:05,918 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:19:05,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 12:19:05,918 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:19:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:19:05,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:19:07,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2402 backedges. 0 proven. 1292 refuted. 0 times theorem prover too weak. 1110 trivial. 0 not checked. [2018-03-23 12:19:07,765 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:19:07,765 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 12:19:07,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:19:07,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:19:07,815 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:19:09,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2402 backedges. 1292 proven. 1110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:19:09,316 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:19:09,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 70] total 109 [2018-03-23 12:19:09,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-03-23 12:19:09,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-03-23 12:19:09,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=999, Invalid=10773, Unknown=0, NotChecked=0, Total=11772 [2018-03-23 12:19:09,332 INFO L87 Difference]: Start difference. First operand 2073 states and 2284 transitions. Second operand 109 states. Received shutdown request... [2018-03-23 12:19:19,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-03-23 12:19:19,539 WARN L519 AbstractCegarLoop]: Verification canceled [2018-03-23 12:19:19,542 WARN L197 ceAbstractionStarter]: Timeout [2018-03-23 12:19:19,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.03 12:19:19 BasicIcfg [2018-03-23 12:19:19,542 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-03-23 12:19:19,543 INFO L168 Benchmark]: Toolchain (without parser) took 115004.68 ms. Allocated memory was 308.3 MB in the beginning and 1.3 GB in the end (delta: 976.2 MB). Free memory was 251.1 MB in the beginning and 607.9 MB in the end (delta: -356.8 MB). Peak memory consumption was 619.4 MB. Max. memory is 5.3 GB. [2018-03-23 12:19:19,544 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 308.3 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-03-23 12:19:19,544 INFO L168 Benchmark]: CACSL2BoogieTranslator took 209.82 ms. Allocated memory is still 308.3 MB. Free memory was 250.1 MB in the beginning and 240.9 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. [2018-03-23 12:19:19,544 INFO L168 Benchmark]: Boogie Preprocessor took 32.17 ms. Allocated memory is still 308.3 MB. Free memory was 240.9 MB in the beginning and 238.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:19:19,544 INFO L168 Benchmark]: RCFGBuilder took 343.60 ms. Allocated memory was 308.3 MB in the beginning and 469.8 MB in the end (delta: 161.5 MB). Free memory was 238.9 MB in the beginning and 435.9 MB in the end (delta: -197.0 MB). Peak memory consumption was 23.3 MB. Max. memory is 5.3 GB. [2018-03-23 12:19:19,545 INFO L168 Benchmark]: IcfgTransformer took 2572.02 ms. Allocated memory was 469.8 MB in the beginning and 583.5 MB in the end (delta: 113.8 MB). Free memory was 435.9 MB in the beginning and 522.7 MB in the end (delta: -86.8 MB). Peak memory consumption was 27.0 MB. Max. memory is 5.3 GB. [2018-03-23 12:19:19,545 INFO L168 Benchmark]: TraceAbstraction took 111841.42 ms. Allocated memory was 583.5 MB in the beginning and 1.3 GB in the end (delta: 701.0 MB). Free memory was 522.7 MB in the beginning and 607.9 MB in the end (delta: -85.2 MB). Peak memory consumption was 615.7 MB. Max. memory is 5.3 GB. [2018-03-23 12:19:19,547 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.16 ms. Allocated memory is still 308.3 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 209.82 ms. Allocated memory is still 308.3 MB. Free memory was 250.1 MB in the beginning and 240.9 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.17 ms. Allocated memory is still 308.3 MB. Free memory was 240.9 MB in the beginning and 238.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 343.60 ms. Allocated memory was 308.3 MB in the beginning and 469.8 MB in the end (delta: 161.5 MB). Free memory was 238.9 MB in the beginning and 435.9 MB in the end (delta: -197.0 MB). Peak memory consumption was 23.3 MB. Max. memory is 5.3 GB. * IcfgTransformer took 2572.02 ms. Allocated memory was 469.8 MB in the beginning and 583.5 MB in the end (delta: 113.8 MB). Free memory was 435.9 MB in the beginning and 522.7 MB in the end (delta: -86.8 MB). Peak memory consumption was 27.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 111841.42 ms. Allocated memory was 583.5 MB in the beginning and 1.3 GB in the end (delta: 701.0 MB). Free memory was 522.7 MB in the beginning and 607.9 MB in the end (delta: -85.2 MB). Peak memory consumption was 615.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 59 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 252 LocStat_NO_SUPPORTING_DISEQUALITIES : 104 LocStat_NO_DISJUNCTIONS : -118 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 79 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 60 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 80 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.027361 RENAME_VARIABLES(MILLISECONDS) : 0.313497 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.001353 PROJECTAWAY(MILLISECONDS) : 0.169882 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.256978 DISJOIN(MILLISECONDS) : 0.245999 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.343882 ADD_EQUALITY(MILLISECONDS) : 0.152683 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.044969 #CONJOIN_DISJUNCTIVE : 422 #RENAME_VARIABLES : 903 #UNFREEZE : 0 #CONJOIN : 532 #PROJECTAWAY : 568 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 85 #RENAME_VARIABLES_DISJUNCTIVE : 896 #ADD_EQUALITY : 60 #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.traceabstraction: - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 18). Cancelled while BasicCegarLoop was constructing difference of abstraction (2073states) and interpolant automaton (currently 144 states, 109 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 249 known predicates. - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was constructing difference of abstraction (2073states) and interpolant automaton (currently 144 states, 109 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 249 known predicates. - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was constructing difference of abstraction (2073states) and interpolant automaton (currently 144 states, 109 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 249 known predicates. - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 30). Cancelled while BasicCegarLoop was constructing difference of abstraction (2073states) and interpolant automaton (currently 144 states, 109 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 249 known predicates. - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 23). Cancelled while BasicCegarLoop was constructing difference of abstraction (2073states) and interpolant automaton (currently 144 states, 109 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 249 known predicates. - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 27). Cancelled while BasicCegarLoop was constructing difference of abstraction (2073states) and interpolant automaton (currently 144 states, 109 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 249 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 61 locations, 6 error locations. TIMEOUT Result, 111.7s OverallTime, 34 OverallIterations, 18 TraceHistogramMax, 78.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2029 SDtfs, 19290 SDslu, 30130 SDs, 0 SdLazy, 64825 SolverSat, 5087 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5990 GetRequests, 3373 SyntacticMatches, 54 SemanticMatches, 2562 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 140375 ImplicationChecksByTransitivity, 67.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2073occurred in iteration=33, 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: 1.2s AutomataMinimizationTime, 33 MinimizatonAttempts, 10065 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 27.9s InterpolantComputationTime, 7953 NumberOfCodeBlocks, 7850 NumberOfCodeBlocksAsserted, 157 NumberOfCheckSat, 7889 ConstructedInterpolants, 2 QuantifiedInterpolants, 14873722 SizeOfPredicates, 539 NumberOfNonLiveVariables, 6292 ConjunctsInSsa, 914 ConjunctsInUnsatCore, 64 InterpolantComputations, 7 PerfectInterpolantSequences, 16708/33504 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-03-23_12-19-19-557.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-03-23_12-19-19-557.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-03-23_12-19-19-557.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-03-23_12-19-19-557.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-03-23_12-19-19-557.csv Completed graceful shutdown