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/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cf7e2d-m [2018-03-29 23:48:35,979 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-03-29 23:48:35,980 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-03-29 23:48:35,994 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-03-29 23:48:35,994 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-03-29 23:48:35,995 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-03-29 23:48:35,996 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-03-29 23:48:35,998 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-03-29 23:48:36,000 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-03-29 23:48:36,001 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-03-29 23:48:36,002 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-03-29 23:48:36,002 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-03-29 23:48:36,003 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-03-29 23:48:36,004 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-03-29 23:48:36,005 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-03-29 23:48:36,007 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-03-29 23:48:36,010 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-03-29 23:48:36,011 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-03-29 23:48:36,013 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-03-29 23:48:36,014 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-03-29 23:48:36,016 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-03-29 23:48:36,016 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-03-29 23:48:36,017 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-03-29 23:48:36,018 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-03-29 23:48:36,018 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-03-29 23:48:36,020 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-03-29 23:48:36,020 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-03-29 23:48:36,021 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-03-29 23:48:36,021 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-03-29 23:48:36,022 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-03-29 23:48:36,022 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-03-29 23:48:36,023 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-03-29 23:48:36,047 INFO L110 SettingsManager]: Loading preferences was successful [2018-03-29 23:48:36,048 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-03-29 23:48:36,048 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-03-29 23:48:36,048 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-03-29 23:48:36,049 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-03-29 23:48:36,049 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-03-29 23:48:36,049 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-03-29 23:48:36,049 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-03-29 23:48:36,049 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-03-29 23:48:36,050 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-03-29 23:48:36,050 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-03-29 23:48:36,050 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-03-29 23:48:36,050 INFO L133 SettingsManager]: * sizeof long=4 [2018-03-29 23:48:36,050 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-03-29 23:48:36,051 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-03-29 23:48:36,051 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-03-29 23:48:36,051 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-03-29 23:48:36,051 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-03-29 23:48:36,051 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-03-29 23:48:36,051 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-03-29 23:48:36,051 INFO L133 SettingsManager]: * sizeof long double=12 [2018-03-29 23:48:36,052 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-03-29 23:48:36,052 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-03-29 23:48:36,052 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-03-29 23:48:36,052 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-03-29 23:48:36,053 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-29 23:48:36,053 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-03-29 23:48:36,053 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-03-29 23:48:36,053 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-03-29 23:48:36,053 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-03-29 23:48:36,053 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-03-29 23:48:36,053 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 23:48:36,054 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-03-29 23:48:36,054 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-03-29 23:48:36,055 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-03-29 23:48:36,055 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-03-29 23:48:36,055 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-03-29 23:48:36,086 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-03-29 23:48:36,096 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-03-29 23:48:36,099 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-03-29 23:48:36,100 INFO L271 PluginConnector]: Initializing CDTParser... [2018-03-29 23:48:36,101 INFO L276 PluginConnector]: CDTParser initialized [2018-03-29 23:48:36,102 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2018-03-29 23:48:36,428 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG95657e873 [2018-03-29 23:48:36,538 INFO L287 CDTParser]: IsIndexed: true [2018-03-29 23:48:36,538 INFO L288 CDTParser]: Found 1 translation units. [2018-03-29 23:48:36,539 INFO L168 CDTParser]: Scanning ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2018-03-29 23:48:36,540 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-03-29 23:48:36,540 INFO L215 ultiparseSymbolTable]: [2018-03-29 23:48:36,540 INFO L218 ultiparseSymbolTable]: Function table: [2018-03-29 23:48:36,540 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo ('foo') in ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2018-03-29 23:48:36,541 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2018-03-29 23:48:36,541 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-03-29 23:48:36,541 INFO L233 ultiparseSymbolTable]: [2018-03-29 23:48:36,556 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG95657e873 [2018-03-29 23:48:36,561 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-03-29 23:48:36,565 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-03-29 23:48:36,567 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-03-29 23:48:36,567 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-03-29 23:48:36,574 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-03-29 23:48:36,575 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 11:48:36" (1/1) ... [2018-03-29 23:48:36,578 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f281dbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 11:48:36, skipping insertion in model container [2018-03-29 23:48:36,578 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 11:48:36" (1/1) ... [2018-03-29 23:48:36,592 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-29 23:48:36,605 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-29 23:48:36,743 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-29 23:48:36,769 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-29 23:48:36,773 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-03-29 23:48:36,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 11:48:36 WrapperNode [2018-03-29 23:48:36,784 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-03-29 23:48:36,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-03-29 23:48:36,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-03-29 23:48:36,785 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-03-29 23:48:36,800 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 11:48:36" (1/1) ... [2018-03-29 23:48:36,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 11:48:36" (1/1) ... [2018-03-29 23:48:36,811 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 11:48:36" (1/1) ... [2018-03-29 23:48:36,811 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 11:48:36" (1/1) ... [2018-03-29 23:48:36,816 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 11:48:36" (1/1) ... [2018-03-29 23:48:36,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 11:48:36" (1/1) ... [2018-03-29 23:48:36,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 11:48:36" (1/1) ... [2018-03-29 23:48:36,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-03-29 23:48:36,825 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-03-29 23:48:36,825 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-03-29 23:48:36,825 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-03-29 23:48:36,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 11:48:36" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-29 23:48:36,888 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-03-29 23:48:36,888 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-03-29 23:48:36,888 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo [2018-03-29 23:48:36,888 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-03-29 23:48:36,889 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo [2018-03-29 23:48:36,889 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-03-29 23:48:36,889 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-03-29 23:48:36,889 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-03-29 23:48:36,889 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-03-29 23:48:36,889 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-03-29 23:48:36,889 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-03-29 23:48:36,890 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-03-29 23:48:36,890 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-03-29 23:48:37,163 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-03-29 23:48:37,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 11:48:37 BoogieIcfgContainer [2018-03-29 23:48:37,163 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-03-29 23:48:37,164 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-03-29 23:48:37,164 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-03-29 23:48:37,165 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-03-29 23:48:37,167 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 11:48:37" (1/1) ... [2018-03-29 23:48:37,177 INFO L139 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-03-29 23:48:37,177 INFO L140 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-03-29 23:48:37,192 INFO L298 apSepIcfgTransformer]: Heap separator: starting memloc-array-style preprocessing [2018-03-29 23:48:37,200 INFO L333 apSepIcfgTransformer]: finished MemlocArrayUpdater, created 0 location literals (each corresponds to one heap write) [2018-03-29 23:48:37,206 INFO L393 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-03-29 23:48:37,206 DEBUG L397 apSepIcfgTransformer]: storeIndexInfoToLocLiteral: Map: [2018-03-29 23:48:37,208 DEBUG L399 apSepIcfgTransformer]: edgeToIndexToStoreIndexInfo: NestedMap2: [2018-03-29 23:48:37,259 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-03-29 23:48:44,007 INFO L314 AbstractInterpreter]: Visited 68 different actions 294 times. Merged at 47 different actions 153 times. Never widened. Found 19 fixpoints after 8 different actions. Largest state had 21 variables. [2018-03-29 23:48:44,009 INFO L405 apSepIcfgTransformer]: finished equality analysis [2018-03-29 23:48:44,017 INFO L195 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 1 [2018-03-29 23:48:44,017 INFO L415 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-03-29 23:48:44,018 INFO L416 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-03-29 23:48:44,018 INFO L418 apSepIcfgTransformer]: select infos: Set: ((select (select |v_#memory_int_1| v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_2) (+ v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_6 v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_2)), at (SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0 * 1, 1); srcloc: L16')) [2018-03-29 23:48:44,021 DEBUG L379 HeapPartitionManager]: creating LocationBlock locs_30 [2018-03-29 23:48:44,022 DEBUG L380 HeapPartitionManager]: with contents [NoStoreIndexInfo] [2018-03-29 23:48:44,022 DEBUG L329 HeapPartitionManager]: adding LocationBlock locs_30 [2018-03-29 23:48:44,022 DEBUG L330 HeapPartitionManager]: at dimension 0 for ((select (select |v_#memory_int_1| v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_2) (+ v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_6 v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_2)), at (SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0 * 1, 1); srcloc: L16')) [2018-03-29 23:48:44,022 DEBUG L331 HeapPartitionManager]: write locations: [NoStoreIndexInfo] [2018-03-29 23:48:44,022 DEBUG L379 HeapPartitionManager]: creating LocationBlock locs_30 [2018-03-29 23:48:44,022 DEBUG L380 HeapPartitionManager]: with contents [NoStoreIndexInfo] [2018-03-29 23:48:44,023 DEBUG L329 HeapPartitionManager]: adding LocationBlock locs_30 [2018-03-29 23:48:44,023 DEBUG L330 HeapPartitionManager]: at dimension 1 for ((select (select |v_#memory_int_1| v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_2) (+ v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_6 v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_2)), at (SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0 * 1, 1); srcloc: L16')) [2018-03-29 23:48:44,023 DEBUG L331 HeapPartitionManager]: write locations: [NoStoreIndexInfo] [2018-03-29 23:48:44,023 INFO L336 HeapPartitionManager]: partitioning result: [2018-03-29 23:48:44,023 INFO L341 HeapPartitionManager]: location blocks for array group [#memory_int] [2018-03-29 23:48:44,023 INFO L350 HeapPartitionManager]: at dimension 0 [2018-03-29 23:48:44,023 INFO L351 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-03-29 23:48:44,024 INFO L352 HeapPartitionManager]: # location blocks :1 [2018-03-29 23:48:44,024 DEBUG L359 HeapPartitionManager]: location block contents: [2018-03-29 23:48:44,024 DEBUG L362 HeapPartitionManager]: [NoStoreIndexInfo] [2018-03-29 23:48:44,024 INFO L350 HeapPartitionManager]: at dimension 1 [2018-03-29 23:48:44,024 INFO L351 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-03-29 23:48:44,024 INFO L352 HeapPartitionManager]: # location blocks :1 [2018-03-29 23:48:44,024 DEBUG L359 HeapPartitionManager]: location block contents: [2018-03-29 23:48:44,024 DEBUG L362 HeapPartitionManager]: [NoStoreIndexInfo] [2018-03-29 23:48:44,025 INFO L124 ransitionTransformer]: executing heap partitioning transformation [2018-03-29 23:48:44,028 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,028 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-03-29 23:48:44,028 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,028 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,029 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,029 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-03-29 23:48:44,029 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,029 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,030 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,030 DEBUG L259 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-03-29 23:48:44,030 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,030 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,030 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,031 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-03-29 23:48:44,031 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,031 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,031 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,031 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{main_~i~1=v_main_~i~1_8} AuxVars[] AssignedVars[main_~i~1] [2018-03-29 23:48:44,032 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,032 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,032 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,032 DEBUG L259 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-03-29 23:48:44,033 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,033 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,033 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,033 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{main_~b~0=v_main_~b~0_3} AuxVars[] AssignedVars[main_~b~0] [2018-03-29 23:48:44,033 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,033 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,034 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,034 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-03-29 23:48:44,034 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,034 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,035 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,035 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{main_~buffer~0=v_main_~buffer~0_1} AuxVars[] AssignedVars[main_~buffer~0] [2018-03-29 23:48:44,035 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,035 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,035 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,035 DEBUG L259 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-03-29 23:48:44,035 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,036 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,036 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,036 DEBUG L259 ransitionTransformer]: Formula: (= v_main_~i~1_9 0) InVars {} OutVars{main_~i~1=v_main_~i~1_9} AuxVars[] AssignedVars[main_~i~1] [2018-03-29 23:48:44,036 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,036 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,036 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,036 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-03-29 23:48:44,036 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,037 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,037 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,037 DEBUG L259 ransitionTransformer]: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-03-29 23:48:44,037 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,037 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,037 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,038 DEBUG L259 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-03-29 23:48:44,038 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,038 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,038 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,038 DEBUG L259 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-03-29 23:48:44,038 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,038 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,038 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,039 DEBUG L259 ransitionTransformer]: Formula: (= v_main_~i~1_16 0) InVars {} OutVars{main_~i~1=v_main_~i~1_16} AuxVars[] AssignedVars[main_~i~1] [2018-03-29 23:48:44,039 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,039 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,039 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,039 DEBUG L259 ransitionTransformer]: Formula: (or (not (< v_main_~i~1_12 100)) (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-03-29 23:48:44,040 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,040 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,040 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,040 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-03-29 23:48:44,040 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,041 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,041 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,041 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-03-29 23:48:44,041 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,041 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,041 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,042 DEBUG L259 ransitionTransformer]: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-03-29 23:48:44,042 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,042 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,042 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,042 DEBUG L259 ransitionTransformer]: Formula: (and (= |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~sizeInParam_1| 32) (= |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.baseInParam_1| |v_main_~#mask~0.base_7|) (= |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.offsetInParam_1| |v_main_~#mask~0.offset_7|)) InVars {main_~#mask~0.base=|v_main_~#mask~0.base_7|, main_~#mask~0.offset=|v_main_~#mask~0.offset_7|} OutVars{__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.base=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.baseInParam_1|, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.offset=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.offsetInParam_1|, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~size=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~sizeInParam_1|} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.base, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.offset, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~size] [2018-03-29 23:48:44,043 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,043 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,043 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,043 DEBUG L259 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-03-29 23:48:44,043 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,044 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,044 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,044 DEBUG L259 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-03-29 23:48:44,044 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,044 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,045 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,045 DEBUG L259 ransitionTransformer]: Formula: (= |v_main_#res_2| 0) InVars {} OutVars{main_#res=|v_main_#res_2|} AuxVars[] AssignedVars[main_#res] [2018-03-29 23:48:44,045 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,045 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,045 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,046 DEBUG L259 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-03-29 23:48:44,046 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,046 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,046 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,047 DEBUG L259 ransitionTransformer]: Formula: (= v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~size_1 |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~size_1|) InVars {__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~size=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~size_1|} OutVars{__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~size=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~size_1|, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~size=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~size_1} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~size] [2018-03-29 23:48:44,047 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,047 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,047 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,047 DEBUG L259 ransitionTransformer]: Formula: (or (not (<= 0 v_main_~i~1_3)) (not (< v_main_~i~1_3 100))) InVars {main_~i~1=v_main_~i~1_3} OutVars{main_~i~1=v_main_~i~1_3} AuxVars[] AssignedVars[] [2018-03-29 23:48:44,048 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,048 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,048 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,048 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-03-29 23:48:44,048 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,048 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,049 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,049 DEBUG L259 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-03-29 23:48:44,049 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,049 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,049 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,050 DEBUG L259 ransitionTransformer]: Formula: (= v_main_~b~0_4 (store v_main_~b~0_5 v_main_~i~1_13 |v_main_#t~ret3_3|)) InVars {main_~i~1=v_main_~i~1_13, main_~b~0=v_main_~b~0_5, main_#t~ret3=|v_main_#t~ret3_3|} OutVars{main_~i~1=v_main_~i~1_13, main_~b~0=v_main_~b~0_4, main_#t~ret3=|v_main_#t~ret3_3|} AuxVars[] AssignedVars[main_~b~0] [2018-03-29 23:48:44,050 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,050 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,050 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,050 DEBUG L259 ransitionTransformer]: Formula: (and (= v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_1 |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.offset_1|) (= v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_1 |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.base_1|)) InVars {__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.base=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.base_1|, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.offset=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.offset_1|} OutVars{__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.base=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.base_1|, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.offset=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.offset_1|, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_1, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_1} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset] [2018-03-29 23:48:44,050 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,051 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,051 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,051 DEBUG L259 ransitionTransformer]: Formula: (not (= 32 (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-03-29 23:48:44,051 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,051 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,051 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,051 DEBUG L259 ransitionTransformer]: Formula: (= (select v_main_~b~0_2 v_main_~i~1_5) 32) 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-03-29 23:48:44,051 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,052 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,052 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,052 DEBUG L259 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-03-29 23:48:44,052 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,052 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,052 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,052 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{main_#t~ret3=|v_main_#t~ret3_4|} AuxVars[] AssignedVars[main_#t~ret3] [2018-03-29 23:48:44,052 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,052 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,053 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,053 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~a~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~a~0_1} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~a~0] [2018-03-29 23:48:44,053 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,053 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,053 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,053 DEBUG L259 ransitionTransformer]: Formula: (= |v_main_#res_1| 1) InVars {} OutVars{main_#res=|v_main_#res_1|} AuxVars[] AssignedVars[main_#res] [2018-03-29 23:48:44,053 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,054 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,054 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,054 DEBUG L259 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-03-29 23:48:44,054 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,054 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,055 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,055 DEBUG L259 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-03-29 23:48:44,055 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,055 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,055 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,056 DEBUG L259 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-03-29 23:48:44,056 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,056 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,056 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,056 DEBUG L259 ransitionTransformer]: Formula: (= |v_main_#t~post2_1| v_main_~i~1_14) InVars {main_~i~1=v_main_~i~1_14} OutVars{main_~i~1=v_main_~i~1_14, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_#t~post2] [2018-03-29 23:48:44,056 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,057 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,057 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,057 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_1} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0] [2018-03-29 23:48:44,057 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,057 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,058 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,058 DEBUG L259 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-03-29 23:48:44,058 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,058 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,058 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,058 DEBUG L259 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-03-29 23:48:44,058 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,059 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,059 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,059 DEBUG L259 ransitionTransformer]: Formula: (= v_main_~i~1_15 (+ |v_main_#t~post2_2| 1)) InVars {main_#t~post2=|v_main_#t~post2_2|} OutVars{main_~i~1=v_main_~i~1_15, main_#t~post2=|v_main_#t~post2_2|} AuxVars[] AssignedVars[main_~i~1] [2018-03-29 23:48:44,059 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,059 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,059 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,059 DEBUG L259 ransitionTransformer]: Formula: (= v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_2 0) InVars {} OutVars{__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_2} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0] [2018-03-29 23:48:44,059 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,059 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,060 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,060 DEBUG L259 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-03-29 23:48:44,060 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,060 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,060 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,060 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{main_#t~post4=|v_main_#t~post4_3|} AuxVars[] AssignedVars[main_#t~post4] [2018-03-29 23:48:44,060 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,060 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,060 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,061 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{main_#t~post2=|v_main_#t~post2_3|} AuxVars[] AssignedVars[main_#t~post2] [2018-03-29 23:48:44,061 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,061 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,061 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,061 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-03-29 23:48:44,061 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,061 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,061 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,062 DEBUG L259 ransitionTransformer]: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-03-29 23:48:44,062 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,062 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,062 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,062 DEBUG L259 ransitionTransformer]: Formula: (not (< v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_3 v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~size_2)) InVars {__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_3, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~size=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~size_2} OutVars{__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_3, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~size=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~size_2} AuxVars[] AssignedVars[] [2018-03-29 23:48:44,062 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,062 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,063 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,063 DEBUG L259 ransitionTransformer]: Formula: (< v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_4 v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~size_3) InVars {__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_4, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~size=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~size_3} OutVars{__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_4, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~size=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~size_3} AuxVars[] AssignedVars[] [2018-03-29 23:48:44,063 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,063 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,063 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,064 DEBUG L259 ransitionTransformer]: Formula: (= |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#res_1| v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_11) InVars {__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_11} OutVars{__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#res=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#res_1|, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_11} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#res] [2018-03-29 23:48:44,064 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,064 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,064 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,064 DEBUG L259 ransitionTransformer]: Formula: (or (not (<= 0 v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_5)) (not (< v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_5 32))) InVars {__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_5} OutVars{__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_5} AuxVars[] AssignedVars[] [2018-03-29 23:48:44,065 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,065 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,065 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,065 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-03-29 23:48:44,065 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,065 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,066 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,066 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-03-29 23:48:44,066 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,066 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,068 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,069 DEBUG L259 ransitionTransformer]: Formula: (let ((.cse0 (+ v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_6 v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_2))) (and (<= 0 .cse0) (<= (+ v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_6 v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_2 1) (select |v_#length_1| v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_2)) (= |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~mem1_1| (select (select |v_#memory_int_part_locs_30_locs_30_1| v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_2) .cse0)) (= 1 (select |v_#valid_3| v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_2)))) InVars {__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_2, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_2, #valid=|v_#valid_3|, #length=|v_#length_1|, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_6, #memory_int_part_locs_30_locs_30=|v_#memory_int_part_locs_30_locs_30_1|} OutVars{__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_2, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_2, #valid=|v_#valid_3|, #length=|v_#length_1|, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_6, #memory_int_part_locs_30_locs_30=|v_#memory_int_part_locs_30_locs_30_1|, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~mem1=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~mem1_1|} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~mem1] [2018-03-29 23:48:44,069 DEBUG L266 ransitionTransformer]: formula has changed [2018-03-29 23:48:44,069 DEBUG L267 ransitionTransformer]: old formula: [2018-03-29 23:48:44,069 DEBUG L268 ransitionTransformer]: (let ((.cse0 (+ v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_6 v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_2))) (and (<= 0 .cse0) (<= (+ v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_6 v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_2 1) (select |v_#length_1| v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_2)) (= |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~mem1_1| (select (select |v_#memory_int_1| v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_2) .cse0)) (= 1 (select |v_#valid_3| v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_2)))) [2018-03-29 23:48:44,069 DEBUG L269 ransitionTransformer]: new formula: [2018-03-29 23:48:44,070 DEBUG L270 ransitionTransformer]: (let ((.cse0 (+ v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_6 v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_2))) (and (<= 0 .cse0) (<= (+ v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_6 v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_2 1) (select |v_#length_1| v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_2)) (= |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~mem1_1| (select (select |v_#memory_int_part_locs_30_locs_30_1| v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_2) .cse0)) (= 1 (select |v_#valid_3| v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_2)))) [2018-03-29 23:48:44,070 DEBUG L274 ransitionTransformer]: invars have changed [2018-03-29 23:48:44,070 DEBUG L275 ransitionTransformer]: old invars: [2018-03-29 23:48:44,070 DEBUG L276 ransitionTransformer]: {__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_2, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_2, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_6} [2018-03-29 23:48:44,070 DEBUG L277 ransitionTransformer]: new invars: [2018-03-29 23:48:44,070 DEBUG L278 ransitionTransformer]: {__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_2, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_2, #valid=|v_#valid_3|, #length=|v_#length_1|, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_6, #memory_int_part_locs_30_locs_30=|v_#memory_int_part_locs_30_locs_30_1|} [2018-03-29 23:48:44,070 DEBUG L282 ransitionTransformer]: outvars have changed [2018-03-29 23:48:44,070 DEBUG L283 ransitionTransformer]: old outvars: [2018-03-29 23:48:44,070 DEBUG L284 ransitionTransformer]: {__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_2, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_2, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_6, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~mem1=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~mem1_1|} [2018-03-29 23:48:44,071 DEBUG L285 ransitionTransformer]: new outvars: [2018-03-29 23:48:44,071 DEBUG L286 ransitionTransformer]: {__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_2, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_2, #valid=|v_#valid_3|, #length=|v_#length_1|, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_6, #memory_int_part_locs_30_locs_30=|v_#memory_int_part_locs_30_locs_30_1|, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~mem1=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~mem1_1|} [2018-03-29 23:48:44,071 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,071 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,071 DEBUG L259 ransitionTransformer]: Formula: (not (= 1 (select |v_#valid_4| v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_3))) InVars {__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_3, #valid=|v_#valid_4|} OutVars{__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_3, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] [2018-03-29 23:48:44,071 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,071 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,071 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,072 DEBUG L259 ransitionTransformer]: Formula: (or (not (<= (+ v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_7 v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_3 1) (select |v_#length_2| v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_4))) (not (<= 0 (+ v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_7 v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_3)))) InVars {__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_4, #length=|v_#length_2|, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_7, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_3} OutVars{__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_4, #length=|v_#length_2|, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_7, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_3} AuxVars[] AssignedVars[] [2018-03-29 23:48:44,072 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,072 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,072 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,072 DEBUG L259 ransitionTransformer]: Formula: (= v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~a~0_2 (store v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~a~0_3 v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_8 |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~mem1_2|)) InVars {__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_8, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~a~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~a~0_3, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~mem1=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~mem1_2|} OutVars{__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_8, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~a~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~a~0_2, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~mem1=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~mem1_2|} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~a~0] [2018-03-29 23:48:44,073 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,073 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,073 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,073 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~mem1=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~mem1_3|} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~mem1] [2018-03-29 23:48:44,073 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,074 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,074 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,074 DEBUG L259 ransitionTransformer]: Formula: (= |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~post0_1| v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_9) InVars {__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_9} OutVars{__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_9, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~post0=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~post0_1|} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~post0] [2018-03-29 23:48:44,074 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,074 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,074 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,075 DEBUG L259 ransitionTransformer]: Formula: (= v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_10 (+ |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~post0_2| 1)) InVars {__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~post0=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~post0_2|} OutVars{__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_10, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~post0=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~post0_2|} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0] [2018-03-29 23:48:44,075 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,075 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,075 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,075 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~post0=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~post0_3|} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~post0] [2018-03-29 23:48:44,075 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,075 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,076 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,076 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-03-29 23:48:44,076 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,076 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,076 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,076 DEBUG L259 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-03-29 23:48:44,077 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,077 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,077 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:48:44,077 DEBUG L259 ransitionTransformer]: Formula: (= |v_main_#t~ret3_5| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#resOutParam_1|) InVars {__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#res=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#resOutParam_1|} OutVars{main_#t~ret3=|v_main_#t~ret3_5|} AuxVars[] AssignedVars[main_#t~ret3] [2018-03-29 23:48:44,077 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:48:44,077 DEBUG L288 ransitionTransformer]: [2018-03-29 23:48:44,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 29.03 11:48:44 BasicIcfg [2018-03-29 23:48:44,079 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-03-29 23:48:44,080 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-03-29 23:48:44,080 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-03-29 23:48:44,083 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-03-29 23:48:44,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.03 11:48:36" (1/4) ... [2018-03-29 23:48:44,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6236b700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 11:48:44, skipping insertion in model container [2018-03-29 23:48:44,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 11:48:36" (2/4) ... [2018-03-29 23:48:44,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6236b700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 11:48:44, skipping insertion in model container [2018-03-29 23:48:44,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 11:48:37" (3/4) ... [2018-03-29 23:48:44,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6236b700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 11:48:44, skipping insertion in model container [2018-03-29 23:48:44,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 29.03 11:48:44" (4/4) ... [2018-03-29 23:48:44,086 INFO L107 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-03-29 23:48:44,092 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-03-29 23:48:44,098 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-03-29 23:48:44,128 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-03-29 23:48:44,129 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-03-29 23:48:44,129 INFO L370 AbstractCegarLoop]: Hoare is true [2018-03-29 23:48:44,129 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-03-29 23:48:44,129 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-03-29 23:48:44,129 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-03-29 23:48:44,129 INFO L374 AbstractCegarLoop]: Difference is false [2018-03-29 23:48:44,130 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-03-29 23:48:44,130 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-03-29 23:48:44,130 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-03-29 23:48:44,141 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-03-29 23:48:44,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-03-29 23:48:44,146 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:48:44,146 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 23:48:44,147 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-29 23:48:44,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1643881845, 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-03-29 23:48:44,167 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:48:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:48:44,205 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:48:44,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:48:44,283 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:48:44,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:48:44,378 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 23:48:44,378 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2018-03-29 23:48:44,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-03-29 23:48:44,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-03-29 23:48:44,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-03-29 23:48:44,389 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 5 states. [2018-03-29 23:48:44,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:48:44,548 INFO L93 Difference]: Finished difference Result 137 states and 159 transitions. [2018-03-29 23:48:44,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-03-29 23:48:44,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-03-29 23:48:44,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:48:44,561 INFO L225 Difference]: With dead ends: 137 [2018-03-29 23:48:44,561 INFO L226 Difference]: Without dead ends: 81 [2018-03-29 23:48:44,565 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-03-29 23:48:44,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-03-29 23:48:44,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 65. [2018-03-29 23:48:44,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-03-29 23:48:44,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2018-03-29 23:48:44,610 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 14 [2018-03-29 23:48:44,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:48:44,610 INFO L459 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2018-03-29 23:48:44,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-03-29 23:48:44,611 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2018-03-29 23:48:44,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-03-29 23:48:44,611 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:48:44,612 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-03-29 23:48:44,612 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-29 23:48:44,612 INFO L82 PathProgramCache]: Analyzing trace with hash 2045121409, 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-03-29 23:48:44,625 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:48:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:48:44,645 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:48:44,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:48:44,667 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:48:44,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:48:44,733 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 23:48:44,733 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2018-03-29 23:48:44,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-29 23:48:44,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-29 23:48:44,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-03-29 23:48:44,735 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 4 states. [2018-03-29 23:48:44,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:48:44,791 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-03-29 23:48:44,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-03-29 23:48:44,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-03-29 23:48:44,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:48:44,794 INFO L225 Difference]: With dead ends: 79 [2018-03-29 23:48:44,794 INFO L226 Difference]: Without dead ends: 78 [2018-03-29 23:48:44,794 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 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-03-29 23:48:44,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-03-29 23:48:44,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 68. [2018-03-29 23:48:44,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-03-29 23:48:44,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-03-29 23:48:44,802 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 23 [2018-03-29 23:48:44,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:48:44,803 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-03-29 23:48:44,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-29 23:48:44,803 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-03-29 23:48:44,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-03-29 23:48:44,804 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:48:44,804 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, 1] [2018-03-29 23:48:44,804 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-29 23:48:44,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1025745536, 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-03-29 23:48:44,813 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:48:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:48:44,830 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:48:44,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 23:48:44,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 23:48:44,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 23:48:44,858 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-29 23:48:44,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:48:44,870 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:48:44,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:48:44,926 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 23:48:44,926 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-03-29 23:48:44,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-03-29 23:48:44,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-03-29 23:48:44,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-03-29 23:48:44,927 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 5 states. [2018-03-29 23:48:44,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:48:44,965 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-03-29 23:48:44,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-29 23:48:44,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-03-29 23:48:44,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:48:44,966 INFO L225 Difference]: With dead ends: 68 [2018-03-29 23:48:44,966 INFO L226 Difference]: Without dead ends: 67 [2018-03-29 23:48:44,967 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-03-29 23:48:44,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-03-29 23:48:44,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-03-29 23:48:44,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-03-29 23:48:44,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-03-29 23:48:44,972 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 24 [2018-03-29 23:48:44,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:48:44,972 INFO L459 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-03-29 23:48:44,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-03-29 23:48:44,972 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-03-29 23:48:44,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-03-29 23:48:44,973 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:48:44,973 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, 1] [2018-03-29 23:48:44,973 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-29 23:48:44,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1025745535, 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-03-29 23:48:44,979 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:48:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:48:44,994 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:48:45,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 23:48:45,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 23:48:45,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 23:48:45,016 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-29 23:48:45,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:48:45,095 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:48:45,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:48:45,188 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 23:48:45,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2018-03-29 23:48:45,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-03-29 23:48:45,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-03-29 23:48:45,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-03-29 23:48:45,189 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 10 states. [2018-03-29 23:48:45,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:48:45,447 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-03-29 23:48:45,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-03-29 23:48:45,448 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-03-29 23:48:45,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:48:45,449 INFO L225 Difference]: With dead ends: 76 [2018-03-29 23:48:45,449 INFO L226 Difference]: Without dead ends: 75 [2018-03-29 23:48:45,449 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-03-29 23:48:45,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-03-29 23:48:45,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2018-03-29 23:48:45,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-03-29 23:48:45,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-03-29 23:48:45,459 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 24 [2018-03-29 23:48:45,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:48:45,460 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-03-29 23:48:45,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-03-29 23:48:45,460 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-03-29 23:48:45,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-03-29 23:48:45,461 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:48:45,461 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] [2018-03-29 23:48:45,461 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-29 23:48:45,462 INFO L82 PathProgramCache]: Analyzing trace with hash 736488116, 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-03-29 23:48:45,474 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:48:45,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:48:45,499 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:48:45,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:48:45,533 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:48:45,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:48:45,629 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:48:45,629 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-03-29 23:48:45,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-03-29 23:48:45,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-03-29 23:48:45,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-03-29 23:48:45,630 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 8 states. [2018-03-29 23:48:45,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:48:45,736 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2018-03-29 23:48:45,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-03-29 23:48:45,736 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-03-29 23:48:45,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:48:45,737 INFO L225 Difference]: With dead ends: 102 [2018-03-29 23:48:45,737 INFO L226 Difference]: Without dead ends: 101 [2018-03-29 23:48:45,738 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-03-29 23:48:45,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-03-29 23:48:45,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 85. [2018-03-29 23:48:45,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-03-29 23:48:45,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2018-03-29 23:48:45,746 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 32 [2018-03-29 23:48:45,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:48:45,747 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2018-03-29 23:48:45,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-03-29 23:48:45,747 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2018-03-29 23:48:45,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-03-29 23:48:45,748 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:48:45,748 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] [2018-03-29 23:48:45,748 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-29 23:48:45,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1356295342, 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-03-29 23:48:45,756 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:48:45,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:48:45,770 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:48:45,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 23:48:45,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 23:48:45,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 23:48:45,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-29 23:48:45,837 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:48:45,838 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:48:45,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:48:45,926 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:48:45,926 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-03-29 23:48:45,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-03-29 23:48:45,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-03-29 23:48:45,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-03-29 23:48:45,927 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 14 states. [2018-03-29 23:48:46,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:48:46,153 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2018-03-29 23:48:46,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-03-29 23:48:46,154 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-03-29 23:48:46,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:48:46,155 INFO L225 Difference]: With dead ends: 96 [2018-03-29 23:48:46,155 INFO L226 Difference]: Without dead ends: 95 [2018-03-29 23:48:46,156 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2018-03-29 23:48:46,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-03-29 23:48:46,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 86. [2018-03-29 23:48:46,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-03-29 23:48:46,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2018-03-29 23:48:46,164 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 33 [2018-03-29 23:48:46,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:48:46,164 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2018-03-29 23:48:46,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-03-29 23:48:46,165 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2018-03-29 23:48:46,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-03-29 23:48:46,166 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:48:46,166 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, 1] [2018-03-29 23:48:46,166 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-29 23:48:46,166 INFO L82 PathProgramCache]: Analyzing trace with hash -334466374, 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-03-29 23:48:46,173 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:48:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:48:46,185 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:48:46,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:48:46,200 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:48:46,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:48:46,260 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 23:48:46,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2018-03-29 23:48:46,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-03-29 23:48:46,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-03-29 23:48:46,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-03-29 23:48:46,261 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand 8 states. [2018-03-29 23:48:46,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:48:46,312 INFO L93 Difference]: Finished difference Result 161 states and 173 transitions. [2018-03-29 23:48:46,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-29 23:48:46,312 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-03-29 23:48:46,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:48:46,313 INFO L225 Difference]: With dead ends: 161 [2018-03-29 23:48:46,313 INFO L226 Difference]: Without dead ends: 86 [2018-03-29 23:48:46,314 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-03-29 23:48:46,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-03-29 23:48:46,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-03-29 23:48:46,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-03-29 23:48:46,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-03-29 23:48:46,320 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 34 [2018-03-29 23:48:46,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:48:46,320 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-03-29 23:48:46,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-03-29 23:48:46,320 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-03-29 23:48:46,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-03-29 23:48:46,322 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:48:46,322 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, 1] [2018-03-29 23:48:46,322 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-29 23:48:46,322 INFO L82 PathProgramCache]: Analyzing trace with hash 251145639, 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-03-29 23:48:46,331 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:48:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:48:46,346 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:48:46,387 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:48:46,387 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:48:46,438 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:48:46,459 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:48:46,459 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-03-29 23:48:46,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-29 23:48:46,459 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-29 23:48:46,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-03-29 23:48:46,460 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 12 states. [2018-03-29 23:48:46,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:48:46,560 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2018-03-29 23:48:46,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-03-29 23:48:46,560 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2018-03-29 23:48:46,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:48:46,561 INFO L225 Difference]: With dead ends: 164 [2018-03-29 23:48:46,561 INFO L226 Difference]: Without dead ends: 86 [2018-03-29 23:48:46,562 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2018-03-29 23:48:46,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-03-29 23:48:46,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-03-29 23:48:46,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-03-29 23:48:46,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2018-03-29 23:48:46,568 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 43 [2018-03-29 23:48:46,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:48:46,568 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2018-03-29 23:48:46,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-29 23:48:46,568 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2018-03-29 23:48:46,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-03-29 23:48:46,569 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:48:46,569 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, 1] [2018-03-29 23:48:46,569 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-29 23:48:46,569 INFO L82 PathProgramCache]: Analyzing trace with hash -2102194860, 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-03-29 23:48:46,575 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:48:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:48:46,592 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:48:46,625 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:48:46,625 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:48:46,700 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:48:46,721 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:48:46,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-03-29 23:48:46,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-03-29 23:48:46,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-03-29 23:48:46,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-03-29 23:48:46,722 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand 16 states. [2018-03-29 23:48:47,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:48:47,107 INFO L93 Difference]: Finished difference Result 143 states and 153 transitions. [2018-03-29 23:48:47,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-03-29 23:48:47,107 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2018-03-29 23:48:47,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:48:47,108 INFO L225 Difference]: With dead ends: 143 [2018-03-29 23:48:47,109 INFO L226 Difference]: Without dead ends: 142 [2018-03-29 23:48:47,109 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=244, Invalid=626, Unknown=0, NotChecked=0, Total=870 [2018-03-29 23:48:47,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-03-29 23:48:47,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 121. [2018-03-29 23:48:47,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-03-29 23:48:47,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2018-03-29 23:48:47,117 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 50 [2018-03-29 23:48:47,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:48:47,117 INFO L459 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2018-03-29 23:48:47,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-03-29 23:48:47,117 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2018-03-29 23:48:47,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-03-29 23:48:47,118 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:48:47,118 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 23:48:47,118 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-29 23:48:47,118 INFO L82 PathProgramCache]: Analyzing trace with hash -743530994, 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-03-29 23:48:47,124 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:48:47,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:48:47,139 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:48:47,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 23:48:47,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 23:48:47,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 23:48:47,144 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-29 23:48:47,229 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:48:47,229 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:48:47,356 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:48:47,377 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:48:47,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-03-29 23:48:47,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-03-29 23:48:47,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-03-29 23:48:47,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2018-03-29 23:48:47,378 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand 22 states. [2018-03-29 23:48:48,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:48:48,067 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2018-03-29 23:48:48,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-03-29 23:48:48,067 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2018-03-29 23:48:48,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:48:48,068 INFO L225 Difference]: With dead ends: 135 [2018-03-29 23:48:48,068 INFO L226 Difference]: Without dead ends: 134 [2018-03-29 23:48:48,069 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=430, Invalid=1292, Unknown=0, NotChecked=0, Total=1722 [2018-03-29 23:48:48,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-03-29 23:48:48,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 122. [2018-03-29 23:48:48,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-03-29 23:48:48,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2018-03-29 23:48:48,075 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 51 [2018-03-29 23:48:48,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:48:48,076 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2018-03-29 23:48:48,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-03-29 23:48:48,076 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2018-03-29 23:48:48,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-03-29 23:48:48,077 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:48:48,077 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 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-03-29 23:48:48,077 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-29 23:48:48,077 INFO L82 PathProgramCache]: Analyzing trace with hash -855038201, now seen corresponding path program 2 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-03-29 23:48:48,086 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:48:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:48:48,104 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:48:48,166 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:48:48,167 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:48:48,288 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:48:48,308 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:48:48,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-03-29 23:48:48,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-03-29 23:48:48,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-03-29 23:48:48,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2018-03-29 23:48:48,309 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand 20 states. [2018-03-29 23:48:48,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:48:48,594 INFO L93 Difference]: Finished difference Result 236 states and 250 transitions. [2018-03-29 23:48:48,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-03-29 23:48:48,595 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 61 [2018-03-29 23:48:48,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:48:48,595 INFO L225 Difference]: With dead ends: 236 [2018-03-29 23:48:48,595 INFO L226 Difference]: Without dead ends: 122 [2018-03-29 23:48:48,597 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=432, Invalid=900, Unknown=0, NotChecked=0, Total=1332 [2018-03-29 23:48:48,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-03-29 23:48:48,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-03-29 23:48:48,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-03-29 23:48:48,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 125 transitions. [2018-03-29 23:48:48,602 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 125 transitions. Word has length 61 [2018-03-29 23:48:48,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:48:48,602 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 125 transitions. [2018-03-29 23:48:48,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-03-29 23:48:48,602 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 125 transitions. [2018-03-29 23:48:48,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-03-29 23:48:48,603 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:48:48,604 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 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, 1] [2018-03-29 23:48:48,604 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-29 23:48:48,604 INFO L82 PathProgramCache]: Analyzing trace with hash 318839444, now seen corresponding path program 3 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-03-29 23:48:48,614 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:48:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:48:48,645 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:48:48,774 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:48:48,775 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:48:49,018 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:48:49,038 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:48:49,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-03-29 23:48:49,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-03-29 23:48:49,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-03-29 23:48:49,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=818, Unknown=0, NotChecked=0, Total=992 [2018-03-29 23:48:49,040 INFO L87 Difference]: Start difference. First operand 122 states and 125 transitions. Second operand 32 states. [2018-03-29 23:48:50,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:48:50,166 INFO L93 Difference]: Finished difference Result 231 states and 249 transitions. [2018-03-29 23:48:50,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-03-29 23:48:50,166 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 86 [2018-03-29 23:48:50,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:48:50,168 INFO L225 Difference]: With dead ends: 231 [2018-03-29 23:48:50,168 INFO L226 Difference]: Without dead ends: 230 [2018-03-29 23:48:50,169 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1096, Invalid=3194, Unknown=0, NotChecked=0, Total=4290 [2018-03-29 23:48:50,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-03-29 23:48:50,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 193. [2018-03-29 23:48:50,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-03-29 23:48:50,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 211 transitions. [2018-03-29 23:48:50,178 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 211 transitions. Word has length 86 [2018-03-29 23:48:50,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:48:50,178 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 211 transitions. [2018-03-29 23:48:50,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-03-29 23:48:50,178 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 211 transitions. [2018-03-29 23:48:50,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-03-29 23:48:50,180 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:48:50,180 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 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, 1] [2018-03-29 23:48:50,180 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-29 23:48:50,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1294088398, now seen corresponding path program 3 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-03-29 23:48:50,186 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:48:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:48:50,214 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:48:50,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 23:48:50,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 23:48:50,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 23:48:50,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-29 23:48:50,432 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:48:50,432 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:48:50,756 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:48:50,777 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:48:50,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2018-03-29 23:48:50,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-03-29 23:48:50,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-03-29 23:48:50,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1187, Unknown=0, NotChecked=0, Total=1406 [2018-03-29 23:48:50,778 INFO L87 Difference]: Start difference. First operand 193 states and 211 transitions. Second operand 38 states. [2018-03-29 23:48:52,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:48:52,983 INFO L93 Difference]: Finished difference Result 219 states and 237 transitions. [2018-03-29 23:48:52,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-03-29 23:48:52,983 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 87 [2018-03-29 23:48:52,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:48:52,984 INFO L225 Difference]: With dead ends: 219 [2018-03-29 23:48:52,985 INFO L226 Difference]: Without dead ends: 218 [2018-03-29 23:48:52,987 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1340 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1510, Invalid=5132, Unknown=0, NotChecked=0, Total=6642 [2018-03-29 23:48:52,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-03-29 23:48:52,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 194. [2018-03-29 23:48:52,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-03-29 23:48:52,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 205 transitions. [2018-03-29 23:48:52,996 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 205 transitions. Word has length 87 [2018-03-29 23:48:52,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:48:52,997 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 205 transitions. [2018-03-29 23:48:52,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-03-29 23:48:52,997 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 205 transitions. [2018-03-29 23:48:52,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-03-29 23:48:52,998 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:48:52,998 INFO L355 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 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-03-29 23:48:52,998 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-29 23:48:52,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1849011769, now seen corresponding path program 3 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-03-29 23:48:53,004 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:48:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:48:53,031 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:48:53,195 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:48:53,195 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:48:53,493 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:48:53,527 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:48:53,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2018-03-29 23:48:53,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-03-29 23:48:53,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-03-29 23:48:53,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=916, Unknown=0, NotChecked=0, Total=1260 [2018-03-29 23:48:53,529 INFO L87 Difference]: Start difference. First operand 194 states and 205 transitions. Second operand 36 states. [2018-03-29 23:48:54,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:48:54,385 INFO L93 Difference]: Finished difference Result 380 states and 402 transitions. [2018-03-29 23:48:54,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-03-29 23:48:54,385 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 97 [2018-03-29 23:48:54,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:48:54,386 INFO L225 Difference]: With dead ends: 380 [2018-03-29 23:48:54,386 INFO L226 Difference]: Without dead ends: 194 [2018-03-29 23:48:54,388 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 158 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1500 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1660, Invalid=3596, Unknown=0, NotChecked=0, Total=5256 [2018-03-29 23:48:54,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-03-29 23:48:54,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-03-29 23:48:54,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-03-29 23:48:54,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 197 transitions. [2018-03-29 23:48:54,393 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 197 transitions. Word has length 97 [2018-03-29 23:48:54,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:48:54,394 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 197 transitions. [2018-03-29 23:48:54,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-03-29 23:48:54,394 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 197 transitions. [2018-03-29 23:48:54,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-03-29 23:48:54,395 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:48:54,395 INFO L355 BasicCegarLoop]: trace histogram [16, 16, 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, 1] [2018-03-29 23:48:54,395 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-29 23:48:54,395 INFO L82 PathProgramCache]: Analyzing trace with hash -737913580, now seen corresponding path program 4 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-03-29 23:48:54,401 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:48:54,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:48:54,436 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:48:54,743 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:48:54,743 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:48:55,653 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:48:55,673 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:48:55,673 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 63 [2018-03-29 23:48:55,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-03-29 23:48:55,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-03-29 23:48:55,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=606, Invalid=3426, Unknown=0, NotChecked=0, Total=4032 [2018-03-29 23:48:55,675 INFO L87 Difference]: Start difference. First operand 194 states and 197 transitions. Second operand 64 states. [2018-03-29 23:49:01,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:49:01,089 INFO L93 Difference]: Finished difference Result 407 states and 441 transitions. [2018-03-29 23:49:01,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-03-29 23:49:01,090 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 158 [2018-03-29 23:49:01,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:49:01,092 INFO L225 Difference]: With dead ends: 407 [2018-03-29 23:49:01,093 INFO L226 Difference]: Without dead ends: 406 [2018-03-29 23:49:01,097 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3452 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=4624, Invalid=14282, Unknown=0, NotChecked=0, Total=18906 [2018-03-29 23:49:01,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-03-29 23:49:01,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 337. [2018-03-29 23:49:01,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-03-29 23:49:01,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 371 transitions. [2018-03-29 23:49:01,108 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 371 transitions. Word has length 158 [2018-03-29 23:49:01,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:49:01,108 INFO L459 AbstractCegarLoop]: Abstraction has 337 states and 371 transitions. [2018-03-29 23:49:01,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-03-29 23:49:01,108 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 371 transitions. [2018-03-29 23:49:01,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-03-29 23:49:01,109 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:49:01,109 INFO L355 BasicCegarLoop]: trace histogram [16, 16, 16, 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, 1] [2018-03-29 23:49:01,109 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-29 23:49:01,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1400484274, 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-03-29 23:49:01,116 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:49:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:49:01,152 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:49:01,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 23:49:01,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 23:49:01,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 23:49:01,157 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-29 23:49:01,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 0 proven. 1005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:49:01,790 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:49:02,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 0 proven. 1005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:49:02,815 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:49:02,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 69 [2018-03-29 23:49:02,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-03-29 23:49:02,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-03-29 23:49:02,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=683, Invalid=4147, Unknown=0, NotChecked=0, Total=4830 [2018-03-29 23:49:02,817 INFO L87 Difference]: Start difference. First operand 337 states and 371 transitions. Second operand 70 states. [2018-03-29 23:49:05,379 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 124 DAG size of output 27 [2018-03-29 23:49:11,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:49:11,142 INFO L93 Difference]: Finished difference Result 387 states and 421 transitions. [2018-03-29 23:49:11,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-03-29 23:49:11,142 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 159 [2018-03-29 23:49:11,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:49:11,144 INFO L225 Difference]: With dead ends: 387 [2018-03-29 23:49:11,145 INFO L226 Difference]: Without dead ends: 386 [2018-03-29 23:49:11,150 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5800 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=5590, Invalid=20492, Unknown=0, NotChecked=0, Total=26082 [2018-03-29 23:49:11,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-03-29 23:49:11,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 338. [2018-03-29 23:49:11,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-03-29 23:49:11,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 357 transitions. [2018-03-29 23:49:11,160 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 357 transitions. Word has length 159 [2018-03-29 23:49:11,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:49:11,160 INFO L459 AbstractCegarLoop]: Abstraction has 338 states and 357 transitions. [2018-03-29 23:49:11,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-03-29 23:49:11,160 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 357 transitions. [2018-03-29 23:49:11,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-03-29 23:49:11,161 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:49:11,161 INFO L355 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 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-03-29 23:49:11,161 INFO L408 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-29 23:49:11,161 INFO L82 PathProgramCache]: Analyzing trace with hash 959547207, now seen corresponding path program 4 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-03-29 23:49:11,175 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:49:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:49:11,207 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:49:11,591 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 3 proven. 975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:49:11,591 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:49:12,258 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 3 proven. 975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:49:12,279 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:49:12,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 68 [2018-03-29 23:49:12,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-03-29 23:49:12,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-03-29 23:49:12,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1192, Invalid=3364, Unknown=0, NotChecked=0, Total=4556 [2018-03-29 23:49:12,280 INFO L87 Difference]: Start difference. First operand 338 states and 357 transitions. Second operand 68 states. [2018-03-29 23:49:15,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:49:15,057 INFO L93 Difference]: Finished difference Result 668 states and 706 transitions. [2018-03-29 23:49:15,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-03-29 23:49:15,058 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 169 [2018-03-29 23:49:15,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:49:15,059 INFO L225 Difference]: With dead ends: 668 [2018-03-29 23:49:15,059 INFO L226 Difference]: Without dead ends: 338 [2018-03-29 23:49:15,061 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 270 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6512 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=6516, Invalid=14364, Unknown=0, NotChecked=0, Total=20880 [2018-03-29 23:49:15,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-03-29 23:49:15,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2018-03-29 23:49:15,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-03-29 23:49:15,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 341 transitions. [2018-03-29 23:49:15,072 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 341 transitions. Word has length 169 [2018-03-29 23:49:15,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:49:15,072 INFO L459 AbstractCegarLoop]: Abstraction has 338 states and 341 transitions. [2018-03-29 23:49:15,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-03-29 23:49:15,072 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 341 transitions. [2018-03-29 23:49:15,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-03-29 23:49:15,073 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:49:15,074 INFO L355 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 23:49:15,074 INFO L408 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-29 23:49:15,074 INFO L82 PathProgramCache]: Analyzing trace with hash -261666284, now seen corresponding path program 5 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-03-29 23:49:15,085 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:49:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:49:15,142 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:49:16,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:49:16,351 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:49:19,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:49:19,652 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:49:19,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 127 [2018-03-29 23:49:19,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-03-29 23:49:19,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-03-29 23:49:19,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1277, Invalid=14979, Unknown=0, NotChecked=0, Total=16256 [2018-03-29 23:49:19,655 INFO L87 Difference]: Start difference. First operand 338 states and 341 transitions. Second operand 128 states. [2018-03-29 23:49:25,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:49:25,078 INFO L93 Difference]: Finished difference Result 356 states and 360 transitions. [2018-03-29 23:49:25,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-03-29 23:49:25,078 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 302 [2018-03-29 23:49:25,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:49:25,079 INFO L225 Difference]: With dead ends: 356 [2018-03-29 23:49:25,079 INFO L226 Difference]: Without dead ends: 355 [2018-03-29 23:49:25,081 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 665 GetRequests, 477 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3844 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=3540, Invalid=32370, Unknown=0, NotChecked=0, Total=35910 [2018-03-29 23:49:25,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-03-29 23:49:25,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 346. [2018-03-29 23:49:25,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-03-29 23:49:25,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 350 transitions. [2018-03-29 23:49:25,094 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 350 transitions. Word has length 302 [2018-03-29 23:49:25,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:49:25,095 INFO L459 AbstractCegarLoop]: Abstraction has 346 states and 350 transitions. [2018-03-29 23:49:25,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-03-29 23:49:25,095 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 350 transitions. [2018-03-29 23:49:25,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-03-29 23:49:25,097 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:49:25,097 INFO L355 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 23:49:25,097 INFO L408 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-29 23:49:25,098 INFO L82 PathProgramCache]: Analyzing trace with hash 478280014, now seen corresponding path program 5 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-03-29 23:49:25,106 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:49:25,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:49:25,170 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:49:25,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 23:49:25,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 23:49:25,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 23:49:25,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-29 23:49:27,360 INFO L134 CoverageAnalysis]: Checked inductivity of 4309 backedges. 0 proven. 4309 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:49:27,360 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:49:30,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4309 backedges. 0 proven. 4309 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:49:30,498 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:49:30,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 133 [2018-03-29 23:49:30,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-03-29 23:49:30,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-03-29 23:49:30,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1418, Invalid=16404, Unknown=0, NotChecked=0, Total=17822 [2018-03-29 23:49:30,501 INFO L87 Difference]: Start difference. First operand 346 states and 350 transitions. Second operand 134 states. [2018-03-29 23:49:40,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:49:40,078 INFO L93 Difference]: Finished difference Result 355 states and 359 transitions. [2018-03-29 23:49:40,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-03-29 23:49:40,078 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 303 [2018-03-29 23:49:40,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:49:40,080 INFO L225 Difference]: With dead ends: 355 [2018-03-29 23:49:40,080 INFO L226 Difference]: Without dead ends: 354 [2018-03-29 23:49:40,082 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 701 GetRequests, 473 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10768 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=4945, Invalid=47725, Unknown=0, NotChecked=0, Total=52670 [2018-03-29 23:49:40,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-03-29 23:49:40,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 347. [2018-03-29 23:49:40,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-03-29 23:49:40,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 351 transitions. [2018-03-29 23:49:40,095 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 351 transitions. Word has length 303 [2018-03-29 23:49:40,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:49:40,095 INFO L459 AbstractCegarLoop]: Abstraction has 347 states and 351 transitions. [2018-03-29 23:49:40,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-03-29 23:49:40,095 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 351 transitions. [2018-03-29 23:49:40,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-03-29 23:49:40,097 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:49:40,097 INFO L355 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 23:49:40,098 INFO L408 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-29 23:49:40,098 INFO L82 PathProgramCache]: Analyzing trace with hash 982346113, now seen corresponding path program 6 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-03-29 23:49:40,107 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:49:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:49:40,170 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:49:41,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 4560 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:49:41,576 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:49:43,834 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 4560 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:49:43,854 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 23:49:43,855 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [69, 69] imperfect sequences [] total 134 [2018-03-29 23:49:43,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-03-29 23:49:43,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-03-29 23:49:43,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3467, Invalid=14355, Unknown=0, NotChecked=0, Total=17822 [2018-03-29 23:49:43,856 INFO L87 Difference]: Start difference. First operand 347 states and 351 transitions. Second operand 134 states. [2018-03-29 23:49:47,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:49:47,835 INFO L93 Difference]: Finished difference Result 679 states and 688 transitions. [2018-03-29 23:49:47,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-03-29 23:49:47,835 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 311 [2018-03-29 23:49:47,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:49:47,837 INFO L225 Difference]: With dead ends: 679 [2018-03-29 23:49:47,837 INFO L226 Difference]: Without dead ends: 346 [2018-03-29 23:49:47,841 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 720 GetRequests, 487 SyntacticMatches, 2 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12977 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=13102, Invalid=40954, Unknown=0, NotChecked=0, Total=54056 [2018-03-29 23:49:47,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-03-29 23:49:47,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 343. [2018-03-29 23:49:47,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-03-29 23:49:47,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 346 transitions. [2018-03-29 23:49:47,851 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 346 transitions. Word has length 311 [2018-03-29 23:49:47,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:49:47,851 INFO L459 AbstractCegarLoop]: Abstraction has 343 states and 346 transitions. [2018-03-29 23:49:47,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-03-29 23:49:47,852 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 346 transitions. [2018-03-29 23:49:47,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-03-29 23:49:47,853 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:49:47,853 INFO L355 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 31, 31, 31, 31, 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-03-29 23:49:47,853 INFO L408 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-29 23:49:47,853 INFO L82 PathProgramCache]: Analyzing trace with hash -288132537, now seen corresponding path program 5 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-03-29 23:49:47,859 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:49:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:49:47,916 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:49:49,184 INFO L134 CoverageAnalysis]: Checked inductivity of 4250 backedges. 3 proven. 4247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:49:49,184 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:49:49,405 WARN L148 SmtUtils]: Spent 215ms on a formula simplification that was a NOOP. DAG size: 165 [2018-03-29 23:49:49,633 WARN L148 SmtUtils]: Spent 223ms on a formula simplification that was a NOOP. DAG size: 165 [2018-03-29 23:49:50,756 INFO L134 CoverageAnalysis]: Checked inductivity of 4250 backedges. 3 proven. 4247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:49:50,777 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:49:50,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 131 [2018-03-29 23:49:50,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-03-29 23:49:50,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-03-29 23:49:50,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3396, Invalid=13634, Unknown=0, NotChecked=0, Total=17030 [2018-03-29 23:49:50,780 INFO L87 Difference]: Start difference. First operand 343 states and 346 transitions. Second operand 131 states. [2018-03-29 23:49:52,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:49:52,703 INFO L93 Difference]: Finished difference Result 675 states and 681 transitions. [2018-03-29 23:49:52,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-03-29 23:49:52,703 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 313 [2018-03-29 23:49:52,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:49:52,706 INFO L225 Difference]: With dead ends: 675 [2018-03-29 23:49:52,706 INFO L226 Difference]: Without dead ends: 343 [2018-03-29 23:49:52,710 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 494 SyntacticMatches, 2 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14761 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=9634, Invalid=27808, Unknown=0, NotChecked=0, Total=37442 [2018-03-29 23:49:52,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-03-29 23:49:52,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2018-03-29 23:49:52,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-03-29 23:49:52,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 345 transitions. [2018-03-29 23:49:52,723 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 345 transitions. Word has length 313 [2018-03-29 23:49:52,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:49:52,723 INFO L459 AbstractCegarLoop]: Abstraction has 343 states and 345 transitions. [2018-03-29 23:49:52,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-03-29 23:49:52,724 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 345 transitions. [2018-03-29 23:49:52,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-03-29 23:49:52,726 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:49:52,726 INFO L355 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 32, 32, 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-03-29 23:49:52,726 INFO L408 AbstractCegarLoop]: === Iteration 22 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-29 23:49:52,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1164485446, now seen corresponding path program 6 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-03-29 23:49:52,736 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:49:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:49:52,821 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:49:52,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4531 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4528 trivial. 0 not checked. [2018-03-29 23:49:52,889 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:49:52,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4531 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4528 trivial. 0 not checked. [2018-03-29 23:49:52,962 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 23:49:52,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2018-03-29 23:49:52,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-03-29 23:49:52,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-03-29 23:49:52,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-03-29 23:49:52,963 INFO L87 Difference]: Start difference. First operand 343 states and 345 transitions. Second operand 9 states. [2018-03-29 23:49:53,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:49:53,005 INFO L93 Difference]: Finished difference Result 359 states and 361 transitions. [2018-03-29 23:49:53,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-03-29 23:49:53,005 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 322 [2018-03-29 23:49:53,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:49:53,006 INFO L225 Difference]: With dead ends: 359 [2018-03-29 23:49:53,006 INFO L226 Difference]: Without dead ends: 358 [2018-03-29 23:49:53,007 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 646 GetRequests, 635 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-03-29 23:49:53,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-03-29 23:49:53,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 341. [2018-03-29 23:49:53,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-03-29 23:49:53,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 343 transitions. [2018-03-29 23:49:53,015 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 343 transitions. Word has length 322 [2018-03-29 23:49:53,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:49:53,016 INFO L459 AbstractCegarLoop]: Abstraction has 341 states and 343 transitions. [2018-03-29 23:49:53,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-03-29 23:49:53,016 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 343 transitions. [2018-03-29 23:49:53,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-03-29 23:49:53,017 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:49:53,017 INFO L355 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 32, 32, 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, 1] [2018-03-29 23:49:53,017 INFO L408 AbstractCegarLoop]: === Iteration 23 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-29 23:49:53,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1071372289, now seen corresponding path program 1 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-03-29 23:49:53,024 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:49:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:49:53,086 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:49:53,134 INFO L134 CoverageAnalysis]: Checked inductivity of 4530 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4528 trivial. 0 not checked. [2018-03-29 23:49:53,135 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:49:53,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4530 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4528 trivial. 0 not checked. [2018-03-29 23:49:53,208 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:49:53,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-03-29 23:49:53,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-03-29 23:49:53,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-03-29 23:49:53,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-03-29 23:49:53,209 INFO L87 Difference]: Start difference. First operand 341 states and 343 transitions. Second operand 8 states. [2018-03-29 23:49:53,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:49:53,555 INFO L93 Difference]: Finished difference Result 391 states and 397 transitions. [2018-03-29 23:49:53,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-03-29 23:49:53,555 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 330 [2018-03-29 23:49:53,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:49:53,556 INFO L225 Difference]: With dead ends: 391 [2018-03-29 23:49:53,556 INFO L226 Difference]: Without dead ends: 371 [2018-03-29 23:49:53,557 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 653 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-03-29 23:49:53,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-03-29 23:49:53,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 361. [2018-03-29 23:49:53,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-03-29 23:49:53,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 365 transitions. [2018-03-29 23:49:53,566 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 365 transitions. Word has length 330 [2018-03-29 23:49:53,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:49:53,566 INFO L459 AbstractCegarLoop]: Abstraction has 361 states and 365 transitions. [2018-03-29 23:49:53,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-03-29 23:49:53,566 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 365 transitions. [2018-03-29 23:49:53,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 947 [2018-03-29 23:49:53,574 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:49:53,574 INFO L355 BasicCegarLoop]: trace histogram [99, 96, 96, 96, 96, 96, 96, 96, 96, 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, 1] [2018-03-29 23:49:53,574 INFO L408 AbstractCegarLoop]: === Iteration 24 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-29 23:49:53,575 INFO L82 PathProgramCache]: Analyzing trace with hash -136445473, now seen corresponding path program 2 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-03-29 23:49:53,593 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:49:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:49:53,796 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:49:54,115 INFO L134 CoverageAnalysis]: Checked inductivity of 41682 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 41646 trivial. 0 not checked. [2018-03-29 23:49:54,115 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:49:54,482 INFO L134 CoverageAnalysis]: Checked inductivity of 41682 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 41646 trivial. 0 not checked. [2018-03-29 23:49:54,504 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:49:54,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-03-29 23:49:54,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-03-29 23:49:54,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-03-29 23:49:54,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-03-29 23:49:54,505 INFO L87 Difference]: Start difference. First operand 361 states and 365 transitions. Second operand 16 states. [2018-03-29 23:49:54,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:49:54,675 INFO L93 Difference]: Finished difference Result 431 states and 443 transitions. [2018-03-29 23:49:54,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-03-29 23:49:54,675 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 946 [2018-03-29 23:49:54,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:49:54,677 INFO L225 Difference]: With dead ends: 431 [2018-03-29 23:49:54,677 INFO L226 Difference]: Without dead ends: 411 [2018-03-29 23:49:54,678 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1903 GetRequests, 1877 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-03-29 23:49:54,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-03-29 23:49:54,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 401. [2018-03-29 23:49:54,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-03-29 23:49:54,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 409 transitions. [2018-03-29 23:49:54,690 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 409 transitions. Word has length 946 [2018-03-29 23:49:54,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:49:54,691 INFO L459 AbstractCegarLoop]: Abstraction has 401 states and 409 transitions. [2018-03-29 23:49:54,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-03-29 23:49:54,691 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 409 transitions. [2018-03-29 23:49:54,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2179 [2018-03-29 23:49:54,728 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:49:54,729 INFO L355 BasicCegarLoop]: trace histogram [231, 224, 224, 224, 224, 224, 224, 224, 224, 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, 1] [2018-03-29 23:49:54,729 INFO L408 AbstractCegarLoop]: === Iteration 25 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-29 23:49:54,730 INFO L82 PathProgramCache]: Analyzing trace with hash 621863835, now seen corresponding path program 3 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-03-29 23:49:54,739 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:49:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:49:55,181 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:49:56,992 INFO L134 CoverageAnalysis]: Checked inductivity of 228354 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 228130 trivial. 0 not checked. [2018-03-29 23:49:56,992 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:49:58,585 INFO L134 CoverageAnalysis]: Checked inductivity of 228354 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 228130 trivial. 0 not checked. [2018-03-29 23:49:58,609 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:49:58,609 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-03-29 23:49:58,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-03-29 23:49:58,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-03-29 23:49:58,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=720, Unknown=0, NotChecked=0, Total=992 [2018-03-29 23:49:58,611 INFO L87 Difference]: Start difference. First operand 401 states and 409 transitions. Second operand 32 states. [2018-03-29 23:49:59,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:49:59,302 INFO L93 Difference]: Finished difference Result 511 states and 535 transitions. [2018-03-29 23:49:59,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-03-29 23:49:59,302 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 2178 [2018-03-29 23:49:59,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:49:59,307 INFO L225 Difference]: With dead ends: 511 [2018-03-29 23:49:59,308 INFO L226 Difference]: Without dead ends: 491 [2018-03-29 23:49:59,309 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4383 GetRequests, 4325 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1155, Invalid=2385, Unknown=0, NotChecked=0, Total=3540 [2018-03-29 23:49:59,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-03-29 23:49:59,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 481. [2018-03-29 23:49:59,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2018-03-29 23:49:59,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 497 transitions. [2018-03-29 23:49:59,333 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 497 transitions. Word has length 2178 [2018-03-29 23:49:59,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:49:59,335 INFO L459 AbstractCegarLoop]: Abstraction has 481 states and 497 transitions. [2018-03-29 23:49:59,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-03-29 23:49:59,335 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 497 transitions. [2018-03-29 23:49:59,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4643 [2018-03-29 23:49:59,456 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:49:59,457 INFO L355 BasicCegarLoop]: trace histogram [495, 480, 480, 480, 480, 480, 480, 480, 480, 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, 1] [2018-03-29 23:49:59,457 INFO L408 AbstractCegarLoop]: === Iteration 26 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-29 23:49:59,458 INFO L82 PathProgramCache]: Analyzing trace with hash 985194259, now seen corresponding path program 4 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-03-29 23:49:59,464 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:50:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:50:00,228 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:50:06,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1051170 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 1050090 trivial. 0 not checked. [2018-03-29 23:50:06,092 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:50:12,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1051170 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 1050090 trivial. 0 not checked. [2018-03-29 23:50:12,070 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:50:12,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 64 [2018-03-29 23:50:12,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-03-29 23:50:12,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-03-29 23:50:12,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1056, Invalid=2976, Unknown=0, NotChecked=0, Total=4032 [2018-03-29 23:50:12,074 INFO L87 Difference]: Start difference. First operand 481 states and 497 transitions. Second operand 64 states. [2018-03-29 23:50:13,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:50:13,335 INFO L93 Difference]: Finished difference Result 671 states and 719 transitions. [2018-03-29 23:50:13,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-03-29 23:50:13,336 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 4642 [2018-03-29 23:50:13,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:50:13,342 INFO L225 Difference]: With dead ends: 671 [2018-03-29 23:50:13,342 INFO L226 Difference]: Without dead ends: 651 [2018-03-29 23:50:13,343 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9343 GetRequests, 9221 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3257 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=4867, Invalid=10385, Unknown=0, NotChecked=0, Total=15252 [2018-03-29 23:50:13,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2018-03-29 23:50:13,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 641. [2018-03-29 23:50:13,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2018-03-29 23:50:13,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 673 transitions. [2018-03-29 23:50:13,369 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 673 transitions. Word has length 4642 [2018-03-29 23:50:13,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:50:13,372 INFO L459 AbstractCegarLoop]: Abstraction has 641 states and 673 transitions. [2018-03-29 23:50:13,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-03-29 23:50:13,372 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 673 transitions. [2018-03-29 23:50:13,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9571 [2018-03-29 23:50:13,724 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:50:13,726 INFO L355 BasicCegarLoop]: trace histogram [1023, 992, 992, 992, 992, 992, 992, 992, 992, 32, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 23:50:13,727 INFO L408 AbstractCegarLoop]: === Iteration 27 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-29 23:50:13,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1464972803, now seen corresponding path program 5 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-03-29 23:50:13,734 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:50:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:50:15,356 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:50:38,523 INFO L134 CoverageAnalysis]: Checked inductivity of 4494690 backedges. 0 proven. 4712 refuted. 0 times theorem prover too weak. 4489978 trivial. 0 not checked. [2018-03-29 23:50:38,523 INFO L314 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown