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_Fixed_noBitfields+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-35b68b2 [2018-04-07 02:05:23,193 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-07 02:05:23,195 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-07 02:05:23,209 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-07 02:05:23,210 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-07 02:05:23,211 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-07 02:05:23,211 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-07 02:05:23,213 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-07 02:05:23,214 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-07 02:05:23,215 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-07 02:05:23,216 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-07 02:05:23,216 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-07 02:05:23,217 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-07 02:05:23,219 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-07 02:05:23,219 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-07 02:05:23,222 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-07 02:05:23,224 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-07 02:05:23,226 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-07 02:05:23,227 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-07 02:05:23,228 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-07 02:05:23,231 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-07 02:05:23,231 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-07 02:05:23,231 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-07 02:05:23,232 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-07 02:05:23,233 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-07 02:05:23,235 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-07 02:05:23,235 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-07 02:05:23,236 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-07 02:05:23,236 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-07 02:05:23,237 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-07 02:05:23,237 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-07 02:05:23,237 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-07 02:05:23,263 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-07 02:05:23,263 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-07 02:05:23,263 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-07 02:05:23,264 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-07 02:05:23,264 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-07 02:05:23,265 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-07 02:05:23,265 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-07 02:05:23,265 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-07 02:05:23,265 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-07 02:05:23,265 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-07 02:05:23,266 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-07 02:05:23,266 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-07 02:05:23,266 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-07 02:05:23,266 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-07 02:05:23,267 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-07 02:05:23,267 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-07 02:05:23,267 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-07 02:05:23,267 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-07 02:05:23,267 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-07 02:05:23,268 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-07 02:05:23,268 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-07 02:05:23,268 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-07 02:05:23,268 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-07 02:05:23,269 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-07 02:05:23,269 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-07 02:05:23,269 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-07 02:05:23,269 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-07 02:05:23,269 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-07 02:05:23,270 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-07 02:05:23,270 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-07 02:05:23,270 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-07 02:05:23,270 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-07 02:05:23,270 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:05:23,271 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-07 02:05:23,272 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-07 02:05:23,272 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-07 02:05:23,272 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-07 02:05:23,272 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-07 02:05:23,308 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-07 02:05:23,322 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-07 02:05:23,327 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-07 02:05:23,329 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-07 02:05:23,329 INFO L276 PluginConnector]: CDTParser initialized [2018-04-07 02:05:23,332 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-04-07 02:05:23,717 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG969e3aae0 [2018-04-07 02:05:23,848 INFO L287 CDTParser]: IsIndexed: true [2018-04-07 02:05:23,848 INFO L288 CDTParser]: Found 1 translation units. [2018-04-07 02:05:23,849 INFO L168 CDTParser]: Scanning ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-04-07 02:05:23,850 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-07 02:05:23,850 INFO L215 ultiparseSymbolTable]: [2018-04-07 02:05:23,850 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-07 02:05:23,851 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo ('foo') in ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-04-07 02:05:23,851 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-04-07 02:05:23,851 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-07 02:05:23,851 INFO L233 ultiparseSymbolTable]: [2018-04-07 02:05:23,867 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG969e3aae0 [2018-04-07 02:05:23,872 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-07 02:05:23,874 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-04-07 02:05:23,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-07 02:05:23,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-07 02:05:23,882 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-07 02:05:23,884 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 02:05:23" (1/1) ... [2018-04-07 02:05:23,886 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@474e609a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:05:23, skipping insertion in model container [2018-04-07 02:05:23,887 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 02:05:23" (1/1) ... [2018-04-07 02:05:23,902 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-07 02:05:23,915 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-07 02:05:24,054 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-07 02:05:24,083 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-07 02:05:24,089 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-04-07 02:05:24,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:05:24 WrapperNode [2018-04-07 02:05:24,100 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-07 02:05:24,100 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-07 02:05:24,101 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-07 02:05:24,101 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-07 02:05:24,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:05:24" (1/1) ... [2018-04-07 02:05:24,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:05:24" (1/1) ... [2018-04-07 02:05:24,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:05:24" (1/1) ... [2018-04-07 02:05:24,131 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:05:24" (1/1) ... [2018-04-07 02:05:24,136 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:05:24" (1/1) ... [2018-04-07 02:05:24,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:05:24" (1/1) ... [2018-04-07 02:05:24,148 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:05:24" (1/1) ... [2018-04-07 02:05:24,149 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-07 02:05:24,150 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-07 02:05:24,150 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-07 02:05:24,150 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-07 02:05:24,151 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:05: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-04-07 02:05:24,213 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-07 02:05:24,213 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-07 02:05:24,214 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo [2018-04-07 02:05:24,214 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-07 02:05:24,214 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo [2018-04-07 02:05:24,214 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-07 02:05:24,214 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-07 02:05:24,214 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-07 02:05:24,214 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-07 02:05:24,215 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-07 02:05:24,215 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-07 02:05:24,215 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-07 02:05:24,215 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-07 02:05:24,542 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-07 02:05:24,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 02:05:24 BoogieIcfgContainer [2018-04-07 02:05:24,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-07 02:05:24,544 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-04-07 02:05:24,544 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-04-07 02:05:24,545 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-04-07 02:05:24,549 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 02:05:24" (1/1) ... [2018-04-07 02:05:24,558 INFO L139 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-04-07 02:05:24,558 INFO L140 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-04-07 02:05:24,574 INFO L299 apSepIcfgTransformer]: Heap separator: starting memloc-array-style preprocessing [2018-04-07 02:05:24,587 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-04-07 02:05:24,588 INFO L332 apSepIcfgTransformer]: finished MemlocArrayUpdater, created 0 location literals (each corresponds to one heap write) [2018-04-07 02:05:24,595 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-04-07 02:05:24,599 INFO L412 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-04-07 02:05:24,599 DEBUG L416 apSepIcfgTransformer]: storeIndexInfoToLocLiteral: Map: [2018-04-07 02:05:24,601 DEBUG L418 apSepIcfgTransformer]: edgeToIndexToStoreIndexInfo: NestedMap2: [2018-04-07 02:05:24,665 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-04-07 02:05:26,988 INFO L314 AbstractInterpreter]: Visited 68 different actions 191 times. Merged at 46 different actions 84 times. Never widened. Found 11 fixpoints after 6 different actions. Largest state had 21 variables. [2018-04-07 02:05:26,990 INFO L424 apSepIcfgTransformer]: finished equality analysis [2018-04-07 02:05:26,998 INFO L195 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 1 [2018-04-07 02:05:26,999 INFO L434 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-04-07 02:05:26,999 INFO L435 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-04-07 02:05:26,999 INFO L437 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-04-07 02:05:27,003 DEBUG L373 HeapPartitionManager]: creating LocationBlock locs_30 [2018-04-07 02:05:27,003 DEBUG L374 HeapPartitionManager]: with contents [NoStoreIndexInfo] [2018-04-07 02:05:27,004 DEBUG L323 HeapPartitionManager]: adding LocationBlock locs_30 [2018-04-07 02:05:27,004 DEBUG L324 HeapPartitionManager]: at dimension 0 for ((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-04-07 02:05:27,004 DEBUG L325 HeapPartitionManager]: write locations: [NoStoreIndexInfo] [2018-04-07 02:05:27,004 DEBUG L373 HeapPartitionManager]: creating LocationBlock locs_30 [2018-04-07 02:05:27,004 DEBUG L374 HeapPartitionManager]: with contents [NoStoreIndexInfo] [2018-04-07 02:05:27,005 DEBUG L323 HeapPartitionManager]: adding LocationBlock locs_30 [2018-04-07 02:05:27,005 DEBUG L324 HeapPartitionManager]: at dimension 1 for ((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-04-07 02:05:27,005 DEBUG L325 HeapPartitionManager]: write locations: [NoStoreIndexInfo] [2018-04-07 02:05:27,005 INFO L330 HeapPartitionManager]: partitioning result: [2018-04-07 02:05:27,006 INFO L335 HeapPartitionManager]: location blocks for array group [#memory_int] [2018-04-07 02:05:27,006 INFO L344 HeapPartitionManager]: at dimension 0 [2018-04-07 02:05:27,006 INFO L345 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-04-07 02:05:27,006 INFO L346 HeapPartitionManager]: # location blocks :1 [2018-04-07 02:05:27,007 DEBUG L353 HeapPartitionManager]: location block contents: [2018-04-07 02:05:27,007 DEBUG L356 HeapPartitionManager]: [NoStoreIndexInfo] [2018-04-07 02:05:27,007 INFO L344 HeapPartitionManager]: at dimension 1 [2018-04-07 02:05:27,007 INFO L345 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-04-07 02:05:27,007 INFO L346 HeapPartitionManager]: # location blocks :1 [2018-04-07 02:05:27,007 DEBUG L353 HeapPartitionManager]: location block contents: [2018-04-07 02:05:27,008 DEBUG L356 HeapPartitionManager]: [NoStoreIndexInfo] [2018-04-07 02:05:27,009 INFO L131 ransitionTransformer]: executing heap partitioning transformation [2018-04-07 02:05:27,013 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,013 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:05:27,013 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,013 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,014 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,014 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:05:27,014 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,014 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,015 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,015 DEBUG L281 ransitionTransformer]: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] [2018-04-07 02:05:27,015 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,016 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,016 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,016 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:05:27,017 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,017 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,017 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,017 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{main_~i~1=v_main_~i~1_8} AuxVars[] AssignedVars[main_~i~1] [2018-04-07 02:05:27,017 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,018 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,018 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,018 DEBUG L281 ransitionTransformer]: Formula: (= |v_#valid_1| (store |v_#valid_2| 0 0)) InVars {#valid=|v_#valid_2|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid] [2018-04-07 02:05:27,018 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,018 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,019 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,019 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{main_~b~0=v_main_~b~0_3} AuxVars[] AssignedVars[main_~b~0] [2018-04-07 02:05:27,019 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,019 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,019 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,019 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:05:27,020 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,020 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,020 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,020 DEBUG L281 ransitionTransformer]: Formula: (and (= 0 (select |v_#valid_16| |v_main_~#mask~0.base_5|)) (= |v_#length_5| (store |v_#length_6| |v_main_~#mask~0.base_5| 32)) (= 0 |v_main_~#mask~0.offset_5|) (not (= 0 |v_main_~#mask~0.base_5|)) (= |v_#valid_15| (store |v_#valid_16| |v_main_~#mask~0.base_5| 1))) InVars {#length=|v_#length_6|, #valid=|v_#valid_16|} OutVars{#length=|v_#length_5|, main_~#mask~0.base=|v_main_~#mask~0.base_5|, main_~#mask~0.offset=|v_main_~#mask~0.offset_5|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[main_~#mask~0.base, main_~#mask~0.offset, #valid, #length] [2018-04-07 02:05:27,021 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,021 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,021 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,021 DEBUG L281 ransitionTransformer]: Formula: (= v_main_~i~1_9 0) InVars {} OutVars{main_~i~1=v_main_~i~1_9} AuxVars[] AssignedVars[main_~i~1] [2018-04-07 02:05:27,021 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,022 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,022 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,022 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:05:27,022 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,022 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,022 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,023 DEBUG L281 ransitionTransformer]: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:05:27,023 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,023 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,023 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,023 DEBUG L281 ransitionTransformer]: Formula: (not (< v_main_~i~1_10 32)) InVars {main_~i~1=v_main_~i~1_10} OutVars{main_~i~1=v_main_~i~1_10} AuxVars[] AssignedVars[] [2018-04-07 02:05:27,024 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,024 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,024 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,024 DEBUG L281 ransitionTransformer]: Formula: (< v_main_~i~1_11 32) InVars {main_~i~1=v_main_~i~1_11} OutVars{main_~i~1=v_main_~i~1_11} AuxVars[] AssignedVars[] [2018-04-07 02:05:27,024 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,024 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,025 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,025 DEBUG L281 ransitionTransformer]: Formula: (= v_main_~i~1_17 0) InVars {} OutVars{main_~i~1=v_main_~i~1_17} AuxVars[] AssignedVars[main_~i~1] [2018-04-07 02:05:27,025 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,025 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,025 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,026 DEBUG L281 ransitionTransformer]: Formula: (or (not (< v_main_~i~1_12 32)) (not (<= 0 v_main_~i~1_12))) InVars {main_~i~1=v_main_~i~1_12} OutVars{main_~i~1=v_main_~i~1_12} AuxVars[] AssignedVars[] [2018-04-07 02:05:27,026 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,026 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,026 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,026 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:05:27,026 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,027 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,027 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,027 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:05:27,027 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,027 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,028 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,028 DEBUG L281 ransitionTransformer]: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:05:27,028 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,028 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,028 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,029 DEBUG L281 ransitionTransformer]: Formula: (and (= |v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#in~b.offsetInParam_1| |v_main_~#mask~0.offset_7|) (= |v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#in~sizeInParam_1| v_main_~i~1_18) (= |v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#in~b.baseInParam_1| |v_main_~#mask~0.base_7|)) InVars {main_~i~1=v_main_~i~1_18, main_~#mask~0.base=|v_main_~#mask~0.base_7|, main_~#mask~0.offset=|v_main_~#mask~0.offset_7|} OutVars{__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#in~size=|v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#in~sizeInParam_1|, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#in~b.base=|v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#in~b.baseInParam_1|, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#in~b.offset=|v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#in~b.offsetInParam_1|} AuxVars[] AssignedVars[__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#in~size, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#in~b.base, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#in~b.offset] [2018-04-07 02:05:27,029 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,029 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,029 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,029 DEBUG L281 ransitionTransformer]: Formula: (not (< v_main_~i~1_1 32)) InVars {main_~i~1=v_main_~i~1_1} OutVars{main_~i~1=v_main_~i~1_1} AuxVars[] AssignedVars[] [2018-04-07 02:05:27,030 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,030 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,030 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,030 DEBUG L281 ransitionTransformer]: Formula: (< v_main_~i~1_2 32) InVars {main_~i~1=v_main_~i~1_2} OutVars{main_~i~1=v_main_~i~1_2} AuxVars[] AssignedVars[] [2018-04-07 02:05:27,030 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,030 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,031 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,031 DEBUG L281 ransitionTransformer]: Formula: (= |v_main_#res_2| 0) InVars {} OutVars{main_#res=|v_main_#res_2|} AuxVars[] AssignedVars[main_#res] [2018-04-07 02:05:27,031 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,031 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,031 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,032 DEBUG L281 ransitionTransformer]: Formula: (and (<= |v_main_#t~ret3_2| 2147483647) (<= 0 (+ |v_main_#t~ret3_2| 2147483648))) InVars {main_#t~ret3=|v_main_#t~ret3_2|} OutVars{main_#t~ret3=|v_main_#t~ret3_2|} AuxVars[] AssignedVars[] [2018-04-07 02:05:27,032 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,032 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,032 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,032 DEBUG L281 ransitionTransformer]: Formula: (and (= v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.base_1 |v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#in~b.base_1|) (= v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.offset_1 |v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#in~b.offset_1|)) InVars {__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#in~b.offset=|v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#in~b.offset_1|, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#in~b.base=|v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#in~b.base_1|} OutVars{__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.base=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.base_1, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.offset=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.offset_1, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#in~b.offset=|v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#in~b.offset_1|, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#in~b.base=|v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#in~b.base_1|} AuxVars[] AssignedVars[__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.base, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.offset] [2018-04-07 02:05:27,033 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,033 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,033 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,033 DEBUG L281 ransitionTransformer]: Formula: (or (not (<= 0 v_main_~i~1_3)) (not (< v_main_~i~1_3 32))) InVars {main_~i~1=v_main_~i~1_3} OutVars{main_~i~1=v_main_~i~1_3} AuxVars[] AssignedVars[] [2018-04-07 02:05:27,033 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,033 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,034 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,034 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:05:27,034 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,034 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,034 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,035 DEBUG L281 ransitionTransformer]: Formula: (= |v_#valid_11| (store |v_#valid_12| |v_main_~#mask~0.base_3| 0)) InVars {main_~#mask~0.base=|v_main_~#mask~0.base_3|, #valid=|v_#valid_12|} OutVars{main_~#mask~0.base=|v_main_~#mask~0.base_3|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#valid] [2018-04-07 02:05:27,035 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,035 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,035 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,035 DEBUG L281 ransitionTransformer]: Formula: (= v_main_~b~0_4 (store v_main_~b~0_5 v_main_~i~1_14 |v_main_#t~ret3_3|)) InVars {main_~i~1=v_main_~i~1_14, main_~b~0=v_main_~b~0_5, main_#t~ret3=|v_main_#t~ret3_3|} OutVars{main_~i~1=v_main_~i~1_14, main_~b~0=v_main_~b~0_4, main_#t~ret3=|v_main_#t~ret3_3|} AuxVars[] AssignedVars[main_~b~0] [2018-04-07 02:05:27,035 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,036 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,036 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,036 DEBUG L281 ransitionTransformer]: Formula: (= v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~size_1 |v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#in~size_1|) InVars {__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#in~size=|v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#in~size_1|} OutVars{__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#in~size=|v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#in~size_1|, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~size=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~size_1} AuxVars[] AssignedVars[__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~size] [2018-04-07 02:05:27,036 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,036 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,036 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,037 DEBUG L281 ransitionTransformer]: Formula: (not (= (+ v_main_~i~1_4 1) (select v_main_~b~0_1 v_main_~i~1_4))) InVars {main_~b~0=v_main_~b~0_1, main_~i~1=v_main_~i~1_4} OutVars{main_~b~0=v_main_~b~0_1, main_~i~1=v_main_~i~1_4} AuxVars[] AssignedVars[] [2018-04-07 02:05:27,037 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,037 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,037 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,037 DEBUG L281 ransitionTransformer]: Formula: (= (select v_main_~b~0_2 v_main_~i~1_5) (+ v_main_~i~1_5 1)) InVars {main_~b~0=v_main_~b~0_2, main_~i~1=v_main_~i~1_5} OutVars{main_~b~0=v_main_~b~0_2, main_~i~1=v_main_~i~1_5} AuxVars[] AssignedVars[] [2018-04-07 02:05:27,037 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,038 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,038 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,038 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{main_~#mask~0.base=|v_main_~#mask~0.base_4|, main_~#mask~0.offset=|v_main_~#mask~0.offset_4|} AuxVars[] AssignedVars[main_~#mask~0.base, main_~#mask~0.offset] [2018-04-07 02:05:27,038 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,038 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,039 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,039 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{main_#t~ret3=|v_main_#t~ret3_4|} AuxVars[] AssignedVars[main_#t~ret3] [2018-04-07 02:05:27,039 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,039 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,039 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,039 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~a~0=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~a~0_1} AuxVars[] AssignedVars[__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~a~0] [2018-04-07 02:05:27,040 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,040 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,040 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,040 DEBUG L281 ransitionTransformer]: Formula: (= |v_main_#res_1| 1) InVars {} OutVars{main_#res=|v_main_#res_1|} AuxVars[] AssignedVars[main_#res] [2018-04-07 02:05:27,040 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,040 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,041 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,041 DEBUG L281 ransitionTransformer]: Formula: (= |v_main_#t~post4_1| v_main_~i~1_6) InVars {main_~i~1=v_main_~i~1_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~1=v_main_~i~1_6} AuxVars[] AssignedVars[main_#t~post4] [2018-04-07 02:05:27,041 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,041 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,041 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,042 DEBUG L281 ransitionTransformer]: Formula: (= |v_#valid_13| |old(#valid)|) InVars {#valid=|v_#valid_13|, old(#valid)=|old(#valid)|} OutVars{#valid=|v_#valid_13|, old(#valid)=|old(#valid)|} AuxVars[] AssignedVars[] [2018-04-07 02:05:27,042 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,042 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,042 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,042 DEBUG L281 ransitionTransformer]: Formula: (not (= |v_#valid_14| |old(#valid)|)) InVars {#valid=|v_#valid_14|, old(#valid)=|old(#valid)|} OutVars{#valid=|v_#valid_14|, old(#valid)=|old(#valid)|} AuxVars[] AssignedVars[] [2018-04-07 02:05:27,042 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,043 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,043 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,043 DEBUG L281 ransitionTransformer]: Formula: (= |v_main_#t~post2_1| v_main_~i~1_15) InVars {main_~i~1=v_main_~i~1_15} OutVars{main_~i~1=v_main_~i~1_15, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_#t~post2] [2018-04-07 02:05:27,043 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,043 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,044 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,044 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0_1} AuxVars[] AssignedVars[__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0] [2018-04-07 02:05:27,044 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,044 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,044 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,044 DEBUG L281 ransitionTransformer]: Formula: (= (store |v_#valid_10| |v_main_~#mask~0.base_1| 0) |v_#valid_9|) InVars {main_~#mask~0.base=|v_main_~#mask~0.base_1|, #valid=|v_#valid_10|} OutVars{main_~#mask~0.base=|v_main_~#mask~0.base_1|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[#valid] [2018-04-07 02:05:27,045 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,045 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,045 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,045 DEBUG L281 ransitionTransformer]: Formula: (= v_main_~i~1_7 (+ |v_main_#t~post4_2| 1)) InVars {main_#t~post4=|v_main_#t~post4_2|} OutVars{main_#t~post4=|v_main_#t~post4_2|, main_~i~1=v_main_~i~1_7} AuxVars[] AssignedVars[main_~i~1] [2018-04-07 02:05:27,045 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,045 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,046 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,046 DEBUG L281 ransitionTransformer]: Formula: (= v_main_~i~1_16 (+ |v_main_#t~post2_2| 1)) InVars {main_#t~post2=|v_main_#t~post2_2|} OutVars{main_~i~1=v_main_~i~1_16, main_#t~post2=|v_main_#t~post2_2|} AuxVars[] AssignedVars[main_~i~1] [2018-04-07 02:05:27,046 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,046 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,046 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,046 DEBUG L281 ransitionTransformer]: Formula: (= v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0_2 0) InVars {} OutVars{__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0_2} AuxVars[] AssignedVars[__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0] [2018-04-07 02:05:27,047 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,047 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,047 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,047 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{main_~#mask~0.base=|v_main_~#mask~0.base_2|, main_~#mask~0.offset=|v_main_~#mask~0.offset_2|} AuxVars[] AssignedVars[main_~#mask~0.base, main_~#mask~0.offset] [2018-04-07 02:05:27,047 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,047 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,048 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,048 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{main_#t~post4=|v_main_#t~post4_3|} AuxVars[] AssignedVars[main_#t~post4] [2018-04-07 02:05:27,048 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,048 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,048 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,048 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{main_#t~post2=|v_main_#t~post2_3|} AuxVars[] AssignedVars[main_#t~post2] [2018-04-07 02:05:27,048 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,049 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,049 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,049 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:05:27,049 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,049 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,049 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,050 DEBUG L281 ransitionTransformer]: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:05:27,050 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,050 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,050 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,050 DEBUG L281 ransitionTransformer]: Formula: (not (<= v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0_3 (+ v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~size_2 1))) InVars {__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~size=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~size_2, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0_3} OutVars{__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~size=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~size_2, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0_3} AuxVars[] AssignedVars[] [2018-04-07 02:05:27,050 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,051 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,051 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,051 DEBUG L281 ransitionTransformer]: Formula: (<= v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0_4 (+ v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~size_3 1)) InVars {__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~size=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~size_3, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0_4} OutVars{__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~size=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~size_3, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0_4} AuxVars[] AssignedVars[] [2018-04-07 02:05:27,051 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,051 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,052 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,052 DEBUG L281 ransitionTransformer]: Formula: (= |v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#res_1| v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0_11) InVars {__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0_11} OutVars{__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#res=|v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#res_1|, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0_11} AuxVars[] AssignedVars[__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#res] [2018-04-07 02:05:27,052 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,052 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,052 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,052 DEBUG L281 ransitionTransformer]: Formula: (or (not (< v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0_5 33)) (not (<= 0 v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0_5))) InVars {__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0_5} OutVars{__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0_5} AuxVars[] AssignedVars[] [2018-04-07 02:05:27,053 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,053 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,053 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,053 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:05:27,053 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,053 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,054 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,054 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:05:27,054 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,054 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,057 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,057 DEBUG L281 ransitionTransformer]: Formula: (let ((.cse0 (+ 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))) (and (<= (+ 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 1) (select |v_#length_1| v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.base_2)) (= (select (select |v_#memory_int_part_locs_30_locs_30_1| v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.base_2) .cse0) |v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#t~mem1_1|) (<= 0 .cse0) (= (select |v_#valid_3| v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.base_2) 1))) InVars {__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0_6, #valid=|v_#valid_3|, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.base=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.base_2, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.offset=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.offset_2, #length=|v_#length_1|, #memory_int_part_locs_30_locs_30=|v_#memory_int_part_locs_30_locs_30_1|} OutVars{__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0_6, #valid=|v_#valid_3|, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#t~mem1=|v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#t~mem1_1|, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.base=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.base_2, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.offset=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.offset_2, #length=|v_#length_1|, #memory_int_part_locs_30_locs_30=|v_#memory_int_part_locs_30_locs_30_1|} AuxVars[] AssignedVars[__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#t~mem1] [2018-04-07 02:05:27,057 DEBUG L288 ransitionTransformer]: formula has changed [2018-04-07 02:05:27,057 DEBUG L289 ransitionTransformer]: old formula: [2018-04-07 02:05:27,057 DEBUG L290 ransitionTransformer]: (let ((.cse0 (+ 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))) (and (<= (+ 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 1) (select |v_#length_1| v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.base_2)) (= (select (select |v_#memory_int_1| v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.base_2) .cse0) |v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#t~mem1_1|) (<= 0 .cse0) (= (select |v_#valid_3| v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.base_2) 1))) [2018-04-07 02:05:27,058 DEBUG L291 ransitionTransformer]: new formula: [2018-04-07 02:05:27,058 DEBUG L292 ransitionTransformer]: (let ((.cse0 (+ 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))) (and (<= (+ 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 1) (select |v_#length_1| v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.base_2)) (= (select (select |v_#memory_int_part_locs_30_locs_30_1| v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.base_2) .cse0) |v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#t~mem1_1|) (<= 0 .cse0) (= (select |v_#valid_3| v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.base_2) 1))) [2018-04-07 02:05:27,058 DEBUG L296 ransitionTransformer]: invars have changed [2018-04-07 02:05:27,058 DEBUG L297 ransitionTransformer]: old invars: [2018-04-07 02:05:27,058 DEBUG L298 ransitionTransformer]: {__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0_6, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_1|, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.base=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.base_2, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.offset=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.offset_2, #length=|v_#length_1|} [2018-04-07 02:05:27,059 DEBUG L299 ransitionTransformer]: new invars: [2018-04-07 02:05:27,059 DEBUG L300 ransitionTransformer]: {__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0_6, #valid=|v_#valid_3|, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.base=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.base_2, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.offset=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.offset_2, #length=|v_#length_1|, #memory_int_part_locs_30_locs_30=|v_#memory_int_part_locs_30_locs_30_1|} [2018-04-07 02:05:27,059 DEBUG L304 ransitionTransformer]: outvars have changed [2018-04-07 02:05:27,059 DEBUG L305 ransitionTransformer]: old outvars: [2018-04-07 02:05:27,059 DEBUG L306 ransitionTransformer]: {__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0_6, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_1|, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#t~mem1=|v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#t~mem1_1|, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.base=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.base_2, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.offset=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.offset_2, #length=|v_#length_1|} [2018-04-07 02:05:27,059 DEBUG L307 ransitionTransformer]: new outvars: [2018-04-07 02:05:27,060 DEBUG L308 ransitionTransformer]: {__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0_6, #valid=|v_#valid_3|, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#t~mem1=|v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#t~mem1_1|, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.base=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.base_2, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.offset=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.offset_2, #length=|v_#length_1|, #memory_int_part_locs_30_locs_30=|v_#memory_int_part_locs_30_locs_30_1|} [2018-04-07 02:05:27,060 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,060 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,060 DEBUG L281 ransitionTransformer]: Formula: (not (= (select |v_#valid_4| v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.base_3) 1)) InVars {__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.base=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.base_3, #valid=|v_#valid_4|} OutVars{__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.base=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.base_3, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] [2018-04-07 02:05:27,060 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,060 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,061 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,061 DEBUG L281 ransitionTransformer]: Formula: (or (not (<= (+ v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.offset_3 v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0_7 1) (select |v_#length_2| v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.base_4))) (not (<= 0 (+ v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.offset_3 v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0_7)))) InVars {__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.base=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.base_4, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.offset=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.offset_3, #length=|v_#length_2|, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0_7} OutVars{__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.base=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.base_4, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.offset=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~b.offset_3, #length=|v_#length_2|, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0_7} AuxVars[] AssignedVars[] [2018-04-07 02:05:27,061 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,061 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,062 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,062 DEBUG L281 ransitionTransformer]: Formula: (= v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~a~0_2 (store v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~a~0_3 v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0_8 |v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#t~mem1_2|)) InVars {__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~a~0=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~a~0_3, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#t~mem1=|v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#t~mem1_2|, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0_8} OutVars{__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~a~0=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~a~0_2, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#t~mem1=|v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#t~mem1_2|, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0_8} AuxVars[] AssignedVars[__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~a~0] [2018-04-07 02:05:27,062 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,062 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,062 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,062 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#t~mem1=|v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#t~mem1_3|} AuxVars[] AssignedVars[__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#t~mem1] [2018-04-07 02:05:27,063 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,063 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,063 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,063 DEBUG L281 ransitionTransformer]: Formula: (= |v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#t~post0_1| v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0_9) InVars {__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0_9} OutVars{__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#t~post0=|v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#t~post0_1|, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0_9} AuxVars[] AssignedVars[__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#t~post0] [2018-04-07 02:05:27,063 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,063 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,064 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,064 DEBUG L281 ransitionTransformer]: Formula: (= v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0_10 (+ |v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#t~post0_2| 1)) InVars {__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#t~post0=|v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#t~post0_2|} OutVars{__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0=v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0_10, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#t~post0=|v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#t~post0_2|} AuxVars[] AssignedVars[__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_~i~0] [2018-04-07 02:05:27,064 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,064 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,064 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,065 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#t~post0=|v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#t~post0_3|} AuxVars[] AssignedVars[__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#t~post0] [2018-04-07 02:05:27,065 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,065 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,065 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,065 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:05:27,065 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,065 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,066 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,066 DEBUG L281 ransitionTransformer]: Formula: (= |v_ULTIMATE.start_#t~ret5_2| |v_main_#resOutParam_1|) InVars {main_#res=|v_main_#resOutParam_1|} OutVars{ULTIMATE.start_#t~ret5=|v_ULTIMATE.start_#t~ret5_2|} AuxVars[] AssignedVars[ULTIMATE.start_#t~ret5] [2018-04-07 02:05:27,066 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,066 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,066 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:05:27,067 DEBUG L281 ransitionTransformer]: Formula: (= |v_main_#t~ret3_5| |v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#resOutParam_1|) InVars {__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#res=|v___U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo_#resOutParam_1|} OutVars{main_#t~ret3=|v_main_#t~ret3_5|} AuxVars[] AssignedVars[main_#t~ret3] [2018-04-07 02:05:27,067 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:05:27,067 DEBUG L310 ransitionTransformer]: [2018-04-07 02:05:27,067 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-04-07 02:05:27,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 02:05:27 BasicIcfg [2018-04-07 02:05:27,069 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-04-07 02:05:27,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-07 02:05:27,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-07 02:05:27,073 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-07 02:05:27,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 02:05:23" (1/4) ... [2018-04-07 02:05:27,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@694b6c34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 02:05:27, skipping insertion in model container [2018-04-07 02:05:27,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:05:24" (2/4) ... [2018-04-07 02:05:27,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@694b6c34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 02:05:27, skipping insertion in model container [2018-04-07 02:05:27,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 02:05:24" (3/4) ... [2018-04-07 02:05:27,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@694b6c34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 02:05:27, skipping insertion in model container [2018-04-07 02:05:27,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 02:05:27" (4/4) ... [2018-04-07 02:05:27,077 INFO L107 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-04-07 02:05:27,086 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-07 02:05:27,095 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-04-07 02:05:27,136 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-07 02:05:27,137 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-07 02:05:27,137 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-07 02:05:27,137 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-07 02:05:27,137 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-07 02:05:27,137 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-07 02:05:27,138 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-07 02:05:27,138 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-07 02:05:27,138 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-07 02:05:27,139 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-07 02:05:27,152 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-04-07 02:05:27,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-07 02:05:27,159 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:05:27,160 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:05:27,160 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-04-07 02:05:27,166 INFO L82 PathProgramCache]: Analyzing trace with hash -681009750, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:05:27,184 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:05:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:05:27,226 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:05:27,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:05:27,302 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:05:27,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:05:27,393 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-07 02:05:27,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-07 02:05:27,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-07 02:05:27,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-07 02:05:27,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-07 02:05:27,407 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 4 states. [2018-04-07 02:05:27,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:05:27,592 INFO L93 Difference]: Finished difference Result 136 states and 158 transitions. [2018-04-07 02:05:27,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-07 02:05:27,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-04-07 02:05:27,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:05:27,611 INFO L225 Difference]: With dead ends: 136 [2018-04-07 02:05:27,611 INFO L226 Difference]: Without dead ends: 80 [2018-04-07 02:05:27,624 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-07 02:05:27,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-04-07 02:05:27,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 64. [2018-04-07 02:05:27,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-04-07 02:05:27,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2018-04-07 02:05:27,684 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 13 [2018-04-07 02:05:27,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:05:27,684 INFO L459 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2018-04-07 02:05:27,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-07 02:05:27,684 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-04-07 02:05:27,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-07 02:05:27,685 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:05:27,685 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:05:27,686 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-04-07 02:05:27,686 INFO L82 PathProgramCache]: Analyzing trace with hash -119315392, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:05:27,701 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:05:27,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:05:27,731 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:05:27,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:05:27,755 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:05:27,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:05:27,865 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-07 02:05:27,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2018-04-07 02:05:27,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-07 02:05:27,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-07 02:05:27,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-07 02:05:27,867 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand 4 states. [2018-04-07 02:05:27,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:05:27,908 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-04-07 02:05:27,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-07 02:05:27,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-04-07 02:05:27,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:05:27,912 INFO L225 Difference]: With dead ends: 78 [2018-04-07 02:05:27,913 INFO L226 Difference]: Without dead ends: 77 [2018-04-07 02:05:27,914 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-07 02:05:27,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-04-07 02:05:27,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2018-04-07 02:05:27,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-04-07 02:05:27,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-04-07 02:05:27,924 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 22 [2018-04-07 02:05:27,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:05:27,924 INFO L459 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-04-07 02:05:27,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-07 02:05:27,925 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-04-07 02:05:27,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-07 02:05:27,925 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:05:27,926 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:05:27,926 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-04-07 02:05:27,926 INFO L82 PathProgramCache]: Analyzing trace with hash 596190367, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:05:27,943 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:05:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:05:27,961 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:05:27,979 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-04-07 02:05:27,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:05:27,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:05:27,988 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-07 02:05:28,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:05:28,009 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:05:28,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:05:28,051 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-07 02:05:28,051 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-07 02:05:28,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-07 02:05:28,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-07 02:05:28,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-07 02:05:28,052 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2018-04-07 02:05:28,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:05:28,110 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-04-07 02:05:28,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-07 02:05:28,111 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-04-07 02:05:28,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:05:28,112 INFO L225 Difference]: With dead ends: 67 [2018-04-07 02:05:28,112 INFO L226 Difference]: Without dead ends: 66 [2018-04-07 02:05:28,112 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 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-04-07 02:05:28,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-04-07 02:05:28,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-04-07 02:05:28,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-04-07 02:05:28,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-04-07 02:05:28,120 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 23 [2018-04-07 02:05:28,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:05:28,120 INFO L459 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-04-07 02:05:28,120 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-07 02:05:28,120 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-04-07 02:05:28,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-07 02:05:28,121 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:05:28,121 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:05:28,121 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-04-07 02:05:28,122 INFO L82 PathProgramCache]: Analyzing trace with hash 596190368, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:05:28,128 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:05:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:05:28,150 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:05:28,158 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-04-07 02:05:28,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:05:28,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:05:28,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-07 02:05:28,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:05:28,216 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:05:28,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:05:28,327 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-07 02:05:28,328 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2018-04-07 02:05:28,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-07 02:05:28,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-07 02:05:28,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-04-07 02:05:28,328 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 10 states. [2018-04-07 02:05:28,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:05:28,447 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-04-07 02:05:28,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-07 02:05:28,448 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-04-07 02:05:28,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:05:28,449 INFO L225 Difference]: With dead ends: 75 [2018-04-07 02:05:28,449 INFO L226 Difference]: Without dead ends: 74 [2018-04-07 02:05:28,449 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-04-07 02:05:28,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-04-07 02:05:28,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 67. [2018-04-07 02:05:28,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-04-07 02:05:28,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-04-07 02:05:28,458 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 23 [2018-04-07 02:05:28,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:05:28,458 INFO L459 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-04-07 02:05:28,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-07 02:05:28,458 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-04-07 02:05:28,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-07 02:05:28,459 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:05:28,460 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:05:28,460 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-04-07 02:05:28,460 INFO L82 PathProgramCache]: Analyzing trace with hash 168788435, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:05:28,468 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:05:28,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:05:28,485 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:05:28,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:05:28,500 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:05:28,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:05:28,574 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:05:28,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-04-07 02:05:28,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-07 02:05:28,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-07 02:05:28,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-04-07 02:05:28,575 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 8 states. [2018-04-07 02:05:28,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:05:28,724 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2018-04-07 02:05:28,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-07 02:05:28,725 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-04-07 02:05:28,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:05:28,727 INFO L225 Difference]: With dead ends: 101 [2018-04-07 02:05:28,727 INFO L226 Difference]: Without dead ends: 100 [2018-04-07 02:05:28,727 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-04-07 02:05:28,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-04-07 02:05:28,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 84. [2018-04-07 02:05:28,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-04-07 02:05:28,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2018-04-07 02:05:28,736 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 31 [2018-04-07 02:05:28,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:05:28,736 INFO L459 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2018-04-07 02:05:28,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-07 02:05:28,736 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2018-04-07 02:05:28,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-07 02:05:28,737 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:05:28,737 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:05:28,737 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-04-07 02:05:28,737 INFO L82 PathProgramCache]: Analyzing trace with hash 937474413, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:05:28,748 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:05:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:05:28,767 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:05:28,779 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-04-07 02:05:28,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:05:28,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:05:28,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-07 02:05:28,876 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:05:28,876 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:05:29,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:05:29,157 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:05:29,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-04-07 02:05:29,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-07 02:05:29,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-07 02:05:29,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-04-07 02:05:29,158 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand 14 states. [2018-04-07 02:05:29,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:05:29,408 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2018-04-07 02:05:29,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-07 02:05:29,408 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-04-07 02:05:29,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:05:29,409 INFO L225 Difference]: With dead ends: 95 [2018-04-07 02:05:29,410 INFO L226 Difference]: Without dead ends: 94 [2018-04-07 02:05:29,410 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2018-04-07 02:05:29,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-04-07 02:05:29,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2018-04-07 02:05:29,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-07 02:05:29,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2018-04-07 02:05:29,419 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 32 [2018-04-07 02:05:29,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:05:29,419 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2018-04-07 02:05:29,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-07 02:05:29,420 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2018-04-07 02:05:29,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-07 02:05:29,421 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:05:29,421 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:05:29,421 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-04-07 02:05:29,421 INFO L82 PathProgramCache]: Analyzing trace with hash -433013287, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:05:29,429 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:05:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:05:29,443 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:05:29,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:05:29,468 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:05:29,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:05:29,572 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-07 02:05:29,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2018-04-07 02:05:29,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-07 02:05:29,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-07 02:05:29,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-04-07 02:05:29,573 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 9 states. [2018-04-07 02:05:29,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:05:29,697 INFO L93 Difference]: Finished difference Result 174 states and 188 transitions. [2018-04-07 02:05:29,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-07 02:05:29,698 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-04-07 02:05:29,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:05:29,699 INFO L225 Difference]: With dead ends: 174 [2018-04-07 02:05:29,699 INFO L226 Difference]: Without dead ends: 102 [2018-04-07 02:05:29,700 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-04-07 02:05:29,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-04-07 02:05:29,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 89. [2018-04-07 02:05:29,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-04-07 02:05:29,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-04-07 02:05:29,710 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 33 [2018-04-07 02:05:29,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:05:29,711 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-04-07 02:05:29,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-07 02:05:29,711 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-04-07 02:05:29,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-07 02:05:29,714 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:05:29,714 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:05:29,714 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-04-07 02:05:29,714 INFO L82 PathProgramCache]: Analyzing trace with hash 742553190, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:05:29,721 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:05:29,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:05:29,735 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:05:29,771 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:05:29,771 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:05:29,881 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:05:29,902 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:05:29,902 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-04-07 02:05:29,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-07 02:05:29,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-07 02:05:29,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-04-07 02:05:29,903 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 12 states. [2018-04-07 02:05:30,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:05:30,030 INFO L93 Difference]: Finished difference Result 180 states and 194 transitions. [2018-04-07 02:05:30,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-07 02:05:30,030 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-04-07 02:05:30,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:05:30,031 INFO L225 Difference]: With dead ends: 180 [2018-04-07 02:05:30,031 INFO L226 Difference]: Without dead ends: 105 [2018-04-07 02:05:30,032 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2018-04-07 02:05:30,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-04-07 02:05:30,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 89. [2018-04-07 02:05:30,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-04-07 02:05:30,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-04-07 02:05:30,040 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 42 [2018-04-07 02:05:30,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:05:30,041 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-04-07 02:05:30,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-07 02:05:30,041 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-04-07 02:05:30,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-07 02:05:30,042 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:05:30,042 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:05:30,042 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-04-07 02:05:30,043 INFO L82 PathProgramCache]: Analyzing trace with hash 645199987, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:05:30,051 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:05:30,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:05:30,067 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:05:30,137 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-07 02:05:30,137 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:05:30,209 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-07 02:05:30,248 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-07 02:05:30,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 15 [2018-04-07 02:05:30,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-07 02:05:30,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-07 02:05:30,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-04-07 02:05:30,250 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 15 states. [2018-04-07 02:05:30,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:05:30,518 INFO L93 Difference]: Finished difference Result 211 states and 225 transitions. [2018-04-07 02:05:30,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-07 02:05:30,519 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 49 [2018-04-07 02:05:30,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:05:30,519 INFO L225 Difference]: With dead ends: 211 [2018-04-07 02:05:30,520 INFO L226 Difference]: Without dead ends: 130 [2018-04-07 02:05:30,520 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=428, Unknown=0, NotChecked=0, Total=600 [2018-04-07 02:05:30,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-04-07 02:05:30,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 114. [2018-04-07 02:05:30,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-04-07 02:05:30,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2018-04-07 02:05:30,526 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 49 [2018-04-07 02:05:30,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:05:30,526 INFO L459 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2018-04-07 02:05:30,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-07 02:05:30,527 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2018-04-07 02:05:30,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-07 02:05:30,527 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:05:30,527 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:05:30,528 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-04-07 02:05:30,528 INFO L82 PathProgramCache]: Analyzing trace with hash 2131954809, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:05:30,534 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:05:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:05:30,550 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:05:30,573 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-04-07 02:05:30,574 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:05:30,600 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-04-07 02:05:30,635 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-07 02:05:30,635 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2018-04-07 02:05:30,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-07 02:05:30,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-07 02:05:30,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-04-07 02:05:30,636 INFO L87 Difference]: Start difference. First operand 114 states and 120 transitions. Second operand 9 states. [2018-04-07 02:05:30,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:05:30,689 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2018-04-07 02:05:30,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-07 02:05:30,690 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-04-07 02:05:30,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:05:30,691 INFO L225 Difference]: With dead ends: 129 [2018-04-07 02:05:30,691 INFO L226 Difference]: Without dead ends: 128 [2018-04-07 02:05:30,692 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2018-04-07 02:05:30,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-04-07 02:05:30,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 113. [2018-04-07 02:05:30,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-04-07 02:05:30,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-04-07 02:05:30,698 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 51 [2018-04-07 02:05:30,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:05:30,698 INFO L459 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-04-07 02:05:30,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-07 02:05:30,699 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-04-07 02:05:30,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-07 02:05:30,699 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:05:30,699 INFO L355 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:05:30,699 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-04-07 02:05:30,700 INFO L82 PathProgramCache]: Analyzing trace with hash -2093893696, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:05:30,705 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:05:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:05:30,720 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:05:30,738 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-04-07 02:05:30,738 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:05:30,757 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-04-07 02:05:30,791 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:05:30,791 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-04-07 02:05:30,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-07 02:05:30,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-07 02:05:30,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-04-07 02:05:30,792 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 8 states. [2018-04-07 02:05:30,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:05:30,880 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2018-04-07 02:05:30,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-07 02:05:30,881 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2018-04-07 02:05:30,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:05:30,881 INFO L225 Difference]: With dead ends: 161 [2018-04-07 02:05:30,882 INFO L226 Difference]: Without dead ends: 141 [2018-04-07 02:05:30,882 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-04-07 02:05:30,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-04-07 02:05:30,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 131. [2018-04-07 02:05:30,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-07 02:05:30,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 138 transitions. [2018-04-07 02:05:30,889 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 138 transitions. Word has length 59 [2018-04-07 02:05:30,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:05:30,889 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 138 transitions. [2018-04-07 02:05:30,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-07 02:05:30,889 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 138 transitions. [2018-04-07 02:05:30,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-04-07 02:05:30,890 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:05:30,890 INFO L355 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 5, 5, 5, 5, 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, 1] [2018-04-07 02:05:30,890 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-04-07 02:05:30,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1028363326, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:05:30,900 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:05:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:05:30,921 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:05:31,003 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 109 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-04-07 02:05:31,003 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:05:31,086 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 109 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-04-07 02:05:31,107 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:05:31,107 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 21 [2018-04-07 02:05:31,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-07 02:05:31,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-07 02:05:31,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2018-04-07 02:05:31,108 INFO L87 Difference]: Start difference. First operand 131 states and 138 transitions. Second operand 21 states. [2018-04-07 02:05:31,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:05:31,480 INFO L93 Difference]: Finished difference Result 264 states and 281 transitions. [2018-04-07 02:05:31,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-07 02:05:31,481 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 87 [2018-04-07 02:05:31,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:05:31,482 INFO L225 Difference]: With dead ends: 264 [2018-04-07 02:05:31,482 INFO L226 Difference]: Without dead ends: 185 [2018-04-07 02:05:31,483 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 149 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=303, Invalid=1029, Unknown=0, NotChecked=0, Total=1332 [2018-04-07 02:05:31,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-04-07 02:05:31,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2018-04-07 02:05:31,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-07 02:05:31,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 177 transitions. [2018-04-07 02:05:31,498 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 177 transitions. Word has length 87 [2018-04-07 02:05:31,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:05:31,498 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 177 transitions. [2018-04-07 02:05:31,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-07 02:05:31,499 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 177 transitions. [2018-04-07 02:05:31,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-07 02:05:31,505 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:05:31,506 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-04-07 02:05:31,506 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-04-07 02:05:31,506 INFO L82 PathProgramCache]: Analyzing trace with hash 953487774, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:05:31,512 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:05:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:05:31,536 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:05:31,623 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-04-07 02:05:31,623 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:05:31,717 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 40 proven. 8 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-04-07 02:05:31,738 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-07 02:05:31,738 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 13 [2018-04-07 02:05:31,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-07 02:05:31,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-07 02:05:31,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-04-07 02:05:31,740 INFO L87 Difference]: Start difference. First operand 168 states and 177 transitions. Second operand 13 states. [2018-04-07 02:05:31,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:05:31,866 INFO L93 Difference]: Finished difference Result 263 states and 277 transitions. [2018-04-07 02:05:31,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-07 02:05:31,866 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 99 [2018-04-07 02:05:31,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:05:31,868 INFO L225 Difference]: With dead ends: 263 [2018-04-07 02:05:31,868 INFO L226 Difference]: Without dead ends: 178 [2018-04-07 02:05:31,869 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-04-07 02:05:31,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-04-07 02:05:31,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 168. [2018-04-07 02:05:31,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-07 02:05:31,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 175 transitions. [2018-04-07 02:05:31,876 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 175 transitions. Word has length 99 [2018-04-07 02:05:31,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:05:31,877 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 175 transitions. [2018-04-07 02:05:31,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-07 02:05:31,877 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 175 transitions. [2018-04-07 02:05:31,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-04-07 02:05:31,877 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:05:31,878 INFO L355 BasicCegarLoop]: trace histogram [9, 7, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:05:31,878 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-04-07 02:05:31,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1291549120, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:05:31,884 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:05:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:05:31,917 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:05:31,963 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 166 proven. 2 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-04-07 02:05:31,963 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:05:32,056 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 166 proven. 2 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-04-07 02:05:32,077 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:05:32,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-04-07 02:05:32,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-07 02:05:32,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-07 02:05:32,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-04-07 02:05:32,078 INFO L87 Difference]: Start difference. First operand 168 states and 175 transitions. Second operand 16 states. [2018-04-07 02:05:32,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:05:32,297 INFO L93 Difference]: Finished difference Result 263 states and 274 transitions. [2018-04-07 02:05:32,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-07 02:05:32,298 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 116 [2018-04-07 02:05:32,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:05:32,299 INFO L225 Difference]: With dead ends: 263 [2018-04-07 02:05:32,299 INFO L226 Difference]: Without dead ends: 178 [2018-04-07 02:05:32,299 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 215 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2018-04-07 02:05:32,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-04-07 02:05:32,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 168. [2018-04-07 02:05:32,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-07 02:05:32,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 173 transitions. [2018-04-07 02:05:32,306 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 173 transitions. Word has length 116 [2018-04-07 02:05:32,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:05:32,306 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 173 transitions. [2018-04-07 02:05:32,306 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-07 02:05:32,306 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 173 transitions. [2018-04-07 02:05:32,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-04-07 02:05:32,307 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:05:32,307 INFO L355 BasicCegarLoop]: trace histogram [10, 8, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:05:32,307 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-04-07 02:05:32,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1374557231, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:05:32,314 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:05:32,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:05:32,345 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:05:32,481 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 216 proven. 13 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-04-07 02:05:32,481 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:05:32,698 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 216 proven. 13 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-04-07 02:05:32,733 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:05:32,733 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2018-04-07 02:05:32,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-07 02:05:32,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-07 02:05:32,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-04-07 02:05:32,734 INFO L87 Difference]: Start difference. First operand 168 states and 173 transitions. Second operand 18 states. [2018-04-07 02:05:32,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:05:32,959 INFO L93 Difference]: Finished difference Result 267 states and 275 transitions. [2018-04-07 02:05:32,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-07 02:05:32,959 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 125 [2018-04-07 02:05:32,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:05:32,960 INFO L225 Difference]: With dead ends: 267 [2018-04-07 02:05:32,961 INFO L226 Difference]: Without dead ends: 182 [2018-04-07 02:05:32,961 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 229 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2018-04-07 02:05:32,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-04-07 02:05:32,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 168. [2018-04-07 02:05:32,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-07 02:05:32,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 171 transitions. [2018-04-07 02:05:32,972 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 171 transitions. Word has length 125 [2018-04-07 02:05:32,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:05:32,973 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 171 transitions. [2018-04-07 02:05:32,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-07 02:05:32,973 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 171 transitions. [2018-04-07 02:05:32,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-04-07 02:05:32,975 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:05:32,975 INFO L355 BasicCegarLoop]: trace histogram [11, 9, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:05:32,975 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-04-07 02:05:32,975 INFO L82 PathProgramCache]: Analyzing trace with hash 685717856, now seen corresponding path program 4 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:05:32,984 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:05:33,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:05:33,021 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:05:33,057 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 166 proven. 36 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-04-07 02:05:33,057 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:05:33,137 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 166 proven. 36 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-04-07 02:05:33,159 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:05:33,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-04-07 02:05:33,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-07 02:05:33,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-07 02:05:33,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-04-07 02:05:33,160 INFO L87 Difference]: Start difference. First operand 168 states and 171 transitions. Second operand 16 states. [2018-04-07 02:05:33,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:05:33,436 INFO L93 Difference]: Finished difference Result 225 states and 235 transitions. [2018-04-07 02:05:33,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-07 02:05:33,437 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 134 [2018-04-07 02:05:33,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:05:33,438 INFO L225 Difference]: With dead ends: 225 [2018-04-07 02:05:33,439 INFO L226 Difference]: Without dead ends: 224 [2018-04-07 02:05:33,439 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=244, Invalid=626, Unknown=0, NotChecked=0, Total=870 [2018-04-07 02:05:33,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-04-07 02:05:33,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 203. [2018-04-07 02:05:33,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-04-07 02:05:33,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 213 transitions. [2018-04-07 02:05:33,450 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 213 transitions. Word has length 134 [2018-04-07 02:05:33,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:05:33,451 INFO L459 AbstractCegarLoop]: Abstraction has 203 states and 213 transitions. [2018-04-07 02:05:33,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-07 02:05:33,451 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 213 transitions. [2018-04-07 02:05:33,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-04-07 02:05:33,452 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:05:33,452 INFO L355 BasicCegarLoop]: trace histogram [11, 9, 9, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:05:33,452 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-04-07 02:05:33,453 INFO L82 PathProgramCache]: Analyzing trace with hash -217582720, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:05:33,472 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:05:33,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:05:33,500 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:05:33,503 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-04-07 02:05:33,503 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:05:33,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:05:33,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-07 02:05:33,667 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 181 proven. 39 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-04-07 02:05:33,667 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:05:33,886 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 181 proven. 39 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-04-07 02:05:33,919 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:05:33,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-04-07 02:05:33,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-07 02:05:33,920 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-07 02:05:33,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2018-04-07 02:05:33,921 INFO L87 Difference]: Start difference. First operand 203 states and 213 transitions. Second operand 23 states. [2018-04-07 02:05:34,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:05:34,691 INFO L93 Difference]: Finished difference Result 217 states and 227 transitions. [2018-04-07 02:05:34,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-07 02:05:34,691 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 135 [2018-04-07 02:05:34,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:05:34,693 INFO L225 Difference]: With dead ends: 217 [2018-04-07 02:05:34,693 INFO L226 Difference]: Without dead ends: 216 [2018-04-07 02:05:34,694 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 246 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=462, Invalid=1344, Unknown=0, NotChecked=0, Total=1806 [2018-04-07 02:05:34,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-04-07 02:05:34,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 204. [2018-04-07 02:05:34,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-04-07 02:05:34,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 211 transitions. [2018-04-07 02:05:34,704 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 211 transitions. Word has length 135 [2018-04-07 02:05:34,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:05:34,705 INFO L459 AbstractCegarLoop]: Abstraction has 204 states and 211 transitions. [2018-04-07 02:05:34,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-07 02:05:34,705 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 211 transitions. [2018-04-07 02:05:34,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-04-07 02:05:34,707 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:05:34,707 INFO L355 BasicCegarLoop]: trace histogram [11, 8, 8, 8, 8, 8, 8, 8, 8, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:05:34,707 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-04-07 02:05:34,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1552621568, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:05:34,720 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:05:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:05:34,764 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:05:34,879 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 209 proven. 33 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-04-07 02:05:34,879 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:05:35,059 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 209 proven. 33 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-04-07 02:05:35,081 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:05:35,081 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2018-04-07 02:05:35,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-07 02:05:35,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-07 02:05:35,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2018-04-07 02:05:35,082 INFO L87 Difference]: Start difference. First operand 204 states and 211 transitions. Second operand 24 states. [2018-04-07 02:05:35,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:05:35,545 INFO L93 Difference]: Finished difference Result 324 states and 337 transitions. [2018-04-07 02:05:35,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-07 02:05:35,545 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 153 [2018-04-07 02:05:35,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:05:35,546 INFO L225 Difference]: With dead ends: 324 [2018-04-07 02:05:35,547 INFO L226 Difference]: Without dead ends: 214 [2018-04-07 02:05:35,547 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 277 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=272, Invalid=1060, Unknown=0, NotChecked=0, Total=1332 [2018-04-07 02:05:35,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-04-07 02:05:35,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 204. [2018-04-07 02:05:35,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-04-07 02:05:35,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 210 transitions. [2018-04-07 02:05:35,556 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 210 transitions. Word has length 153 [2018-04-07 02:05:35,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:05:35,557 INFO L459 AbstractCegarLoop]: Abstraction has 204 states and 210 transitions. [2018-04-07 02:05:35,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-07 02:05:35,557 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 210 transitions. [2018-04-07 02:05:35,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-04-07 02:05:35,558 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:05:35,559 INFO L355 BasicCegarLoop]: trace histogram [12, 9, 9, 9, 9, 9, 9, 9, 9, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:05:35,559 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-04-07 02:05:35,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1121569229, now seen corresponding path program 4 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:05:35,569 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:05:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:05:35,616 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:05:35,665 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2018-04-07 02:05:35,665 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:05:35,736 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2018-04-07 02:05:35,765 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:05:35,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-04-07 02:05:35,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-07 02:05:35,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-07 02:05:35,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-04-07 02:05:35,766 INFO L87 Difference]: Start difference. First operand 204 states and 210 transitions. Second operand 16 states. [2018-04-07 02:05:35,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:05:35,909 INFO L93 Difference]: Finished difference Result 274 states and 288 transitions. [2018-04-07 02:05:35,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-07 02:05:35,909 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 162 [2018-04-07 02:05:35,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:05:35,911 INFO L225 Difference]: With dead ends: 274 [2018-04-07 02:05:35,911 INFO L226 Difference]: Without dead ends: 254 [2018-04-07 02:05:35,911 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=259, Invalid=497, Unknown=0, NotChecked=0, Total=756 [2018-04-07 02:05:35,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-04-07 02:05:35,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 244. [2018-04-07 02:05:35,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-04-07 02:05:35,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 254 transitions. [2018-04-07 02:05:35,920 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 254 transitions. Word has length 162 [2018-04-07 02:05:35,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:05:35,920 INFO L459 AbstractCegarLoop]: Abstraction has 244 states and 254 transitions. [2018-04-07 02:05:35,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-07 02:05:35,921 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 254 transitions. [2018-04-07 02:05:35,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-04-07 02:05:35,921 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:05:35,921 INFO L355 BasicCegarLoop]: trace histogram [15, 13, 12, 12, 12, 12, 12, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:05:35,921 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-04-07 02:05:35,922 INFO L82 PathProgramCache]: Analyzing trace with hash -703218656, now seen corresponding path program 5 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:05:35,931 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:05:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:05:35,970 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:05:36,122 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 552 proven. 18 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-04-07 02:05:36,122 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:05:36,361 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 552 proven. 18 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-04-07 02:05:36,395 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:05:36,395 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 27 [2018-04-07 02:05:36,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-07 02:05:36,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-07 02:05:36,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2018-04-07 02:05:36,396 INFO L87 Difference]: Start difference. First operand 244 states and 254 transitions. Second operand 27 states. [2018-04-07 02:05:36,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:05:36,992 INFO L93 Difference]: Finished difference Result 443 states and 463 transitions. [2018-04-07 02:05:36,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-07 02:05:36,993 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 170 [2018-04-07 02:05:36,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:05:36,995 INFO L225 Difference]: With dead ends: 443 [2018-04-07 02:05:36,995 INFO L226 Difference]: Without dead ends: 298 [2018-04-07 02:05:36,997 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 307 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=437, Invalid=1725, Unknown=0, NotChecked=0, Total=2162 [2018-04-07 02:05:36,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-04-07 02:05:37,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 290. [2018-04-07 02:05:37,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-04-07 02:05:37,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 299 transitions. [2018-04-07 02:05:37,011 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 299 transitions. Word has length 170 [2018-04-07 02:05:37,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:05:37,012 INFO L459 AbstractCegarLoop]: Abstraction has 290 states and 299 transitions. [2018-04-07 02:05:37,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-07 02:05:37,012 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 299 transitions. [2018-04-07 02:05:37,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-04-07 02:05:37,014 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:05:37,014 INFO L355 BasicCegarLoop]: trace histogram [20, 17, 16, 16, 16, 16, 16, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:05:37,014 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-04-07 02:05:37,014 INFO L82 PathProgramCache]: Analyzing trace with hash 533335951, now seen corresponding path program 6 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:05:37,025 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:05:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:05:37,092 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:05:37,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1317 backedges. 856 proven. 42 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2018-04-07 02:05:37,288 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:05:37,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1317 backedges. 856 proven. 42 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2018-04-07 02:05:37,520 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:05:37,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 33 [2018-04-07 02:05:37,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-07 02:05:37,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-07 02:05:37,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=887, Unknown=0, NotChecked=0, Total=1056 [2018-04-07 02:05:37,521 INFO L87 Difference]: Start difference. First operand 290 states and 299 transitions. Second operand 33 states. [2018-04-07 02:05:38,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:05:38,093 INFO L93 Difference]: Finished difference Result 491 states and 510 transitions. [2018-04-07 02:05:38,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-07 02:05:38,093 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 226 [2018-04-07 02:05:38,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:05:38,095 INFO L225 Difference]: With dead ends: 491 [2018-04-07 02:05:38,095 INFO L226 Difference]: Without dead ends: 356 [2018-04-07 02:05:38,096 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 411 SyntacticMatches, 9 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=640, Invalid=2782, Unknown=0, NotChecked=0, Total=3422 [2018-04-07 02:05:38,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-04-07 02:05:38,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 345. [2018-04-07 02:05:38,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-04-07 02:05:38,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 354 transitions. [2018-04-07 02:05:38,112 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 354 transitions. Word has length 226 [2018-04-07 02:05:38,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:05:38,113 INFO L459 AbstractCegarLoop]: Abstraction has 345 states and 354 transitions. [2018-04-07 02:05:38,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-07 02:05:38,113 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 354 transitions. [2018-04-07 02:05:38,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-04-07 02:05:38,115 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:05:38,115 INFO L355 BasicCegarLoop]: trace histogram [25, 21, 20, 20, 20, 20, 20, 20, 20, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:05:38,115 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-04-07 02:05:38,116 INFO L82 PathProgramCache]: Analyzing trace with hash 127486462, now seen corresponding path program 7 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:05:38,127 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:05:38,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:05:38,192 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:05:38,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2094 backedges. 1408 proven. 62 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2018-04-07 02:05:38,429 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:05:38,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2094 backedges. 1408 proven. 62 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2018-04-07 02:05:38,692 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:05:38,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 30 [2018-04-07 02:05:38,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-07 02:05:38,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-07 02:05:38,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=718, Unknown=0, NotChecked=0, Total=870 [2018-04-07 02:05:38,694 INFO L87 Difference]: Start difference. First operand 345 states and 354 transitions. Second operand 30 states. [2018-04-07 02:05:39,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:05:39,081 INFO L93 Difference]: Finished difference Result 496 states and 514 transitions. [2018-04-07 02:05:39,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-07 02:05:39,083 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 282 [2018-04-07 02:05:39,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:05:39,085 INFO L225 Difference]: With dead ends: 496 [2018-04-07 02:05:39,085 INFO L226 Difference]: Without dead ends: 355 [2018-04-07 02:05:39,086 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 527 SyntacticMatches, 9 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=426, Invalid=1830, Unknown=0, NotChecked=0, Total=2256 [2018-04-07 02:05:39,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-04-07 02:05:39,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 345. [2018-04-07 02:05:39,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-04-07 02:05:39,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 352 transitions. [2018-04-07 02:05:39,107 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 352 transitions. Word has length 282 [2018-04-07 02:05:39,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:05:39,108 INFO L459 AbstractCegarLoop]: Abstraction has 345 states and 352 transitions. [2018-04-07 02:05:39,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-07 02:05:39,108 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 352 transitions. [2018-04-07 02:05:39,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-04-07 02:05:39,110 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:05:39,110 INFO L355 BasicCegarLoop]: trace histogram [26, 22, 21, 21, 21, 21, 21, 21, 21, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:05:39,110 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-04-07 02:05:39,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1331374381, now seen corresponding path program 8 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:05:39,129 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:05:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:05:39,200 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:05:39,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2285 backedges. 1217 proven. 76 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-04-07 02:05:39,552 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:05:39,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2285 backedges. 1217 proven. 76 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-04-07 02:05:39,837 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:05:39,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 39 [2018-04-07 02:05:39,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-07 02:05:39,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-07 02:05:39,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1257, Unknown=0, NotChecked=0, Total=1482 [2018-04-07 02:05:39,838 INFO L87 Difference]: Start difference. First operand 345 states and 352 transitions. Second operand 39 states. [2018-04-07 02:05:40,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:05:40,756 INFO L93 Difference]: Finished difference Result 545 states and 560 transitions. [2018-04-07 02:05:40,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-07 02:05:40,756 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 291 [2018-04-07 02:05:40,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:05:40,758 INFO L225 Difference]: With dead ends: 545 [2018-04-07 02:05:40,758 INFO L226 Difference]: Without dead ends: 420 [2018-04-07 02:05:40,760 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 613 GetRequests, 533 SyntacticMatches, 11 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1134 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=881, Invalid=4089, Unknown=0, NotChecked=0, Total=4970 [2018-04-07 02:05:40,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2018-04-07 02:05:40,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 409. [2018-04-07 02:05:40,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-04-07 02:05:40,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 416 transitions. [2018-04-07 02:05:40,771 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 416 transitions. Word has length 291 [2018-04-07 02:05:40,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:05:40,772 INFO L459 AbstractCegarLoop]: Abstraction has 409 states and 416 transitions. [2018-04-07 02:05:40,772 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-07 02:05:40,772 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 416 transitions. [2018-04-07 02:05:40,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-04-07 02:05:40,774 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:05:40,774 INFO L355 BasicCegarLoop]: trace histogram [32, 27, 26, 26, 26, 26, 26, 26, 26, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:05:40,774 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-04-07 02:05:40,774 INFO L82 PathProgramCache]: Analyzing trace with hash 846927887, now seen corresponding path program 9 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:05:40,780 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:05:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:05:40,859 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:05:41,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3518 backedges. 2209 proven. 100 refuted. 0 times theorem prover too weak. 1209 trivial. 0 not checked. [2018-04-07 02:05:41,180 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:05:41,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3518 backedges. 2209 proven. 100 refuted. 0 times theorem prover too weak. 1209 trivial. 0 not checked. [2018-04-07 02:05:41,923 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:05:41,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 36 [2018-04-07 02:05:41,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-07 02:05:41,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-07 02:05:41,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1054, Unknown=0, NotChecked=0, Total=1260 [2018-04-07 02:05:41,925 INFO L87 Difference]: Start difference. First operand 409 states and 416 transitions. Second operand 36 states. [2018-04-07 02:05:42,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:05:42,609 INFO L93 Difference]: Finished difference Result 550 states and 563 transitions. [2018-04-07 02:05:42,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-07 02:05:42,609 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 356 [2018-04-07 02:05:42,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:05:42,612 INFO L225 Difference]: With dead ends: 550 [2018-04-07 02:05:42,612 INFO L226 Difference]: Without dead ends: 419 [2018-04-07 02:05:42,614 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 735 GetRequests, 667 SyntacticMatches, 11 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=614, Invalid=2808, Unknown=0, NotChecked=0, Total=3422 [2018-04-07 02:05:42,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-04-07 02:05:42,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 409. [2018-04-07 02:05:42,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-04-07 02:05:42,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 414 transitions. [2018-04-07 02:05:42,629 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 414 transitions. Word has length 356 [2018-04-07 02:05:42,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:05:42,630 INFO L459 AbstractCegarLoop]: Abstraction has 409 states and 414 transitions. [2018-04-07 02:05:42,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-07 02:05:42,630 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 414 transitions. [2018-04-07 02:05:42,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-04-07 02:05:42,632 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:05:42,633 INFO L355 BasicCegarLoop]: trace histogram [33, 28, 27, 27, 27, 27, 27, 27, 27, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:05:42,633 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-04-07 02:05:42,633 INFO L82 PathProgramCache]: Analyzing trace with hash -2067051550, now seen corresponding path program 10 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:05:42,642 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:05:42,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:05:42,735 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:05:43,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3765 backedges. 1635 proven. 120 refuted. 0 times theorem prover too weak. 2010 trivial. 0 not checked. [2018-04-07 02:05:43,337 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:05:43,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3765 backedges. 1635 proven. 120 refuted. 0 times theorem prover too weak. 2010 trivial. 0 not checked. [2018-04-07 02:05:43,703 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:05:43,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 45 [2018-04-07 02:05:43,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-07 02:05:43,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-07 02:05:43,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=1691, Unknown=0, NotChecked=0, Total=1980 [2018-04-07 02:05:43,705 INFO L87 Difference]: Start difference. First operand 409 states and 414 transitions. Second operand 45 states. [2018-04-07 02:05:44,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:05:44,633 INFO L93 Difference]: Finished difference Result 608 states and 619 transitions. [2018-04-07 02:05:44,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-07 02:05:44,634 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 365 [2018-04-07 02:05:44,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:05:44,637 INFO L225 Difference]: With dead ends: 608 [2018-04-07 02:05:44,637 INFO L226 Difference]: Without dead ends: 493 [2018-04-07 02:05:44,638 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 767 GetRequests, 673 SyntacticMatches, 13 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1619 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1160, Invalid=5646, Unknown=0, NotChecked=0, Total=6806 [2018-04-07 02:05:44,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2018-04-07 02:05:44,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 482. [2018-04-07 02:05:44,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-04-07 02:05:44,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 487 transitions. [2018-04-07 02:05:44,650 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 487 transitions. Word has length 365 [2018-04-07 02:05:44,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:05:44,650 INFO L459 AbstractCegarLoop]: Abstraction has 482 states and 487 transitions. [2018-04-07 02:05:44,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-07 02:05:44,651 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 487 transitions. [2018-04-07 02:05:44,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2018-04-07 02:05:44,652 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:05:44,653 INFO L355 BasicCegarLoop]: trace histogram [40, 34, 33, 33, 33, 33, 33, 33, 33, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:05:44,653 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-04-07 02:05:44,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1378878001, now seen corresponding path program 11 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:05:44,659 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:05:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:05:44,776 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:05:45,059 INFO L134 CoverageAnalysis]: Checked inductivity of 5613 backedges. 3236 proven. 147 refuted. 0 times theorem prover too weak. 2230 trivial. 0 not checked. [2018-04-07 02:05:45,059 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:05:45,563 INFO L134 CoverageAnalysis]: Checked inductivity of 5613 backedges. 3236 proven. 147 refuted. 0 times theorem prover too weak. 2230 trivial. 0 not checked. [2018-04-07 02:05:45,588 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:05:45,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 42 [2018-04-07 02:05:45,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-07 02:05:45,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-07 02:05:45,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=1454, Unknown=0, NotChecked=0, Total=1722 [2018-04-07 02:05:45,590 INFO L87 Difference]: Start difference. First operand 482 states and 487 transitions. Second operand 42 states. [2018-04-07 02:05:46,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:05:46,121 INFO L93 Difference]: Finished difference Result 617 states and 625 transitions. [2018-04-07 02:05:46,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-07 02:05:46,122 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 439 [2018-04-07 02:05:46,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:05:46,124 INFO L225 Difference]: With dead ends: 617 [2018-04-07 02:05:46,124 INFO L226 Difference]: Without dead ends: 496 [2018-04-07 02:05:46,126 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 906 GetRequests, 825 SyntacticMatches, 13 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1683 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=836, Invalid=3994, Unknown=0, NotChecked=0, Total=4830 [2018-04-07 02:05:46,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2018-04-07 02:05:46,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 482. [2018-04-07 02:05:46,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-04-07 02:05:46,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 485 transitions. [2018-04-07 02:05:46,139 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 485 transitions. Word has length 439 [2018-04-07 02:05:46,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:05:46,140 INFO L459 AbstractCegarLoop]: Abstraction has 482 states and 485 transitions. [2018-04-07 02:05:46,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-07 02:05:46,140 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 485 transitions. [2018-04-07 02:05:46,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2018-04-07 02:05:46,143 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:05:46,143 INFO L355 BasicCegarLoop]: trace histogram [41, 35, 34, 34, 34, 34, 34, 34, 34, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:05:46,144 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-04-07 02:05:46,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1656662016, now seen corresponding path program 12 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:05:46,155 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:05:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:05:46,280 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:05:46,653 INFO L134 CoverageAnalysis]: Checked inductivity of 5925 backedges. 1878 proven. 210 refuted. 0 times theorem prover too weak. 3837 trivial. 0 not checked. [2018-04-07 02:05:46,653 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:05:47,069 INFO L134 CoverageAnalysis]: Checked inductivity of 5925 backedges. 1878 proven. 210 refuted. 0 times theorem prover too weak. 3837 trivial. 0 not checked. [2018-04-07 02:05:47,091 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:05:47,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-04-07 02:05:47,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-07 02:05:47,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-07 02:05:47,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=818, Unknown=0, NotChecked=0, Total=992 [2018-04-07 02:05:47,093 INFO L87 Difference]: Start difference. First operand 482 states and 485 transitions. Second operand 32 states. [2018-04-07 02:05:48,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:05:48,346 INFO L93 Difference]: Finished difference Result 591 states and 609 transitions. [2018-04-07 02:05:48,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-07 02:05:48,347 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 448 [2018-04-07 02:05:48,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:05:48,349 INFO L225 Difference]: With dead ends: 591 [2018-04-07 02:05:48,349 INFO L226 Difference]: Without dead ends: 590 [2018-04-07 02:05:48,351 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 935 GetRequests, 871 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1096, Invalid=3194, Unknown=0, NotChecked=0, Total=4290 [2018-04-07 02:05:48,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2018-04-07 02:05:48,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 553. [2018-04-07 02:05:48,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2018-04-07 02:05:48,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 571 transitions. [2018-04-07 02:05:48,371 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 571 transitions. Word has length 448 [2018-04-07 02:05:48,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:05:48,372 INFO L459 AbstractCegarLoop]: Abstraction has 553 states and 571 transitions. [2018-04-07 02:05:48,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-07 02:05:48,372 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 571 transitions. [2018-04-07 02:05:48,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2018-04-07 02:05:48,375 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:05:48,375 INFO L355 BasicCegarLoop]: trace histogram [41, 35, 35, 34, 34, 34, 34, 34, 34, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:05:48,376 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-04-07 02:05:48,376 INFO L82 PathProgramCache]: Analyzing trace with hash -183084832, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:05:48,385 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:05:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:05:48,481 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:05:48,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-04-07 02:05:48,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:05:48,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:05:48,501 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-07 02:05:49,175 INFO L134 CoverageAnalysis]: Checked inductivity of 5959 backedges. 1935 proven. 217 refuted. 0 times theorem prover too weak. 3807 trivial. 0 not checked. [2018-04-07 02:05:49,175 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:05:49,683 INFO L134 CoverageAnalysis]: Checked inductivity of 5959 backedges. 1935 proven. 217 refuted. 0 times theorem prover too weak. 3807 trivial. 0 not checked. [2018-04-07 02:05:49,703 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:05:49,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 38 [2018-04-07 02:05:49,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-07 02:05:49,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-07 02:05:49,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1243, Unknown=0, NotChecked=0, Total=1482 [2018-04-07 02:05:49,705 INFO L87 Difference]: Start difference. First operand 553 states and 571 transitions. Second operand 39 states. [2018-04-07 02:05:52,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:05:52,181 INFO L93 Difference]: Finished difference Result 579 states and 597 transitions. [2018-04-07 02:05:52,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-07 02:05:52,182 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 449 [2018-04-07 02:05:52,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:05:52,183 INFO L225 Difference]: With dead ends: 579 [2018-04-07 02:05:52,183 INFO L226 Difference]: Without dead ends: 578 [2018-04-07 02:05:52,185 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 942 GetRequests, 850 SyntacticMatches, 11 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1416 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1574, Invalid=5232, Unknown=0, NotChecked=0, Total=6806 [2018-04-07 02:05:52,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2018-04-07 02:05:52,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 554. [2018-04-07 02:05:52,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-04-07 02:05:52,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 565 transitions. [2018-04-07 02:05:52,197 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 565 transitions. Word has length 449 [2018-04-07 02:05:52,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:05:52,197 INFO L459 AbstractCegarLoop]: Abstraction has 554 states and 565 transitions. [2018-04-07 02:05:52,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-07 02:05:52,198 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 565 transitions. [2018-04-07 02:05:52,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2018-04-07 02:05:52,199 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:05:52,200 INFO L355 BasicCegarLoop]: trace histogram [41, 34, 34, 34, 34, 34, 34, 34, 34, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:05:52,200 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-04-07 02:05:52,200 INFO L82 PathProgramCache]: Analyzing trace with hash -696734368, now seen corresponding path program 5 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:05:52,206 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:05:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:05:52,288 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:05:52,764 INFO L134 CoverageAnalysis]: Checked inductivity of 5959 backedges. 2111 proven. 203 refuted. 0 times theorem prover too weak. 3645 trivial. 0 not checked. [2018-04-07 02:05:52,764 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:05:53,315 INFO L134 CoverageAnalysis]: Checked inductivity of 5959 backedges. 2111 proven. 203 refuted. 0 times theorem prover too weak. 3645 trivial. 0 not checked. [2018-04-07 02:05:53,336 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:05:53,336 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 48 [2018-04-07 02:05:53,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-07 02:05:53,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-07 02:05:53,337 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=1918, Unknown=0, NotChecked=0, Total=2256 [2018-04-07 02:05:53,337 INFO L87 Difference]: Start difference. First operand 554 states and 565 transitions. Second operand 48 states. [2018-04-07 02:05:54,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:05:54,122 INFO L93 Difference]: Finished difference Result 746 states and 767 transitions. [2018-04-07 02:05:54,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-07 02:05:54,122 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 467 [2018-04-07 02:05:54,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:05:54,125 INFO L225 Difference]: With dead ends: 746 [2018-04-07 02:05:54,125 INFO L226 Difference]: Without dead ends: 564 [2018-04-07 02:05:54,126 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 967 GetRequests, 873 SyntacticMatches, 15 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2324 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1092, Invalid=5388, Unknown=0, NotChecked=0, Total=6480 [2018-04-07 02:05:54,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2018-04-07 02:05:54,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 554. [2018-04-07 02:05:54,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-04-07 02:05:54,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 564 transitions. [2018-04-07 02:05:54,144 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 564 transitions. Word has length 467 [2018-04-07 02:05:54,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:05:54,145 INFO L459 AbstractCegarLoop]: Abstraction has 554 states and 564 transitions. [2018-04-07 02:05:54,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-07 02:05:54,145 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 564 transitions. [2018-04-07 02:05:54,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2018-04-07 02:05:54,149 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:05:54,149 INFO L355 BasicCegarLoop]: trace histogram [42, 35, 35, 35, 35, 35, 35, 35, 35, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:05:54,149 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-04-07 02:05:54,150 INFO L82 PathProgramCache]: Analyzing trace with hash 777455725, now seen corresponding path program 6 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:05:54,161 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:05:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:05:54,291 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:05:54,589 INFO L134 CoverageAnalysis]: Checked inductivity of 6279 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 6055 trivial. 0 not checked. [2018-04-07 02:05:54,590 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:05:54,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6279 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 6055 trivial. 0 not checked. [2018-04-07 02:05:54,962 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:05:54,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-04-07 02:05:54,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-07 02:05:54,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-07 02:05:54,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=720, Unknown=0, NotChecked=0, Total=992 [2018-04-07 02:05:54,964 INFO L87 Difference]: Start difference. First operand 554 states and 564 transitions. Second operand 32 states. [2018-04-07 02:05:55,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:05:55,460 INFO L93 Difference]: Finished difference Result 664 states and 690 transitions. [2018-04-07 02:05:55,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-07 02:05:55,460 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 476 [2018-04-07 02:05:55,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:05:55,462 INFO L225 Difference]: With dead ends: 664 [2018-04-07 02:05:55,462 INFO L226 Difference]: Without dead ends: 644 [2018-04-07 02:05:55,463 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 979 GetRequests, 921 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1155, Invalid=2385, Unknown=0, NotChecked=0, Total=3540 [2018-04-07 02:05:55,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2018-04-07 02:05:55,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 634. [2018-04-07 02:05:55,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2018-04-07 02:05:55,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 652 transitions. [2018-04-07 02:05:55,485 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 652 transitions. Word has length 476 [2018-04-07 02:05:55,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:05:55,486 INFO L459 AbstractCegarLoop]: Abstraction has 634 states and 652 transitions. [2018-04-07 02:05:55,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-07 02:05:55,486 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 652 transitions. [2018-04-07 02:05:55,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2018-04-07 02:05:55,490 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:05:55,490 INFO L355 BasicCegarLoop]: trace histogram [49, 43, 42, 42, 42, 42, 42, 42, 42, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:05:55,490 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-04-07 02:05:55,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1893487232, now seen corresponding path program 13 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:05:55,501 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:05:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:05:55,614 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:05:56,185 INFO L134 CoverageAnalysis]: Checked inductivity of 8745 backedges. 4742 proven. 174 refuted. 0 times theorem prover too weak. 3829 trivial. 0 not checked. [2018-04-07 02:05:56,185 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:05:56,812 INFO L134 CoverageAnalysis]: Checked inductivity of 8745 backedges. 4742 proven. 174 refuted. 0 times theorem prover too weak. 3829 trivial. 0 not checked. [2018-04-07 02:05:56,844 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:05:56,845 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 51 [2018-04-07 02:05:56,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-07 02:05:56,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-07 02:05:56,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=2189, Unknown=0, NotChecked=0, Total=2550 [2018-04-07 02:05:56,846 INFO L87 Difference]: Start difference. First operand 634 states and 652 transitions. Second operand 51 states. [2018-04-07 02:05:57,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:05:57,983 INFO L93 Difference]: Finished difference Result 981 states and 1017 transitions. [2018-04-07 02:05:57,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-07 02:05:57,983 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 520 [2018-04-07 02:05:57,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:05:57,985 INFO L225 Difference]: With dead ends: 981 [2018-04-07 02:05:57,985 INFO L226 Difference]: Without dead ends: 724 [2018-04-07 02:05:57,987 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1083 GetRequests, 975 SyntacticMatches, 15 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2189 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1477, Invalid=7453, Unknown=0, NotChecked=0, Total=8930 [2018-04-07 02:05:57,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2018-04-07 02:05:58,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 716. [2018-04-07 02:05:58,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2018-04-07 02:05:58,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 733 transitions. [2018-04-07 02:05:58,002 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 733 transitions. Word has length 520 [2018-04-07 02:05:58,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:05:58,003 INFO L459 AbstractCegarLoop]: Abstraction has 716 states and 733 transitions. [2018-04-07 02:05:58,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-07 02:05:58,003 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 733 transitions. [2018-04-07 02:05:58,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2018-04-07 02:05:58,006 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:05:58,006 INFO L355 BasicCegarLoop]: trace histogram [58, 51, 50, 50, 50, 50, 50, 50, 50, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:05:58,006 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-04-07 02:05:58,007 INFO L82 PathProgramCache]: Analyzing trace with hash 2120268975, now seen corresponding path program 14 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:05:58,021 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:05:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:05:58,189 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:05:59,138 INFO L134 CoverageAnalysis]: Checked inductivity of 12372 backedges. 5938 proven. 238 refuted. 0 times theorem prover too weak. 6196 trivial. 0 not checked. [2018-04-07 02:05:59,139 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:05:59,728 INFO L134 CoverageAnalysis]: Checked inductivity of 12372 backedges. 5938 proven. 238 refuted. 0 times theorem prover too weak. 6196 trivial. 0 not checked. [2018-04-07 02:05:59,763 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:05:59,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 57 [2018-04-07 02:05:59,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-04-07 02:05:59,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-04-07 02:05:59,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=2751, Unknown=0, NotChecked=0, Total=3192 [2018-04-07 02:05:59,764 INFO L87 Difference]: Start difference. First operand 716 states and 733 transitions. Second operand 57 states. [2018-04-07 02:06:01,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:06:01,140 INFO L93 Difference]: Finished difference Result 1065 states and 1100 transitions. [2018-04-07 02:06:01,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-04-07 02:06:01,140 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 612 [2018-04-07 02:06:01,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:06:01,143 INFO L225 Difference]: With dead ends: 1065 [2018-04-07 02:06:01,144 INFO L226 Difference]: Without dead ends: 818 [2018-04-07 02:06:01,146 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1273 GetRequests, 1151 SyntacticMatches, 17 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2844 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1832, Invalid=9510, Unknown=0, NotChecked=0, Total=11342 [2018-04-07 02:06:01,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2018-04-07 02:06:01,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 807. [2018-04-07 02:06:01,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-04-07 02:06:01,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 824 transitions. [2018-04-07 02:06:01,178 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 824 transitions. Word has length 612 [2018-04-07 02:06:01,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:06:01,178 INFO L459 AbstractCegarLoop]: Abstraction has 807 states and 824 transitions. [2018-04-07 02:06:01,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-04-07 02:06:01,179 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 824 transitions. [2018-04-07 02:06:01,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2018-04-07 02:06:01,185 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:06:01,185 INFO L355 BasicCegarLoop]: trace histogram [67, 59, 58, 58, 58, 58, 58, 58, 58, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:06:01,185 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-04-07 02:06:01,186 INFO L82 PathProgramCache]: Analyzing trace with hash 754927454, now seen corresponding path program 15 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:06:01,224 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:06:01,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:06:01,382 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:06:01,971 INFO L134 CoverageAnalysis]: Checked inductivity of 16627 backedges. 9300 proven. 268 refuted. 0 times theorem prover too weak. 7059 trivial. 0 not checked. [2018-04-07 02:06:01,972 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:06:02,695 INFO L134 CoverageAnalysis]: Checked inductivity of 16627 backedges. 9300 proven. 268 refuted. 0 times theorem prover too weak. 7059 trivial. 0 not checked. [2018-04-07 02:06:02,719 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:06:02,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 54 [2018-04-07 02:06:02,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-04-07 02:06:02,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-04-07 02:06:02,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=416, Invalid=2446, Unknown=0, NotChecked=0, Total=2862 [2018-04-07 02:06:02,721 INFO L87 Difference]: Start difference. First operand 807 states and 824 transitions. Second operand 54 states. [2018-04-07 02:06:03,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:06:03,486 INFO L93 Difference]: Finished difference Result 1070 states and 1108 transitions. [2018-04-07 02:06:03,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-07 02:06:03,486 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 704 [2018-04-07 02:06:03,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:06:03,489 INFO L225 Difference]: With dead ends: 1070 [2018-04-07 02:06:03,489 INFO L226 Difference]: Without dead ends: 817 [2018-04-07 02:06:03,492 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1446 GetRequests, 1339 SyntacticMatches, 17 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3068 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1382, Invalid=6990, Unknown=0, NotChecked=0, Total=8372 [2018-04-07 02:06:03,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2018-04-07 02:06:03,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 807. [2018-04-07 02:06:03,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-04-07 02:06:03,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 822 transitions. [2018-04-07 02:06:03,518 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 822 transitions. Word has length 704 [2018-04-07 02:06:03,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:06:03,519 INFO L459 AbstractCegarLoop]: Abstraction has 807 states and 822 transitions. [2018-04-07 02:06:03,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-04-07 02:06:03,519 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 822 transitions. [2018-04-07 02:06:03,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 714 [2018-04-07 02:06:03,525 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:06:03,526 INFO L355 BasicCegarLoop]: trace histogram [68, 60, 59, 59, 59, 59, 59, 59, 59, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:06:03,526 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-04-07 02:06:03,526 INFO L82 PathProgramCache]: Analyzing trace with hash -67037325, now seen corresponding path program 16 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:06:03,541 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:06:03,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:06:03,683 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:06:04,356 INFO L134 CoverageAnalysis]: Checked inductivity of 17168 backedges. 7263 proven. 312 refuted. 0 times theorem prover too weak. 9593 trivial. 0 not checked. [2018-04-07 02:06:04,356 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:06:05,281 INFO L134 CoverageAnalysis]: Checked inductivity of 17168 backedges. 7263 proven. 312 refuted. 0 times theorem prover too weak. 9593 trivial. 0 not checked. [2018-04-07 02:06:05,306 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:06:05,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 63 [2018-04-07 02:06:05,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-04-07 02:06:05,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-04-07 02:06:05,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=529, Invalid=3377, Unknown=0, NotChecked=0, Total=3906 [2018-04-07 02:06:05,308 INFO L87 Difference]: Start difference. First operand 807 states and 822 transitions. Second operand 63 states. [2018-04-07 02:06:07,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:06:07,155 INFO L93 Difference]: Finished difference Result 1155 states and 1186 transitions. [2018-04-07 02:06:07,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-04-07 02:06:07,155 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 713 [2018-04-07 02:06:07,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:06:07,158 INFO L225 Difference]: With dead ends: 1155 [2018-04-07 02:06:07,158 INFO L226 Difference]: Without dead ends: 918 [2018-04-07 02:06:07,161 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1481 GetRequests, 1345 SyntacticMatches, 19 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3584 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2225, Invalid=11817, Unknown=0, NotChecked=0, Total=14042 [2018-04-07 02:06:07,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2018-04-07 02:06:07,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 907. [2018-04-07 02:06:07,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2018-04-07 02:06:07,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 922 transitions. [2018-04-07 02:06:07,188 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 922 transitions. Word has length 713 [2018-04-07 02:06:07,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:06:07,189 INFO L459 AbstractCegarLoop]: Abstraction has 907 states and 922 transitions. [2018-04-07 02:06:07,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-04-07 02:06:07,189 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 922 transitions. [2018-04-07 02:06:07,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 815 [2018-04-07 02:06:07,194 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:06:07,194 INFO L355 BasicCegarLoop]: trace histogram [78, 69, 68, 68, 68, 68, 68, 68, 68, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:06:07,194 INFO L408 AbstractCegarLoop]: === Iteration 35 === [__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-04-07 02:06:07,195 INFO L82 PathProgramCache]: Analyzing trace with hash 55904047, now seen corresponding path program 17 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:06:07,201 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:06:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:06:07,349 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:06:08,107 INFO L134 CoverageAnalysis]: Checked inductivity of 22749 backedges. 11903 proven. 342 refuted. 0 times theorem prover too weak. 10504 trivial. 0 not checked. [2018-04-07 02:06:08,108 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:06:09,098 INFO L134 CoverageAnalysis]: Checked inductivity of 22749 backedges. 11903 proven. 342 refuted. 0 times theorem prover too weak. 10504 trivial. 0 not checked. [2018-04-07 02:06:09,123 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:06:09,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 60 [2018-04-07 02:06:09,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-04-07 02:06:09,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-04-07 02:06:09,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=502, Invalid=3038, Unknown=0, NotChecked=0, Total=3540 [2018-04-07 02:06:09,125 INFO L87 Difference]: Start difference. First operand 907 states and 922 transitions. Second operand 60 states. [2018-04-07 02:06:10,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:06:10,133 INFO L93 Difference]: Finished difference Result 1160 states and 1193 transitions. [2018-04-07 02:06:10,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-07 02:06:10,133 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 814 [2018-04-07 02:06:10,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:06:10,136 INFO L225 Difference]: With dead ends: 1160 [2018-04-07 02:06:10,136 INFO L226 Difference]: Without dead ends: 917 [2018-04-07 02:06:10,138 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1671 GetRequests, 1551 SyntacticMatches, 19 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3915 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1706, Invalid=8800, Unknown=0, NotChecked=0, Total=10506 [2018-04-07 02:06:10,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2018-04-07 02:06:10,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 907. [2018-04-07 02:06:10,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2018-04-07 02:06:10,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 920 transitions. [2018-04-07 02:06:10,160 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 920 transitions. Word has length 814 [2018-04-07 02:06:10,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:06:10,160 INFO L459 AbstractCegarLoop]: Abstraction has 907 states and 920 transitions. [2018-04-07 02:06:10,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-04-07 02:06:10,160 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 920 transitions. [2018-04-07 02:06:10,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 824 [2018-04-07 02:06:10,165 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:06:10,166 INFO L355 BasicCegarLoop]: trace histogram [79, 70, 69, 69, 69, 69, 69, 69, 69, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:06:10,166 INFO L408 AbstractCegarLoop]: === Iteration 36 === [__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-04-07 02:06:10,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1331195198, now seen corresponding path program 18 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:06:10,179 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:06:10,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:06:10,332 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:06:11,206 INFO L134 CoverageAnalysis]: Checked inductivity of 23382 backedges. 8717 proven. 396 refuted. 0 times theorem prover too weak. 14269 trivial. 0 not checked. [2018-04-07 02:06:11,206 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:06:12,208 INFO L134 CoverageAnalysis]: Checked inductivity of 23382 backedges. 8717 proven. 396 refuted. 0 times theorem prover too weak. 14269 trivial. 0 not checked. [2018-04-07 02:06:12,235 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:06:12,235 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 69 [2018-04-07 02:06:12,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-04-07 02:06:12,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-04-07 02:06:12,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=625, Invalid=4067, Unknown=0, NotChecked=0, Total=4692 [2018-04-07 02:06:12,237 INFO L87 Difference]: Start difference. First operand 907 states and 920 transitions. Second operand 69 states. [2018-04-07 02:06:14,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:06:14,084 INFO L93 Difference]: Finished difference Result 1254 states and 1281 transitions. [2018-04-07 02:06:14,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-04-07 02:06:14,084 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 823 [2018-04-07 02:06:14,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:06:14,087 INFO L225 Difference]: With dead ends: 1254 [2018-04-07 02:06:14,087 INFO L226 Difference]: Without dead ends: 1027 [2018-04-07 02:06:14,088 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1707 GetRequests, 1557 SyntacticMatches, 21 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4409 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2656, Invalid=14374, Unknown=0, NotChecked=0, Total=17030 [2018-04-07 02:06:14,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2018-04-07 02:06:14,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 1016. [2018-04-07 02:06:14,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1016 states. [2018-04-07 02:06:14,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1029 transitions. [2018-04-07 02:06:14,111 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1029 transitions. Word has length 823 [2018-04-07 02:06:14,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:06:14,111 INFO L459 AbstractCegarLoop]: Abstraction has 1016 states and 1029 transitions. [2018-04-07 02:06:14,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-04-07 02:06:14,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1029 transitions. [2018-04-07 02:06:14,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 934 [2018-04-07 02:06:14,117 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:06:14,117 INFO L355 BasicCegarLoop]: trace histogram [90, 80, 79, 79, 79, 79, 79, 79, 79, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:06:14,117 INFO L408 AbstractCegarLoop]: === Iteration 37 === [__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-04-07 02:06:14,117 INFO L82 PathProgramCache]: Analyzing trace with hash 626041809, now seen corresponding path program 19 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:06:14,124 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:06:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:06:14,300 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:06:15,282 INFO L134 CoverageAnalysis]: Checked inductivity of 30556 backedges. 14912 proven. 425 refuted. 0 times theorem prover too weak. 15219 trivial. 0 not checked. [2018-04-07 02:06:15,282 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:06:16,474 INFO L134 CoverageAnalysis]: Checked inductivity of 30556 backedges. 14912 proven. 425 refuted. 0 times theorem prover too weak. 15219 trivial. 0 not checked. [2018-04-07 02:06:16,496 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:06:16,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 66 [2018-04-07 02:06:16,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-04-07 02:06:16,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-04-07 02:06:16,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=596, Invalid=3694, Unknown=0, NotChecked=0, Total=4290 [2018-04-07 02:06:16,498 INFO L87 Difference]: Start difference. First operand 1016 states and 1029 transitions. Second operand 66 states. [2018-04-07 02:06:17,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:06:17,790 INFO L93 Difference]: Finished difference Result 1259 states and 1287 transitions. [2018-04-07 02:06:17,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-04-07 02:06:17,791 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 933 [2018-04-07 02:06:17,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:06:17,793 INFO L225 Difference]: With dead ends: 1259 [2018-04-07 02:06:17,793 INFO L226 Difference]: Without dead ends: 1026 [2018-04-07 02:06:17,795 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1914 GetRequests, 1781 SyntacticMatches, 21 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4865 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2064, Invalid=10818, Unknown=0, NotChecked=0, Total=12882 [2018-04-07 02:06:17,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2018-04-07 02:06:17,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1016. [2018-04-07 02:06:17,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1016 states. [2018-04-07 02:06:17,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1027 transitions. [2018-04-07 02:06:17,813 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1027 transitions. Word has length 933 [2018-04-07 02:06:17,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:06:17,814 INFO L459 AbstractCegarLoop]: Abstraction has 1016 states and 1027 transitions. [2018-04-07 02:06:17,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-04-07 02:06:17,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1027 transitions. [2018-04-07 02:06:17,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 943 [2018-04-07 02:06:17,819 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:06:17,820 INFO L355 BasicCegarLoop]: trace histogram [91, 81, 80, 80, 80, 80, 80, 80, 80, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:06:17,820 INFO L408 AbstractCegarLoop]: === Iteration 38 === [__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-04-07 02:06:17,820 INFO L82 PathProgramCache]: Analyzing trace with hash -260764576, now seen corresponding path program 20 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:06:17,826 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:06:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:06:17,976 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:06:19,046 INFO L134 CoverageAnalysis]: Checked inductivity of 31290 backedges. 10300 proven. 490 refuted. 0 times theorem prover too weak. 20500 trivial. 0 not checked. [2018-04-07 02:06:19,046 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:06:20,252 INFO L134 CoverageAnalysis]: Checked inductivity of 31290 backedges. 10300 proven. 490 refuted. 0 times theorem prover too weak. 20500 trivial. 0 not checked. [2018-04-07 02:06:20,273 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:06:20,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 75 [2018-04-07 02:06:20,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-04-07 02:06:20,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-04-07 02:06:20,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=729, Invalid=4821, Unknown=0, NotChecked=0, Total=5550 [2018-04-07 02:06:20,275 INFO L87 Difference]: Start difference. First operand 1016 states and 1027 transitions. Second operand 75 states. [2018-04-07 02:06:22,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:06:22,545 INFO L93 Difference]: Finished difference Result 1362 states and 1385 transitions. [2018-04-07 02:06:22,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-04-07 02:06:22,545 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 942 [2018-04-07 02:06:22,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:06:22,548 INFO L225 Difference]: With dead ends: 1362 [2018-04-07 02:06:22,549 INFO L226 Difference]: Without dead ends: 1145 [2018-04-07 02:06:22,551 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1951 GetRequests, 1787 SyntacticMatches, 23 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5319 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3125, Invalid=17181, Unknown=0, NotChecked=0, Total=20306 [2018-04-07 02:06:22,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2018-04-07 02:06:22,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1134. [2018-04-07 02:06:22,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1134 states. [2018-04-07 02:06:22,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1145 transitions. [2018-04-07 02:06:22,574 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1145 transitions. Word has length 942 [2018-04-07 02:06:22,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:06:22,575 INFO L459 AbstractCegarLoop]: Abstraction has 1134 states and 1145 transitions. [2018-04-07 02:06:22,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-04-07 02:06:22,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1145 transitions. [2018-04-07 02:06:22,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1062 [2018-04-07 02:06:22,585 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:06:22,586 INFO L355 BasicCegarLoop]: trace histogram [103, 92, 91, 91, 91, 91, 91, 91, 91, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:06:22,586 INFO L408 AbstractCegarLoop]: === Iteration 39 === [__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-04-07 02:06:22,587 INFO L82 PathProgramCache]: Analyzing trace with hash -612071166, now seen corresponding path program 21 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:06:22,599 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:06:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:06:22,815 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:06:24,039 INFO L134 CoverageAnalysis]: Checked inductivity of 40351 backedges. 18354 proven. 517 refuted. 0 times theorem prover too weak. 21480 trivial. 0 not checked. [2018-04-07 02:06:24,039 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:06:25,442 INFO L134 CoverageAnalysis]: Checked inductivity of 40351 backedges. 18354 proven. 517 refuted. 0 times theorem prover too weak. 21480 trivial. 0 not checked. [2018-04-07 02:06:25,463 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:06:25,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 72 [2018-04-07 02:06:25,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-04-07 02:06:25,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-04-07 02:06:25,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=698, Invalid=4414, Unknown=0, NotChecked=0, Total=5112 [2018-04-07 02:06:25,465 INFO L87 Difference]: Start difference. First operand 1134 states and 1145 transitions. Second operand 72 states. [2018-04-07 02:06:26,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:06:26,772 INFO L93 Difference]: Finished difference Result 1367 states and 1390 transitions. [2018-04-07 02:06:26,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-04-07 02:06:26,773 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 1061 [2018-04-07 02:06:26,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:06:26,775 INFO L225 Difference]: With dead ends: 1367 [2018-04-07 02:06:26,776 INFO L226 Difference]: Without dead ends: 1144 [2018-04-07 02:06:26,777 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2175 GetRequests, 2029 SyntacticMatches, 23 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5918 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2456, Invalid=13044, Unknown=0, NotChecked=0, Total=15500 [2018-04-07 02:06:26,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2018-04-07 02:06:26,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1134. [2018-04-07 02:06:26,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1134 states. [2018-04-07 02:06:26,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1143 transitions. [2018-04-07 02:06:26,798 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1143 transitions. Word has length 1061 [2018-04-07 02:06:26,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:06:26,798 INFO L459 AbstractCegarLoop]: Abstraction has 1134 states and 1143 transitions. [2018-04-07 02:06:26,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-04-07 02:06:26,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1143 transitions. [2018-04-07 02:06:26,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1071 [2018-04-07 02:06:26,805 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:06:26,805 INFO L355 BasicCegarLoop]: trace histogram [104, 93, 92, 92, 92, 92, 92, 92, 92, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:06:26,805 INFO L408 AbstractCegarLoop]: === Iteration 40 === [__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-04-07 02:06:26,806 INFO L82 PathProgramCache]: Analyzing trace with hash -136221105, now seen corresponding path program 22 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:06:26,812 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:06:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:06:26,997 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:06:28,314 INFO L134 CoverageAnalysis]: Checked inductivity of 41195 backedges. 12012 proven. 594 refuted. 0 times theorem prover too weak. 28589 trivial. 0 not checked. [2018-04-07 02:06:28,314 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:06:29,761 INFO L134 CoverageAnalysis]: Checked inductivity of 41195 backedges. 12012 proven. 594 refuted. 0 times theorem prover too weak. 28589 trivial. 0 not checked. [2018-04-07 02:06:29,797 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:06:29,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 81 [2018-04-07 02:06:29,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-04-07 02:06:29,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-04-07 02:06:29,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=841, Invalid=5639, Unknown=0, NotChecked=0, Total=6480 [2018-04-07 02:06:29,799 INFO L87 Difference]: Start difference. First operand 1134 states and 1143 transitions. Second operand 81 states. [2018-04-07 02:06:32,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:06:32,954 INFO L93 Difference]: Finished difference Result 1479 states and 1498 transitions. [2018-04-07 02:06:32,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-04-07 02:06:32,954 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 1070 [2018-04-07 02:06:32,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:06:32,957 INFO L225 Difference]: With dead ends: 1479 [2018-04-07 02:06:32,957 INFO L226 Difference]: Without dead ends: 1272 [2018-04-07 02:06:32,958 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2213 GetRequests, 2035 SyntacticMatches, 25 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6314 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3632, Invalid=20238, Unknown=0, NotChecked=0, Total=23870 [2018-04-07 02:06:32,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2018-04-07 02:06:32,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 1261. [2018-04-07 02:06:32,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1261 states. [2018-04-07 02:06:32,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1270 transitions. [2018-04-07 02:06:32,980 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1270 transitions. Word has length 1070 [2018-04-07 02:06:32,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:06:32,980 INFO L459 AbstractCegarLoop]: Abstraction has 1261 states and 1270 transitions. [2018-04-07 02:06:32,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-04-07 02:06:32,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1270 transitions. [2018-04-07 02:06:32,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1199 [2018-04-07 02:06:32,988 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:06:32,988 INFO L355 BasicCegarLoop]: trace histogram [117, 105, 104, 104, 104, 104, 104, 104, 104, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:06:32,988 INFO L408 AbstractCegarLoop]: === Iteration 41 === [__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-04-07 02:06:32,989 INFO L82 PathProgramCache]: Analyzing trace with hash 931127358, now seen corresponding path program 23 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:06:32,994 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:06:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:06:33,202 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:06:34,505 INFO L134 CoverageAnalysis]: Checked inductivity of 52464 backedges. 22256 proven. 618 refuted. 0 times theorem prover too weak. 29590 trivial. 0 not checked. [2018-04-07 02:06:34,505 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:06:36,205 INFO L134 CoverageAnalysis]: Checked inductivity of 52464 backedges. 22256 proven. 618 refuted. 0 times theorem prover too weak. 29590 trivial. 0 not checked. [2018-04-07 02:06:36,239 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:06:36,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 78 [2018-04-07 02:06:36,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-04-07 02:06:36,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-04-07 02:06:36,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=808, Invalid=5198, Unknown=0, NotChecked=0, Total=6006 [2018-04-07 02:06:36,242 INFO L87 Difference]: Start difference. First operand 1261 states and 1270 transitions. Second operand 78 states. [2018-04-07 02:06:37,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:06:37,796 INFO L93 Difference]: Finished difference Result 1484 states and 1502 transitions. [2018-04-07 02:06:37,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-04-07 02:06:37,796 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 1198 [2018-04-07 02:06:37,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:06:37,799 INFO L225 Difference]: With dead ends: 1484 [2018-04-07 02:06:37,800 INFO L226 Difference]: Without dead ends: 1271 [2018-04-07 02:06:37,801 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2454 GetRequests, 2295 SyntacticMatches, 25 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7074 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2882, Invalid=15478, Unknown=0, NotChecked=0, Total=18360 [2018-04-07 02:06:37,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2018-04-07 02:06:37,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1261. [2018-04-07 02:06:37,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1261 states. [2018-04-07 02:06:37,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1268 transitions. [2018-04-07 02:06:37,824 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1268 transitions. Word has length 1198 [2018-04-07 02:06:37,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:06:37,825 INFO L459 AbstractCegarLoop]: Abstraction has 1261 states and 1268 transitions. [2018-04-07 02:06:37,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-04-07 02:06:37,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1268 transitions. [2018-04-07 02:06:37,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1208 [2018-04-07 02:06:37,833 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:06:37,833 INFO L355 BasicCegarLoop]: trace histogram [118, 106, 105, 105, 105, 105, 105, 105, 105, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:06:37,833 INFO L408 AbstractCegarLoop]: === Iteration 42 === [__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-04-07 02:06:37,833 INFO L82 PathProgramCache]: Analyzing trace with hash 485390995, now seen corresponding path program 24 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:06:37,839 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:06:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:06:38,037 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:06:39,480 INFO L134 CoverageAnalysis]: Checked inductivity of 53427 backedges. 13853 proven. 708 refuted. 0 times theorem prover too weak. 38866 trivial. 0 not checked. [2018-04-07 02:06:39,480 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:06:41,586 INFO L134 CoverageAnalysis]: Checked inductivity of 53427 backedges. 13853 proven. 708 refuted. 0 times theorem prover too weak. 38866 trivial. 0 not checked. [2018-04-07 02:06:41,608 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:06:41,609 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 87 [2018-04-07 02:06:41,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-04-07 02:06:41,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-04-07 02:06:41,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=961, Invalid=6521, Unknown=0, NotChecked=0, Total=7482 [2018-04-07 02:06:41,611 INFO L87 Difference]: Start difference. First operand 1261 states and 1268 transitions. Second operand 87 states. [2018-04-07 02:06:44,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:06:44,524 INFO L93 Difference]: Finished difference Result 1605 states and 1620 transitions. [2018-04-07 02:06:44,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-04-07 02:06:44,524 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 1207 [2018-04-07 02:06:44,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:06:44,528 INFO L225 Difference]: With dead ends: 1605 [2018-04-07 02:06:44,528 INFO L226 Difference]: Without dead ends: 1408 [2018-04-07 02:06:44,530 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2493 GetRequests, 2301 SyntacticMatches, 27 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7394 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4177, Invalid=23545, Unknown=0, NotChecked=0, Total=27722 [2018-04-07 02:06:44,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2018-04-07 02:06:44,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1397. [2018-04-07 02:06:44,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1397 states. [2018-04-07 02:06:44,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 1404 transitions. [2018-04-07 02:06:44,557 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 1404 transitions. Word has length 1207 [2018-04-07 02:06:44,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:06:44,559 INFO L459 AbstractCegarLoop]: Abstraction has 1397 states and 1404 transitions. [2018-04-07 02:06:44,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-04-07 02:06:44,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 1404 transitions. [2018-04-07 02:06:44,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1345 [2018-04-07 02:06:44,570 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:06:44,571 INFO L355 BasicCegarLoop]: trace histogram [132, 119, 118, 118, 118, 118, 118, 118, 118, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:06:44,571 INFO L408 AbstractCegarLoop]: === Iteration 43 === [__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-04-07 02:06:44,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1678850767, now seen corresponding path program 25 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:06:44,576 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:06:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:06:44,796 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:06:46,174 INFO L134 CoverageAnalysis]: Checked inductivity of 67252 backedges. 26645 proven. 728 refuted. 0 times theorem prover too weak. 39879 trivial. 0 not checked. [2018-04-07 02:06:46,175 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:06:47,845 INFO L134 CoverageAnalysis]: Checked inductivity of 67252 backedges. 26645 proven. 728 refuted. 0 times theorem prover too weak. 39879 trivial. 0 not checked. [2018-04-07 02:06:47,867 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:06:47,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 84 [2018-04-07 02:06:47,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-04-07 02:06:47,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-04-07 02:06:47,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=926, Invalid=6046, Unknown=0, NotChecked=0, Total=6972 [2018-04-07 02:06:47,870 INFO L87 Difference]: Start difference. First operand 1397 states and 1404 transitions. Second operand 84 states. [2018-04-07 02:06:49,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:06:49,208 INFO L93 Difference]: Finished difference Result 1610 states and 1623 transitions. [2018-04-07 02:06:49,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-04-07 02:06:49,208 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 1344 [2018-04-07 02:06:49,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:06:49,211 INFO L225 Difference]: With dead ends: 1610 [2018-04-07 02:06:49,211 INFO L226 Difference]: Without dead ends: 1407 [2018-04-07 02:06:49,213 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2751 GetRequests, 2579 SyntacticMatches, 27 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8333 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3342, Invalid=18120, Unknown=0, NotChecked=0, Total=21462 [2018-04-07 02:06:49,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2018-04-07 02:06:49,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1397. [2018-04-07 02:06:49,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1397 states. [2018-04-07 02:06:49,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 1402 transitions. [2018-04-07 02:06:49,238 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 1402 transitions. Word has length 1344 [2018-04-07 02:06:49,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:06:49,238 INFO L459 AbstractCegarLoop]: Abstraction has 1397 states and 1402 transitions. [2018-04-07 02:06:49,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-04-07 02:06:49,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 1402 transitions. [2018-04-07 02:06:49,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1354 [2018-04-07 02:06:49,248 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:06:49,248 INFO L355 BasicCegarLoop]: trace histogram [133, 120, 119, 119, 119, 119, 119, 119, 119, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:06:49,248 INFO L408 AbstractCegarLoop]: === Iteration 44 === [__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-04-07 02:06:49,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1294240990, now seen corresponding path program 26 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:06:49,254 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:06:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:06:49,470 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:06:51,069 INFO L134 CoverageAnalysis]: Checked inductivity of 68343 backedges. 15823 proven. 832 refuted. 0 times theorem prover too weak. 51688 trivial. 0 not checked. [2018-04-07 02:06:51,069 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:06:52,929 INFO L134 CoverageAnalysis]: Checked inductivity of 68343 backedges. 15823 proven. 832 refuted. 0 times theorem prover too weak. 51688 trivial. 0 not checked. [2018-04-07 02:06:52,951 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:06:52,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 93 [2018-04-07 02:06:52,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-04-07 02:06:52,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-04-07 02:06:52,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1089, Invalid=7467, Unknown=0, NotChecked=0, Total=8556 [2018-04-07 02:06:52,953 INFO L87 Difference]: Start difference. First operand 1397 states and 1402 transitions. Second operand 93 states. [2018-04-07 02:06:56,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:06:56,497 INFO L93 Difference]: Finished difference Result 1740 states and 1751 transitions. [2018-04-07 02:06:56,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-04-07 02:06:56,497 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 1353 [2018-04-07 02:06:56,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:06:56,501 INFO L225 Difference]: With dead ends: 1740 [2018-04-07 02:06:56,501 INFO L226 Difference]: Without dead ends: 1553 [2018-04-07 02:06:56,503 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2791 GetRequests, 2585 SyntacticMatches, 29 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8559 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=4760, Invalid=27102, Unknown=0, NotChecked=0, Total=31862 [2018-04-07 02:06:56,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1553 states. [2018-04-07 02:06:56,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1553 to 1542. [2018-04-07 02:06:56,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1542 states. [2018-04-07 02:06:56,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 1547 transitions. [2018-04-07 02:06:56,530 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 1547 transitions. Word has length 1353 [2018-04-07 02:06:56,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:06:56,531 INFO L459 AbstractCegarLoop]: Abstraction has 1542 states and 1547 transitions. [2018-04-07 02:06:56,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-04-07 02:06:56,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 1547 transitions. [2018-04-07 02:06:56,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1500 [2018-04-07 02:06:56,543 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:06:56,543 INFO L355 BasicCegarLoop]: trace histogram [148, 134, 133, 133, 133, 133, 133, 133, 133, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:06:56,543 INFO L408 AbstractCegarLoop]: === Iteration 45 === [__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-04-07 02:06:56,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1928009201, now seen corresponding path program 27 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:06:56,550 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:06:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:06:56,818 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:06:58,435 INFO L134 CoverageAnalysis]: Checked inductivity of 85099 backedges. 31548 proven. 847 refuted. 0 times theorem prover too weak. 52704 trivial. 0 not checked. [2018-04-07 02:06:58,435 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:07:00,901 INFO L134 CoverageAnalysis]: Checked inductivity of 85099 backedges. 31548 proven. 847 refuted. 0 times theorem prover too weak. 52704 trivial. 0 not checked. [2018-04-07 02:07:00,936 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:07:00,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 90 [2018-04-07 02:07:00,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-04-07 02:07:00,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-04-07 02:07:00,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1052, Invalid=6958, Unknown=0, NotChecked=0, Total=8010 [2018-04-07 02:07:00,938 INFO L87 Difference]: Start difference. First operand 1542 states and 1547 transitions. Second operand 90 states. [2018-04-07 02:07:02,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:07:02,846 INFO L93 Difference]: Finished difference Result 1749 states and 1757 transitions. [2018-04-07 02:07:02,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-04-07 02:07:02,846 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 1499 [2018-04-07 02:07:02,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:07:02,850 INFO L225 Difference]: With dead ends: 1749 [2018-04-07 02:07:02,851 INFO L226 Difference]: Without dead ends: 1556 [2018-04-07 02:07:02,853 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3066 GetRequests, 2881 SyntacticMatches, 29 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9695 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3836, Invalid=20970, Unknown=0, NotChecked=0, Total=24806 [2018-04-07 02:07:02,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2018-04-07 02:07:02,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1542. [2018-04-07 02:07:02,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1542 states. [2018-04-07 02:07:02,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 1545 transitions. [2018-04-07 02:07:02,885 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 1545 transitions. Word has length 1499 [2018-04-07 02:07:02,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:07:02,886 INFO L459 AbstractCegarLoop]: Abstraction has 1542 states and 1545 transitions. [2018-04-07 02:07:02,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-04-07 02:07:02,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 1545 transitions. [2018-04-07 02:07:02,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1509 [2018-04-07 02:07:02,904 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:07:02,905 INFO L355 BasicCegarLoop]: trace histogram [149, 135, 134, 134, 134, 134, 134, 134, 134, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:07:02,905 INFO L408 AbstractCegarLoop]: === Iteration 46 === [__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-04-07 02:07:02,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1918304704, now seen corresponding path program 28 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:07:02,911 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:07:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:07:03,222 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:07:04,367 INFO L134 CoverageAnalysis]: Checked inductivity of 86327 backedges. 16870 proven. 990 refuted. 0 times theorem prover too weak. 68467 trivial. 0 not checked. [2018-04-07 02:07:04,367 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:07:06,439 INFO L134 CoverageAnalysis]: Checked inductivity of 86327 backedges. 16870 proven. 990 refuted. 0 times theorem prover too weak. 68467 trivial. 0 not checked. [2018-04-07 02:07:06,469 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:07:06,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 63 [2018-04-07 02:07:06,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-07 02:07:06,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-07 02:07:06,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=606, Invalid=3426, Unknown=0, NotChecked=0, Total=4032 [2018-04-07 02:07:06,471 INFO L87 Difference]: Start difference. First operand 1542 states and 1545 transitions. Second operand 64 states. [2018-04-07 02:07:08,909 WARN L151 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 116 DAG size of output 12 [2018-04-07 02:07:11,590 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 60 DAG size of output 12 [2018-04-07 02:07:12,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:07:12,942 INFO L93 Difference]: Finished difference Result 1755 states and 1789 transitions. [2018-04-07 02:07:12,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-04-07 02:07:12,942 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 1508 [2018-04-07 02:07:12,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:07:12,946 INFO L225 Difference]: With dead ends: 1755 [2018-04-07 02:07:12,946 INFO L226 Difference]: Without dead ends: 1754 [2018-04-07 02:07:12,948 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3103 GetRequests, 2967 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3452 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=4624, Invalid=14282, Unknown=0, NotChecked=0, Total=18906 [2018-04-07 02:07:12,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2018-04-07 02:07:12,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1685. [2018-04-07 02:07:12,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1685 states. [2018-04-07 02:07:12,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 1719 transitions. [2018-04-07 02:07:12,987 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 1719 transitions. Word has length 1508 [2018-04-07 02:07:12,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:07:12,988 INFO L459 AbstractCegarLoop]: Abstraction has 1685 states and 1719 transitions. [2018-04-07 02:07:12,988 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-04-07 02:07:12,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 1719 transitions. [2018-04-07 02:07:12,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1510 [2018-04-07 02:07:13,000 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:07:13,000 INFO L355 BasicCegarLoop]: trace histogram [149, 135, 135, 134, 134, 134, 134, 134, 134, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:07:13,000 INFO L408 AbstractCegarLoop]: === Iteration 47 === [__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-04-07 02:07:13,001 INFO L82 PathProgramCache]: Analyzing trace with hash 662096544, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:07:13,006 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:07:13,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:07:13,310 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:07:13,324 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-04-07 02:07:13,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:07:13,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:07:13,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-07 02:07:17,364 INFO L134 CoverageAnalysis]: Checked inductivity of 86461 backedges. 17059 proven. 1005 refuted. 0 times theorem prover too weak. 68397 trivial. 0 not checked. [2018-04-07 02:07:17,364 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:07:19,914 INFO L134 CoverageAnalysis]: Checked inductivity of 86461 backedges. 17059 proven. 1005 refuted. 0 times theorem prover too weak. 68397 trivial. 0 not checked. [2018-04-07 02:07:19,935 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:07:19,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35] total 70 [2018-04-07 02:07:19,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-04-07 02:07:19,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-04-07 02:07:19,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=719, Invalid=4251, Unknown=0, NotChecked=0, Total=4970 [2018-04-07 02:07:19,938 INFO L87 Difference]: Start difference. First operand 1685 states and 1719 transitions. Second operand 71 states. [2018-04-07 02:07:23,621 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 124 DAG size of output 27 [2018-04-07 02:07:23,975 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 120 DAG size of output 26 [2018-04-07 02:07:24,298 WARN L151 SmtUtils]: Spent 192ms on a formula simplification. DAG size of input: 117 DAG size of output 27 [2018-04-07 02:07:24,832 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 113 DAG size of output 26 [2018-04-07 02:07:25,505 WARN L151 SmtUtils]: Spent 200ms on a formula simplification. DAG size of input: 106 DAG size of output 26 [2018-04-07 02:07:25,762 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 103 DAG size of output 27 [2018-04-07 02:07:26,130 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 99 DAG size of output 26 [2018-04-07 02:07:31,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:07:31,244 INFO L93 Difference]: Finished difference Result 1735 states and 1769 transitions. [2018-04-07 02:07:31,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-04-07 02:07:31,245 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 1509 [2018-04-07 02:07:31,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:07:31,251 INFO L225 Difference]: With dead ends: 1735 [2018-04-07 02:07:31,251 INFO L226 Difference]: Without dead ends: 1734 [2018-04-07 02:07:31,253 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3110 GetRequests, 2922 SyntacticMatches, 27 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5948 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=5718, Invalid=20688, Unknown=0, NotChecked=0, Total=26406 [2018-04-07 02:07:31,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2018-04-07 02:07:31,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1686. [2018-04-07 02:07:31,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1686 states. [2018-04-07 02:07:31,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 1705 transitions. [2018-04-07 02:07:31,287 INFO L78 Accepts]: Start accepts. Automaton has 1686 states and 1705 transitions. Word has length 1509 [2018-04-07 02:07:31,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:07:31,288 INFO L459 AbstractCegarLoop]: Abstraction has 1686 states and 1705 transitions. [2018-04-07 02:07:31,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-04-07 02:07:31,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 1705 transitions. [2018-04-07 02:07:31,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1528 [2018-04-07 02:07:31,299 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:07:31,300 INFO L355 BasicCegarLoop]: trace histogram [149, 134, 134, 134, 134, 134, 134, 134, 134, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:07:31,300 INFO L408 AbstractCegarLoop]: === Iteration 48 === [__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-04-07 02:07:31,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1513607392, now seen corresponding path program 7 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:07:31,308 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:07:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:07:31,564 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:07:33,473 INFO L134 CoverageAnalysis]: Checked inductivity of 86349 backedges. 17915 proven. 975 refuted. 0 times theorem prover too weak. 67459 trivial. 0 not checked. [2018-04-07 02:07:33,473 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:07:35,838 INFO L134 CoverageAnalysis]: Checked inductivity of 86349 backedges. 17915 proven. 975 refuted. 0 times theorem prover too weak. 67459 trivial. 0 not checked. [2018-04-07 02:07:35,871 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:07:35,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 96 [2018-04-07 02:07:35,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-04-07 02:07:35,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-04-07 02:07:35,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1186, Invalid=7934, Unknown=0, NotChecked=0, Total=9120 [2018-04-07 02:07:35,874 INFO L87 Difference]: Start difference. First operand 1686 states and 1705 transitions. Second operand 96 states. [2018-04-07 02:07:38,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:07:38,074 INFO L93 Difference]: Finished difference Result 2022 states and 2059 transitions. [2018-04-07 02:07:38,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-04-07 02:07:38,075 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 1527 [2018-04-07 02:07:38,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:07:38,079 INFO L225 Difference]: With dead ends: 2022 [2018-04-07 02:07:38,080 INFO L226 Difference]: Without dead ends: 1696 [2018-04-07 02:07:38,084 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3127 GetRequests, 2929 SyntacticMatches, 31 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11160 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4364, Invalid=24028, Unknown=0, NotChecked=0, Total=28392 [2018-04-07 02:07:38,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1696 states. [2018-04-07 02:07:38,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1696 to 1686. [2018-04-07 02:07:38,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1686 states. [2018-04-07 02:07:38,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 1704 transitions. [2018-04-07 02:07:38,128 INFO L78 Accepts]: Start accepts. Automaton has 1686 states and 1704 transitions. Word has length 1527 [2018-04-07 02:07:38,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:07:38,129 INFO L459 AbstractCegarLoop]: Abstraction has 1686 states and 1704 transitions. [2018-04-07 02:07:38,130 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-04-07 02:07:38,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 1704 transitions. [2018-04-07 02:07:38,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1537 [2018-04-07 02:07:38,146 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:07:38,147 INFO L355 BasicCegarLoop]: trace histogram [150, 135, 135, 135, 135, 135, 135, 135, 135, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:07:38,147 INFO L408 AbstractCegarLoop]: === Iteration 49 === [__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-04-07 02:07:38,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1627225773, now seen corresponding path program 8 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:07:38,162 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:07:38,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:07:38,450 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:07:39,421 INFO L134 CoverageAnalysis]: Checked inductivity of 87585 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 86505 trivial. 0 not checked. [2018-04-07 02:07:39,421 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:07:40,892 INFO L134 CoverageAnalysis]: Checked inductivity of 87585 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 86505 trivial. 0 not checked. [2018-04-07 02:07:40,914 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:07:40,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 64 [2018-04-07 02:07:40,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-07 02:07:40,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-07 02:07:40,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1056, Invalid=2976, Unknown=0, NotChecked=0, Total=4032 [2018-04-07 02:07:40,916 INFO L87 Difference]: Start difference. First operand 1686 states and 1704 transitions. Second operand 64 states. [2018-04-07 02:07:42,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:07:42,651 INFO L93 Difference]: Finished difference Result 1876 states and 1926 transitions. [2018-04-07 02:07:42,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-04-07 02:07:42,651 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 1536 [2018-04-07 02:07:42,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:07:42,658 INFO L225 Difference]: With dead ends: 1876 [2018-04-07 02:07:42,658 INFO L226 Difference]: Without dead ends: 1856 [2018-04-07 02:07:42,660 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3131 GetRequests, 3009 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3257 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=4867, Invalid=10385, Unknown=0, NotChecked=0, Total=15252 [2018-04-07 02:07:42,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1856 states. [2018-04-07 02:07:42,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1856 to 1846. [2018-04-07 02:07:42,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1846 states. [2018-04-07 02:07:42,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1846 states to 1846 states and 1880 transitions. [2018-04-07 02:07:42,711 INFO L78 Accepts]: Start accepts. Automaton has 1846 states and 1880 transitions. Word has length 1536 [2018-04-07 02:07:42,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:07:42,713 INFO L459 AbstractCegarLoop]: Abstraction has 1846 states and 1880 transitions. [2018-04-07 02:07:42,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-04-07 02:07:42,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 1880 transitions. [2018-04-07 02:07:42,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1653 [2018-04-07 02:07:42,736 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:07:42,737 INFO L355 BasicCegarLoop]: trace histogram [165, 151, 150, 150, 150, 150, 150, 150, 150, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:07:42,737 INFO L408 AbstractCegarLoop]: === Iteration 50 === [__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-04-07 02:07:42,737 INFO L82 PathProgramCache]: Analyzing trace with hash 777062720, now seen corresponding path program 29 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:07:42,758 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:07:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:07:43,093 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:07:45,214 INFO L134 CoverageAnalysis]: Checked inductivity of 107199 backedges. 37842 proven. 966 refuted. 0 times theorem prover too weak. 68391 trivial. 0 not checked. [2018-04-07 02:07:45,214 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:07:47,492 INFO L134 CoverageAnalysis]: Checked inductivity of 107199 backedges. 37842 proven. 966 refuted. 0 times theorem prover too weak. 68391 trivial. 0 not checked. [2018-04-07 02:07:47,515 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:07:47,515 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 99 [2018-04-07 02:07:47,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-04-07 02:07:47,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-04-07 02:07:47,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=8477, Unknown=0, NotChecked=0, Total=9702 [2018-04-07 02:07:47,517 INFO L87 Difference]: Start difference. First operand 1846 states and 1880 transitions. Second operand 99 states. [2018-04-07 02:07:51,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:07:51,351 INFO L93 Difference]: Finished difference Result 2489 states and 2557 transitions. [2018-04-07 02:07:51,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-04-07 02:07:51,351 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 1652 [2018-04-07 02:07:51,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:07:51,357 INFO L225 Difference]: With dead ends: 2489 [2018-04-07 02:07:51,357 INFO L226 Difference]: Without dead ends: 2008 [2018-04-07 02:07:51,366 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3395 GetRequests, 3175 SyntacticMatches, 31 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9809 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5381, Invalid=30909, Unknown=0, NotChecked=0, Total=36290 [2018-04-07 02:07:51,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2018-04-07 02:07:51,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 2000. [2018-04-07 02:07:51,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2000 states. [2018-04-07 02:07:51,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2000 states to 2000 states and 2033 transitions. [2018-04-07 02:07:51,421 INFO L78 Accepts]: Start accepts. Automaton has 2000 states and 2033 transitions. Word has length 1652 [2018-04-07 02:07:51,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:07:51,423 INFO L459 AbstractCegarLoop]: Abstraction has 2000 states and 2033 transitions. [2018-04-07 02:07:51,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-04-07 02:07:51,423 INFO L276 IsEmpty]: Start isEmpty. Operand 2000 states and 2033 transitions. [2018-04-07 02:07:51,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1817 [2018-04-07 02:07:51,444 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:07:51,445 INFO L355 BasicCegarLoop]: trace histogram [182, 167, 166, 166, 166, 166, 166, 166, 166, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:07:51,445 INFO L408 AbstractCegarLoop]: === Iteration 51 === [__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-04-07 02:07:51,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1708273681, now seen corresponding path program 30 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:07:51,462 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:07:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:07:51,830 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:07:54,285 INFO L134 CoverageAnalysis]: Checked inductivity of 130998 backedges. 42550 proven. 1110 refuted. 0 times theorem prover too weak. 87338 trivial. 0 not checked. [2018-04-07 02:07:54,286 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:07:57,196 INFO L134 CoverageAnalysis]: Checked inductivity of 130998 backedges. 42550 proven. 1110 refuted. 0 times theorem prover too weak. 87338 trivial. 0 not checked. [2018-04-07 02:07:57,230 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:07:57,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 105 [2018-04-07 02:07:57,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-04-07 02:07:57,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-04-07 02:07:57,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1369, Invalid=9551, Unknown=0, NotChecked=0, Total=10920 [2018-04-07 02:07:57,234 INFO L87 Difference]: Start difference. First operand 2000 states and 2033 transitions. Second operand 105 states. [2018-04-07 02:08:01,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:08:01,635 INFO L93 Difference]: Finished difference Result 2645 states and 2712 transitions. [2018-04-07 02:08:01,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-04-07 02:08:01,635 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 1816 [2018-04-07 02:08:01,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:08:01,666 INFO L225 Difference]: With dead ends: 2645 [2018-04-07 02:08:01,666 INFO L226 Difference]: Without dead ends: 2174 [2018-04-07 02:08:01,692 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3729 GetRequests, 3495 SyntacticMatches, 33 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11144 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=6040, Invalid=34966, Unknown=0, NotChecked=0, Total=41006 [2018-04-07 02:08:01,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2174 states. [2018-04-07 02:08:01,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2174 to 2163. [2018-04-07 02:08:01,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2163 states. [2018-04-07 02:08:01,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 2196 transitions. [2018-04-07 02:08:01,772 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 2196 transitions. Word has length 1816 [2018-04-07 02:08:01,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:08:01,774 INFO L459 AbstractCegarLoop]: Abstraction has 2163 states and 2196 transitions. [2018-04-07 02:08:01,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-04-07 02:08:01,774 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 2196 transitions. [2018-04-07 02:08:01,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1981 [2018-04-07 02:08:01,807 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:08:01,808 INFO L355 BasicCegarLoop]: trace histogram [199, 183, 182, 182, 182, 182, 182, 182, 182, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:08:01,808 INFO L408 AbstractCegarLoop]: === Iteration 52 === [__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-04-07 02:08:01,809 INFO L82 PathProgramCache]: Analyzing trace with hash -2068366562, now seen corresponding path program 31 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:08:01,836 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:08:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:08:02,236 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:08:04,904 INFO L134 CoverageAnalysis]: Checked inductivity of 157185 backedges. 65260 proven. 1112 refuted. 0 times theorem prover too weak. 90813 trivial. 0 not checked. [2018-04-07 02:08:04,904 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:08:05,018 WARN L148 SmtUtils]: Spent 104ms on a formula simplification that was a NOOP. DAG size: 91 [2018-04-07 02:08:07,999 INFO L134 CoverageAnalysis]: Checked inductivity of 157185 backedges. 65260 proven. 1112 refuted. 0 times theorem prover too weak. 90813 trivial. 0 not checked. [2018-04-07 02:08:08,022 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:08:08,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 102 [2018-04-07 02:08:08,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-04-07 02:08:08,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-04-07 02:08:08,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1328, Invalid=8974, Unknown=0, NotChecked=0, Total=10302 [2018-04-07 02:08:08,025 INFO L87 Difference]: Start difference. First operand 2163 states and 2196 transitions. Second operand 102 states. [2018-04-07 02:08:10,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:08:10,438 INFO L93 Difference]: Finished difference Result 2650 states and 2728 transitions. [2018-04-07 02:08:10,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-04-07 02:08:10,438 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 1980 [2018-04-07 02:08:10,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:08:10,443 INFO L225 Difference]: With dead ends: 2650 [2018-04-07 02:08:10,443 INFO L226 Difference]: Without dead ends: 2173 [2018-04-07 02:08:10,448 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4038 GetRequests, 3827 SyntacticMatches, 33 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12728 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4926, Invalid=27294, Unknown=0, NotChecked=0, Total=32220 [2018-04-07 02:08:10,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2173 states. [2018-04-07 02:08:10,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2173 to 2163. [2018-04-07 02:08:10,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2163 states. [2018-04-07 02:08:10,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 2194 transitions. [2018-04-07 02:08:10,489 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 2194 transitions. Word has length 1980 [2018-04-07 02:08:10,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:08:10,490 INFO L459 AbstractCegarLoop]: Abstraction has 2163 states and 2194 transitions. [2018-04-07 02:08:10,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-04-07 02:08:10,490 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 2194 transitions. [2018-04-07 02:08:10,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1990 [2018-04-07 02:08:10,510 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:08:10,511 INFO L355 BasicCegarLoop]: trace histogram [200, 184, 183, 183, 183, 183, 183, 183, 183, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:08:10,511 INFO L408 AbstractCegarLoop]: === Iteration 53 === [__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-04-07 02:08:10,511 INFO L82 PathProgramCache]: Analyzing trace with hash -544227405, now seen corresponding path program 32 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:08:10,517 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:08:10,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:08:10,872 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:08:13,674 INFO L134 CoverageAnalysis]: Checked inductivity of 158858 backedges. 47531 proven. 1264 refuted. 0 times theorem prover too weak. 110063 trivial. 0 not checked. [2018-04-07 02:08:13,674 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:08:16,720 INFO L134 CoverageAnalysis]: Checked inductivity of 158858 backedges. 47531 proven. 1264 refuted. 0 times theorem prover too weak. 110063 trivial. 0 not checked. [2018-04-07 02:08:16,742 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:08:16,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 111 [2018-04-07 02:08:16,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-04-07 02:08:16,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-04-07 02:08:16,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1521, Invalid=10689, Unknown=0, NotChecked=0, Total=12210 [2018-04-07 02:08:16,745 INFO L87 Difference]: Start difference. First operand 2163 states and 2194 transitions. Second operand 111 states. [2018-04-07 02:08:21,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:08:21,048 INFO L93 Difference]: Finished difference Result 2807 states and 2870 transitions. [2018-04-07 02:08:21,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-04-07 02:08:21,048 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 1989 [2018-04-07 02:08:21,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:08:21,052 INFO L225 Difference]: With dead ends: 2807 [2018-04-07 02:08:21,052 INFO L226 Difference]: Without dead ends: 2346 [2018-04-07 02:08:21,058 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4081 GetRequests, 3833 SyntacticMatches, 35 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12564 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=6737, Invalid=39273, Unknown=0, NotChecked=0, Total=46010 [2018-04-07 02:08:21,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2346 states. [2018-04-07 02:08:21,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2346 to 2335. [2018-04-07 02:08:21,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2335 states. [2018-04-07 02:08:21,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 2366 transitions. [2018-04-07 02:08:21,111 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 2366 transitions. Word has length 1989 [2018-04-07 02:08:21,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:08:21,112 INFO L459 AbstractCegarLoop]: Abstraction has 2335 states and 2366 transitions. [2018-04-07 02:08:21,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-04-07 02:08:21,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 2366 transitions. [2018-04-07 02:08:21,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2163 [2018-04-07 02:08:21,134 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:08:21,135 INFO L355 BasicCegarLoop]: trace histogram [218, 201, 200, 200, 200, 200, 200, 200, 200, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:08:21,135 INFO L408 AbstractCegarLoop]: === Iteration 54 === [__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-04-07 02:08:21,135 INFO L82 PathProgramCache]: Analyzing trace with hash -186196369, now seen corresponding path program 33 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:08:21,141 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:08:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:08:21,579 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:08:24,724 INFO L134 CoverageAnalysis]: Checked inductivity of 189407 backedges. 74491 proven. 1258 refuted. 0 times theorem prover too weak. 113658 trivial. 0 not checked. [2018-04-07 02:08:24,724 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:08:24,848 WARN L148 SmtUtils]: Spent 114ms on a formula simplification that was a NOOP. DAG size: 96 [2018-04-07 02:08:24,975 WARN L148 SmtUtils]: Spent 125ms on a formula simplification that was a NOOP. DAG size: 96 [2018-04-07 02:08:28,296 INFO L134 CoverageAnalysis]: Checked inductivity of 189407 backedges. 74491 proven. 1258 refuted. 0 times theorem prover too weak. 113658 trivial. 0 not checked. [2018-04-07 02:08:28,320 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:08:28,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 108 [2018-04-07 02:08:28,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-04-07 02:08:28,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-04-07 02:08:28,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1478, Invalid=10078, Unknown=0, NotChecked=0, Total=11556 [2018-04-07 02:08:28,323 INFO L87 Difference]: Start difference. First operand 2335 states and 2366 transitions. Second operand 108 states. [2018-04-07 02:08:30,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:08:30,944 INFO L93 Difference]: Finished difference Result 2812 states and 2885 transitions. [2018-04-07 02:08:30,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-04-07 02:08:30,944 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 2162 [2018-04-07 02:08:30,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:08:30,948 INFO L225 Difference]: With dead ends: 2812 [2018-04-07 02:08:30,949 INFO L226 Difference]: Without dead ends: 2345 [2018-04-07 02:08:30,955 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4407 GetRequests, 4183 SyntacticMatches, 35 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14399 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5522, Invalid=30768, Unknown=0, NotChecked=0, Total=36290 [2018-04-07 02:08:30,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2345 states. [2018-04-07 02:08:31,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2345 to 2335. [2018-04-07 02:08:31,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2335 states. [2018-04-07 02:08:31,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 2364 transitions. [2018-04-07 02:08:31,025 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 2364 transitions. Word has length 2162 [2018-04-07 02:08:31,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:08:31,026 INFO L459 AbstractCegarLoop]: Abstraction has 2335 states and 2364 transitions. [2018-04-07 02:08:31,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-04-07 02:08:31,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 2364 transitions. [2018-04-07 02:08:31,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2172 [2018-04-07 02:08:31,062 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:08:31,063 INFO L355 BasicCegarLoop]: trace histogram [219, 202, 201, 201, 201, 201, 201, 201, 201, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:08:31,063 INFO L408 AbstractCegarLoop]: === Iteration 55 === [__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-04-07 02:08:31,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1115965314, now seen corresponding path program 34 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:08:31,072 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:08:31,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:08:31,443 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:08:34,707 INFO L134 CoverageAnalysis]: Checked inductivity of 191244 backedges. 52785 proven. 1428 refuted. 0 times theorem prover too weak. 137031 trivial. 0 not checked. [2018-04-07 02:08:34,707 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:08:38,291 INFO L134 CoverageAnalysis]: Checked inductivity of 191244 backedges. 52785 proven. 1428 refuted. 0 times theorem prover too weak. 137031 trivial. 0 not checked. [2018-04-07 02:08:38,316 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:08:38,317 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 117 [2018-04-07 02:08:38,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-04-07 02:08:38,318 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-04-07 02:08:38,319 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1681, Invalid=11891, Unknown=0, NotChecked=0, Total=13572 [2018-04-07 02:08:38,319 INFO L87 Difference]: Start difference. First operand 2335 states and 2364 transitions. Second operand 117 states. [2018-04-07 02:08:43,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:08:43,504 INFO L93 Difference]: Finished difference Result 2978 states and 3037 transitions. [2018-04-07 02:08:43,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-04-07 02:08:43,505 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 2171 [2018-04-07 02:08:43,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:08:43,512 INFO L225 Difference]: With dead ends: 2978 [2018-04-07 02:08:43,512 INFO L226 Difference]: Without dead ends: 2527 [2018-04-07 02:08:43,522 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4451 GetRequests, 4189 SyntacticMatches, 37 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14069 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=7472, Invalid=43830, Unknown=0, NotChecked=0, Total=51302 [2018-04-07 02:08:43,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2527 states. [2018-04-07 02:08:43,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2527 to 2516. [2018-04-07 02:08:43,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2516 states. [2018-04-07 02:08:43,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2516 states to 2516 states and 2545 transitions. [2018-04-07 02:08:43,597 INFO L78 Accepts]: Start accepts. Automaton has 2516 states and 2545 transitions. Word has length 2171 [2018-04-07 02:08:43,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:08:43,599 INFO L459 AbstractCegarLoop]: Abstraction has 2516 states and 2545 transitions. [2018-04-07 02:08:43,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-04-07 02:08:43,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2516 states and 2545 transitions. [2018-04-07 02:08:43,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2354 [2018-04-07 02:08:43,640 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:08:43,641 INFO L355 BasicCegarLoop]: trace histogram [238, 220, 219, 219, 219, 219, 219, 219, 219, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:08:43,641 INFO L408 AbstractCegarLoop]: === Iteration 56 === [__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-04-07 02:08:43,642 INFO L82 PathProgramCache]: Analyzing trace with hash 686198289, now seen corresponding path program 35 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:08:43,650 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:08:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:08:44,086 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:08:47,638 INFO L134 CoverageAnalysis]: Checked inductivity of 226638 backedges. 84488 proven. 1413 refuted. 0 times theorem prover too weak. 140737 trivial. 0 not checked. [2018-04-07 02:08:47,638 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:08:47,749 WARN L148 SmtUtils]: Spent 104ms on a formula simplification that was a NOOP. DAG size: 101 [2018-04-07 02:08:47,950 WARN L148 SmtUtils]: Spent 105ms on a formula simplification that was a NOOP. DAG size: 103 [2018-04-07 02:08:51,621 INFO L134 CoverageAnalysis]: Checked inductivity of 226638 backedges. 84488 proven. 1413 refuted. 0 times theorem prover too weak. 140737 trivial. 0 not checked. [2018-04-07 02:08:51,646 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:08:51,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 114 [2018-04-07 02:08:51,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-04-07 02:08:51,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-04-07 02:08:51,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1636, Invalid=11246, Unknown=0, NotChecked=0, Total=12882 [2018-04-07 02:08:51,649 INFO L87 Difference]: Start difference. First operand 2516 states and 2545 transitions. Second operand 114 states. [2018-04-07 02:08:54,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:08:54,147 INFO L93 Difference]: Finished difference Result 2983 states and 3051 transitions. [2018-04-07 02:08:54,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-04-07 02:08:54,147 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 2353 [2018-04-07 02:08:54,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:08:54,152 INFO L225 Difference]: With dead ends: 2983 [2018-04-07 02:08:54,152 INFO L226 Difference]: Without dead ends: 2526 [2018-04-07 02:08:54,158 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4794 GetRequests, 4557 SyntacticMatches, 37 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16173 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6152, Invalid=34450, Unknown=0, NotChecked=0, Total=40602 [2018-04-07 02:08:54,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2526 states. [2018-04-07 02:08:54,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2526 to 2516. [2018-04-07 02:08:54,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2516 states. [2018-04-07 02:08:54,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2516 states to 2516 states and 2543 transitions. [2018-04-07 02:08:54,236 INFO L78 Accepts]: Start accepts. Automaton has 2516 states and 2543 transitions. Word has length 2353 [2018-04-07 02:08:54,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:08:54,238 INFO L459 AbstractCegarLoop]: Abstraction has 2516 states and 2543 transitions. [2018-04-07 02:08:54,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-04-07 02:08:54,238 INFO L276 IsEmpty]: Start isEmpty. Operand 2516 states and 2543 transitions. [2018-04-07 02:08:54,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2363 [2018-04-07 02:08:54,270 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:08:54,271 INFO L355 BasicCegarLoop]: trace histogram [239, 221, 220, 220, 220, 220, 220, 220, 220, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:08:54,271 INFO L408 AbstractCegarLoop]: === Iteration 57 === [__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-04-07 02:08:54,272 INFO L82 PathProgramCache]: Analyzing trace with hash -399307232, now seen corresponding path program 36 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:08:54,277 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:08:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:08:54,694 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:08:58,405 INFO L134 CoverageAnalysis]: Checked inductivity of 228648 backedges. 58312 proven. 1602 refuted. 0 times theorem prover too weak. 168734 trivial. 0 not checked. [2018-04-07 02:08:58,405 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:09:02,337 INFO L134 CoverageAnalysis]: Checked inductivity of 228648 backedges. 58312 proven. 1602 refuted. 0 times theorem prover too weak. 168734 trivial. 0 not checked. [2018-04-07 02:09:02,367 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:09:02,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 123 [2018-04-07 02:09:02,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-04-07 02:09:02,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-04-07 02:09:02,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1849, Invalid=13157, Unknown=0, NotChecked=0, Total=15006 [2018-04-07 02:09:02,370 INFO L87 Difference]: Start difference. First operand 2516 states and 2543 transitions. Second operand 123 states. [2018-04-07 02:09:08,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:09:08,034 INFO L93 Difference]: Finished difference Result 3158 states and 3213 transitions. [2018-04-07 02:09:08,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-04-07 02:09:08,034 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 2362 [2018-04-07 02:09:08,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:09:08,038 INFO L225 Difference]: With dead ends: 3158 [2018-04-07 02:09:08,039 INFO L226 Difference]: Without dead ends: 2717 [2018-04-07 02:09:08,044 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4839 GetRequests, 4563 SyntacticMatches, 39 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15659 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=8245, Invalid=48637, Unknown=0, NotChecked=0, Total=56882 [2018-04-07 02:09:08,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2717 states. [2018-04-07 02:09:08,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2717 to 2706. [2018-04-07 02:09:08,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2706 states. [2018-04-07 02:09:08,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 2733 transitions. [2018-04-07 02:09:08,122 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 2733 transitions. Word has length 2362 [2018-04-07 02:09:08,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:09:08,123 INFO L459 AbstractCegarLoop]: Abstraction has 2706 states and 2733 transitions. [2018-04-07 02:09:08,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-04-07 02:09:08,124 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 2733 transitions. [2018-04-07 02:09:08,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2554 [2018-04-07 02:09:08,158 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:09:08,159 INFO L355 BasicCegarLoop]: trace histogram [259, 240, 239, 239, 239, 239, 239, 239, 239, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:09:08,159 INFO L408 AbstractCegarLoop]: === Iteration 58 === [__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-04-07 02:09:08,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1101515714, now seen corresponding path program 37 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:09:08,166 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:09:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:09:08,643 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:09:12,708 INFO L134 CoverageAnalysis]: Checked inductivity of 269397 backedges. 95278 proven. 1577 refuted. 0 times theorem prover too weak. 172542 trivial. 0 not checked. [2018-04-07 02:09:12,708 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:09:12,822 WARN L148 SmtUtils]: Spent 107ms on a formula simplification that was a NOOP. DAG size: 106 [2018-04-07 02:09:12,924 WARN L148 SmtUtils]: Spent 100ms on a formula simplification that was a NOOP. DAG size: 106 [2018-04-07 02:09:13,028 WARN L148 SmtUtils]: Spent 102ms on a formula simplification that was a NOOP. DAG size: 108 [2018-04-07 02:09:13,133 WARN L148 SmtUtils]: Spent 103ms on a formula simplification that was a NOOP. DAG size: 108 [2018-04-07 02:09:17,306 INFO L134 CoverageAnalysis]: Checked inductivity of 269397 backedges. 95278 proven. 1577 refuted. 0 times theorem prover too weak. 172542 trivial. 0 not checked. [2018-04-07 02:09:17,331 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:09:17,331 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 120 [2018-04-07 02:09:17,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-04-07 02:09:17,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-04-07 02:09:17,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1802, Invalid=12478, Unknown=0, NotChecked=0, Total=14280 [2018-04-07 02:09:17,334 INFO L87 Difference]: Start difference. First operand 2706 states and 2733 transitions. Second operand 120 states. [2018-04-07 02:09:20,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:09:20,593 INFO L93 Difference]: Finished difference Result 3163 states and 3226 transitions. [2018-04-07 02:09:20,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-04-07 02:09:20,593 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 2553 [2018-04-07 02:09:20,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:09:20,596 INFO L225 Difference]: With dead ends: 3163 [2018-04-07 02:09:20,596 INFO L226 Difference]: Without dead ends: 2716 [2018-04-07 02:09:20,601 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5199 GetRequests, 4949 SyntacticMatches, 39 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18050 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6816, Invalid=38340, Unknown=0, NotChecked=0, Total=45156 [2018-04-07 02:09:20,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2018-04-07 02:09:20,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 2706. [2018-04-07 02:09:20,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2706 states. [2018-04-07 02:09:20,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 2731 transitions. [2018-04-07 02:09:20,676 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 2731 transitions. Word has length 2553 [2018-04-07 02:09:20,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:09:20,678 INFO L459 AbstractCegarLoop]: Abstraction has 2706 states and 2731 transitions. [2018-04-07 02:09:20,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-04-07 02:09:20,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 2731 transitions. [2018-04-07 02:09:20,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2563 [2018-04-07 02:09:20,728 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:09:20,729 INFO L355 BasicCegarLoop]: trace histogram [260, 241, 240, 240, 240, 240, 240, 240, 240, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:09:20,729 INFO L408 AbstractCegarLoop]: === Iteration 59 === [__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-04-07 02:09:20,730 INFO L82 PathProgramCache]: Analyzing trace with hash 2135795599, now seen corresponding path program 38 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:09:20,738 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy Received shutdown request... [2018-04-07 02:09:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:09:21,201 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:09:21,204 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-07 02:09:21,205 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-07 02:09:21,208 WARN L197 ceAbstractionStarter]: Timeout [2018-04-07 02:09:21,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 02:09:21 BasicIcfg [2018-04-07 02:09:21,208 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-07 02:09:21,209 INFO L168 Benchmark]: Toolchain (without parser) took 237336.89 ms. Allocated memory was 303.0 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 246.1 MB in the beginning and 1.6 GB in the end (delta: -1.3 GB). Peak memory consumption was 674.6 MB. Max. memory is 5.3 GB. [2018-04-07 02:09:21,210 INFO L168 Benchmark]: CDTParser took 2.86 ms. Allocated memory is still 303.0 MB. Free memory is still 265.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-07 02:09:21,210 INFO L168 Benchmark]: CACSL2BoogieTranslator took 224.99 ms. Allocated memory is still 303.0 MB. Free memory was 246.1 MB in the beginning and 235.9 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-04-07 02:09:21,210 INFO L168 Benchmark]: Boogie Preprocessor took 49.18 ms. Allocated memory is still 303.0 MB. Free memory was 235.9 MB in the beginning and 233.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-04-07 02:09:21,210 INFO L168 Benchmark]: RCFGBuilder took 393.25 ms. Allocated memory was 303.0 MB in the beginning and 465.6 MB in the end (delta: 162.5 MB). Free memory was 233.8 MB in the beginning and 432.2 MB in the end (delta: -198.4 MB). Peak memory consumption was 23.3 MB. Max. memory is 5.3 GB. [2018-04-07 02:09:21,211 INFO L168 Benchmark]: IcfgTransformer took 2525.31 ms. Allocated memory was 465.6 MB in the beginning and 520.1 MB in the end (delta: 54.5 MB). Free memory was 432.2 MB in the beginning and 405.6 MB in the end (delta: 26.6 MB). Peak memory consumption was 81.1 MB. Max. memory is 5.3 GB. [2018-04-07 02:09:21,211 INFO L168 Benchmark]: TraceAbstraction took 234138.39 ms. Allocated memory was 520.1 MB in the beginning and 2.3 GB in the end (delta: 1.8 GB). Free memory was 405.6 MB in the beginning and 1.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 617.1 MB. Max. memory is 5.3 GB. [2018-04-07 02:09:21,213 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.86 ms. Allocated memory is still 303.0 MB. Free memory is still 265.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 224.99 ms. Allocated memory is still 303.0 MB. Free memory was 246.1 MB in the beginning and 235.9 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 49.18 ms. Allocated memory is still 303.0 MB. Free memory was 235.9 MB in the beginning and 233.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 393.25 ms. Allocated memory was 303.0 MB in the beginning and 465.6 MB in the end (delta: 162.5 MB). Free memory was 233.8 MB in the beginning and 432.2 MB in the end (delta: -198.4 MB). Peak memory consumption was 23.3 MB. Max. memory is 5.3 GB. * IcfgTransformer took 2525.31 ms. Allocated memory was 465.6 MB in the beginning and 520.1 MB in the end (delta: 54.5 MB). Free memory was 432.2 MB in the beginning and 405.6 MB in the end (delta: 26.6 MB). Peak memory consumption was 81.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 234138.39 ms. Allocated memory was 520.1 MB in the beginning and 2.3 GB in the end (delta: 1.8 GB). Free memory was 405.6 MB in the beginning and 1.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 617.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 60 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 390 LocStat_NO_SUPPORTING_DISEQUALITIES : 108 LocStat_NO_DISJUNCTIONS : -120 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 74 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 56 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 75 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 670.32 RENAME_VARIABLES(MILLISECONDS) : 109.59 UNFREEZE(MILLISECONDS) : 0.00 CONJOIN(MILLISECONDS) : 658.11 PROJECTAWAY(MILLISECONDS) : 490.65 ADD_WEAK_EQUALITY(MILLISECONDS) : 6.93 DISJOIN(MILLISECONDS) : 31.49 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 121.70 ADD_EQUALITY(MILLISECONDS) : 9.81 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.00 ADD_DISEQUALITY(MILLISECONDS) : 0.23 #CONJOIN_DISJUNCTIVE : 201 #RENAME_VARIABLES : 424 #UNFREEZE : 0 #CONJOIN : 261 #PROJECTAWAY : 305 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 34 #RENAME_VARIABLES_DISJUNCTIVE : 420 #ADD_EQUALITY : 56 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 - StatisticsResult: WeqCcManagerStatistics FREEZE(MILLISECONDS) : 971.41 ADDNODE(MILLISECONDS) : 0.00 MEET(MILLISECONDS) : 653.52 FILTERREDUNDANT(MILLISECONDS) : 0.00 REPORTWEQ(MILLISECONDS) : 6.80 JOIN(MILLISECONDS) : 29.20 RENAMEVARS(MILLISECONDS) : 103.17 FLATTENLABELS(MILLISECONDS) : 0.00 COPY(MILLISECONDS) : 0.00 ISSTRONGERTHAN(MILLISECONDS) : 737.29 ISLABELSTRONGERTHAN(MILLISECONDS) : 78.17 ISWEQGRAPHSTRONGERTHAN(MILLISECONDS) : 12.08 UNFREEZE(MILLISECONDS) : 23.52 REPORTCONTAINS(MILLISECONDS) : 0.32 PROJECTAWAY(MILLISECONDS) : 424.90 MEETEDGELABELS(MILLISECONDS) : 76.78 REPORTEQUALITY(MILLISECONDS) : 202.67 ADDALLNODES(MILLISECONDS) : 128.27 REPORTDISEQUALITY(MILLISECONDS) : 1.93 WEQGRAPHJOIN(MILLISECONDS) : 5.10 #FREEZE : 1337 #ADDNODE : 0 #MEET : 166 #FILTERREDUNDANT : 0 #REPORTWEQ : 7 #JOIN : 34 #RENAMEVARS : 424 #FLATTENLABELS : 0 #COPY : 0 #ISSTRONGERTHAN : 367 #ISLABELSTRONGERTHAN : 2930 #ISWEQGRAPHSTRONGERTHAN : 110 #UNFREEZE : 954 #REPORTCONTAINS : 9 #PROJECTAWAY : 364 #MEETEDGELABELS : 589 #REPORTEQUALITY : 1150 #ADDALLNODES : 166 #REPORTDISEQUALITY : 307 #WEQGRAPHJOIN : 34 - StatisticsResult: CcManagerStatistics ADDNODE(MILLISECONDS) : 0.00 MEET(MILLISECONDS) : 392.31 REPORT_EQUALITY(MILLISECONDS) : 110.44 FILTERREDUNDANT(MILLISECONDS) : 359.01 ADD_ALL_ELEMENTS(MILLISECONDS) : 62.07 JOIN(MILLISECONDS) : 19.70 ALIGN_ELEMENTS(MILLISECONDS) : 87.75 COPY(MILLISECONDS) : 0.00 REPORT_DISEQUALITY(MILLISECONDS) : 40.87 UNFREEZE(MILLISECONDS) : 0.00 OVERALL(MILLISECONDS) : 787.24 REPORTCONTAINS(MILLISECONDS) : 4.41 IS_STRONGER_THAN_NO_CACHING(MILLISECONDS) : 163.82 REMOVE(MILLISECONDS) : 0.00 IS_STRONGER_THAN_W_CACHING(MILLISECONDS) : 0.00 PROJECT_TO_ELEMENTS(MILLISECONDS) : 169.87 #ADDNODE : 0 #MEET : 1591 #REPORT_EQUALITY : 8632 #FILTERREDUNDANT : 9360 #ADD_ALL_ELEMENTS : 3108 #JOIN : 34 #ALIGN_ELEMENTS : 681 #COPY : 0 #REPORT_DISEQUALITY : 3645 #UNFREEZE : 0 #OVERALL : 36633 #REPORTCONTAINS : 170 #IS_STRONGER_THAN_NO_CACHING : 7684 #REMOVE : 0 #IS_STRONGER_THAN_W_CACHING : 0 #PROJECT_TO_ELEMENTS : 1728 * 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 analyzing trace of length 2563 with TraceHistMax 260, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was analyzing trace of length 2563 with TraceHistMax 260, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was analyzing trace of length 2563 with TraceHistMax 260, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 30). Cancelled while BasicCegarLoop was analyzing trace of length 2563 with TraceHistMax 260, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 23). Cancelled while BasicCegarLoop was analyzing trace of length 2563 with TraceHistMax 260, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 27). Cancelled while BasicCegarLoop was analyzing trace of length 2563 with TraceHistMax 260, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 61 locations, 6 error locations. TIMEOUT Result, 234.0s OverallTime, 59 OverallIterations, 260 TraceHistogramMax, 97.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4879 SDtfs, 18328 SDslu, 63703 SDs, 0 SdLazy, 66550 SolverSat, 4603 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93034 GetRequests, 86771 SyntacticMatches, 848 SemanticMatches, 5415 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246120 ImplicationChecksByTransitivity, 123.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2706occurred in iteration=57, 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.4s AutomataMinimizationTime, 58 MinimizatonAttempts, 776 StatesRemovedByMinimization, 57 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.7s SsaConstructionTime, 6.5s SatisfiabilityAnalysisTime, 123.6s InterpolantComputationTime, 45269 NumberOfCodeBlocks, 45269 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 90422 ConstructedInterpolants, 1579 QuantifiedInterpolants, 241643656 SizeOfPredicates, 1789 NumberOfNonLiveVariables, 82224 ConjunctsInSsa, 2060 ConjunctsInUnsatCore, 116 InterpolantComputations, 15 PerfectInterpolantSequences, 5196392/5246124 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_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-04-07_02-09-21-227.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_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-04-07_02-09-21-227.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_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-04-07_02-09-21-227.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_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-1-2018-04-07_02-09-21-227.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_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-2-2018-04-07_02-09-21-227.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_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-04-07_02-09-21-227.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_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-07_02-09-21-227.csv Completed graceful shutdown