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-453dfda-m [2018-04-10 02:57:31,898 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 02:57:31,901 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 02:57:31,922 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 02:57:31,923 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 02:57:31,924 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 02:57:31,925 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 02:57:31,927 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 02:57:31,929 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 02:57:31,930 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 02:57:31,931 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 02:57:31,931 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 02:57:31,932 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 02:57:31,934 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 02:57:31,935 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 02:57:31,937 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 02:57:31,939 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 02:57:31,941 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 02:57:31,943 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 02:57:31,944 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 02:57:31,946 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 02:57:31,946 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 02:57:31,947 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 02:57:31,948 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 02:57:31,949 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 02:57:31,950 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 02:57:31,950 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 02:57:31,951 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 02:57:31,952 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 02:57:31,952 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 02:57:31,953 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 02:57:31,953 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-10 02:57:31,978 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 02:57:31,978 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 02:57:31,978 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-10 02:57:31,979 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-10 02:57:31,979 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-10 02:57:31,980 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-10 02:57:31,980 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-10 02:57:31,980 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-10 02:57:31,980 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-10 02:57:31,980 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-10 02:57:31,981 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-10 02:57:31,981 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-10 02:57:31,981 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 02:57:31,981 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 02:57:31,982 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 02:57:31,982 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 02:57:31,982 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 02:57:31,982 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 02:57:31,982 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 02:57:31,983 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-10 02:57:31,983 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 02:57:31,983 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 02:57:31,983 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 02:57:31,983 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-10 02:57:31,984 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-10 02:57:31,984 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 02:57:31,984 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 02:57:31,984 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 02:57:31,984 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-10 02:57:31,985 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-10 02:57:31,985 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-10 02:57:31,985 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-10 02:57:31,985 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 02:57:31,985 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-10 02:57:31,986 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-10 02:57:31,986 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-10 02:57:31,987 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-10 02:57:31,987 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-10 02:57:32,026 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 02:57:32,039 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 02:57:32,044 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 02:57:32,046 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 02:57:32,046 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 02:57:32,047 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-04-10 02:57:32,359 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG09f47b1f4 [2018-04-10 02:57:32,491 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 02:57:32,491 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 02:57:32,492 INFO L168 CDTParser]: Scanning ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2018-04-10 02:57:32,492 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 02:57:32,493 INFO L215 ultiparseSymbolTable]: [2018-04-10 02:57:32,493 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 02:57:32,493 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-04-10 02:57:32,493 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2018-04-10 02:57:32,493 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 02:57:32,493 INFO L233 ultiparseSymbolTable]: [2018-04-10 02:57:32,508 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG09f47b1f4 [2018-04-10 02:57:32,513 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 02:57:32,514 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-04-10 02:57:32,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 02:57:32,516 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 02:57:32,521 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 02:57:32,522 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 02:57:32" (1/1) ... [2018-04-10 02:57:32,525 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5849295b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:57:32, skipping insertion in model container [2018-04-10 02:57:32,525 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 02:57:32" (1/1) ... [2018-04-10 02:57:32,541 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 02:57:32,553 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 02:57:32,688 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 02:57:32,711 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 02:57:32,716 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-04-10 02:57:32,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:57:32 WrapperNode [2018-04-10 02:57:32,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 02:57:32,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 02:57:32,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 02:57:32,727 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 02:57:32,737 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:57:32" (1/1) ... [2018-04-10 02:57:32,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:57:32" (1/1) ... [2018-04-10 02:57:32,745 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:57:32" (1/1) ... [2018-04-10 02:57:32,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:57:32" (1/1) ... [2018-04-10 02:57:32,751 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:57:32" (1/1) ... [2018-04-10 02:57:32,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:57:32" (1/1) ... [2018-04-10 02:57:32,759 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:57:32" (1/1) ... [2018-04-10 02:57:32,761 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 02:57:32,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 02:57:32,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 02:57:32,762 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 02:57:32,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:57:32" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 02:57:32,817 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 02:57:32,817 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 02:57:32,817 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo [2018-04-10 02:57:32,817 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 02:57:32,817 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo [2018-04-10 02:57:32,817 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-10 02:57:32,818 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 02:57:32,818 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-10 02:57:32,818 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-10 02:57:32,818 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 02:57:32,818 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 02:57:32,818 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-10 02:57:32,819 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-10 02:57:33,083 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 02:57:33,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 02:57:33 BoogieIcfgContainer [2018-04-10 02:57:33,084 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 02:57:33,084 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-04-10 02:57:33,084 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-04-10 02:57:33,085 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-04-10 02:57:33,088 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 02:57:33" (1/1) ... [2018-04-10 02:57:33,095 INFO L139 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-04-10 02:57:33,095 INFO L140 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-04-10 02:57:33,112 INFO L299 apSepIcfgTransformer]: Heap separator: starting memloc-array-style preprocessing [2018-04-10 02:57:33,123 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-04-10 02:57:33,125 INFO L332 apSepIcfgTransformer]: finished MemlocArrayUpdater, created 0 location literals (each corresponds to one heap write) [2018-04-10 02:57:33,131 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-04-10 02:57:33,136 INFO L412 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-04-10 02:57:33,136 DEBUG L416 apSepIcfgTransformer]: storeIndexInfoToLocLiteral: Map: [2018-04-10 02:57:33,138 DEBUG L418 apSepIcfgTransformer]: edgeToIndexToStoreIndexInfo: NestedMap2: [2018-04-10 02:57:33,189 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-04-10 02:57:35,592 INFO L314 AbstractInterpreter]: Visited 69 different actions 192 times. Merged at 46 different actions 84 times. Never widened. Found 11 fixpoints after 6 different actions. Largest state had 21 variables. [2018-04-10 02:57:35,595 INFO L424 apSepIcfgTransformer]: finished equality analysis [2018-04-10 02:57:35,603 INFO L195 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 1 [2018-04-10 02:57:35,604 INFO L434 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-04-10 02:57:35,604 INFO L435 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-04-10 02:57:35,604 INFO L437 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-04-10 02:57:35,608 DEBUG L373 HeapPartitionManager]: creating LocationBlock locs_30 [2018-04-10 02:57:35,609 DEBUG L374 HeapPartitionManager]: with contents [NoStoreIndexInfo] [2018-04-10 02:57:35,609 DEBUG L323 HeapPartitionManager]: adding LocationBlock locs_30 [2018-04-10 02:57:35,609 DEBUG L324 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-04-10 02:57:35,609 DEBUG L325 HeapPartitionManager]: write locations: [NoStoreIndexInfo] [2018-04-10 02:57:35,609 DEBUG L373 HeapPartitionManager]: creating LocationBlock locs_30 [2018-04-10 02:57:35,610 DEBUG L374 HeapPartitionManager]: with contents [NoStoreIndexInfo] [2018-04-10 02:57:35,610 DEBUG L323 HeapPartitionManager]: adding LocationBlock locs_30 [2018-04-10 02:57:35,610 DEBUG L324 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-04-10 02:57:35,610 DEBUG L325 HeapPartitionManager]: write locations: [NoStoreIndexInfo] [2018-04-10 02:57:35,610 INFO L330 HeapPartitionManager]: partitioning result: [2018-04-10 02:57:35,611 INFO L335 HeapPartitionManager]: location blocks for array group [#memory_int] [2018-04-10 02:57:35,611 INFO L344 HeapPartitionManager]: at dimension 0 [2018-04-10 02:57:35,611 INFO L345 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-04-10 02:57:35,611 INFO L346 HeapPartitionManager]: # location blocks :1 [2018-04-10 02:57:35,612 DEBUG L353 HeapPartitionManager]: location block contents: [2018-04-10 02:57:35,612 DEBUG L356 HeapPartitionManager]: [NoStoreIndexInfo] [2018-04-10 02:57:35,612 INFO L344 HeapPartitionManager]: at dimension 1 [2018-04-10 02:57:35,612 INFO L345 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-04-10 02:57:35,612 INFO L346 HeapPartitionManager]: # location blocks :1 [2018-04-10 02:57:35,612 DEBUG L353 HeapPartitionManager]: location block contents: [2018-04-10 02:57:35,613 DEBUG L356 HeapPartitionManager]: [NoStoreIndexInfo] [2018-04-10 02:57:35,614 INFO L134 ransitionTransformer]: executing heap partitioning transformation [2018-04-10 02:57:35,618 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,619 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 02:57:35,619 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,619 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,620 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,620 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 02:57:35,620 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,620 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,621 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,621 DEBUG L331 ransitionTransformer]: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] [2018-04-10 02:57:35,621 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,622 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,623 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,623 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 02:57:35,623 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,623 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,624 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,624 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 02:57:35,624 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 02:57:35,624 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 02:57:35,624 DEBUG L356 ransitionTransformer]: {main_~i~1=v_main_~i~1_8} [2018-04-10 02:57:35,624 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 02:57:35,625 DEBUG L358 ransitionTransformer]: {} [2018-04-10 02:57:35,625 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,625 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,625 DEBUG L331 ransitionTransformer]: Formula: (= |v_#valid_1| (store |v_#valid_2| 0 0)) InVars {#valid=|v_#valid_2|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid] [2018-04-10 02:57:35,626 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,626 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,626 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,626 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 02:57:35,626 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 02:57:35,627 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 02:57:35,627 DEBUG L356 ransitionTransformer]: {main_~b~0=v_main_~b~0_3} [2018-04-10 02:57:35,627 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 02:57:35,627 DEBUG L358 ransitionTransformer]: {} [2018-04-10 02:57:35,627 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,627 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,628 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 02:57:35,628 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,628 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,628 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,628 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 02:57:35,628 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 02:57:35,629 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 02:57:35,629 DEBUG L356 ransitionTransformer]: {main_~buffer~0=v_main_~buffer~0_1} [2018-04-10 02:57:35,629 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 02:57:35,629 DEBUG L358 ransitionTransformer]: {} [2018-04-10 02:57:35,629 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,630 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,630 DEBUG L331 ransitionTransformer]: Formula: (and (= 0 (select |v_#valid_16| |v_main_~#mask~0.base_5|)) (= |v_#length_5| (store |v_#length_6| |v_main_~#mask~0.base_5| 32)) (= 0 |v_main_~#mask~0.offset_5|) (not (= 0 |v_main_~#mask~0.base_5|)) (= |v_#valid_15| (store |v_#valid_16| |v_main_~#mask~0.base_5| 1))) InVars {#length=|v_#length_6|, #valid=|v_#valid_16|} OutVars{#length=|v_#length_5|, main_~#mask~0.base=|v_main_~#mask~0.base_5|, main_~#mask~0.offset=|v_main_~#mask~0.offset_5|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[main_~#mask~0.base, main_~#mask~0.offset, #valid, #length] [2018-04-10 02:57:35,630 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,630 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,631 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,631 DEBUG L331 ransitionTransformer]: Formula: (= v_main_~i~1_9 0) InVars {} OutVars{main_~i~1=v_main_~i~1_9} AuxVars[] AssignedVars[main_~i~1] [2018-04-10 02:57:35,631 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,631 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,631 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,632 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 02:57:35,632 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,632 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,632 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,632 DEBUG L331 ransitionTransformer]: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 02:57:35,632 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,633 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,633 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,633 DEBUG L331 ransitionTransformer]: Formula: (not (< v_main_~i~1_10 32)) InVars {main_~i~1=v_main_~i~1_10} OutVars{main_~i~1=v_main_~i~1_10} AuxVars[] AssignedVars[] [2018-04-10 02:57:35,633 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,633 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,634 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,634 DEBUG L331 ransitionTransformer]: Formula: (< v_main_~i~1_11 32) InVars {main_~i~1=v_main_~i~1_11} OutVars{main_~i~1=v_main_~i~1_11} AuxVars[] AssignedVars[] [2018-04-10 02:57:35,634 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,634 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,635 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,635 DEBUG L331 ransitionTransformer]: Formula: (= v_main_~i~1_16 0) InVars {} OutVars{main_~i~1=v_main_~i~1_16} AuxVars[] AssignedVars[main_~i~1] [2018-04-10 02:57:35,635 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,635 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,635 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,636 DEBUG L331 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-04-10 02:57:35,636 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,636 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,636 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,636 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 02:57:35,637 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,637 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,637 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,637 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 02:57:35,637 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,637 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,638 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,638 DEBUG L331 ransitionTransformer]: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 02:57:35,638 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,638 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,639 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,639 DEBUG L331 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|, main_~#mask~0.base=|v_main_~#mask~0.base_7|, main_~#mask~0.offset=|v_main_~#mask~0.offset_7|} 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-04-10 02:57:35,639 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 02:57:35,639 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 02:57:35,639 DEBUG L356 ransitionTransformer]: {__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|} [2018-04-10 02:57:35,640 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 02:57:35,640 DEBUG L358 ransitionTransformer]: {__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|, main_~#mask~0.base=|v_main_~#mask~0.base_7|, main_~#mask~0.offset=|v_main_~#mask~0.offset_7|} [2018-04-10 02:57:35,640 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,640 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,640 DEBUG L331 ransitionTransformer]: Formula: (not (< v_main_~i~1_1 32)) InVars {main_~i~1=v_main_~i~1_1} OutVars{main_~i~1=v_main_~i~1_1} AuxVars[] AssignedVars[] [2018-04-10 02:57:35,641 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,641 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,641 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,641 DEBUG L331 ransitionTransformer]: Formula: (< v_main_~i~1_2 32) InVars {main_~i~1=v_main_~i~1_2} OutVars{main_~i~1=v_main_~i~1_2} AuxVars[] AssignedVars[] [2018-04-10 02:57:35,641 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,642 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,642 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,642 DEBUG L331 ransitionTransformer]: Formula: (= |v_main_#res_2| 0) InVars {} OutVars{main_#res=|v_main_#res_2|} AuxVars[] AssignedVars[main_#res] [2018-04-10 02:57:35,642 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,642 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,643 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,643 DEBUG L331 ransitionTransformer]: Formula: (and (<= |v_main_#t~ret3_2| 2147483647) (<= 0 (+ |v_main_#t~ret3_2| 2147483648))) InVars {main_#t~ret3=|v_main_#t~ret3_2|} OutVars{main_#t~ret3=|v_main_#t~ret3_2|} AuxVars[] AssignedVars[] [2018-04-10 02:57:35,643 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,643 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,643 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,644 DEBUG L331 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-04-10 02:57:35,644 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,644 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,644 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,644 DEBUG L331 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-04-10 02:57:35,644 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,645 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,645 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,645 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 02:57:35,645 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,645 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,646 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,646 DEBUG L331 ransitionTransformer]: Formula: (= |v_#valid_11| (store |v_#valid_12| |v_main_~#mask~0.base_3| 0)) InVars {main_~#mask~0.base=|v_main_~#mask~0.base_3|, #valid=|v_#valid_12|} OutVars{main_~#mask~0.base=|v_main_~#mask~0.base_3|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#valid] [2018-04-10 02:57:35,646 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,646 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,646 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,647 DEBUG L331 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-04-10 02:57:35,647 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,647 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,647 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,647 DEBUG L331 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-04-10 02:57:35,648 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,648 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,648 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,648 DEBUG L331 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-04-10 02:57:35,648 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,649 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,649 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,649 DEBUG L331 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-04-10 02:57:35,649 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,649 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,650 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,650 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 02:57:35,650 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 02:57:35,650 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 02:57:35,650 DEBUG L356 ransitionTransformer]: {main_~#mask~0.base=|v_main_~#mask~0.base_4|, main_~#mask~0.offset=|v_main_~#mask~0.offset_4|} [2018-04-10 02:57:35,650 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 02:57:35,651 DEBUG L358 ransitionTransformer]: {} [2018-04-10 02:57:35,651 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,651 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,651 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 02:57:35,651 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 02:57:35,651 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 02:57:35,652 DEBUG L356 ransitionTransformer]: {main_#t~ret3=|v_main_#t~ret3_4|} [2018-04-10 02:57:35,652 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 02:57:35,652 DEBUG L358 ransitionTransformer]: {} [2018-04-10 02:57:35,652 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,652 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,653 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 02:57:35,653 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 02:57:35,653 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 02:57:35,653 DEBUG L356 ransitionTransformer]: {__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} [2018-04-10 02:57:35,653 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 02:57:35,653 DEBUG L358 ransitionTransformer]: {} [2018-04-10 02:57:35,653 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,654 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,654 DEBUG L331 ransitionTransformer]: Formula: (= |v_main_#res_1| 1) InVars {} OutVars{main_#res=|v_main_#res_1|} AuxVars[] AssignedVars[main_#res] [2018-04-10 02:57:35,654 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,654 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,655 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,655 DEBUG L331 ransitionTransformer]: Formula: (= |v_main_#t~post4_1| v_main_~i~1_6) InVars {main_~i~1=v_main_~i~1_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~1=v_main_~i~1_6} AuxVars[] AssignedVars[main_#t~post4] [2018-04-10 02:57:35,655 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,655 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,655 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,656 DEBUG L331 ransitionTransformer]: Formula: (= |v_#valid_13| |old(#valid)|) InVars {#valid=|v_#valid_13|, old(#valid)=|old(#valid)|} OutVars{#valid=|v_#valid_13|, old(#valid)=|old(#valid)|} AuxVars[] AssignedVars[] [2018-04-10 02:57:35,656 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,656 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,656 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,656 DEBUG L331 ransitionTransformer]: Formula: (not (= |v_#valid_14| |old(#valid)|)) InVars {#valid=|v_#valid_14|, old(#valid)=|old(#valid)|} OutVars{#valid=|v_#valid_14|, old(#valid)=|old(#valid)|} AuxVars[] AssignedVars[] [2018-04-10 02:57:35,657 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,657 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,657 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,657 DEBUG L331 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-04-10 02:57:35,657 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,657 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,658 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,658 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 02:57:35,658 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 02:57:35,658 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 02:57:35,658 DEBUG L356 ransitionTransformer]: {__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} [2018-04-10 02:57:35,658 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 02:57:35,659 DEBUG L358 ransitionTransformer]: {} [2018-04-10 02:57:35,659 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,659 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,659 DEBUG L331 ransitionTransformer]: Formula: (= (store |v_#valid_10| |v_main_~#mask~0.base_1| 0) |v_#valid_9|) InVars {main_~#mask~0.base=|v_main_~#mask~0.base_1|, #valid=|v_#valid_10|} OutVars{main_~#mask~0.base=|v_main_~#mask~0.base_1|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[#valid] [2018-04-10 02:57:35,659 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,660 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,660 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,660 DEBUG L331 ransitionTransformer]: Formula: (= v_main_~i~1_7 (+ |v_main_#t~post4_2| 1)) InVars {main_#t~post4=|v_main_#t~post4_2|} OutVars{main_#t~post4=|v_main_#t~post4_2|, main_~i~1=v_main_~i~1_7} AuxVars[] AssignedVars[main_~i~1] [2018-04-10 02:57:35,660 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,660 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,661 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,661 DEBUG L331 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-04-10 02:57:35,661 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,661 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,661 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,662 DEBUG L331 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-04-10 02:57:35,662 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,662 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,662 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,662 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 02:57:35,662 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 02:57:35,663 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 02:57:35,663 DEBUG L356 ransitionTransformer]: {main_~#mask~0.base=|v_main_~#mask~0.base_2|, main_~#mask~0.offset=|v_main_~#mask~0.offset_2|} [2018-04-10 02:57:35,663 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 02:57:35,663 DEBUG L358 ransitionTransformer]: {} [2018-04-10 02:57:35,663 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,663 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,664 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 02:57:35,664 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 02:57:35,664 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 02:57:35,664 DEBUG L356 ransitionTransformer]: {main_#t~post4=|v_main_#t~post4_3|} [2018-04-10 02:57:35,664 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 02:57:35,664 DEBUG L358 ransitionTransformer]: {} [2018-04-10 02:57:35,665 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,665 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,665 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 02:57:35,665 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 02:57:35,665 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 02:57:35,665 DEBUG L356 ransitionTransformer]: {main_#t~post2=|v_main_#t~post2_3|} [2018-04-10 02:57:35,665 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 02:57:35,666 DEBUG L358 ransitionTransformer]: {} [2018-04-10 02:57:35,666 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,666 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,666 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 02:57:35,666 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,667 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,667 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,667 DEBUG L331 ransitionTransformer]: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 02:57:35,667 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,667 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,667 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,668 DEBUG L331 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-04-10 02:57:35,668 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,668 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,668 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,668 DEBUG L331 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-04-10 02:57:35,669 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,669 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,669 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,669 DEBUG L331 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-04-10 02:57:35,669 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,669 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,670 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,670 DEBUG L331 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-04-10 02:57:35,670 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,670 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,670 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,670 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 02:57:35,671 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,671 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,671 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,671 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 02:57:35,671 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,671 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,674 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,675 DEBUG L331 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-04-10 02:57:35,675 DEBUG L338 ransitionTransformer]: formula has changed [2018-04-10 02:57:35,675 DEBUG L339 ransitionTransformer]: old formula: [2018-04-10 02:57:35,675 DEBUG L340 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-04-10 02:57:35,675 DEBUG L341 ransitionTransformer]: new formula: [2018-04-10 02:57:35,676 DEBUG L342 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-04-10 02:57:35,676 DEBUG L346 ransitionTransformer]: invars have changed [2018-04-10 02:57:35,676 DEBUG L347 ransitionTransformer]: old invars: [2018-04-10 02:57:35,676 DEBUG L348 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-04-10 02:57:35,676 DEBUG L349 ransitionTransformer]: new invars: [2018-04-10 02:57:35,676 DEBUG L350 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-04-10 02:57:35,677 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 02:57:35,677 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 02:57:35,677 DEBUG L356 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-04-10 02:57:35,677 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 02:57:35,677 DEBUG L358 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-04-10 02:57:35,677 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,679 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,680 DEBUG L331 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-04-10 02:57:35,680 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,680 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,681 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,681 DEBUG L331 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-04-10 02:57:35,681 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,681 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,681 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,682 DEBUG L331 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-04-10 02:57:35,682 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,682 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,682 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,682 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 02:57:35,682 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 02:57:35,683 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 02:57:35,683 DEBUG L356 ransitionTransformer]: {__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|} [2018-04-10 02:57:35,683 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 02:57:35,683 DEBUG L358 ransitionTransformer]: {} [2018-04-10 02:57:35,683 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,684 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,684 DEBUG L331 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-04-10 02:57:35,684 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,684 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,684 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,685 DEBUG L331 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-04-10 02:57:35,685 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,685 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,685 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,685 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 02:57:35,685 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 02:57:35,686 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 02:57:35,686 DEBUG L356 ransitionTransformer]: {__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|} [2018-04-10 02:57:35,686 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 02:57:35,686 DEBUG L358 ransitionTransformer]: {} [2018-04-10 02:57:35,686 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,686 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,687 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 02:57:35,687 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 02:57:35,687 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,687 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,687 DEBUG L331 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|, main_#res=|v_main_#resOutParam_1|} AuxVars[] AssignedVars[ULTIMATE.start_#t~ret5] [2018-04-10 02:57:35,687 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 02:57:35,688 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 02:57:35,688 DEBUG L356 ransitionTransformer]: {ULTIMATE.start_#t~ret5=|v_ULTIMATE.start_#t~ret5_2|} [2018-04-10 02:57:35,688 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 02:57:35,688 DEBUG L358 ransitionTransformer]: {ULTIMATE.start_#t~ret5=|v_ULTIMATE.start_#t~ret5_2|, main_#res=|v_main_#resOutParam_1|} [2018-04-10 02:57:35,688 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,689 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 02:57:35,689 DEBUG L331 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{__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#res=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#resOutParam_1|, main_#t~ret3=|v_main_#t~ret3_5|} AuxVars[] AssignedVars[main_#t~ret3] [2018-04-10 02:57:35,689 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 02:57:35,689 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 02:57:35,689 DEBUG L356 ransitionTransformer]: {main_#t~ret3=|v_main_#t~ret3_5|} [2018-04-10 02:57:35,689 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 02:57:35,689 DEBUG L358 ransitionTransformer]: {__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#res=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#resOutParam_1|, main_#t~ret3=|v_main_#t~ret3_5|} [2018-04-10 02:57:35,690 DEBUG L360 ransitionTransformer]: [2018-04-10 02:57:35,690 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-04-10 02:57:35,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.04 02:57:35 BasicIcfg [2018-04-10 02:57:35,692 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-04-10 02:57:35,693 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 02:57:35,693 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 02:57:35,696 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 02:57:35,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 02:57:32" (1/4) ... [2018-04-10 02:57:35,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@655695cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 02:57:35, skipping insertion in model container [2018-04-10 02:57:35,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:57:32" (2/4) ... [2018-04-10 02:57:35,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@655695cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 02:57:35, skipping insertion in model container [2018-04-10 02:57:35,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 02:57:33" (3/4) ... [2018-04-10 02:57:35,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@655695cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 02:57:35, skipping insertion in model container [2018-04-10 02:57:35,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.04 02:57:35" (4/4) ... [2018-04-10 02:57:35,700 INFO L107 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-04-10 02:57:35,710 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-10 02:57:35,718 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-04-10 02:57:35,762 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 02:57:35,762 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 02:57:35,763 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-10 02:57:35,763 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-10 02:57:35,763 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-10 02:57:35,763 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 02:57:35,763 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 02:57:35,763 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 02:57:35,763 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 02:57:35,764 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 02:57:35,779 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-04-10 02:57:35,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-10 02:57:35,786 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 02:57:35,787 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 02:57:35,787 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-04-10 02:57:35,792 INFO L82 PathProgramCache]: Analyzing trace with hash 840184683, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 02:57:35,810 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 02:57:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 02:57:35,850 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 02:57:35,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:57:35,906 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 02:57:35,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:57:35,975 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-10 02:57:35,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2018-04-10 02:57:35,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 02:57:35,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 02:57:35,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-10 02:57:35,992 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 5 states. [2018-04-10 02:57:36,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 02:57:36,085 INFO L93 Difference]: Finished difference Result 137 states and 159 transitions. [2018-04-10 02:57:36,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 02:57:36,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-10 02:57:36,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 02:57:36,098 INFO L225 Difference]: With dead ends: 137 [2018-04-10 02:57:36,098 INFO L226 Difference]: Without dead ends: 81 [2018-04-10 02:57:36,102 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-10 02:57:36,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-04-10 02:57:36,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 65. [2018-04-10 02:57:36,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-04-10 02:57:36,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2018-04-10 02:57:36,148 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 14 [2018-04-10 02:57:36,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 02:57:36,148 INFO L459 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2018-04-10 02:57:36,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 02:57:36,149 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2018-04-10 02:57:36,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-10 02:57:36,149 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 02:57:36,150 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 02:57:36,150 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-04-10 02:57:36,150 INFO L82 PathProgramCache]: Analyzing trace with hash -247761374, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 02:57:36,164 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 02:57:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 02:57:36,183 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 02:57:36,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:57:36,208 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 02:57:36,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:57:36,259 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-10 02:57:36,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2018-04-10 02:57:36,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 02:57:36,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 02:57:36,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-10 02:57:36,262 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 4 states. [2018-04-10 02:57:36,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 02:57:36,321 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-04-10 02:57:36,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 02:57:36,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-04-10 02:57:36,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 02:57:36,325 INFO L225 Difference]: With dead ends: 79 [2018-04-10 02:57:36,325 INFO L226 Difference]: Without dead ends: 78 [2018-04-10 02:57:36,326 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-04-10 02:57:36,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-04-10 02:57:36,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 68. [2018-04-10 02:57:36,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-04-10 02:57:36,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-04-10 02:57:36,332 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 23 [2018-04-10 02:57:36,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 02:57:36,333 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-04-10 02:57:36,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 02:57:36,333 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-04-10 02:57:36,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-10 02:57:36,334 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 02:57:36,334 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-04-10 02:57:36,334 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-04-10 02:57:36,334 INFO L82 PathProgramCache]: Analyzing trace with hash 909332224, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 02:57:36,347 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 02:57:36,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 02:57:36,368 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 02:57:36,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 02:57:36,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 02:57:36,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 02:57:36,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 02:57:36,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:57:36,419 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 02:57:36,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:57:36,462 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-10 02:57:36,463 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-10 02:57:36,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 02:57:36,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 02:57:36,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 02:57:36,464 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 5 states. [2018-04-10 02:57:36,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 02:57:36,566 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-04-10 02:57:36,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 02:57:36,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-04-10 02:57:36,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 02:57:36,567 INFO L225 Difference]: With dead ends: 68 [2018-04-10 02:57:36,568 INFO L226 Difference]: Without dead ends: 67 [2018-04-10 02:57:36,568 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-04-10 02:57:36,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-04-10 02:57:36,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-04-10 02:57:36,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-04-10 02:57:36,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-04-10 02:57:36,575 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 24 [2018-04-10 02:57:36,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 02:57:36,575 INFO L459 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-04-10 02:57:36,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 02:57:36,575 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-04-10 02:57:36,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-10 02:57:36,576 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 02:57:36,576 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-04-10 02:57:36,576 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-04-10 02:57:36,577 INFO L82 PathProgramCache]: Analyzing trace with hash 909332225, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 02:57:36,589 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 02:57:36,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 02:57:36,608 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 02:57:36,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 02:57:36,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 02:57:36,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 02:57:36,627 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 02:57:36,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:57:36,692 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 02:57:36,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:57:36,820 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-10 02:57:36,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2018-04-10 02:57:36,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 02:57:36,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 02:57:36,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-04-10 02:57:36,821 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 10 states. [2018-04-10 02:57:37,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 02:57:37,033 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-04-10 02:57:37,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 02:57:37,033 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-04-10 02:57:37,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 02:57:37,034 INFO L225 Difference]: With dead ends: 76 [2018-04-10 02:57:37,034 INFO L226 Difference]: Without dead ends: 75 [2018-04-10 02:57:37,035 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-04-10 02:57:37,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-04-10 02:57:37,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2018-04-10 02:57:37,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-04-10 02:57:37,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-04-10 02:57:37,042 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 24 [2018-04-10 02:57:37,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 02:57:37,043 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-04-10 02:57:37,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 02:57:37,043 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-04-10 02:57:37,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-10 02:57:37,044 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 02:57:37,044 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-04-10 02:57:37,044 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-04-10 02:57:37,044 INFO L82 PathProgramCache]: Analyzing trace with hash 377367732, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 02:57:37,060 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 02:57:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 02:57:37,076 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 02:57:37,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:57:37,171 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 02:57:37,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:57:37,333 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 02:57:37,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-04-10 02:57:37,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 02:57:37,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 02:57:37,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-04-10 02:57:37,334 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 8 states. [2018-04-10 02:57:37,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 02:57:37,682 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2018-04-10 02:57:37,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 02:57:37,683 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-04-10 02:57:37,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 02:57:37,684 INFO L225 Difference]: With dead ends: 102 [2018-04-10 02:57:37,684 INFO L226 Difference]: Without dead ends: 101 [2018-04-10 02:57:37,685 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-04-10 02:57:37,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-04-10 02:57:37,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 85. [2018-04-10 02:57:37,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-10 02:57:37,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2018-04-10 02:57:37,693 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 32 [2018-04-10 02:57:37,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 02:57:37,694 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2018-04-10 02:57:37,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 02:57:37,694 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2018-04-10 02:57:37,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-10 02:57:37,695 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 02:57:37,695 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-04-10 02:57:37,695 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-04-10 02:57:37,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1186501969, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 02:57:37,710 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 02:57:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 02:57:37,726 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 02:57:37,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 02:57:37,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 02:57:37,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 02:57:37,784 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 02:57:38,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:57:38,079 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 02:57:38,278 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:57:38,313 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 02:57:38,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-04-10 02:57:38,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-10 02:57:38,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-10 02:57:38,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-04-10 02:57:38,317 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 14 states. [2018-04-10 02:57:38,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 02:57:38,679 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2018-04-10 02:57:38,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 02:57:38,679 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-04-10 02:57:38,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 02:57:38,681 INFO L225 Difference]: With dead ends: 99 [2018-04-10 02:57:38,681 INFO L226 Difference]: Without dead ends: 98 [2018-04-10 02:57:38,681 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2018-04-10 02:57:38,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-04-10 02:57:38,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 86. [2018-04-10 02:57:38,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-04-10 02:57:38,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2018-04-10 02:57:38,690 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 33 [2018-04-10 02:57:38,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 02:57:38,691 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2018-04-10 02:57:38,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-10 02:57:38,691 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2018-04-10 02:57:38,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-10 02:57:38,692 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 02:57:38,692 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-04-10 02:57:38,692 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-04-10 02:57:38,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1851771686, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 02:57:38,702 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 02:57:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 02:57:38,716 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 02:57:38,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:57:38,766 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 02:57:38,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:57:38,854 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-10 02:57:38,855 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2018-04-10 02:57:38,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 02:57:38,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 02:57:38,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-10 02:57:38,856 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand 8 states. [2018-04-10 02:57:38,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 02:57:38,925 INFO L93 Difference]: Finished difference Result 161 states and 173 transitions. [2018-04-10 02:57:38,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 02:57:38,925 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-04-10 02:57:38,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 02:57:38,926 INFO L225 Difference]: With dead ends: 161 [2018-04-10 02:57:38,926 INFO L226 Difference]: Without dead ends: 86 [2018-04-10 02:57:38,926 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-04-10 02:57:38,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-04-10 02:57:38,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-04-10 02:57:38,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-04-10 02:57:38,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-04-10 02:57:38,933 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 34 [2018-04-10 02:57:38,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 02:57:38,933 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-04-10 02:57:38,933 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 02:57:38,933 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-04-10 02:57:38,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-10 02:57:38,934 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 02:57:38,934 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-04-10 02:57:38,935 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-04-10 02:57:38,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1644163320, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 02:57:38,941 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 02:57:38,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 02:57:38,965 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 02:57:39,038 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:57:39,038 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 02:57:39,207 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:57:39,237 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 02:57:39,238 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-04-10 02:57:39,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-10 02:57:39,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-10 02:57:39,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-04-10 02:57:39,238 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 12 states. [2018-04-10 02:57:39,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 02:57:39,475 INFO L93 Difference]: Finished difference Result 167 states and 177 transitions. [2018-04-10 02:57:39,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 02:57:39,493 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2018-04-10 02:57:39,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 02:57:39,494 INFO L225 Difference]: With dead ends: 167 [2018-04-10 02:57:39,494 INFO L226 Difference]: Without dead ends: 89 [2018-04-10 02:57:39,495 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2018-04-10 02:57:39,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-04-10 02:57:39,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-04-10 02:57:39,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-04-10 02:57:39,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2018-04-10 02:57:39,501 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 43 [2018-04-10 02:57:39,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 02:57:39,501 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2018-04-10 02:57:39,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-10 02:57:39,501 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2018-04-10 02:57:39,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-10 02:57:39,502 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 02:57:39,503 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-04-10 02:57:39,503 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-04-10 02:57:39,503 INFO L82 PathProgramCache]: Analyzing trace with hash -919097228, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 02:57:39,509 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 02:57:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 02:57:39,534 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 02:57:39,589 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:57:39,589 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 02:57:39,697 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:57:39,719 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 02:57:39,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-04-10 02:57:39,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 02:57:39,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 02:57:39,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-04-10 02:57:39,720 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand 16 states. [2018-04-10 02:57:39,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 02:57:39,994 INFO L93 Difference]: Finished difference Result 143 states and 153 transitions. [2018-04-10 02:57:39,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 02:57:39,994 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2018-04-10 02:57:39,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 02:57:39,996 INFO L225 Difference]: With dead ends: 143 [2018-04-10 02:57:39,996 INFO L226 Difference]: Without dead ends: 142 [2018-04-10 02:57:39,996 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=550, Unknown=0, NotChecked=0, Total=756 [2018-04-10 02:57:39,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-04-10 02:57:40,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 121. [2018-04-10 02:57:40,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-04-10 02:57:40,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2018-04-10 02:57:40,006 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 50 [2018-04-10 02:57:40,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 02:57:40,007 INFO L459 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2018-04-10 02:57:40,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 02:57:40,007 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2018-04-10 02:57:40,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-10 02:57:40,008 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 02:57:40,008 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-04-10 02:57:40,008 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-04-10 02:57:40,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1572757231, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 02:57:40,017 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 02:57:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 02:57:40,039 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 02:57:40,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 02:57:40,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 02:57:40,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 02:57:40,054 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 02:57:40,143 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:57:40,143 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 02:57:40,284 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:57:40,306 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 02:57:40,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-04-10 02:57:40,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-10 02:57:40,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-10 02:57:40,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2018-04-10 02:57:40,307 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand 22 states. [2018-04-10 02:57:40,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 02:57:40,992 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2018-04-10 02:57:40,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-10 02:57:40,992 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2018-04-10 02:57:40,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 02:57:40,994 INFO L225 Difference]: With dead ends: 138 [2018-04-10 02:57:40,994 INFO L226 Difference]: Without dead ends: 137 [2018-04-10 02:57:40,995 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=335, Invalid=997, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 02:57:40,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-04-10 02:57:41,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 122. [2018-04-10 02:57:41,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-10 02:57:41,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2018-04-10 02:57:41,007 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 51 [2018-04-10 02:57:41,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 02:57:41,008 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2018-04-10 02:57:41,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-10 02:57:41,008 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2018-04-10 02:57:41,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-10 02:57:41,009 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 02:57:41,009 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-04-10 02:57:41,009 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-04-10 02:57:41,010 INFO L82 PathProgramCache]: Analyzing trace with hash -628968632, 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-04-10 02:57:41,027 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 02:57:41,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 02:57:41,048 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 02:57:41,110 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:57:41,111 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 02:57:41,224 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:57:41,246 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 02:57:41,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-04-10 02:57:41,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-10 02:57:41,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-10 02:57:41,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2018-04-10 02:57:41,247 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand 20 states. [2018-04-10 02:57:41,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 02:57:41,562 INFO L93 Difference]: Finished difference Result 239 states and 253 transitions. [2018-04-10 02:57:41,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-10 02:57:41,562 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 61 [2018-04-10 02:57:41,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 02:57:41,563 INFO L225 Difference]: With dead ends: 239 [2018-04-10 02:57:41,563 INFO L226 Difference]: Without dead ends: 125 [2018-04-10 02:57:41,564 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=386, Invalid=804, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 02:57:41,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-04-10 02:57:41,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2018-04-10 02:57:41,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-10 02:57:41,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 125 transitions. [2018-04-10 02:57:41,571 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 125 transitions. Word has length 61 [2018-04-10 02:57:41,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 02:57:41,571 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 125 transitions. [2018-04-10 02:57:41,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-10 02:57:41,571 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 125 transitions. [2018-04-10 02:57:41,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-04-10 02:57:41,573 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 02:57:41,573 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-04-10 02:57:41,573 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-04-10 02:57:41,573 INFO L82 PathProgramCache]: Analyzing trace with hash 953313268, 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-04-10 02:57:41,584 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 02:57:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 02:57:41,606 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 02:57:41,744 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:57:41,744 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 02:57:42,026 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:57:42,047 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 02:57:42,047 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-04-10 02:57:42,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-10 02:57:42,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-10 02:57:42,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=818, Unknown=0, NotChecked=0, Total=992 [2018-04-10 02:57:42,048 INFO L87 Difference]: Start difference. First operand 122 states and 125 transitions. Second operand 32 states. [2018-04-10 02:57:43,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 02:57:43,207 INFO L93 Difference]: Finished difference Result 231 states and 249 transitions. [2018-04-10 02:57:43,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-10 02:57:43,207 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 86 [2018-04-10 02:57:43,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 02:57:43,209 INFO L225 Difference]: With dead ends: 231 [2018-04-10 02:57:43,209 INFO L226 Difference]: Without dead ends: 230 [2018-04-10 02:57:43,211 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=862, Invalid=2678, Unknown=0, NotChecked=0, Total=3540 [2018-04-10 02:57:43,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-04-10 02:57:43,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 193. [2018-04-10 02:57:43,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-04-10 02:57:43,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 211 transitions. [2018-04-10 02:57:43,223 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 211 transitions. Word has length 86 [2018-04-10 02:57:43,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 02:57:43,224 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 211 transitions. [2018-04-10 02:57:43,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-10 02:57:43,224 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 211 transitions. [2018-04-10 02:57:43,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-04-10 02:57:43,225 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 02:57:43,226 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-04-10 02:57:43,226 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-04-10 02:57:43,226 INFO L82 PathProgramCache]: Analyzing trace with hash -512059537, 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-04-10 02:57:43,233 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 02:57:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 02:57:43,258 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 02:57:43,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 02:57:43,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 02:57:43,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 02:57:43,287 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 02:57:43,670 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:57:43,670 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 02:57:44,071 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:57:44,093 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 02:57:44,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2018-04-10 02:57:44,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-10 02:57:44,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-10 02:57:44,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1187, Unknown=0, NotChecked=0, Total=1406 [2018-04-10 02:57:44,094 INFO L87 Difference]: Start difference. First operand 193 states and 211 transitions. Second operand 38 states. [2018-04-10 02:57:45,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 02:57:45,885 INFO L93 Difference]: Finished difference Result 222 states and 240 transitions. [2018-04-10 02:57:45,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-10 02:57:45,885 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 87 [2018-04-10 02:57:45,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 02:57:45,887 INFO L225 Difference]: With dead ends: 222 [2018-04-10 02:57:45,887 INFO L226 Difference]: Without dead ends: 221 [2018-04-10 02:57:45,888 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1107, Invalid=3585, Unknown=0, NotChecked=0, Total=4692 [2018-04-10 02:57:45,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-04-10 02:57:45,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 194. [2018-04-10 02:57:45,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-10 02:57:45,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 205 transitions. [2018-04-10 02:57:45,899 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 205 transitions. Word has length 87 [2018-04-10 02:57:45,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 02:57:45,899 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 205 transitions. [2018-04-10 02:57:45,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-10 02:57:45,899 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 205 transitions. [2018-04-10 02:57:45,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-04-10 02:57:45,901 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 02:57:45,901 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-04-10 02:57:45,901 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-04-10 02:57:45,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1555188680, 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-04-10 02:57:45,912 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 02:57:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 02:57:45,936 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 02:57:46,083 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:57:46,084 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 02:57:46,356 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:57:46,377 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 02:57:46,378 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2018-04-10 02:57:46,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-10 02:57:46,378 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-10 02:57:46,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=916, Unknown=0, NotChecked=0, Total=1260 [2018-04-10 02:57:46,379 INFO L87 Difference]: Start difference. First operand 194 states and 205 transitions. Second operand 36 states. [2018-04-10 02:57:47,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 02:57:47,407 INFO L93 Difference]: Finished difference Result 383 states and 405 transitions. [2018-04-10 02:57:47,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-10 02:57:47,408 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 97 [2018-04-10 02:57:47,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 02:57:47,409 INFO L225 Difference]: With dead ends: 383 [2018-04-10 02:57:47,409 INFO L226 Difference]: Without dead ends: 197 [2018-04-10 02:57:47,411 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 158 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1398, Invalid=3024, Unknown=0, NotChecked=0, Total=4422 [2018-04-10 02:57:47,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-10 02:57:47,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2018-04-10 02:57:47,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-10 02:57:47,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 197 transitions. [2018-04-10 02:57:47,418 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 197 transitions. Word has length 97 [2018-04-10 02:57:47,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 02:57:47,419 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 197 transitions. [2018-04-10 02:57:47,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-10 02:57:47,419 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 197 transitions. [2018-04-10 02:57:47,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-04-10 02:57:47,420 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 02:57:47,420 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-04-10 02:57:47,420 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-04-10 02:57:47,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1657366796, 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-04-10 02:57:47,427 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 02:57:47,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 02:57:47,493 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 02:57:48,060 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:57:48,061 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 02:57:49,194 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:57:49,215 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 02:57:49,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 63 [2018-04-10 02:57:49,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-10 02:57:49,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-10 02:57:49,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=606, Invalid=3426, Unknown=0, NotChecked=0, Total=4032 [2018-04-10 02:57:49,217 INFO L87 Difference]: Start difference. First operand 194 states and 197 transitions. Second operand 64 states. [2018-04-10 02:57:50,982 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 119 DAG size of output 11 [2018-04-10 02:57:51,787 WARN L151 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 103 DAG size of output 11 [2018-04-10 02:57:54,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 02:57:54,641 INFO L93 Difference]: Finished difference Result 407 states and 441 transitions. [2018-04-10 02:57:54,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-04-10 02:57:54,645 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 158 [2018-04-10 02:57:54,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 02:57:54,647 INFO L225 Difference]: With dead ends: 407 [2018-04-10 02:57:54,647 INFO L226 Difference]: Without dead ends: 406 [2018-04-10 02:57:54,651 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2010 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=3518, Invalid=11734, Unknown=0, NotChecked=0, Total=15252 [2018-04-10 02:57:54,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-04-10 02:57:54,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 337. [2018-04-10 02:57:54,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-04-10 02:57:54,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 371 transitions. [2018-04-10 02:57:54,672 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 371 transitions. Word has length 158 [2018-04-10 02:57:54,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 02:57:54,673 INFO L459 AbstractCegarLoop]: Abstraction has 337 states and 371 transitions. [2018-04-10 02:57:54,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-04-10 02:57:54,673 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 371 transitions. [2018-04-10 02:57:54,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-04-10 02:57:54,675 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 02:57:54,675 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-04-10 02:57:54,675 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-04-10 02:57:54,676 INFO L82 PathProgramCache]: Analyzing trace with hash 161237103, now seen corresponding path program 4 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 02:57:54,683 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 02:57:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 02:57:54,733 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 02:57:54,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 02:57:54,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 02:57:54,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 02:57:54,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 02:57:55,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 0 proven. 1005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:57:55,501 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 02:57:56,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 0 proven. 1005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:57:56,887 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 02:57:56,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 69 [2018-04-10 02:57:56,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-04-10 02:57:56,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-04-10 02:57:56,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=683, Invalid=4147, Unknown=0, NotChecked=0, Total=4830 [2018-04-10 02:57:56,890 INFO L87 Difference]: Start difference. First operand 337 states and 371 transitions. Second operand 70 states. [2018-04-10 02:57:59,208 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 124 DAG size of output 27 [2018-04-10 02:57:59,483 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 120 DAG size of output 26 [2018-04-10 02:57:59,712 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 117 DAG size of output 27 [2018-04-10 02:58:00,048 WARN L151 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 113 DAG size of output 26 [2018-04-10 02:58:00,382 WARN L151 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 110 DAG size of output 27 [2018-04-10 02:58:04,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 02:58:04,678 INFO L93 Difference]: Finished difference Result 390 states and 424 transitions. [2018-04-10 02:58:04,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-04-10 02:58:04,678 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 159 [2018-04-10 02:58:04,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 02:58:04,681 INFO L225 Difference]: With dead ends: 390 [2018-04-10 02:58:04,681 INFO L226 Difference]: Without dead ends: 389 [2018-04-10 02:58:04,688 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3281 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=3995, Invalid=13561, Unknown=0, NotChecked=0, Total=17556 [2018-04-10 02:58:04,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-04-10 02:58:04,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 338. [2018-04-10 02:58:04,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-04-10 02:58:04,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 357 transitions. [2018-04-10 02:58:04,707 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 357 transitions. Word has length 159 [2018-04-10 02:58:04,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 02:58:04,707 INFO L459 AbstractCegarLoop]: Abstraction has 338 states and 357 transitions. [2018-04-10 02:58:04,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-04-10 02:58:04,707 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 357 transitions. [2018-04-10 02:58:04,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-04-10 02:58:04,712 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 02:58:04,712 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-04-10 02:58:04,712 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-04-10 02:58:04,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1356153656, 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-04-10 02:58:04,722 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 02:58:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 02:58:04,765 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 02:58:05,188 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 3 proven. 975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:58:05,188 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 02:58:06,016 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 3 proven. 975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:58:06,037 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 02:58:06,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 68 [2018-04-10 02:58:06,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-04-10 02:58:06,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-04-10 02:58:06,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1192, Invalid=3364, Unknown=0, NotChecked=0, Total=4556 [2018-04-10 02:58:06,039 INFO L87 Difference]: Start difference. First operand 338 states and 357 transitions. Second operand 68 states. [2018-04-10 02:58:08,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 02:58:08,792 INFO L93 Difference]: Finished difference Result 671 states and 709 transitions. [2018-04-10 02:58:08,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-04-10 02:58:08,792 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 169 [2018-04-10 02:58:08,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 02:58:08,794 INFO L225 Difference]: With dead ends: 671 [2018-04-10 02:58:08,795 INFO L226 Difference]: Without dead ends: 341 [2018-04-10 02:58:08,797 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 270 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4729 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5342, Invalid=11688, Unknown=0, NotChecked=0, Total=17030 [2018-04-10 02:58:08,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-04-10 02:58:08,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 338. [2018-04-10 02:58:08,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-04-10 02:58:08,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 341 transitions. [2018-04-10 02:58:08,814 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 341 transitions. Word has length 169 [2018-04-10 02:58:08,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 02:58:08,815 INFO L459 AbstractCegarLoop]: Abstraction has 338 states and 341 transitions. [2018-04-10 02:58:08,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-04-10 02:58:08,815 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 341 transitions. [2018-04-10 02:58:08,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-04-10 02:58:08,820 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 02:58:08,820 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-04-10 02:58:08,820 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-04-10 02:58:08,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1731851508, 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-04-10 02:58:08,830 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 02:58:08,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 02:58:08,936 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 02:58:10,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:58:10,344 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 02:58:14,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:58:14,532 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 02:58:14,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 127 [2018-04-10 02:58:14,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-04-10 02:58:14,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-04-10 02:58:14,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1277, Invalid=14979, Unknown=0, NotChecked=0, Total=16256 [2018-04-10 02:58:14,535 INFO L87 Difference]: Start difference. First operand 338 states and 341 transitions. Second operand 128 states. [2018-04-10 02:58:20,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 02:58:20,830 INFO L93 Difference]: Finished difference Result 356 states and 360 transitions. [2018-04-10 02:58:20,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-04-10 02:58:20,831 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 302 [2018-04-10 02:58:20,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 02:58:20,834 INFO L225 Difference]: With dead ends: 356 [2018-04-10 02:58:20,834 INFO L226 Difference]: Without dead ends: 355 [2018-04-10 02:58:20,836 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 665 GetRequests, 477 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3844 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=3540, Invalid=32370, Unknown=0, NotChecked=0, Total=35910 [2018-04-10 02:58:20,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-04-10 02:58:20,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 346. [2018-04-10 02:58:20,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-04-10 02:58:20,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 350 transitions. [2018-04-10 02:58:20,855 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 350 transitions. Word has length 302 [2018-04-10 02:58:20,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 02:58:20,856 INFO L459 AbstractCegarLoop]: Abstraction has 346 states and 350 transitions. [2018-04-10 02:58:20,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-04-10 02:58:20,856 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 350 transitions. [2018-04-10 02:58:20,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-04-10 02:58:20,858 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 02:58:20,858 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-04-10 02:58:20,858 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-04-10 02:58:20,859 INFO L82 PathProgramCache]: Analyzing trace with hash -2147177873, 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-04-10 02:58:20,868 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 02:58:20,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 02:58:20,933 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 02:58:20,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 02:58:20,938 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 02:58:20,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 02:58:20,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 02:58:23,459 INFO L134 CoverageAnalysis]: Checked inductivity of 4309 backedges. 0 proven. 4309 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:58:23,459 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 02:58:27,182 INFO L134 CoverageAnalysis]: Checked inductivity of 4309 backedges. 0 proven. 4309 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:58:27,203 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 02:58:27,203 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 133 [2018-04-10 02:58:27,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-04-10 02:58:27,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-04-10 02:58:27,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1418, Invalid=16404, Unknown=0, NotChecked=0, Total=17822 [2018-04-10 02:58:27,204 INFO L87 Difference]: Start difference. First operand 346 states and 350 transitions. Second operand 134 states. [2018-04-10 02:58:35,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 02:58:35,920 INFO L93 Difference]: Finished difference Result 355 states and 359 transitions. [2018-04-10 02:58:35,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-04-10 02:58:35,921 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 303 [2018-04-10 02:58:35,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 02:58:35,922 INFO L225 Difference]: With dead ends: 355 [2018-04-10 02:58:35,922 INFO L226 Difference]: Without dead ends: 354 [2018-04-10 02:58:35,924 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 671 GetRequests, 473 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8383 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=4120, Invalid=35680, Unknown=0, NotChecked=0, Total=39800 [2018-04-10 02:58:35,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-04-10 02:58:35,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 347. [2018-04-10 02:58:35,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-04-10 02:58:35,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 351 transitions. [2018-04-10 02:58:35,934 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 351 transitions. Word has length 303 [2018-04-10 02:58:35,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 02:58:35,935 INFO L459 AbstractCegarLoop]: Abstraction has 347 states and 351 transitions. [2018-04-10 02:58:35,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-04-10 02:58:35,935 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 351 transitions. [2018-04-10 02:58:35,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-04-10 02:58:35,936 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 02:58:35,936 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-04-10 02:58:35,936 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-04-10 02:58:35,936 INFO L82 PathProgramCache]: Analyzing trace with hash 137116194, 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-04-10 02:58:35,943 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 02:58:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 02:58:36,015 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 02:58:37,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 4560 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:58:37,685 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 02:58:40,439 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 4560 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:58:40,460 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-10 02:58:40,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [69, 69] imperfect sequences [] total 134 [2018-04-10 02:58:40,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-04-10 02:58:40,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-04-10 02:58:40,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3467, Invalid=14355, Unknown=0, NotChecked=0, Total=17822 [2018-04-10 02:58:40,464 INFO L87 Difference]: Start difference. First operand 347 states and 351 transitions. Second operand 134 states. [2018-04-10 02:58:43,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 02:58:43,983 INFO L93 Difference]: Finished difference Result 679 states and 688 transitions. [2018-04-10 02:58:43,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-04-10 02:58:43,983 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 311 [2018-04-10 02:58:43,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 02:58:43,985 INFO L225 Difference]: With dead ends: 679 [2018-04-10 02:58:43,985 INFO L226 Difference]: Without dead ends: 346 [2018-04-10 02:58:43,987 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 487 SyntacticMatches, 2 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9379 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=10362, Invalid=29838, Unknown=0, NotChecked=0, Total=40200 [2018-04-10 02:58:43,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-04-10 02:58:43,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 343. [2018-04-10 02:58:43,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-04-10 02:58:43,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 346 transitions. [2018-04-10 02:58:43,997 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 346 transitions. Word has length 311 [2018-04-10 02:58:43,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 02:58:43,997 INFO L459 AbstractCegarLoop]: Abstraction has 343 states and 346 transitions. [2018-04-10 02:58:43,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-04-10 02:58:43,997 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 346 transitions. [2018-04-10 02:58:43,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-04-10 02:58:43,999 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 02:58:43,999 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-04-10 02:58:43,999 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-04-10 02:58:43,999 INFO L82 PathProgramCache]: Analyzing trace with hash -805265720, 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-04-10 02:58:44,005 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 02:58:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 02:58:44,065 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 02:58:45,548 INFO L134 CoverageAnalysis]: Checked inductivity of 4250 backedges. 3 proven. 4247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:58:45,548 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 02:58:45,784 WARN L148 SmtUtils]: Spent 231ms on a formula simplification that was a NOOP. DAG size: 165 [2018-04-10 02:58:46,054 WARN L148 SmtUtils]: Spent 267ms on a formula simplification that was a NOOP. DAG size: 165 [2018-04-10 02:58:47,629 INFO L134 CoverageAnalysis]: Checked inductivity of 4250 backedges. 3 proven. 4247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 02:58:47,651 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 02:58:47,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 131 [2018-04-10 02:58:47,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-04-10 02:58:47,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-04-10 02:58:47,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3396, Invalid=13634, Unknown=0, NotChecked=0, Total=17030 [2018-04-10 02:58:47,654 INFO L87 Difference]: Start difference. First operand 343 states and 346 transitions. Second operand 131 states. [2018-04-10 02:58:49,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 02:58:49,951 INFO L93 Difference]: Finished difference Result 675 states and 681 transitions. [2018-04-10 02:58:49,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-04-10 02:58:49,951 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 313 [2018-04-10 02:58:49,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 02:58:49,954 INFO L225 Difference]: With dead ends: 675 [2018-04-10 02:58:49,954 INFO L226 Difference]: Without dead ends: 343 [2018-04-10 02:58:49,957 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 494 SyntacticMatches, 2 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14760 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=9636, Invalid=27806, Unknown=0, NotChecked=0, Total=37442 [2018-04-10 02:58:49,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-04-10 02:58:49,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2018-04-10 02:58:49,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-04-10 02:58:49,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 345 transitions. [2018-04-10 02:58:49,972 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 345 transitions. Word has length 313 [2018-04-10 02:58:49,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 02:58:49,973 INFO L459 AbstractCegarLoop]: Abstraction has 343 states and 345 transitions. [2018-04-10 02:58:49,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-04-10 02:58:49,973 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 345 transitions. [2018-04-10 02:58:49,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-04-10 02:58:49,975 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 02:58:49,975 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-04-10 02:58:49,975 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-04-10 02:58:49,976 INFO L82 PathProgramCache]: Analyzing trace with hash -951258918, 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-04-10 02:58:49,984 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 02:58:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 02:58:50,062 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 02:58:50,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4531 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4528 trivial. 0 not checked. [2018-04-10 02:58:50,183 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 02:58:50,240 INFO L134 CoverageAnalysis]: Checked inductivity of 4531 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4528 trivial. 0 not checked. [2018-04-10 02:58:50,262 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-10 02:58:50,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2018-04-10 02:58:50,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 02:58:50,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 02:58:50,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-04-10 02:58:50,263 INFO L87 Difference]: Start difference. First operand 343 states and 345 transitions. Second operand 9 states. [2018-04-10 02:58:50,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 02:58:50,314 INFO L93 Difference]: Finished difference Result 359 states and 361 transitions. [2018-04-10 02:58:50,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 02:58:50,314 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 322 [2018-04-10 02:58:50,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 02:58:50,316 INFO L225 Difference]: With dead ends: 359 [2018-04-10 02:58:50,316 INFO L226 Difference]: Without dead ends: 358 [2018-04-10 02:58:50,316 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-04-10 02:58:50,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-04-10 02:58:50,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 341. [2018-04-10 02:58:50,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-04-10 02:58:50,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 343 transitions. [2018-04-10 02:58:50,326 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 343 transitions. Word has length 322 [2018-04-10 02:58:50,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 02:58:50,327 INFO L459 AbstractCegarLoop]: Abstraction has 341 states and 343 transitions. [2018-04-10 02:58:50,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 02:58:50,327 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 343 transitions. [2018-04-10 02:58:50,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-04-10 02:58:50,328 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 02:58:50,328 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-04-10 02:58:50,328 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-04-10 02:58:50,329 INFO L82 PathProgramCache]: Analyzing trace with hash 2127961249, 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-04-10 02:58:50,334 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 02:58:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 02:58:50,398 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 02:58:50,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4530 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4528 trivial. 0 not checked. [2018-04-10 02:58:50,457 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 02:58:50,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4530 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4528 trivial. 0 not checked. [2018-04-10 02:58:50,576 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 02:58:50,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-04-10 02:58:50,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 02:58:50,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 02:58:50,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-04-10 02:58:50,577 INFO L87 Difference]: Start difference. First operand 341 states and 343 transitions. Second operand 8 states. [2018-04-10 02:58:50,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 02:58:50,765 INFO L93 Difference]: Finished difference Result 397 states and 404 transitions. [2018-04-10 02:58:50,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 02:58:50,765 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 330 [2018-04-10 02:58:50,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 02:58:50,768 INFO L225 Difference]: With dead ends: 397 [2018-04-10 02:58:50,769 INFO L226 Difference]: Without dead ends: 377 [2018-04-10 02:58:50,769 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 653 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-04-10 02:58:50,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-04-10 02:58:50,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 361. [2018-04-10 02:58:50,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-04-10 02:58:50,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 365 transitions. [2018-04-10 02:58:50,789 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 365 transitions. Word has length 330 [2018-04-10 02:58:50,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 02:58:50,790 INFO L459 AbstractCegarLoop]: Abstraction has 361 states and 365 transitions. [2018-04-10 02:58:50,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 02:58:50,790 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 365 transitions. [2018-04-10 02:58:50,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 947 [2018-04-10 02:58:50,802 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 02:58:50,802 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-04-10 02:58:50,802 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-04-10 02:58:50,803 INFO L82 PathProgramCache]: Analyzing trace with hash -822354689, 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-04-10 02:58:50,811 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 02:58:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 02:58:51,066 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 02:58:51,522 INFO L134 CoverageAnalysis]: Checked inductivity of 41682 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 41646 trivial. 0 not checked. [2018-04-10 02:58:51,523 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 02:58:51,835 INFO L134 CoverageAnalysis]: Checked inductivity of 41682 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 41646 trivial. 0 not checked. [2018-04-10 02:58:51,859 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 02:58:51,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-04-10 02:58:51,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 02:58:51,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 02:58:51,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-04-10 02:58:51,861 INFO L87 Difference]: Start difference. First operand 361 states and 365 transitions. Second operand 16 states. [2018-04-10 02:58:52,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 02:58:52,087 INFO L93 Difference]: Finished difference Result 437 states and 450 transitions. [2018-04-10 02:58:52,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 02:58:52,090 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 946 [2018-04-10 02:58:52,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 02:58:52,096 INFO L225 Difference]: With dead ends: 437 [2018-04-10 02:58:52,096 INFO L226 Difference]: Without dead ends: 417 [2018-04-10 02:58:52,097 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1903 GetRequests, 1877 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=259, Invalid=497, Unknown=0, NotChecked=0, Total=756 [2018-04-10 02:58:52,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-04-10 02:58:52,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 401. [2018-04-10 02:58:52,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-04-10 02:58:52,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 409 transitions. [2018-04-10 02:58:52,124 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 409 transitions. Word has length 946 [2018-04-10 02:58:52,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 02:58:52,126 INFO L459 AbstractCegarLoop]: Abstraction has 401 states and 409 transitions. [2018-04-10 02:58:52,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 02:58:52,126 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 409 transitions. [2018-04-10 02:58:52,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2179 [2018-04-10 02:58:52,163 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 02:58:52,164 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-04-10 02:58:52,164 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-04-10 02:58:52,164 INFO L82 PathProgramCache]: Analyzing trace with hash -888116293, 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-04-10 02:58:52,194 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 02:58:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 02:58:52,750 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 02:58:54,295 INFO L134 CoverageAnalysis]: Checked inductivity of 228354 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 228130 trivial. 0 not checked. [2018-04-10 02:58:54,296 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 02:58:56,251 INFO L134 CoverageAnalysis]: Checked inductivity of 228354 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 228130 trivial. 0 not checked. [2018-04-10 02:58:56,276 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 02:58:56,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-04-10 02:58:56,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-10 02:58:56,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-10 02:58:56,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=720, Unknown=0, NotChecked=0, Total=992 [2018-04-10 02:58:56,278 INFO L87 Difference]: Start difference. First operand 401 states and 409 transitions. Second operand 32 states. [2018-04-10 02:58:56,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 02:58:56,800 INFO L93 Difference]: Finished difference Result 517 states and 542 transitions. [2018-04-10 02:58:56,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-10 02:58:56,801 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 2178 [2018-04-10 02:58:56,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 02:58:56,808 INFO L225 Difference]: With dead ends: 517 [2018-04-10 02:58:56,808 INFO L226 Difference]: Without dead ends: 497 [2018-04-10 02:58:56,810 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4383 GetRequests, 4325 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1155, Invalid=2385, Unknown=0, NotChecked=0, Total=3540 [2018-04-10 02:58:56,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2018-04-10 02:58:56,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 481. [2018-04-10 02:58:56,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2018-04-10 02:58:56,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 497 transitions. [2018-04-10 02:58:56,844 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 497 transitions. Word has length 2178 [2018-04-10 02:58:56,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 02:58:56,846 INFO L459 AbstractCegarLoop]: Abstraction has 481 states and 497 transitions. [2018-04-10 02:58:56,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-10 02:58:56,846 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 497 transitions. [2018-04-10 02:58:57,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4643 [2018-04-10 02:58:57,007 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 02:58:57,009 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-04-10 02:58:57,009 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-04-10 02:58:57,009 INFO L82 PathProgramCache]: Analyzing trace with hash 518373683, 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-04-10 02:58:57,015 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 02:58:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 02:58:58,046 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 02:59:04,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1051170 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 1050090 trivial. 0 not checked. [2018-04-10 02:59:04,672 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 02:59:11,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1051170 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 1050090 trivial. 0 not checked. [2018-04-10 02:59:11,273 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 02:59:11,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 64 [2018-04-10 02:59:11,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-10 02:59:11,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-10 02:59:11,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1056, Invalid=2976, Unknown=0, NotChecked=0, Total=4032 [2018-04-10 02:59:11,278 INFO L87 Difference]: Start difference. First operand 481 states and 497 transitions. Second operand 64 states. [2018-04-10 02:59:12,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 02:59:12,901 INFO L93 Difference]: Finished difference Result 677 states and 726 transitions. [2018-04-10 02:59:12,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-04-10 02:59:12,902 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 4642 [2018-04-10 02:59:12,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 02:59:12,911 INFO L225 Difference]: With dead ends: 677 [2018-04-10 02:59:12,911 INFO L226 Difference]: Without dead ends: 657 [2018-04-10 02:59:12,915 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9343 GetRequests, 9221 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3257 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=4867, Invalid=10385, Unknown=0, NotChecked=0, Total=15252 [2018-04-10 02:59:12,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2018-04-10 02:59:12,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 641. [2018-04-10 02:59:12,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2018-04-10 02:59:12,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 673 transitions. [2018-04-10 02:59:12,963 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 673 transitions. Word has length 4642 [2018-04-10 02:59:12,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 02:59:12,965 INFO L459 AbstractCegarLoop]: Abstraction has 641 states and 673 transitions. [2018-04-10 02:59:12,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-04-10 02:59:12,966 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 673 transitions. [2018-04-10 02:59:13,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9571 [2018-04-10 02:59:13,368 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 02:59:13,370 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-04-10 02:59:13,371 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-04-10 02:59:13,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1770081315, 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-04-10 02:59:13,378 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 02:59:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 02:59:15,354 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 02:59:40,903 INFO L134 CoverageAnalysis]: Checked inductivity of 4494690 backedges. 0 proven. 4712 refuted. 0 times theorem prover too weak. 4489978 trivial. 0 not checked. [2018-04-10 02:59:40,903 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:00:07,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4494690 backedges. 0 proven. 4712 refuted. 0 times theorem prover too weak. 4489978 trivial. 0 not checked. [2018-04-10 03:00:07,844 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:00:07,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2018-04-10 03:00:07,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-04-10 03:00:07,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-04-10 03:00:07,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2018-04-10 03:00:07,852 INFO L87 Difference]: Start difference. First operand 641 states and 673 transitions. Second operand 65 states. [2018-04-10 03:00:09,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:00:09,924 INFO L93 Difference]: Finished difference Result 687 states and 722 transitions. [2018-04-10 03:00:09,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-04-10 03:00:09,925 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 9570 [2018-04-10 03:00:09,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:00:09,939 INFO L225 Difference]: With dead ends: 687 [2018-04-10 03:00:09,939 INFO L226 Difference]: Without dead ends: 667 [2018-04-10 03:00:09,942 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19201 GetRequests, 19013 SyntacticMatches, 63 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5673 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5118, Invalid=10884, Unknown=0, NotChecked=0, Total=16002 [2018-04-10 03:00:09,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-04-10 03:00:09,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 651. [2018-04-10 03:00:09,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-04-10 03:00:09,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 684 transitions. [2018-04-10 03:00:09,988 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 684 transitions. Word has length 9570 [2018-04-10 03:00:09,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:00:09,993 INFO L459 AbstractCegarLoop]: Abstraction has 651 states and 684 transitions. [2018-04-10 03:00:09,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-04-10 03:00:09,994 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 684 transitions. [2018-04-10 03:00:10,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9879 [2018-04-10 03:00:10,525 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:00:10,531 INFO L355 BasicCegarLoop]: trace histogram [1056, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 33, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 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-04-10 03:00:10,531 INFO L408 AbstractCegarLoop]: === Iteration 28 === [__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-04-10 03:00:10,533 INFO L82 PathProgramCache]: Analyzing trace with hash 919446546, now seen corresponding path program 6 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:00:10,542 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:00:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:00:12,509 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:00:14,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 03:00:14,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:00:14,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:00:14,078 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 03:00:14,238 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 03:00:14,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 03:00:14,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:00:14,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:00:14,244 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-10 03:00:14,415 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 03:00:14,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 03:00:14,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:00:14,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:00:14,441 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-10 03:00:14,767 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 03:00:14,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 03:00:14,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:00:14,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:00:14,800 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-10 03:00:14,952 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 03:00:14,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 03:00:14,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:00:14,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:00:14,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-10 03:00:15,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 03:00:15,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 03:00:15,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:00:15,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:00:15,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-10 03:00:15,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 03:00:15,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 03:00:15,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:00:15,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:00:15,241 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-10 03:00:15,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 03:00:15,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 03:00:15,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:00:15,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:00:15,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-10 03:00:15,512 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 03:00:15,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 03:00:15,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:00:15,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:00:15,518 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-10 03:00:15,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 03:00:15,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 03:00:15,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:00:15,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:00:15,657 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-10 03:00:15,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 03:00:15,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 03:00:15,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:00:15,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:00:15,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-10 03:00:15,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 03:00:15,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 03:00:15,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:00:15,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:00:15,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-10 03:00:16,067 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 03:00:16,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 03:00:16,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:00:16,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:00:16,074 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-10 03:00:16,218 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 03:00:16,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 03:00:16,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:00:16,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:00:16,225 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-10 03:00:16,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 03:00:16,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 03:00:16,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:00:16,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:00:16,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-10 03:00:16,526 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 03:00:16,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 03:00:16,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:00:16,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:00:16,533 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-10 03:00:16,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 03:00:16,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 03:00:16,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:00:16,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:00:16,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-10 03:00:16,820 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 03:00:16,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 03:00:16,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:00:16,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:00:16,827 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-10 03:00:16,973 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 03:00:16,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 03:00:16,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:00:16,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:00:16,980 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-10 03:00:17,131 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 03:00:17,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 03:00:17,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:00:17,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:00:17,138 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-10 03:00:17,286 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 03:00:17,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 03:00:17,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:00:17,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:00:17,292 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-10 03:00:17,442 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 03:00:17,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 03:00:17,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:00:17,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:00:17,448 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-10 03:00:17,603 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 03:00:17,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 03:00:17,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:00:17,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:00:17,609 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-10 03:00:17,813 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 03:00:17,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 03:00:17,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:00:17,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:00:17,820 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-10 03:00:17,980 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 03:00:17,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 03:00:17,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:00:17,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:00:17,986 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-10 03:00:18,145 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 03:00:18,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 03:00:18,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:00:18,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:00:18,152 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-10 03:00:18,315 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 03:00:18,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 03:00:18,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:00:18,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:00:18,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-10 03:00:18,636 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 03:00:18,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 03:00:18,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:00:18,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:00:18,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-10 03:00:18,892 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 03:00:18,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 03:00:18,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:00:18,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:00:18,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-10 03:00:19,072 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 03:00:19,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 03:00:19,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:00:19,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:00:19,080 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-10 03:00:19,253 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 03:00:19,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 03:00:19,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:00:19,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:00:19,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-10 03:00:19,434 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 03:00:19,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 03:00:19,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:00:19,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:00:19,441 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:5 [2018-04-10 03:00:49,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4789504 backedges. 4590 proven. 294781 refuted. 0 times theorem prover too weak. 4490133 trivial. 0 not checked. [2018-04-10 03:00:49,907 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:00:58,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-04-10 03:00:58,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:00:58,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-04-10 03:00:58,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 03:00:58,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 03:00:58,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-04-10 03:00:58,591 WARN L148 SmtUtils]: Spent 257ms on a formula simplification that was a NOOP. DAG size: 167 [2018-04-10 03:01:29,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4789504 backedges. 0 proven. 294931 refuted. 0 times theorem prover too weak. 4494573 trivial. 0 not checked. [2018-04-10 03:01:29,540 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:01:29,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134, 76] total 137 [2018-04-10 03:01:29,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-04-10 03:01:29,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-04-10 03:01:29,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1332, Invalid=17300, Unknown=0, NotChecked=0, Total=18632 [2018-04-10 03:01:29,551 INFO L87 Difference]: Start difference. First operand 651 states and 684 transitions. Second operand 137 states. Received shutdown request... [2018-04-10 03:01:32,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-10 03:01:32,209 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-10 03:01:32,212 WARN L197 ceAbstractionStarter]: Timeout [2018-04-10 03:01:32,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 03:01:32 BasicIcfg [2018-04-10 03:01:32,213 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 03:01:32,213 INFO L168 Benchmark]: Toolchain (without parser) took 239700.29 ms. Allocated memory was 303.0 MB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Free memory was 246.1 MB in the beginning and 981.3 MB in the end (delta: -735.2 MB). Peak memory consumption was 300.3 MB. Max. memory is 5.3 GB. [2018-04-10 03:01:32,214 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 303.0 MB. Free memory is still 265.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 03:01:32,214 INFO L168 Benchmark]: CACSL2BoogieTranslator took 211.07 ms. Allocated memory is still 303.0 MB. Free memory was 246.1 MB in the beginning and 236.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-04-10 03:01:32,215 INFO L168 Benchmark]: Boogie Preprocessor took 34.72 ms. Allocated memory is still 303.0 MB. Free memory was 236.1 MB in the beginning and 234.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-04-10 03:01:32,215 INFO L168 Benchmark]: RCFGBuilder took 321.97 ms. Allocated memory was 303.0 MB in the beginning and 465.0 MB in the end (delta: 162.0 MB). Free memory was 234.1 MB in the beginning and 431.7 MB in the end (delta: -197.7 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. [2018-04-10 03:01:32,215 INFO L168 Benchmark]: IcfgTransformer took 2607.61 ms. Allocated memory was 465.0 MB in the beginning and 522.7 MB in the end (delta: 57.7 MB). Free memory was 430.4 MB in the beginning and 450.0 MB in the end (delta: -19.5 MB). Peak memory consumption was 38.1 MB. Max. memory is 5.3 GB. [2018-04-10 03:01:32,216 INFO L168 Benchmark]: TraceAbstraction took 236519.73 ms. Allocated memory was 522.7 MB in the beginning and 1.3 GB in the end (delta: 815.8 MB). Free memory was 450.0 MB in the beginning and 981.3 MB in the end (delta: -531.3 MB). Peak memory consumption was 284.5 MB. Max. memory is 5.3 GB. [2018-04-10 03:01:32,219 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 303.0 MB. Free memory is still 265.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 211.07 ms. Allocated memory is still 303.0 MB. Free memory was 246.1 MB in the beginning and 236.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.72 ms. Allocated memory is still 303.0 MB. Free memory was 236.1 MB in the beginning and 234.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 321.97 ms. Allocated memory was 303.0 MB in the beginning and 465.0 MB in the end (delta: 162.0 MB). Free memory was 234.1 MB in the beginning and 431.7 MB in the end (delta: -197.7 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. * IcfgTransformer took 2607.61 ms. Allocated memory was 465.0 MB in the beginning and 522.7 MB in the end (delta: 57.7 MB). Free memory was 430.4 MB in the beginning and 450.0 MB in the end (delta: -19.5 MB). Peak memory consumption was 38.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 236519.73 ms. Allocated memory was 522.7 MB in the beginning and 1.3 GB in the end (delta: 815.8 MB). Free memory was 450.0 MB in the beginning and 981.3 MB in the end (delta: -531.3 MB). Peak memory consumption was 284.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 61 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 397 LocStat_NO_SUPPORTING_DISEQUALITIES : 108 LocStat_NO_DISJUNCTIONS : -122 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 75 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 56 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 76 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 623.18 RENAME_VARIABLES(MILLISECONDS) : 106.09 UNFREEZE(MILLISECONDS) : 0.00 CONJOIN(MILLISECONDS) : 616.55 PROJECTAWAY(MILLISECONDS) : 483.11 ADD_WEAK_EQUALITY(MILLISECONDS) : 6.67 DISJOIN(MILLISECONDS) : 33.23 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 117.08 ADD_EQUALITY(MILLISECONDS) : 8.91 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.00 ADD_DISEQUALITY(MILLISECONDS) : 0.21 #CONJOIN_DISJUNCTIVE : 202 #RENAME_VARIABLES : 426 #UNFREEZE : 0 #CONJOIN : 262 #PROJECTAWAY : 307 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 35 #RENAME_VARIABLES_DISJUNCTIVE : 422 #ADD_EQUALITY : 56 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 - StatisticsResult: WeqCcManagerStatistics FREEZE(MILLISECONDS) : 1119.24 ADDNODE(MILLISECONDS) : 0.00 MEET(MILLISECONDS) : 612.42 FILTERREDUNDANT(MILLISECONDS) : 0.00 REPORTWEQ(MILLISECONDS) : 6.53 JOIN(MILLISECONDS) : 30.91 RENAMEVARS(MILLISECONDS) : 99.80 FLATTENLABELS(MILLISECONDS) : 0.00 COPY(MILLISECONDS) : 0.00 ISSTRONGERTHAN(MILLISECONDS) : 868.00 ISLABELSTRONGERTHAN(MILLISECONDS) : 70.89 ISWEQGRAPHSTRONGERTHAN(MILLISECONDS) : 15.34 UNFREEZE(MILLISECONDS) : 23.45 REPORTCONTAINS(MILLISECONDS) : 0.49 PROJECTAWAY(MILLISECONDS) : 429.62 MEETEDGELABELS(MILLISECONDS) : 72.81 REPORTEQUALITY(MILLISECONDS) : 166.31 ADDALLNODES(MILLISECONDS) : 113.39 REPORTDISEQUALITY(MILLISECONDS) : 1.88 WEQGRAPHJOIN(MILLISECONDS) : 11.79 #FREEZE : 1339 #ADDNODE : 0 #MEET : 166 #FILTERREDUNDANT : 0 #REPORTWEQ : 7 #JOIN : 35 #RENAMEVARS : 426 #FLATTENLABELS : 0 #COPY : 0 #ISSTRONGERTHAN : 367 #ISLABELSTRONGERTHAN : 2944 #ISWEQGRAPHSTRONGERTHAN : 109 #UNFREEZE : 957 #REPORTCONTAINS : 9 #PROJECTAWAY : 365 #MEETEDGELABELS : 539 #REPORTEQUALITY : 1161 #ADDALLNODES : 166 #REPORTDISEQUALITY : 309 #WEQGRAPHJOIN : 35 - StatisticsResult: CcManagerStatistics ADDNODE(MILLISECONDS) : 0.00 MEET(MILLISECONDS) : 399.12 REPORT_EQUALITY(MILLISECONDS) : 127.35 FILTERREDUNDANT(MILLISECONDS) : 570.41 ADD_ALL_ELEMENTS(MILLISECONDS) : 87.02 JOIN(MILLISECONDS) : 14.71 ALIGN_ELEMENTS(MILLISECONDS) : 228.40 COPY(MILLISECONDS) : 0.00 REPORT_DISEQUALITY(MILLISECONDS) : 41.12 UNFREEZE(MILLISECONDS) : 0.00 OVERALL(MILLISECONDS) : 871.24 REPORTCONTAINS(MILLISECONDS) : 5.62 IS_STRONGER_THAN_NO_CACHING(MILLISECONDS) : 353.84 REMOVE(MILLISECONDS) : 0.00 IS_STRONGER_THAN_W_CACHING(MILLISECONDS) : 0.00 PROJECT_TO_ELEMENTS(MILLISECONDS) : 186.03 #ADDNODE : 0 #MEET : 1932 #REPORT_EQUALITY : 11192 #FILTERREDUNDANT : 9004 #ADD_ALL_ELEMENTS : 8426 #JOIN : 35 #ALIGN_ELEMENTS : 3150 #COPY : 0 #REPORT_DISEQUALITY : 4828 #UNFREEZE : 0 #OVERALL : 52624 #REPORTCONTAINS : 321 #IS_STRONGER_THAN_NO_CACHING : 11722 #REMOVE : 0 #IS_STRONGER_THAN_W_CACHING : 0 #PROJECT_TO_ELEMENTS : 2014 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int] : 1 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : 1 COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : 1 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_1 : 1 COUNT_BLOCKS_for_[#memory_int]_at_dim_1 : 1 COUNT_ARRAY_READS for [#memory_int] : 1 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 16]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 16). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 29 states, 137 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 162 known predicates. - TimeoutResultAtElement [Line: 16]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 16). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 29 states, 137 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 162 known predicates. - TimeoutResultAtElement [Line: 16]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 16). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 29 states, 137 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 162 known predicates. - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 29). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 29 states, 137 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 162 known predicates. - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 21). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 29 states, 137 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 162 known predicates. - TimeoutResultAtElement [Line: 26]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 26). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 29 states, 137 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 162 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 62 locations, 6 error locations. TIMEOUT Result, 236.4s OverallTime, 28 OverallIterations, 1056 TraceHistogramMax, 51.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2162 SDtfs, 20658 SDslu, 47836 SDs, 0 SdLazy, 40844 SolverSat, 4888 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61247 GetRequests, 59050 SyntacticMatches, 168 SemanticMatches, 2028 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65708 ImplicationChecksByTransitivity, 76.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=651occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 27 MinimizatonAttempts, 409 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.0s SsaConstructionTime, 5.1s SatisfiabilityAnalysisTime, 176.3s InterpolantComputationTime, 30240 NumberOfCodeBlocks, 30240 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 60424 ConstructedInterpolants, 7 QuantifiedInterpolants, 519501422 SizeOfPredicates, 753 NumberOfNonLiveVariables, 54361 ConjunctsInSsa, 1135 ConjunctsInUnsatCore, 56 InterpolantComputations, 14 PerfectInterpolantSequences, 20636258/21271180 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-04-10_03-01-32-236.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-04-10_03-01-32-236.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-04-10_03-01-32-236.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-1-2018-04-10_03-01-32-236.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-2-2018-04-10_03-01-32-236.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-04-10_03-01-32-236.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-10_03-01-32-236.csv Completed graceful shutdown