./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety.prp --file ../../sv-benchmarks/c/heap-manipulation/dll_of_dll_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b11e9207-cf0a-4e6a-8dbe-c5ae5686e94c/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b11e9207-cf0a-4e6a-8dbe-c5ae5686e94c/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b11e9207-cf0a-4e6a-8dbe-c5ae5686e94c/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b11e9207-cf0a-4e6a-8dbe-c5ae5686e94c/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/dll_of_dll_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b11e9207-cf0a-4e6a-8dbe-c5ae5686e94c/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b11e9207-cf0a-4e6a-8dbe-c5ae5686e94c/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 30912d79507d112674315a135c457bdb2fa6a53f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b11e9207-cf0a-4e6a-8dbe-c5ae5686e94c/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b11e9207-cf0a-4e6a-8dbe-c5ae5686e94c/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b11e9207-cf0a-4e6a-8dbe-c5ae5686e94c/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b11e9207-cf0a-4e6a-8dbe-c5ae5686e94c/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/dll_of_dll_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b11e9207-cf0a-4e6a-8dbe-c5ae5686e94c/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b11e9207-cf0a-4e6a-8dbe-c5ae5686e94c/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 30912d79507d112674315a135c457bdb2fa6a53f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: enhanced interpolant automaton in iteration 36 broken: counterexample of length 142 not accepted (original is ok) --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 06:00:22,618 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 06:00:22,620 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 06:00:22,629 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 06:00:22,629 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 06:00:22,630 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 06:00:22,631 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 06:00:22,633 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 06:00:22,634 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 06:00:22,634 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 06:00:22,636 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 06:00:22,636 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 06:00:22,636 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 06:00:22,637 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 06:00:22,638 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 06:00:22,639 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 06:00:22,640 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 06:00:22,641 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 06:00:22,642 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 06:00:22,644 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 06:00:22,645 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 06:00:22,646 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 06:00:22,648 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 06:00:22,648 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 06:00:22,648 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 06:00:22,649 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 06:00:22,650 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 06:00:22,650 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 06:00:22,651 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 06:00:22,652 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 06:00:22,652 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 06:00:22,653 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 06:00:22,653 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 06:00:22,653 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 06:00:22,654 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 06:00:22,654 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 06:00:22,654 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b11e9207-cf0a-4e6a-8dbe-c5ae5686e94c/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-11-10 06:00:22,665 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 06:00:22,665 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 06:00:22,666 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 06:00:22,666 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 06:00:22,666 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 06:00:22,666 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 06:00:22,667 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 06:00:22,667 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 06:00:22,667 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 06:00:22,668 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 06:00:22,668 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 06:00:22,668 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 06:00:22,668 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 06:00:22,668 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 06:00:22,669 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 06:00:22,669 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 06:00:22,669 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 06:00:22,669 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 06:00:22,669 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 06:00:22,669 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-10 06:00:22,669 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-10 06:00:22,670 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-10 06:00:22,670 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 06:00:22,670 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 06:00:22,670 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 06:00:22,670 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 06:00:22,670 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 06:00:22,670 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 06:00:22,670 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 06:00:22,671 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 06:00:22,671 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 06:00:22,671 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 06:00:22,671 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 06:00:22,671 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 06:00:22,671 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_b11e9207-cf0a-4e6a-8dbe-c5ae5686e94c/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 30912d79507d112674315a135c457bdb2fa6a53f [2018-11-10 06:00:22,693 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 06:00:22,702 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 06:00:22,704 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 06:00:22,704 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 06:00:22,705 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 06:00:22,705 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b11e9207-cf0a-4e6a-8dbe-c5ae5686e94c/bin-2019/utaipan/../../sv-benchmarks/c/heap-manipulation/dll_of_dll_true-unreach-call_true-valid-memsafety.i [2018-11-10 06:00:22,741 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b11e9207-cf0a-4e6a-8dbe-c5ae5686e94c/bin-2019/utaipan/data/d5f5bb0a9/f8e5a0e715d44efdbb6ab3a61779e673/FLAG0094dcda0 [2018-11-10 06:00:23,175 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 06:00:23,175 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b11e9207-cf0a-4e6a-8dbe-c5ae5686e94c/sv-benchmarks/c/heap-manipulation/dll_of_dll_true-unreach-call_true-valid-memsafety.i [2018-11-10 06:00:23,182 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b11e9207-cf0a-4e6a-8dbe-c5ae5686e94c/bin-2019/utaipan/data/d5f5bb0a9/f8e5a0e715d44efdbb6ab3a61779e673/FLAG0094dcda0 [2018-11-10 06:00:23,193 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b11e9207-cf0a-4e6a-8dbe-c5ae5686e94c/bin-2019/utaipan/data/d5f5bb0a9/f8e5a0e715d44efdbb6ab3a61779e673 [2018-11-10 06:00:23,195 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 06:00:23,196 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 06:00:23,196 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 06:00:23,196 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 06:00:23,198 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 06:00:23,198 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:00:23" (1/1) ... [2018-11-10 06:00:23,200 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f66aa3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:23, skipping insertion in model container [2018-11-10 06:00:23,200 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:00:23" (1/1) ... [2018-11-10 06:00:23,205 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 06:00:23,233 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 06:00:23,439 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:00:23,447 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 06:00:23,490 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:00:23,518 INFO L193 MainTranslator]: Completed translation [2018-11-10 06:00:23,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:23 WrapperNode [2018-11-10 06:00:23,518 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 06:00:23,519 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 06:00:23,519 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 06:00:23,519 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 06:00:23,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:23" (1/1) ... [2018-11-10 06:00:23,578 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:23" (1/1) ... [2018-11-10 06:00:23,606 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 06:00:23,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 06:00:23,606 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 06:00:23,607 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 06:00:23,615 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:23" (1/1) ... [2018-11-10 06:00:23,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:23" (1/1) ... [2018-11-10 06:00:23,622 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:23" (1/1) ... [2018-11-10 06:00:23,623 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:23" (1/1) ... [2018-11-10 06:00:23,638 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:23" (1/1) ... [2018-11-10 06:00:23,646 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:23" (1/1) ... [2018-11-10 06:00:23,650 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:23" (1/1) ... [2018-11-10 06:00:23,655 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 06:00:23,655 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 06:00:23,655 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 06:00:23,655 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 06:00:23,656 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b11e9207-cf0a-4e6a-8dbe-c5ae5686e94c/bin-2019/utaipan/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-11-10 06:00:23,697 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_init [2018-11-10 06:00:23,697 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_init [2018-11-10 06:00:23,697 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy_nested_lists [2018-11-10 06:00:23,697 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy_nested_lists [2018-11-10 06:00:23,697 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy_master [2018-11-10 06:00:23,697 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy_master [2018-11-10 06:00:23,698 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2018-11-10 06:00:23,698 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2018-11-10 06:00:23,698 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_base [2018-11-10 06:00:23,698 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_base [2018-11-10 06:00:23,698 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_slave [2018-11-10 06:00:23,698 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_slave [2018-11-10 06:00:23,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 06:00:23,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 06:00:23,698 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_or_die_slave [2018-11-10 06:00:23,698 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_or_die_slave [2018-11-10 06:00:23,698 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_master [2018-11-10 06:00:23,698 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_master [2018-11-10 06:00:23,699 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2018-11-10 06:00:23,699 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2018-11-10 06:00:23,699 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 06:00:23,699 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 06:00:23,699 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-11-10 06:00:23,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-11-10 06:00:23,699 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_full [2018-11-10 06:00:23,699 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_full [2018-11-10 06:00:23,700 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy_slave [2018-11-10 06:00:23,700 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy_slave [2018-11-10 06:00:23,700 INFO L130 BoogieDeclarations]: Found specification of procedure dll_reinit_nested_lists [2018-11-10 06:00:23,700 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_reinit_nested_lists [2018-11-10 06:00:23,700 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_dangling [2018-11-10 06:00:23,700 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_dangling [2018-11-10 06:00:23,700 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2018-11-10 06:00:23,700 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2018-11-10 06:00:23,700 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_or_die_master [2018-11-10 06:00:23,701 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_or_die_master [2018-11-10 06:00:23,701 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2018-11-10 06:00:23,701 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2018-11-10 06:00:23,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 06:00:23,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 06:00:24,503 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 06:00:24,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:00:24 BoogieIcfgContainer [2018-11-10 06:00:24,504 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 06:00:24,504 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 06:00:24,504 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 06:00:24,507 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 06:00:24,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:00:23" (1/3) ... [2018-11-10 06:00:24,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42560edb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:00:24, skipping insertion in model container [2018-11-10 06:00:24,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:23" (2/3) ... [2018-11-10 06:00:24,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42560edb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:00:24, skipping insertion in model container [2018-11-10 06:00:24,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:00:24" (3/3) ... [2018-11-10 06:00:24,509 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_of_dll_true-unreach-call_true-valid-memsafety.i [2018-11-10 06:00:24,516 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 06:00:24,521 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 97 error locations. [2018-11-10 06:00:24,532 INFO L257 AbstractCegarLoop]: Starting to check reachability of 97 error locations. [2018-11-10 06:00:24,550 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 06:00:24,550 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-10 06:00:24,550 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 06:00:24,550 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 06:00:24,551 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 06:00:24,551 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 06:00:24,551 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 06:00:24,551 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 06:00:24,569 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states. [2018-11-10 06:00:24,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 06:00:24,577 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:00:24,577 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:00:24,581 INFO L424 AbstractCegarLoop]: === Iteration 1 === [dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 06:00:24,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:00:24,586 INFO L82 PathProgramCache]: Analyzing trace with hash -55455711, now seen corresponding path program 1 times [2018-11-10 06:00:24,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:00:24,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:24,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:00:24,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:24,622 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:00:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:00:24,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:00:24,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:00:24,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 06:00:24,707 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 06:00:24,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 06:00:24,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:00:24,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:00:24,722 INFO L87 Difference]: Start difference. First operand 373 states. Second operand 3 states. [2018-11-10 06:00:24,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:00:24,967 INFO L93 Difference]: Finished difference Result 370 states and 400 transitions. [2018-11-10 06:00:24,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:00:24,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-10 06:00:24,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:00:24,977 INFO L225 Difference]: With dead ends: 370 [2018-11-10 06:00:24,977 INFO L226 Difference]: Without dead ends: 352 [2018-11-10 06:00:24,978 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:00:24,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-11-10 06:00:25,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2018-11-10 06:00:25,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-11-10 06:00:25,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 369 transitions. [2018-11-10 06:00:25,022 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 369 transitions. Word has length 9 [2018-11-10 06:00:25,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:00:25,022 INFO L481 AbstractCegarLoop]: Abstraction has 352 states and 369 transitions. [2018-11-10 06:00:25,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 06:00:25,022 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 369 transitions. [2018-11-10 06:00:25,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 06:00:25,023 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:00:25,023 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:00:25,025 INFO L424 AbstractCegarLoop]: === Iteration 2 === [dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 06:00:25,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:00:25,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1719126921, now seen corresponding path program 1 times [2018-11-10 06:00:25,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:00:25,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:25,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:00:25,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:25,028 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:00:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:00:25,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:00:25,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:00:25,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 06:00:25,077 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 06:00:25,078 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 06:00:25,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:00:25,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:00:25,079 INFO L87 Difference]: Start difference. First operand 352 states and 369 transitions. Second operand 3 states. [2018-11-10 06:00:25,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:00:25,201 INFO L93 Difference]: Finished difference Result 351 states and 368 transitions. [2018-11-10 06:00:25,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:00:25,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-10 06:00:25,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:00:25,203 INFO L225 Difference]: With dead ends: 351 [2018-11-10 06:00:25,203 INFO L226 Difference]: Without dead ends: 351 [2018-11-10 06:00:25,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:00:25,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-11-10 06:00:25,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2018-11-10 06:00:25,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-11-10 06:00:25,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 368 transitions. [2018-11-10 06:00:25,216 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 368 transitions. Word has length 10 [2018-11-10 06:00:25,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:00:25,216 INFO L481 AbstractCegarLoop]: Abstraction has 351 states and 368 transitions. [2018-11-10 06:00:25,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 06:00:25,216 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 368 transitions. [2018-11-10 06:00:25,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 06:00:25,216 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:00:25,216 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:00:25,218 INFO L424 AbstractCegarLoop]: === Iteration 3 === [dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 06:00:25,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:00:25,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1926432963, now seen corresponding path program 1 times [2018-11-10 06:00:25,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:00:25,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:25,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:00:25,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:25,221 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:00:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:00:25,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:00:25,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:00:25,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:00:25,260 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 06:00:25,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 06:00:25,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 06:00:25,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 06:00:25,261 INFO L87 Difference]: Start difference. First operand 351 states and 368 transitions. Second operand 4 states. [2018-11-10 06:00:25,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:00:25,472 INFO L93 Difference]: Finished difference Result 348 states and 365 transitions. [2018-11-10 06:00:25,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 06:00:25,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-10 06:00:25,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:00:25,474 INFO L225 Difference]: With dead ends: 348 [2018-11-10 06:00:25,474 INFO L226 Difference]: Without dead ends: 348 [2018-11-10 06:00:25,475 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 06:00:25,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-11-10 06:00:25,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2018-11-10 06:00:25,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-11-10 06:00:25,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 365 transitions. [2018-11-10 06:00:25,486 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 365 transitions. Word has length 20 [2018-11-10 06:00:25,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:00:25,486 INFO L481 AbstractCegarLoop]: Abstraction has 348 states and 365 transitions. [2018-11-10 06:00:25,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 06:00:25,487 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 365 transitions. [2018-11-10 06:00:25,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 06:00:25,487 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:00:25,487 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:00:25,489 INFO L424 AbstractCegarLoop]: === Iteration 4 === [dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 06:00:25,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:00:25,490 INFO L82 PathProgramCache]: Analyzing trace with hash -69437544, now seen corresponding path program 1 times [2018-11-10 06:00:25,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:00:25,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:25,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:00:25,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:25,492 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:00:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:00:25,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:00:25,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:00:25,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:00:25,534 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 06:00:25,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 06:00:25,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 06:00:25,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 06:00:25,535 INFO L87 Difference]: Start difference. First operand 348 states and 365 transitions. Second operand 4 states. [2018-11-10 06:00:25,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:00:25,699 INFO L93 Difference]: Finished difference Result 346 states and 363 transitions. [2018-11-10 06:00:25,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 06:00:25,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-10 06:00:25,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:00:25,700 INFO L225 Difference]: With dead ends: 346 [2018-11-10 06:00:25,701 INFO L226 Difference]: Without dead ends: 346 [2018-11-10 06:00:25,701 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 06:00:25,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-11-10 06:00:25,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2018-11-10 06:00:25,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-11-10 06:00:25,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 363 transitions. [2018-11-10 06:00:25,708 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 363 transitions. Word has length 20 [2018-11-10 06:00:25,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:00:25,709 INFO L481 AbstractCegarLoop]: Abstraction has 346 states and 363 transitions. [2018-11-10 06:00:25,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 06:00:25,709 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 363 transitions. [2018-11-10 06:00:25,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 06:00:25,709 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:00:25,709 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:00:25,710 INFO L424 AbstractCegarLoop]: === Iteration 5 === [dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 06:00:25,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:00:25,711 INFO L82 PathProgramCache]: Analyzing trace with hash -410119659, now seen corresponding path program 1 times [2018-11-10 06:00:25,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:00:25,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:25,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:00:25,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:25,712 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:00:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:00:25,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:00:25,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:00:25,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:00:25,768 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 06:00:25,769 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 06:00:25,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 06:00:25,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 06:00:25,769 INFO L87 Difference]: Start difference. First operand 346 states and 363 transitions. Second operand 4 states. [2018-11-10 06:00:25,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:00:25,917 INFO L93 Difference]: Finished difference Result 345 states and 362 transitions. [2018-11-10 06:00:25,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 06:00:25,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-10 06:00:25,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:00:25,919 INFO L225 Difference]: With dead ends: 345 [2018-11-10 06:00:25,919 INFO L226 Difference]: Without dead ends: 345 [2018-11-10 06:00:25,919 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 06:00:25,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-11-10 06:00:25,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2018-11-10 06:00:25,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-11-10 06:00:25,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 362 transitions. [2018-11-10 06:00:25,926 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 362 transitions. Word has length 21 [2018-11-10 06:00:25,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:00:25,926 INFO L481 AbstractCegarLoop]: Abstraction has 345 states and 362 transitions. [2018-11-10 06:00:25,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 06:00:25,926 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 362 transitions. [2018-11-10 06:00:25,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 06:00:25,926 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:00:25,926 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:00:25,928 INFO L424 AbstractCegarLoop]: === Iteration 6 === [dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 06:00:25,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:00:25,928 INFO L82 PathProgramCache]: Analyzing trace with hash 2142403863, now seen corresponding path program 1 times [2018-11-10 06:00:25,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:00:25,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:25,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:00:25,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:25,929 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:00:25,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:00:25,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:00:25,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:00:25,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 06:00:25,989 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 06:00:25,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 06:00:25,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 06:00:25,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 06:00:25,990 INFO L87 Difference]: Start difference. First operand 345 states and 362 transitions. Second operand 5 states. [2018-11-10 06:00:26,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:00:26,037 INFO L93 Difference]: Finished difference Result 377 states and 402 transitions. [2018-11-10 06:00:26,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 06:00:26,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-10 06:00:26,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:00:26,040 INFO L225 Difference]: With dead ends: 377 [2018-11-10 06:00:26,040 INFO L226 Difference]: Without dead ends: 377 [2018-11-10 06:00:26,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-10 06:00:26,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-11-10 06:00:26,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 368. [2018-11-10 06:00:26,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-11-10 06:00:26,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 395 transitions. [2018-11-10 06:00:26,052 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 395 transitions. Word has length 21 [2018-11-10 06:00:26,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:00:26,053 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 395 transitions. [2018-11-10 06:00:26,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 06:00:26,053 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 395 transitions. [2018-11-10 06:00:26,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 06:00:26,053 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:00:26,053 INFO L375 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-11-10 06:00:26,055 INFO L424 AbstractCegarLoop]: === Iteration 7 === [dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 06:00:26,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:00:26,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1012019223, now seen corresponding path program 1 times [2018-11-10 06:00:26,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:00:26,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:26,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:00:26,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:26,056 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:00:26,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:00:26,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:00:26,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:00:26,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:00:26,113 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 06:00:26,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 06:00:26,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 06:00:26,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 06:00:26,113 INFO L87 Difference]: Start difference. First operand 368 states and 395 transitions. Second operand 4 states. [2018-11-10 06:00:26,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:00:26,248 INFO L93 Difference]: Finished difference Result 367 states and 394 transitions. [2018-11-10 06:00:26,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 06:00:26,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-10 06:00:26,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:00:26,249 INFO L225 Difference]: With dead ends: 367 [2018-11-10 06:00:26,249 INFO L226 Difference]: Without dead ends: 367 [2018-11-10 06:00:26,250 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 06:00:26,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-11-10 06:00:26,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2018-11-10 06:00:26,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-11-10 06:00:26,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 394 transitions. [2018-11-10 06:00:26,255 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 394 transitions. Word has length 23 [2018-11-10 06:00:26,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:00:26,256 INFO L481 AbstractCegarLoop]: Abstraction has 367 states and 394 transitions. [2018-11-10 06:00:26,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 06:00:26,256 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 394 transitions. [2018-11-10 06:00:26,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 06:00:26,256 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:00:26,256 INFO L375 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, 1] [2018-11-10 06:00:26,257 INFO L424 AbstractCegarLoop]: === Iteration 8 === [dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 06:00:26,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:00:26,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1887884825, now seen corresponding path program 1 times [2018-11-10 06:00:26,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:00:26,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:26,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:00:26,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:26,258 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:00:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:00:26,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:00:26,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:00:26,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 06:00:26,319 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 06:00:26,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 06:00:26,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 06:00:26,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 06:00:26,320 INFO L87 Difference]: Start difference. First operand 367 states and 394 transitions. Second operand 5 states. [2018-11-10 06:00:26,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:00:26,456 INFO L93 Difference]: Finished difference Result 366 states and 393 transitions. [2018-11-10 06:00:26,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 06:00:26,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-10 06:00:26,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:00:26,457 INFO L225 Difference]: With dead ends: 366 [2018-11-10 06:00:26,457 INFO L226 Difference]: Without dead ends: 366 [2018-11-10 06:00:26,458 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-10 06:00:26,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-11-10 06:00:26,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2018-11-10 06:00:26,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-11-10 06:00:26,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 393 transitions. [2018-11-10 06:00:26,464 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 393 transitions. Word has length 25 [2018-11-10 06:00:26,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:00:26,465 INFO L481 AbstractCegarLoop]: Abstraction has 366 states and 393 transitions. [2018-11-10 06:00:26,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 06:00:26,465 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 393 transitions. [2018-11-10 06:00:26,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 06:00:26,465 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:00:26,465 INFO L375 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, 1, 1, 1, 1, 1] [2018-11-10 06:00:26,466 INFO L424 AbstractCegarLoop]: === Iteration 9 === [dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 06:00:26,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:00:26,466 INFO L82 PathProgramCache]: Analyzing trace with hash -2017844820, now seen corresponding path program 1 times [2018-11-10 06:00:26,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:00:26,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:26,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:00:26,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:26,467 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:00:26,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:00:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:00:26,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:00:26,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 06:00:26,622 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 06:00:26,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 06:00:26,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 06:00:26,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-10 06:00:26,622 INFO L87 Difference]: Start difference. First operand 366 states and 393 transitions. Second operand 11 states. [2018-11-10 06:00:27,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:00:27,744 INFO L93 Difference]: Finished difference Result 428 states and 464 transitions. [2018-11-10 06:00:27,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 06:00:27,745 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-11-10 06:00:27,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:00:27,746 INFO L225 Difference]: With dead ends: 428 [2018-11-10 06:00:27,746 INFO L226 Difference]: Without dead ends: 428 [2018-11-10 06:00:27,747 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2018-11-10 06:00:27,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-11-10 06:00:27,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 373. [2018-11-10 06:00:27,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-11-10 06:00:27,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 402 transitions. [2018-11-10 06:00:27,758 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 402 transitions. Word has length 29 [2018-11-10 06:00:27,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:00:27,758 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 402 transitions. [2018-11-10 06:00:27,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 06:00:27,759 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 402 transitions. [2018-11-10 06:00:27,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 06:00:27,759 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:00:27,759 INFO L375 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, 1, 1, 1, 1, 1, 1] [2018-11-10 06:00:27,760 INFO L424 AbstractCegarLoop]: === Iteration 10 === [dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 06:00:27,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:00:27,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1871320087, now seen corresponding path program 1 times [2018-11-10 06:00:27,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:00:27,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:27,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:00:27,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:27,762 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:00:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:00:27,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:00:27,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:00:27,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 06:00:27,946 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 06:00:27,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 06:00:27,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 06:00:27,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-10 06:00:27,947 INFO L87 Difference]: Start difference. First operand 373 states and 402 transitions. Second operand 11 states. [2018-11-10 06:00:29,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:00:29,311 INFO L93 Difference]: Finished difference Result 430 states and 470 transitions. [2018-11-10 06:00:29,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 06:00:29,312 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-11-10 06:00:29,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:00:29,313 INFO L225 Difference]: With dead ends: 430 [2018-11-10 06:00:29,313 INFO L226 Difference]: Without dead ends: 430 [2018-11-10 06:00:29,313 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-11-10 06:00:29,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-11-10 06:00:29,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 381. [2018-11-10 06:00:29,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-11-10 06:00:29,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 413 transitions. [2018-11-10 06:00:29,324 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 413 transitions. Word has length 30 [2018-11-10 06:00:29,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:00:29,325 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 413 transitions. [2018-11-10 06:00:29,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 06:00:29,325 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 413 transitions. [2018-11-10 06:00:29,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 06:00:29,325 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:00:29,325 INFO L375 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:00:29,326 INFO L424 AbstractCegarLoop]: === Iteration 11 === [dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 06:00:29,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:00:29,326 INFO L82 PathProgramCache]: Analyzing trace with hash -2118619378, now seen corresponding path program 1 times [2018-11-10 06:00:29,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:00:29,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:29,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:00:29,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:29,328 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:00:29,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:00:29,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:00:29,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:00:29,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 06:00:29,398 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 06:00:29,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 06:00:29,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 06:00:29,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 06:00:29,399 INFO L87 Difference]: Start difference. First operand 381 states and 413 transitions. Second operand 8 states. [2018-11-10 06:00:29,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:00:29,734 INFO L93 Difference]: Finished difference Result 380 states and 412 transitions. [2018-11-10 06:00:29,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 06:00:29,735 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-11-10 06:00:29,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:00:29,736 INFO L225 Difference]: With dead ends: 380 [2018-11-10 06:00:29,736 INFO L226 Difference]: Without dead ends: 380 [2018-11-10 06:00:29,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-10 06:00:29,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-11-10 06:00:29,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-11-10 06:00:29,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-11-10 06:00:29,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 412 transitions. [2018-11-10 06:00:29,744 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 412 transitions. Word has length 31 [2018-11-10 06:00:29,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:00:29,744 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 412 transitions. [2018-11-10 06:00:29,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 06:00:29,744 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 412 transitions. [2018-11-10 06:00:29,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 06:00:29,745 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:00:29,745 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:00:29,746 INFO L424 AbstractCegarLoop]: === Iteration 12 === [dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 06:00:29,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:00:29,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1252691207, now seen corresponding path program 1 times [2018-11-10 06:00:29,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:00:29,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:29,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:00:29,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:29,747 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:00:29,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:00:29,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:00:29,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:00:29,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 06:00:29,821 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 06:00:29,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 06:00:29,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 06:00:29,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-10 06:00:29,822 INFO L87 Difference]: Start difference. First operand 380 states and 412 transitions. Second operand 8 states. [2018-11-10 06:00:30,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:00:30,168 INFO L93 Difference]: Finished difference Result 380 states and 413 transitions. [2018-11-10 06:00:30,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 06:00:30,169 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-11-10 06:00:30,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:00:30,170 INFO L225 Difference]: With dead ends: 380 [2018-11-10 06:00:30,170 INFO L226 Difference]: Without dead ends: 380 [2018-11-10 06:00:30,170 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-10 06:00:30,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-11-10 06:00:30,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 379. [2018-11-10 06:00:30,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-11-10 06:00:30,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 411 transitions. [2018-11-10 06:00:30,177 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 411 transitions. Word has length 32 [2018-11-10 06:00:30,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:00:30,177 INFO L481 AbstractCegarLoop]: Abstraction has 379 states and 411 transitions. [2018-11-10 06:00:30,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 06:00:30,177 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 411 transitions. [2018-11-10 06:00:30,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 06:00:30,178 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:00:30,178 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:00:30,179 INFO L424 AbstractCegarLoop]: === Iteration 13 === [dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 06:00:30,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:00:30,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1245404677, now seen corresponding path program 1 times [2018-11-10 06:00:30,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:00:30,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:30,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:00:30,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:30,180 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:00:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:00:30,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:00:30,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:00:30,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-11-10 06:00:30,760 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 06:00:30,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 06:00:30,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 06:00:30,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-11-10 06:00:30,760 INFO L87 Difference]: Start difference. First operand 379 states and 411 transitions. Second operand 17 states. [2018-11-10 06:00:31,372 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-11-10 06:00:31,737 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2018-11-10 06:00:32,512 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2018-11-10 06:00:35,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:00:35,034 INFO L93 Difference]: Finished difference Result 441 states and 482 transitions. [2018-11-10 06:00:35,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 06:00:35,035 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2018-11-10 06:00:35,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:00:35,036 INFO L225 Difference]: With dead ends: 441 [2018-11-10 06:00:35,036 INFO L226 Difference]: Without dead ends: 441 [2018-11-10 06:00:35,037 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2018-11-10 06:00:35,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-11-10 06:00:35,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 390. [2018-11-10 06:00:35,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-11-10 06:00:35,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 428 transitions. [2018-11-10 06:00:35,043 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 428 transitions. Word has length 34 [2018-11-10 06:00:35,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:00:35,043 INFO L481 AbstractCegarLoop]: Abstraction has 390 states and 428 transitions. [2018-11-10 06:00:35,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 06:00:35,044 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 428 transitions. [2018-11-10 06:00:35,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-10 06:00:35,044 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:00:35,044 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:00:35,045 INFO L424 AbstractCegarLoop]: === Iteration 14 === [dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 06:00:35,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:00:35,045 INFO L82 PathProgramCache]: Analyzing trace with hash 2096607431, now seen corresponding path program 1 times [2018-11-10 06:00:35,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:00:35,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:35,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:00:35,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:35,047 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:00:35,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:00:35,117 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 06:00:35,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:00:35,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:00:35,117 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 06:00:35,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 06:00:35,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 06:00:35,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 06:00:35,118 INFO L87 Difference]: Start difference. First operand 390 states and 428 transitions. Second operand 4 states. [2018-11-10 06:00:35,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:00:35,275 INFO L93 Difference]: Finished difference Result 389 states and 427 transitions. [2018-11-10 06:00:35,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 06:00:35,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-11-10 06:00:35,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:00:35,277 INFO L225 Difference]: With dead ends: 389 [2018-11-10 06:00:35,277 INFO L226 Difference]: Without dead ends: 389 [2018-11-10 06:00:35,278 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 06:00:35,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-11-10 06:00:35,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2018-11-10 06:00:35,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-11-10 06:00:35,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 427 transitions. [2018-11-10 06:00:35,289 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 427 transitions. Word has length 49 [2018-11-10 06:00:35,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:00:35,289 INFO L481 AbstractCegarLoop]: Abstraction has 389 states and 427 transitions. [2018-11-10 06:00:35,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 06:00:35,289 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 427 transitions. [2018-11-10 06:00:35,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-10 06:00:35,290 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:00:35,290 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:00:35,290 INFO L424 AbstractCegarLoop]: === Iteration 15 === [dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 06:00:35,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:00:35,291 INFO L82 PathProgramCache]: Analyzing trace with hash 500093225, now seen corresponding path program 1 times [2018-11-10 06:00:35,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:00:35,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:35,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:00:35,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:35,296 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:00:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:00:35,348 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 06:00:35,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:00:35,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:00:35,349 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 06:00:35,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 06:00:35,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 06:00:35,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 06:00:35,349 INFO L87 Difference]: Start difference. First operand 389 states and 427 transitions. Second operand 4 states. [2018-11-10 06:00:35,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:00:35,499 INFO L93 Difference]: Finished difference Result 388 states and 426 transitions. [2018-11-10 06:00:35,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 06:00:35,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-11-10 06:00:35,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:00:35,501 INFO L225 Difference]: With dead ends: 388 [2018-11-10 06:00:35,501 INFO L226 Difference]: Without dead ends: 388 [2018-11-10 06:00:35,502 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 06:00:35,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-11-10 06:00:35,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2018-11-10 06:00:35,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-11-10 06:00:35,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 426 transitions. [2018-11-10 06:00:35,511 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 426 transitions. Word has length 51 [2018-11-10 06:00:35,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:00:35,511 INFO L481 AbstractCegarLoop]: Abstraction has 388 states and 426 transitions. [2018-11-10 06:00:35,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 06:00:35,511 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 426 transitions. [2018-11-10 06:00:35,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-10 06:00:35,512 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:00:35,512 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:00:35,513 INFO L424 AbstractCegarLoop]: === Iteration 16 === [dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 06:00:35,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:00:35,513 INFO L82 PathProgramCache]: Analyzing trace with hash 185734759, now seen corresponding path program 1 times [2018-11-10 06:00:35,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:00:35,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:35,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:00:35,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:35,514 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:00:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:00:35,648 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 06:00:35,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:00:35,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 06:00:35,649 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 06:00:35,649 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 06:00:35,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 06:00:35,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-10 06:00:35,649 INFO L87 Difference]: Start difference. First operand 388 states and 426 transitions. Second operand 11 states. [2018-11-10 06:00:36,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:00:36,560 INFO L93 Difference]: Finished difference Result 430 states and 473 transitions. [2018-11-10 06:00:36,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 06:00:36,561 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2018-11-10 06:00:36,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:00:36,562 INFO L225 Difference]: With dead ends: 430 [2018-11-10 06:00:36,562 INFO L226 Difference]: Without dead ends: 430 [2018-11-10 06:00:36,562 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-11-10 06:00:36,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-11-10 06:00:36,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 387. [2018-11-10 06:00:36,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-11-10 06:00:36,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 425 transitions. [2018-11-10 06:00:36,569 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 425 transitions. Word has length 55 [2018-11-10 06:00:36,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:00:36,569 INFO L481 AbstractCegarLoop]: Abstraction has 387 states and 425 transitions. [2018-11-10 06:00:36,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 06:00:36,569 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 425 transitions. [2018-11-10 06:00:36,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-10 06:00:36,570 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:00:36,570 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:00:36,570 INFO L424 AbstractCegarLoop]: === Iteration 17 === [dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 06:00:36,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:00:36,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1462810884, now seen corresponding path program 1 times [2018-11-10 06:00:36,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:00:36,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:36,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:00:36,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:36,576 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:00:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:00:36,724 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 06:00:36,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:00:36,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 06:00:36,724 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 06:00:36,724 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 06:00:36,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 06:00:36,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-10 06:00:36,725 INFO L87 Difference]: Start difference. First operand 387 states and 425 transitions. Second operand 11 states. [2018-11-10 06:00:37,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:00:37,746 INFO L93 Difference]: Finished difference Result 447 states and 492 transitions. [2018-11-10 06:00:37,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 06:00:37,746 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-11-10 06:00:37,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:00:37,747 INFO L225 Difference]: With dead ends: 447 [2018-11-10 06:00:37,747 INFO L226 Difference]: Without dead ends: 447 [2018-11-10 06:00:37,748 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-11-10 06:00:37,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-11-10 06:00:37,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 403. [2018-11-10 06:00:37,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-11-10 06:00:37,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 449 transitions. [2018-11-10 06:00:37,756 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 449 transitions. Word has length 56 [2018-11-10 06:00:37,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:00:37,756 INFO L481 AbstractCegarLoop]: Abstraction has 403 states and 449 transitions. [2018-11-10 06:00:37,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 06:00:37,756 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 449 transitions. [2018-11-10 06:00:37,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-10 06:00:37,760 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:00:37,760 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:00:37,760 INFO L424 AbstractCegarLoop]: === Iteration 18 === [dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 06:00:37,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:00:37,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1897502199, now seen corresponding path program 1 times [2018-11-10 06:00:37,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:00:37,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:37,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:00:37,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:37,767 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:00:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:00:37,836 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 06:00:37,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:00:37,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 06:00:37,837 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 06:00:37,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 06:00:37,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 06:00:37,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-10 06:00:37,837 INFO L87 Difference]: Start difference. First operand 403 states and 449 transitions. Second operand 9 states. [2018-11-10 06:00:38,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:00:38,112 INFO L93 Difference]: Finished difference Result 402 states and 447 transitions. [2018-11-10 06:00:38,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 06:00:38,112 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-11-10 06:00:38,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:00:38,114 INFO L225 Difference]: With dead ends: 402 [2018-11-10 06:00:38,114 INFO L226 Difference]: Without dead ends: 402 [2018-11-10 06:00:38,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-10 06:00:38,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-11-10 06:00:38,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2018-11-10 06:00:38,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-11-10 06:00:38,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 447 transitions. [2018-11-10 06:00:38,131 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 447 transitions. Word has length 57 [2018-11-10 06:00:38,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:00:38,131 INFO L481 AbstractCegarLoop]: Abstraction has 402 states and 447 transitions. [2018-11-10 06:00:38,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 06:00:38,131 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 447 transitions. [2018-11-10 06:00:38,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-10 06:00:38,132 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:00:38,132 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:00:38,132 INFO L424 AbstractCegarLoop]: === Iteration 19 === [dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 06:00:38,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:00:38,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1306974630, now seen corresponding path program 1 times [2018-11-10 06:00:38,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:00:38,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:38,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:00:38,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:38,134 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:00:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:00:38,194 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 06:00:38,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:00:38,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 06:00:38,194 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 06:00:38,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 06:00:38,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 06:00:38,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-10 06:00:38,195 INFO L87 Difference]: Start difference. First operand 402 states and 447 transitions. Second operand 8 states. [2018-11-10 06:00:38,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:00:38,422 INFO L93 Difference]: Finished difference Result 403 states and 447 transitions. [2018-11-10 06:00:38,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 06:00:38,422 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-11-10 06:00:38,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:00:38,423 INFO L225 Difference]: With dead ends: 403 [2018-11-10 06:00:38,423 INFO L226 Difference]: Without dead ends: 403 [2018-11-10 06:00:38,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-10 06:00:38,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-11-10 06:00:38,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 401. [2018-11-10 06:00:38,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-11-10 06:00:38,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 445 transitions. [2018-11-10 06:00:38,429 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 445 transitions. Word has length 58 [2018-11-10 06:00:38,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:00:38,430 INFO L481 AbstractCegarLoop]: Abstraction has 401 states and 445 transitions. [2018-11-10 06:00:38,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 06:00:38,430 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 445 transitions. [2018-11-10 06:00:38,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-10 06:00:38,430 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:00:38,431 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:00:38,431 INFO L424 AbstractCegarLoop]: === Iteration 20 === [dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 06:00:38,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:00:38,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1872190056, now seen corresponding path program 1 times [2018-11-10 06:00:38,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:00:38,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:38,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:00:38,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:38,433 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:00:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:00:38,732 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 06:00:38,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:00:38,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-11-10 06:00:38,733 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 06:00:38,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 06:00:38,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 06:00:38,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-11-10 06:00:38,733 INFO L87 Difference]: Start difference. First operand 401 states and 445 transitions. Second operand 16 states. [2018-11-10 06:00:41,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:00:41,056 INFO L93 Difference]: Finished difference Result 452 states and 499 transitions. [2018-11-10 06:00:41,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 06:00:41,056 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60 [2018-11-10 06:00:41,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:00:41,057 INFO L225 Difference]: With dead ends: 452 [2018-11-10 06:00:41,057 INFO L226 Difference]: Without dead ends: 452 [2018-11-10 06:00:41,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2018-11-10 06:00:41,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-11-10 06:00:41,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 399. [2018-11-10 06:00:41,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-11-10 06:00:41,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 440 transitions. [2018-11-10 06:00:41,064 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 440 transitions. Word has length 60 [2018-11-10 06:00:41,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:00:41,064 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 440 transitions. [2018-11-10 06:00:41,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 06:00:41,065 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 440 transitions. [2018-11-10 06:00:41,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-10 06:00:41,065 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:00:41,065 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:00:41,066 INFO L424 AbstractCegarLoop]: === Iteration 21 === [dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 06:00:41,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:00:41,066 INFO L82 PathProgramCache]: Analyzing trace with hash -2091643788, now seen corresponding path program 1 times [2018-11-10 06:00:41,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:00:41,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:41,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:00:41,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:41,067 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:00:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:00:41,118 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 06:00:41,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:00:41,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 06:00:41,118 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 06:00:41,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 06:00:41,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 06:00:41,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 06:00:41,119 INFO L87 Difference]: Start difference. First operand 399 states and 440 transitions. Second operand 6 states. [2018-11-10 06:00:41,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:00:41,303 INFO L93 Difference]: Finished difference Result 398 states and 438 transitions. [2018-11-10 06:00:41,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 06:00:41,303 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-11-10 06:00:41,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:00:41,305 INFO L225 Difference]: With dead ends: 398 [2018-11-10 06:00:41,305 INFO L226 Difference]: Without dead ends: 398 [2018-11-10 06:00:41,305 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 06:00:41,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-11-10 06:00:41,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2018-11-10 06:00:41,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-11-10 06:00:41,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 438 transitions. [2018-11-10 06:00:41,311 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 438 transitions. Word has length 61 [2018-11-10 06:00:41,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:00:41,311 INFO L481 AbstractCegarLoop]: Abstraction has 398 states and 438 transitions. [2018-11-10 06:00:41,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 06:00:41,311 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 438 transitions. [2018-11-10 06:00:41,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-10 06:00:41,312 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:00:41,312 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:00:41,312 INFO L424 AbstractCegarLoop]: === Iteration 22 === [dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 06:00:41,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:00:41,313 INFO L82 PathProgramCache]: Analyzing trace with hash -416447318, now seen corresponding path program 1 times [2018-11-10 06:00:41,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:00:41,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:41,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:00:41,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:41,314 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:00:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:00:41,469 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 06:00:41,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:00:41,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 06:00:41,469 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 06:00:41,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 06:00:41,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 06:00:41,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-11-10 06:00:41,470 INFO L87 Difference]: Start difference. First operand 398 states and 438 transitions. Second operand 12 states. [2018-11-10 06:00:42,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:00:42,540 INFO L93 Difference]: Finished difference Result 436 states and 480 transitions. [2018-11-10 06:00:42,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 06:00:42,541 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2018-11-10 06:00:42,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:00:42,542 INFO L225 Difference]: With dead ends: 436 [2018-11-10 06:00:42,542 INFO L226 Difference]: Without dead ends: 436 [2018-11-10 06:00:42,542 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2018-11-10 06:00:42,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-11-10 06:00:42,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 398. [2018-11-10 06:00:42,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-11-10 06:00:42,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 437 transitions. [2018-11-10 06:00:42,548 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 437 transitions. Word has length 62 [2018-11-10 06:00:42,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:00:42,548 INFO L481 AbstractCegarLoop]: Abstraction has 398 states and 437 transitions. [2018-11-10 06:00:42,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 06:00:42,548 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 437 transitions. [2018-11-10 06:00:42,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 06:00:42,549 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:00:42,549 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:00:42,550 INFO L424 AbstractCegarLoop]: === Iteration 23 === [dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 06:00:42,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:00:42,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1513210834, now seen corresponding path program 1 times [2018-11-10 06:00:42,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:00:42,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:42,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:00:42,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:00:42,551 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:00:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:00:42,779 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 06:00:42,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:00:42,779 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 06:00:42,780 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 85 with the following transitions: [2018-11-10 06:00:42,781 INFO L202 CegarAbsIntRunner]: [31], [33], [35], [37], [39], [41], [50], [86], [88], [90], [150], [151], [175], [178], [181], [184], [390], [395], [397], [399], [401], [403], [405], [406], [591], [596], [598], [600], [602], [604], [606], [608], [610], [611], [615], [617], [619], [620], [621], [623], [625], [634], [636], [638], [640], [641], [685], [687], [691], [692], [693], [695], [696], [697], [701], [715], [717], [718], [749], [750], [751], [753], [754] [2018-11-10 06:00:42,821 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 06:00:42,822 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 06:00:43,572 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 06:00:43,573 INFO L272 AbstractInterpreter]: Visited 63 different actions 210 times. Never merged. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 40 variables. [2018-11-10 06:00:43,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:00:43,578 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 06:00:43,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:00:43,578 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b11e9207-cf0a-4e6a-8dbe-c5ae5686e94c/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:00:43,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:00:43,586 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 06:00:43,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:00:43,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:00:43,889 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:00:43,889 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:00:43,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 06:00:43,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:00:43,902 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-11-10 06:00:43,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:00:43,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:00:43,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-11-10 06:00:43,944 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 06:00:43,944 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:00:45,672 WARN L179 SmtUtils]: Spent 1.62 s on a formula simplification that was a NOOP. DAG size: 25 [2018-11-10 06:00:45,686 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 27 [2018-11-10 06:00:51,985 WARN L179 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 25 [2018-11-10 06:00:56,070 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification that was a NOOP. DAG size: 25 [2018-11-10 06:00:58,148 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 25 [2018-11-10 06:00:58,299 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:00:58,300 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:00:58,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-11-10 06:00:58,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:00:58,307 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 16 treesize of output 12 [2018-11-10 06:00:58,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:00:58,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:00:58,312 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:7 [2018-11-10 06:00:58,424 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:00:58,425 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:00:58,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2018-11-10 06:00:58,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:00:58,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-11-10 06:00:58,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:00:58,439 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:00:58,439 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:00:58,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-11-10 06:00:58,440 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:00:58,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:00:58,444 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2018-11-10 06:00:58,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2018-11-10 06:00:58,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-11-10 06:00:58,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-11-10 06:00:58,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:00:58,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-11-10 06:00:58,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:53 [2018-11-10 06:00:58,573 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:00:58,573 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:00:58,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-11-10 06:00:58,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:00:58,584 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:00:58,584 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:00:58,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-10 06:00:58,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:00:58,600 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:00:58,600 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:00:58,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-11-10 06:00:58,601 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:00:58,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:00:58,606 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:49, output treesize:7 [2018-11-10 06:00:58,643 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 06:00:58,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 06:00:58,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 37 [2018-11-10 06:00:58,660 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 06:00:58,661 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-10 06:00:58,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-10 06:00:58,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1298, Unknown=2, NotChecked=0, Total=1406 [2018-11-10 06:00:58,663 INFO L87 Difference]: Start difference. First operand 398 states and 437 transitions. Second operand 26 states. [2018-11-10 06:01:00,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:01:00,679 INFO L93 Difference]: Finished difference Result 440 states and 484 transitions. [2018-11-10 06:01:00,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 06:01:00,679 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 84 [2018-11-10 06:01:00,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:01:00,681 INFO L225 Difference]: With dead ends: 440 [2018-11-10 06:01:00,681 INFO L226 Difference]: Without dead ends: 440 [2018-11-10 06:01:00,681 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 144 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=238, Invalid=2016, Unknown=2, NotChecked=0, Total=2256 [2018-11-10 06:01:00,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-11-10 06:01:00,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 397. [2018-11-10 06:01:00,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-11-10 06:01:00,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 436 transitions. [2018-11-10 06:01:00,689 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 436 transitions. Word has length 84 [2018-11-10 06:01:00,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:01:00,689 INFO L481 AbstractCegarLoop]: Abstraction has 397 states and 436 transitions. [2018-11-10 06:01:00,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-10 06:01:00,689 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 436 transitions. [2018-11-10 06:01:00,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 06:01:00,690 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:01:00,690 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:01:00,691 INFO L424 AbstractCegarLoop]: === Iteration 24 === [dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 06:01:00,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:00,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1792382389, now seen corresponding path program 1 times [2018-11-10 06:01:00,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:01:00,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:00,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:00,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:00,696 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:01:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:01:00,779 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 06:01:00,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:01:00,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 06:01:00,779 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 06:01:00,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 06:01:00,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 06:01:00,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 06:01:00,780 INFO L87 Difference]: Start difference. First operand 397 states and 436 transitions. Second operand 5 states. [2018-11-10 06:01:00,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:01:00,805 INFO L93 Difference]: Finished difference Result 389 states and 415 transitions. [2018-11-10 06:01:00,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 06:01:00,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2018-11-10 06:01:00,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:01:00,807 INFO L225 Difference]: With dead ends: 389 [2018-11-10 06:01:00,807 INFO L226 Difference]: Without dead ends: 389 [2018-11-10 06:01:00,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 06:01:00,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-11-10 06:01:00,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 387. [2018-11-10 06:01:00,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-11-10 06:01:00,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 415 transitions. [2018-11-10 06:01:00,813 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 415 transitions. Word has length 86 [2018-11-10 06:01:00,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:01:00,813 INFO L481 AbstractCegarLoop]: Abstraction has 387 states and 415 transitions. [2018-11-10 06:01:00,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 06:01:00,813 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 415 transitions. [2018-11-10 06:01:00,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-10 06:01:00,813 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:01:00,813 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:01:00,814 INFO L424 AbstractCegarLoop]: === Iteration 25 === [dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 06:01:00,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:00,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1571140042, now seen corresponding path program 1 times [2018-11-10 06:01:00,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:01:00,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:00,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:00,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:00,815 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:01:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:01:01,293 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 06:01:01,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:01:01,293 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 06:01:01,293 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 89 with the following transitions: [2018-11-10 06:01:01,293 INFO L202 CegarAbsIntRunner]: [31], [33], [35], [37], [39], [41], [50], [86], [88], [90], [150], [151], [175], [178], [181], [184], [390], [395], [397], [399], [401], [403], [405], [406], [591], [596], [598], [600], [602], [604], [606], [608], [610], [611], [615], [617], [619], [621], [623], [625], [628], [629], [634], [636], [638], [640], [641], [685], [687], [691], [692], [693], [695], [696], [697], [701], [715], [717], [718], [749], [750], [751], [753], [754] [2018-11-10 06:01:01,297 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 06:01:01,297 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 06:01:01,704 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 06:01:01,704 INFO L272 AbstractInterpreter]: Visited 64 different actions 214 times. Never merged. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 40 variables. [2018-11-10 06:01:01,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:01,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 06:01:01,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:01:01,706 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b11e9207-cf0a-4e6a-8dbe-c5ae5686e94c/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:01:01,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:01,714 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 06:01:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:01:01,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:01:01,785 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-11-10 06:01:01,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:01,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:01,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 06:01:01,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 06:01:01,805 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 8 treesize of output 7 [2018-11-10 06:01:01,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:01,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:01,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:01,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-11-10 06:01:01,953 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:01:01,953 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:01:01,955 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:01:01,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2018-11-10 06:01:01,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:01,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-11-10 06:01:01,968 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-10 06:01:01,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 19 [2018-11-10 06:01:01,975 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-10 06:01:01,981 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:01:01,990 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:01:02,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:01:02,006 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:40, output treesize:32 [2018-11-10 06:01:02,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 19 [2018-11-10 06:01:02,068 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-10 06:01:02,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:02,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:02,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 06:01:02,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:24 [2018-11-10 06:01:02,145 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 06:01:02,145 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:01:25,908 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 39 [2018-11-10 06:01:44,827 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:44,828 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:44,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 69 [2018-11-10 06:01:44,852 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:44,853 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:44,856 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:44,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 112 [2018-11-10 06:01:44,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:44,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:44,866 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:44,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 64 [2018-11-10 06:01:44,888 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:44,890 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:44,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 75 [2018-11-10 06:01:44,891 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:44,898 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:44,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 64 [2018-11-10 06:01:44,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 8 [2018-11-10 06:01:44,932 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:44,957 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 06:01:44,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 74 [2018-11-10 06:01:44,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 52 [2018-11-10 06:01:44,974 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:45,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 58 treesize of output 52 [2018-11-10 06:01:45,026 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:45,063 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 37 [2018-11-10 06:01:45,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:01:45,089 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:45,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2018-11-10 06:01:45,096 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-10 06:01:45,113 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 06:01:45,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 54 [2018-11-10 06:01:45,232 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 06:01:45,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 27 treesize of output 21 [2018-11-10 06:01:45,234 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:45,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2018-11-10 06:01:45,237 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:45,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-11-10 06:01:45,239 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:45,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 30 [2018-11-10 06:01:45,277 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-11-10 06:01:45,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2018-11-10 06:01:45,282 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-11-10 06:01:45,306 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-10 06:01:45,484 INFO L267 ElimStorePlain]: Start of recursive call 8: 8 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-10 06:01:45,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2018-11-10 06:01:45,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 28 treesize of output 22 [2018-11-10 06:01:45,491 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:45,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-10 06:01:45,503 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:45,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-11-10 06:01:45,513 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:45,519 INFO L267 ElimStorePlain]: Start of recursive call 20: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:01:45,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 47 [2018-11-10 06:01:45,523 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 31 [2018-11-10 06:01:45,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2018-11-10 06:01:45,544 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-11-10 06:01:45,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:01:45,545 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:45,563 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 06:01:45,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-10 06:01:45,605 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:45,626 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:01:45,714 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-10 06:01:45,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:01:45,750 INFO L202 ElimStorePlain]: Needed 28 recursive calls to eliminate 8 variables, input treesize:61, output treesize:7 [2018-11-10 06:01:45,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-11-10 06:01:45,775 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 9 treesize of output 8 [2018-11-10 06:01:45,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:45,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2018-11-10 06:01:45,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-11-10 06:01:45,810 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:01:45,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 15 [2018-11-10 06:01:45,825 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:45,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2018-11-10 06:01:45,860 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 06:01:45,877 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-10 06:01:45,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 57 [2018-11-10 06:01:45,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 39 treesize of output 33 [2018-11-10 06:01:45,896 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:45,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 45 [2018-11-10 06:01:46,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-11-10 06:01:46,005 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 06:01:46,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-11-10 06:01:46,011 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 06:01:46,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 37 treesize of output 31 [2018-11-10 06:01:46,053 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:46,082 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2018-11-10 06:01:46,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 61 [2018-11-10 06:01:46,365 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 104 [2018-11-10 06:01:46,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 39 [2018-11-10 06:01:46,380 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-10 06:01:46,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2018-11-10 06:01:46,416 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-10 06:01:46,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 27 [2018-11-10 06:01:46,630 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-11-10 06:01:46,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 36 [2018-11-10 06:01:46,637 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-11-10 06:01:46,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2018-11-10 06:01:46,809 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:46,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 36 [2018-11-10 06:01:46,986 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-11-10 06:01:46,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 31 [2018-11-10 06:01:46,999 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-11-10 06:01:47,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-11-10 06:01:47,141 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:01:47,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2018-11-10 06:01:47,143 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:01:47,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-11-10 06:01:47,272 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:47,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 34 treesize of output 28 [2018-11-10 06:01:47,273 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:47,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 23 [2018-11-10 06:01:47,391 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-11-10 06:01:47,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 28 [2018-11-10 06:01:47,397 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-11-10 06:01:47,484 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, 7 dim-1 vars, End of recursive call: 7 dim-0 vars, and 13 xjuncts. [2018-11-10 06:01:47,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 47 [2018-11-10 06:01:47,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2018-11-10 06:01:47,719 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 06:01:47,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 40 [2018-11-10 06:01:47,725 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 06:01:47,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 39 treesize of output 33 [2018-11-10 06:01:47,729 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:47,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 52 [2018-11-10 06:01:47,796 INFO L267 ElimStorePlain]: Start of recursive call 32: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-11-10 06:01:47,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 37 [2018-11-10 06:01:47,802 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-11-10 06:01:47,876 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-11-10 06:01:48,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-11-10 06:01:48,138 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:01:48,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2018-11-10 06:01:48,144 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:01:48,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2018-11-10 06:01:48,147 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:01:48,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-11-10 06:01:48,151 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:01:48,152 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 29 treesize of output 27 [2018-11-10 06:01:48,153 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:01:48,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2018-11-10 06:01:48,155 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:01:48,157 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 40 treesize of output 38 [2018-11-10 06:01:48,158 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:01:48,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2018-11-10 06:01:48,160 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:01:48,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 61 [2018-11-10 06:01:48,594 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 101 [2018-11-10 06:01:48,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-11-10 06:01:48,597 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:01:48,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2018-11-10 06:01:48,599 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:01:48,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 32 [2018-11-10 06:01:48,765 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 2 xjuncts. [2018-11-10 06:01:48,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 27 [2018-11-10 06:01:48,771 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 2 xjuncts. [2018-11-10 06:01:48,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2018-11-10 06:01:48,911 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:48,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 35 [2018-11-10 06:01:48,919 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 2 xjuncts. [2018-11-10 06:01:49,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 34 treesize of output 28 [2018-11-10 06:01:49,050 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:49,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 35 [2018-11-10 06:01:49,056 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 06:01:49,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 31 [2018-11-10 06:01:49,176 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 2 xjuncts. [2018-11-10 06:01:49,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 36 [2018-11-10 06:01:49,186 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 2 xjuncts. [2018-11-10 06:01:49,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 39 [2018-11-10 06:01:49,305 INFO L267 ElimStorePlain]: Start of recursive call 53: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-11-10 06:01:49,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 44 [2018-11-10 06:01:49,321 INFO L267 ElimStorePlain]: Start of recursive call 54: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-11-10 06:01:49,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 32 [2018-11-10 06:01:49,469 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 2 xjuncts. [2018-11-10 06:01:49,554 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-0 vars, 7 dim-1 vars, End of recursive call: 7 dim-0 vars, and 12 xjuncts. [2018-11-10 06:01:49,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 61 [2018-11-10 06:01:50,084 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 104 [2018-11-10 06:01:50,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 38 treesize of output 32 [2018-11-10 06:01:50,086 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:50,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-11-10 06:01:50,089 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:50,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2018-11-10 06:01:50,091 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:50,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 35 [2018-11-10 06:01:50,242 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 2 xjuncts. [2018-11-10 06:01:50,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2018-11-10 06:01:50,245 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:50,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 36 [2018-11-10 06:01:50,377 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 2 xjuncts. [2018-11-10 06:01:50,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 35 [2018-11-10 06:01:50,383 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 2 xjuncts. [2018-11-10 06:01:50,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-11-10 06:01:50,494 INFO L267 ElimStorePlain]: Start of recursive call 64: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:01:50,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2018-11-10 06:01:50,496 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:01:50,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 36 [2018-11-10 06:01:50,604 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 2 xjuncts. [2018-11-10 06:01:50,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 31 [2018-11-10 06:01:50,614 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 2 xjuncts. [2018-11-10 06:01:50,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 23 [2018-11-10 06:01:50,716 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 2 xjuncts. [2018-11-10 06:01:50,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 28 [2018-11-10 06:01:50,722 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 2 xjuncts. [2018-11-10 06:01:50,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 44 [2018-11-10 06:01:50,803 INFO L267 ElimStorePlain]: Start of recursive call 70: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-11-10 06:01:50,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 39 [2018-11-10 06:01:50,815 INFO L267 ElimStorePlain]: Start of recursive call 71: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-11-10 06:01:50,908 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-0 vars, 7 dim-1 vars, End of recursive call: 7 dim-0 vars, and 12 xjuncts. [2018-11-10 06:01:51,353 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 42 [2018-11-10 06:01:51,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2018-11-10 06:01:51,370 INFO L267 ElimStorePlain]: Start of recursive call 73: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 06:01:51,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:01:51,372 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:51,385 INFO L267 ElimStorePlain]: Start of recursive call 72: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-11-10 06:01:51,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-11-10 06:01:51,850 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 06:01:51,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 35 [2018-11-10 06:01:51,856 INFO L267 ElimStorePlain]: Start of recursive call 76: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 06:01:51,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2018-11-10 06:01:51,862 INFO L267 ElimStorePlain]: Start of recursive call 77: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 06:01:51,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2018-11-10 06:01:51,869 INFO L267 ElimStorePlain]: Start of recursive call 78: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 06:01:52,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 58 [2018-11-10 06:01:52,482 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 102 [2018-11-10 06:01:52,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 33 [2018-11-10 06:01:52,492 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 2 xjuncts. [2018-11-10 06:01:52,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 28 [2018-11-10 06:01:52,503 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 2 xjuncts. [2018-11-10 06:01:52,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 41 [2018-11-10 06:01:52,646 INFO L267 ElimStorePlain]: Start of recursive call 82: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-11-10 06:01:52,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 36 [2018-11-10 06:01:52,658 INFO L267 ElimStorePlain]: Start of recursive call 83: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-11-10 06:01:52,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2018-11-10 06:01:52,804 INFO L267 ElimStorePlain]: Start of recursive call 84: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:01:52,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-10 06:01:52,806 INFO L267 ElimStorePlain]: Start of recursive call 85: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:01:52,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 20 [2018-11-10 06:01:52,925 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 2 xjuncts. [2018-11-10 06:01:52,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 25 [2018-11-10 06:01:52,930 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 2 xjuncts. [2018-11-10 06:01:53,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2018-11-10 06:01:53,026 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:53,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2018-11-10 06:01:53,120 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 2 xjuncts. [2018-11-10 06:01:53,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-11-10 06:01:53,211 INFO L267 ElimStorePlain]: Start of recursive call 90: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 06:01:53,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 27 treesize of output 21 [2018-11-10 06:01:53,213 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:53,281 INFO L267 ElimStorePlain]: Start of recursive call 79: 1 dim-0 vars, 7 dim-1 vars, End of recursive call: 7 dim-0 vars, and 12 xjuncts. [2018-11-10 06:01:53,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 42 treesize of output 36 [2018-11-10 06:01:53,808 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:54,291 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 39 [2018-11-10 06:01:54,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2018-11-10 06:01:54,307 INFO L267 ElimStorePlain]: Start of recursive call 94: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 06:01:54,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:01:54,309 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:54,322 INFO L267 ElimStorePlain]: Start of recursive call 93: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-11-10 06:01:54,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-11-10 06:01:54,872 INFO L267 ElimStorePlain]: Start of recursive call 96: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:01:54,875 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 39 treesize of output 37 [2018-11-10 06:01:54,875 INFO L267 ElimStorePlain]: Start of recursive call 97: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:01:54,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-11-10 06:01:54,878 INFO L267 ElimStorePlain]: Start of recursive call 98: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:01:55,392 INFO L267 ElimStorePlain]: Start of recursive call 8: 13 dim-1 vars, End of recursive call: 53 dim-0 vars, and 52 xjuncts. [2018-11-10 06:01:55,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2018-11-10 06:01:55,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 35 [2018-11-10 06:01:55,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-11-10 06:01:55,448 INFO L267 ElimStorePlain]: Start of recursive call 101: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 06:01:55,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2018-11-10 06:01:55,456 INFO L267 ElimStorePlain]: Start of recursive call 102: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 06:01:55,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 27 treesize of output 21 [2018-11-10 06:01:55,458 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:55,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 40 [2018-11-10 06:01:55,522 INFO L267 ElimStorePlain]: Start of recursive call 104: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-11-10 06:01:55,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2018-11-10 06:01:55,528 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 2 xjuncts. [2018-11-10 06:01:55,588 INFO L267 ElimStorePlain]: Start of recursive call 100: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-11-10 06:01:55,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 30 treesize of output 24 [2018-11-10 06:01:55,641 INFO L267 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:55,692 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2018-11-10 06:01:55,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2018-11-10 06:01:55,706 INFO L267 ElimStorePlain]: Start of recursive call 108: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 06:01:55,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:01:55,708 INFO L267 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:55,718 INFO L267 ElimStorePlain]: Start of recursive call 107: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-11-10 06:01:55,783 INFO L267 ElimStorePlain]: Start of recursive call 99: 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 11 xjuncts. [2018-11-10 06:01:56,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 61 dim-0 vars, and 61 xjuncts. [2018-11-10 06:01:57,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 151 dim-0 vars, and 61 xjuncts. [2018-11-10 06:01:57,118 INFO L202 ElimStorePlain]: Needed 109 recursive calls to eliminate 6 variables, input treesize:46, output treesize:1543 [2018-11-10 06:01:58,168 WARN L179 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 789 DAG size of output: 54 [2018-11-10 06:01:58,546 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:58,547 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:58,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 44 [2018-11-10 06:01:58,566 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:58,566 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:58,567 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:58,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-11-10 06:01:58,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:58,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:58,576 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:58,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 39 [2018-11-10 06:01:58,597 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:58,597 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:58,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-11-10 06:01:58,599 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:58,608 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:58,645 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:58,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 36 [2018-11-10 06:01:58,660 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:58,661 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:58,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-11-10 06:01:58,662 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:58,666 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:58,668 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:58,669 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:58,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 41 [2018-11-10 06:01:58,685 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:58,686 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:58,687 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:58,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-11-10 06:01:58,688 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:58,693 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:58,720 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:58,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 33 [2018-11-10 06:01:58,733 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:58,734 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:58,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-11-10 06:01:58,734 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:58,739 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:58,740 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:58,741 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:58,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2018-11-10 06:01:58,760 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:58,760 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:58,761 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:58,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-11-10 06:01:58,762 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:58,766 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:58,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:01:58,786 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 14 variables, input treesize:136, output treesize:7 [2018-11-10 06:01:58,951 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 06:01:58,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 06:01:58,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 48 [2018-11-10 06:01:58,968 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 06:01:58,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-10 06:01:58,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-10 06:01:58,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2182, Unknown=23, NotChecked=0, Total=2352 [2018-11-10 06:01:58,969 INFO L87 Difference]: Start difference. First operand 387 states and 415 transitions. Second operand 33 states. [2018-11-10 06:02:03,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:02:03,908 INFO L93 Difference]: Finished difference Result 434 states and 466 transitions. [2018-11-10 06:02:03,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-10 06:02:03,908 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 88 [2018-11-10 06:02:03,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:02:03,909 INFO L225 Difference]: With dead ends: 434 [2018-11-10 06:02:03,909 INFO L226 Difference]: Without dead ends: 434 [2018-11-10 06:02:03,910 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 141 SyntacticMatches, 15 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 45.6s TimeCoverageRelationStatistics Valid=451, Invalid=4638, Unknown=23, NotChecked=0, Total=5112 [2018-11-10 06:02:03,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-11-10 06:02:03,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 386. [2018-11-10 06:02:03,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-11-10 06:02:03,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 414 transitions. [2018-11-10 06:02:03,915 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 414 transitions. Word has length 88 [2018-11-10 06:02:03,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:02:03,915 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 414 transitions. [2018-11-10 06:02:03,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-10 06:02:03,915 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 414 transitions. [2018-11-10 06:02:03,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-10 06:02:03,916 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:02:03,916 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:02:03,916 INFO L424 AbstractCegarLoop]: === Iteration 26 === [dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 06:02:03,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:02:03,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1460700384, now seen corresponding path program 1 times [2018-11-10 06:02:03,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:02:03,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:02:03,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:02:03,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:02:03,918 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:02:03,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:02:04,590 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 06:02:04,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:02:04,591 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 06:02:04,591 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 90 with the following transitions: [2018-11-10 06:02:04,591 INFO L202 CegarAbsIntRunner]: [31], [33], [35], [37], [39], [41], [50], [86], [88], [90], [150], [151], [175], [178], [181], [184], [390], [395], [397], [399], [401], [403], [405], [406], [591], [596], [598], [600], [602], [604], [606], [608], [610], [611], [615], [617], [619], [621], [623], [625], [628], [630], [631], [634], [636], [638], [640], [641], [685], [687], [691], [692], [693], [695], [696], [697], [701], [715], [717], [718], [749], [750], [751], [753], [754] [2018-11-10 06:02:04,593 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 06:02:04,593 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 06:02:05,101 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 06:02:05,101 INFO L272 AbstractInterpreter]: Visited 65 different actions 218 times. Never merged. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 40 variables. [2018-11-10 06:02:05,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:02:05,103 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 06:02:05,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:02:05,103 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b11e9207-cf0a-4e6a-8dbe-c5ae5686e94c/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:02:05,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:02:05,112 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 06:02:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:02:05,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:02:05,230 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-11-10 06:02:05,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:05,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 06:02:05,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:05,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:05,247 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-11-10 06:02:05,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 06:02:05,288 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 8 treesize of output 7 [2018-11-10 06:02:05,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:05,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:05,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 06:02:05,305 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 8 treesize of output 7 [2018-11-10 06:02:05,305 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:05,308 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:05,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:05,316 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-11-10 06:02:05,576 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:02:05,579 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:02:05,584 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:02:05,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2018-11-10 06:02:05,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:05,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-10 06:02:05,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:05,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-11-10 06:02:05,614 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-10 06:02:05,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 19 [2018-11-10 06:02:05,621 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:05,628 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:05,638 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:05,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-11-10 06:02:05,659 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-10 06:02:05,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 19 [2018-11-10 06:02:05,665 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:05,672 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:05,682 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:05,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:05,707 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 12 variables, input treesize:70, output treesize:17 [2018-11-10 06:02:05,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 06:02:05,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 13 treesize of output 5 [2018-11-10 06:02:05,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:05,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:05,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 06:02:05,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-10 06:02:05,753 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:05,754 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:05,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:05,757 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2018-11-10 06:02:05,794 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 06:02:05,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:02:06,121 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 06:02:06,685 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 06:02:06,694 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 06:02:07,138 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 06:02:07,145 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 06:02:07,615 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 06:02:07,621 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 06:02:08,124 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 06:02:08,135 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-11-10 06:02:09,672 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:09,672 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:09,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 85 [2018-11-10 06:02:09,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:09,675 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 86 [2018-11-10 06:02:09,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:09,711 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2018-11-10 06:02:09,712 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:09,713 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:09,714 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:09,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 43 [2018-11-10 06:02:09,714 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:09,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 88 [2018-11-10 06:02:09,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 76 [2018-11-10 06:02:09,763 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:09,765 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2018-11-10 06:02:09,766 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:09,782 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-10 06:02:09,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 55 [2018-11-10 06:02:09,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 8 [2018-11-10 06:02:09,846 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:09,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-11-10 06:02:09,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-10 06:02:09,866 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:09,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 13 treesize of output 7 [2018-11-10 06:02:09,875 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:09,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2018-11-10 06:02:09,883 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:09,888 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:09,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 58 [2018-11-10 06:02:09,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 57 [2018-11-10 06:02:09,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-11-10 06:02:09,988 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:09,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 06:02:09,990 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:10,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2018-11-10 06:02:10,038 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:10,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 17 [2018-11-10 06:02:10,040 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:10,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 32 [2018-11-10 06:02:10,082 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 3 xjuncts. [2018-11-10 06:02:10,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 29 [2018-11-10 06:02:10,091 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 3 xjuncts. [2018-11-10 06:02:10,118 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 06:02:10,157 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2018-11-10 06:02:10,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:02:10,174 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:10,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2018-11-10 06:02:10,179 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:10,194 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 06:02:10,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2018-11-10 06:02:10,248 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:10,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-11-10 06:02:10,249 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:10,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-11-10 06:02:10,251 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:10,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 22 treesize of output 16 [2018-11-10 06:02:10,297 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:10,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 23 treesize of output 17 [2018-11-10 06:02:10,299 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:10,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 13 [2018-11-10 06:02:10,301 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:10,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 42 treesize of output 36 [2018-11-10 06:02:10,342 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:10,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 43 [2018-11-10 06:02:10,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 24 [2018-11-10 06:02:10,468 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:10,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2018-11-10 06:02:10,473 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:10,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 20 treesize of output 14 [2018-11-10 06:02:10,500 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:10,515 INFO L267 ElimStorePlain]: Start of recursive call 33: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:02:10,574 INFO L267 ElimStorePlain]: Start of recursive call 15: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-10 06:02:10,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 36 [2018-11-10 06:02:10,578 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-11-10 06:02:10,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2018-11-10 06:02:10,592 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:10,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:02:10,594 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:10,604 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 06:02:10,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-10 06:02:10,622 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:10,632 INFO L267 ElimStorePlain]: Start of recursive call 37: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:02:10,659 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-10 06:02:10,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 73 [2018-11-10 06:02:10,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 8 [2018-11-10 06:02:10,678 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:10,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-10 06:02:10,697 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-11-10 06:02:10,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2018-11-10 06:02:10,708 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:10,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:02:10,710 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:10,717 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 06:02:10,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-10 06:02:10,734 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:10,745 INFO L267 ElimStorePlain]: Start of recursive call 44: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:02:10,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2018-11-10 06:02:10,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-11-10 06:02:10,753 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:10,763 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 18 treesize of output 16 [2018-11-10 06:02:10,764 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:10,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 13 treesize of output 7 [2018-11-10 06:02:10,773 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:10,780 INFO L267 ElimStorePlain]: Start of recursive call 49: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:10,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 42 [2018-11-10 06:02:10,793 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2018-11-10 06:02:10,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2018-11-10 06:02:10,811 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:10,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:02:10,814 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:10,827 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 06:02:10,876 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2018-11-10 06:02:10,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2018-11-10 06:02:10,890 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:10,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:02:10,893 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:10,904 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 06:02:10,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 26 treesize of output 20 [2018-11-10 06:02:10,963 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:11,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 23 treesize of output 43 [2018-11-10 06:02:11,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-11-10 06:02:11,086 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:11,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-11-10 06:02:11,089 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:11,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2018-11-10 06:02:11,132 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:11,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-11-10 06:02:11,134 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:11,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2018-11-10 06:02:11,174 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 3 xjuncts. [2018-11-10 06:02:11,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2018-11-10 06:02:11,184 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 3 xjuncts. [2018-11-10 06:02:11,211 INFO L267 ElimStorePlain]: Start of recursive call 61: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 06:02:11,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 24 treesize of output 18 [2018-11-10 06:02:11,264 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:11,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 25 treesize of output 19 [2018-11-10 06:02:11,266 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:11,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 24 treesize of output 18 [2018-11-10 06:02:11,268 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:11,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-11-10 06:02:11,310 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:11,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-11-10 06:02:11,313 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:11,315 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 19 treesize of output 17 [2018-11-10 06:02:11,316 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:11,400 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 32 [2018-11-10 06:02:11,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 15 [2018-11-10 06:02:11,429 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:11,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-10 06:02:11,431 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:11,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-10 06:02:11,434 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:11,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2018-11-10 06:02:11,477 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:11,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2018-11-10 06:02:11,483 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:11,501 INFO L267 ElimStorePlain]: Start of recursive call 74: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-10 06:02:11,533 INFO L267 ElimStorePlain]: Start of recursive call 53: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-10 06:02:11,562 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-10 06:02:11,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 73 [2018-11-10 06:02:11,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 8 [2018-11-10 06:02:11,580 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:11,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2018-11-10 06:02:11,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 18 treesize of output 12 [2018-11-10 06:02:11,605 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:11,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2018-11-10 06:02:11,623 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:11,629 INFO L267 ElimStorePlain]: Start of recursive call 82: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:11,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-10 06:02:11,634 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-11-10 06:02:11,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2018-11-10 06:02:11,645 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:11,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:02:11,647 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:11,654 INFO L267 ElimStorePlain]: Start of recursive call 86: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 06:02:11,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-10 06:02:11,671 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:11,681 INFO L267 ElimStorePlain]: Start of recursive call 85: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:02:11,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 42 [2018-11-10 06:02:11,693 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2018-11-10 06:02:11,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2018-11-10 06:02:11,709 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:11,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:02:11,711 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:11,722 INFO L267 ElimStorePlain]: Start of recursive call 91: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 06:02:11,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 29 treesize of output 23 [2018-11-10 06:02:11,768 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:11,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2018-11-10 06:02:11,810 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:11,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2018-11-10 06:02:11,816 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:11,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2018-11-10 06:02:11,821 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:11,860 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 35 [2018-11-10 06:02:11,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-11-10 06:02:11,890 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:11,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 24 treesize of output 18 [2018-11-10 06:02:11,892 INFO L267 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:11,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-11-10 06:02:11,894 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:11,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2018-11-10 06:02:11,923 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:11,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2018-11-10 06:02:11,931 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:11,950 INFO L267 ElimStorePlain]: Start of recursive call 98: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-10 06:02:12,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 14 treesize of output 8 [2018-11-10 06:02:12,039 INFO L267 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:12,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 13 treesize of output 7 [2018-11-10 06:02:12,041 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:12,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 13 treesize of output 7 [2018-11-10 06:02:12,043 INFO L267 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:12,066 INFO L267 ElimStorePlain]: Start of recursive call 90: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:02:12,085 INFO L267 ElimStorePlain]: Start of recursive call 80: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-10 06:02:12,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2018-11-10 06:02:12,202 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 9 treesize of output 8 [2018-11-10 06:02:12,202 INFO L267 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:12,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2018-11-10 06:02:12,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-11-10 06:02:12,217 INFO L267 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:12,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 13 treesize of output 7 [2018-11-10 06:02:12,225 INFO L267 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:12,233 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:12,233 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:12,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-11-10 06:02:12,234 INFO L267 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:12,240 INFO L267 ElimStorePlain]: Start of recursive call 109: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:12,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 46 [2018-11-10 06:02:12,255 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 39 [2018-11-10 06:02:12,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2018-11-10 06:02:12,271 INFO L267 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:12,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:02:12,273 INFO L267 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:12,284 INFO L267 ElimStorePlain]: Start of recursive call 114: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 06:02:12,327 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:12,328 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:12,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-11-10 06:02:12,328 INFO L267 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:12,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-11-10 06:02:12,364 INFO L267 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:12,366 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 28 treesize of output 26 [2018-11-10 06:02:12,366 INFO L267 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:12,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2018-11-10 06:02:12,368 INFO L267 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:12,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 42 [2018-11-10 06:02:12,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-11-10 06:02:12,441 INFO L267 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:12,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-11-10 06:02:12,443 INFO L267 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:12,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 29 treesize of output 23 [2018-11-10 06:02:12,445 INFO L267 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:12,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-11-10 06:02:12,475 INFO L267 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:12,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-11-10 06:02:12,480 INFO L267 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:12,501 INFO L267 ElimStorePlain]: Start of recursive call 121: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-10 06:02:12,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 13 [2018-11-10 06:02:12,543 INFO L267 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:12,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 15 [2018-11-10 06:02:12,545 INFO L267 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:12,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 22 treesize of output 16 [2018-11-10 06:02:12,546 INFO L267 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:12,584 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-10 06:02:12,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:02:12,594 INFO L267 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:12,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2018-11-10 06:02:12,599 INFO L267 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:12,607 INFO L267 ElimStorePlain]: Start of recursive call 130: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 06:02:12,654 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:12,656 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:12,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 50 [2018-11-10 06:02:12,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-11-10 06:02:12,716 INFO L267 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:12,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-11-10 06:02:12,720 INFO L267 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:12,758 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:12,759 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:12,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 31 [2018-11-10 06:02:12,765 INFO L267 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 3 xjuncts. [2018-11-10 06:02:12,767 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:12,769 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:12,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 33 [2018-11-10 06:02:12,775 INFO L267 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 3 xjuncts. [2018-11-10 06:02:12,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2018-11-10 06:02:12,810 INFO L267 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:12,824 INFO L267 ElimStorePlain]: Start of recursive call 133: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:02:12,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 13 [2018-11-10 06:02:12,864 INFO L267 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:12,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 18 treesize of output 12 [2018-11-10 06:02:12,866 INFO L267 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:12,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 16 treesize of output 10 [2018-11-10 06:02:12,868 INFO L267 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:12,892 INFO L267 ElimStorePlain]: Start of recursive call 113: 8 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-10 06:02:12,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-11-10 06:02:12,896 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2018-11-10 06:02:12,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:02:12,903 INFO L267 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:12,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2018-11-10 06:02:12,909 INFO L267 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:12,915 INFO L267 ElimStorePlain]: Start of recursive call 143: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 06:02:12,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-10 06:02:12,931 INFO L267 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:12,940 INFO L267 ElimStorePlain]: Start of recursive call 142: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:02:12,963 INFO L267 ElimStorePlain]: Start of recursive call 107: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-10 06:02:13,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2018-11-10 06:02:13,087 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 9 treesize of output 8 [2018-11-10 06:02:13,087 INFO L267 ElimStorePlain]: Start of recursive call 148: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:13,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2018-11-10 06:02:13,106 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:13,106 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:13,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-11-10 06:02:13,107 INFO L267 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:13,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 20 treesize of output 14 [2018-11-10 06:02:13,128 INFO L267 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:13,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-11-10 06:02:13,136 INFO L267 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:13,141 INFO L267 ElimStorePlain]: Start of recursive call 149: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:13,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 46 [2018-11-10 06:02:13,153 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:13,153 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:13,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2018-11-10 06:02:13,154 INFO L267 ElimStorePlain]: Start of recursive call 154: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:13,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2018-11-10 06:02:13,178 INFO L267 ElimStorePlain]: Start of recursive call 155: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:13,197 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:13,199 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:13,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 50 [2018-11-10 06:02:13,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 33 [2018-11-10 06:02:13,269 INFO L267 ElimStorePlain]: Start of recursive call 157: End of recursive call: and 3 xjuncts. [2018-11-10 06:02:13,270 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 06:02:13,270 INFO L267 ElimStorePlain]: Start of recursive call 158: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:13,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2018-11-10 06:02:13,309 INFO L267 ElimStorePlain]: Start of recursive call 159: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:13,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2018-11-10 06:02:13,329 INFO L267 ElimStorePlain]: Start of recursive call 160: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:13,335 INFO L267 ElimStorePlain]: Start of recursive call 156: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:13,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 30 treesize of output 24 [2018-11-10 06:02:13,350 INFO L267 ElimStorePlain]: Start of recursive call 161: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:13,373 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2018-11-10 06:02:13,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2018-11-10 06:02:13,392 INFO L267 ElimStorePlain]: Start of recursive call 163: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:13,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:02:13,395 INFO L267 ElimStorePlain]: Start of recursive call 164: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:13,401 INFO L267 ElimStorePlain]: Start of recursive call 162: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:13,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 18 treesize of output 12 [2018-11-10 06:02:13,414 INFO L267 ElimStorePlain]: Start of recursive call 165: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:13,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 36 [2018-11-10 06:02:13,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 23 treesize of output 17 [2018-11-10 06:02:13,476 INFO L267 ElimStorePlain]: Start of recursive call 167: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:13,478 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 06:02:13,478 INFO L267 ElimStorePlain]: Start of recursive call 168: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:13,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-11-10 06:02:13,480 INFO L267 ElimStorePlain]: Start of recursive call 169: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:13,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2018-11-10 06:02:13,515 INFO L267 ElimStorePlain]: Start of recursive call 170: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:13,526 INFO L267 ElimStorePlain]: Start of recursive call 166: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:13,537 INFO L267 ElimStorePlain]: Start of recursive call 153: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:13,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-11-10 06:02:13,541 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2018-11-10 06:02:13,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:02:13,551 INFO L267 ElimStorePlain]: Start of recursive call 173: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:13,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2018-11-10 06:02:13,558 INFO L267 ElimStorePlain]: Start of recursive call 174: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:13,562 INFO L267 ElimStorePlain]: Start of recursive call 172: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:13,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-10 06:02:13,568 INFO L267 ElimStorePlain]: Start of recursive call 175: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:13,571 INFO L267 ElimStorePlain]: Start of recursive call 171: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:13,585 INFO L267 ElimStorePlain]: Start of recursive call 147: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:02:13,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2018-11-10 06:02:13,604 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 9 treesize of output 8 [2018-11-10 06:02:13,604 INFO L267 ElimStorePlain]: Start of recursive call 177: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:13,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-11-10 06:02:13,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-10 06:02:13,621 INFO L267 ElimStorePlain]: Start of recursive call 179: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:13,626 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 7 treesize of output 5 [2018-11-10 06:02:13,626 INFO L267 ElimStorePlain]: Start of recursive call 180: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:13,627 INFO L267 ElimStorePlain]: Start of recursive call 178: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:13,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-11-10 06:02:13,632 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2018-11-10 06:02:13,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2018-11-10 06:02:13,643 INFO L267 ElimStorePlain]: Start of recursive call 183: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:13,643 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 06:02:13,644 INFO L267 ElimStorePlain]: Start of recursive call 184: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:13,648 INFO L267 ElimStorePlain]: Start of recursive call 182: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:13,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-10 06:02:13,655 INFO L267 ElimStorePlain]: Start of recursive call 185: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:13,659 INFO L267 ElimStorePlain]: Start of recursive call 181: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:13,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 41 [2018-11-10 06:02:13,667 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 39 [2018-11-10 06:02:13,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2018-11-10 06:02:13,685 INFO L267 ElimStorePlain]: Start of recursive call 188: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:13,685 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 06:02:13,685 INFO L267 ElimStorePlain]: Start of recursive call 189: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:13,694 INFO L267 ElimStorePlain]: Start of recursive call 187: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:13,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 27 treesize of output 21 [2018-11-10 06:02:13,712 INFO L267 ElimStorePlain]: Start of recursive call 190: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:13,728 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 22 treesize of output 20 [2018-11-10 06:02:13,729 INFO L267 ElimStorePlain]: Start of recursive call 191: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:13,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-11-10 06:02:13,731 INFO L267 ElimStorePlain]: Start of recursive call 192: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:13,749 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2018-11-10 06:02:13,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2018-11-10 06:02:13,778 INFO L267 ElimStorePlain]: Start of recursive call 194: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:13,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2018-11-10 06:02:13,783 INFO L267 ElimStorePlain]: Start of recursive call 195: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:13,797 INFO L267 ElimStorePlain]: Start of recursive call 193: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:13,805 INFO L267 ElimStorePlain]: Start of recursive call 186: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:13,817 INFO L267 ElimStorePlain]: Start of recursive call 176: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:02:13,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 50 [2018-11-10 06:02:13,839 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 9 treesize of output 8 [2018-11-10 06:02:13,839 INFO L267 ElimStorePlain]: Start of recursive call 197: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:13,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-11-10 06:02:13,855 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2018-11-10 06:02:13,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:02:13,863 INFO L267 ElimStorePlain]: Start of recursive call 200: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:13,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2018-11-10 06:02:13,868 INFO L267 ElimStorePlain]: Start of recursive call 201: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:13,873 INFO L267 ElimStorePlain]: Start of recursive call 199: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:13,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-10 06:02:13,877 INFO L267 ElimStorePlain]: Start of recursive call 202: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:13,879 INFO L267 ElimStorePlain]: Start of recursive call 198: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:13,885 INFO L267 ElimStorePlain]: Start of recursive call 196: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:13,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2018-11-10 06:02:13,903 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 9 treesize of output 8 [2018-11-10 06:02:13,904 INFO L267 ElimStorePlain]: Start of recursive call 204: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:13,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 46 [2018-11-10 06:02:13,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 33 treesize of output 27 [2018-11-10 06:02:13,928 INFO L267 ElimStorePlain]: Start of recursive call 206: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:13,956 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:13,956 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:13,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-11-10 06:02:13,957 INFO L267 ElimStorePlain]: Start of recursive call 207: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:13,980 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:13,982 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:13,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 50 [2018-11-10 06:02:14,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-10 06:02:14,047 INFO L267 ElimStorePlain]: Start of recursive call 209: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:14,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 06:02:14,050 INFO L267 ElimStorePlain]: Start of recursive call 210: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:14,077 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:14,078 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:14,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-11-10 06:02:14,078 INFO L267 ElimStorePlain]: Start of recursive call 211: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:14,091 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:14,093 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:14,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 28 [2018-11-10 06:02:14,099 INFO L267 ElimStorePlain]: Start of recursive call 212: End of recursive call: and 3 xjuncts. [2018-11-10 06:02:14,113 INFO L267 ElimStorePlain]: Start of recursive call 208: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:02:14,139 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 36 [2018-11-10 06:02:14,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2018-11-10 06:02:14,175 INFO L267 ElimStorePlain]: Start of recursive call 214: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:14,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2018-11-10 06:02:14,181 INFO L267 ElimStorePlain]: Start of recursive call 215: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:14,206 INFO L267 ElimStorePlain]: Start of recursive call 213: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:14,276 INFO L267 ElimStorePlain]: Start of recursive call 205: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-10 06:02:14,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2018-11-10 06:02:14,283 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 20 treesize of output 18 [2018-11-10 06:02:14,283 INFO L267 ElimStorePlain]: Start of recursive call 217: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:14,293 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:14,293 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:14,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-11-10 06:02:14,294 INFO L267 ElimStorePlain]: Start of recursive call 218: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:14,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 13 treesize of output 7 [2018-11-10 06:02:14,303 INFO L267 ElimStorePlain]: Start of recursive call 219: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:14,309 INFO L267 ElimStorePlain]: Start of recursive call 216: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:14,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-11-10 06:02:14,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-10 06:02:14,313 INFO L267 ElimStorePlain]: Start of recursive call 221: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:14,318 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2018-11-10 06:02:14,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2018-11-10 06:02:14,330 INFO L267 ElimStorePlain]: Start of recursive call 223: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:14,330 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 06:02:14,330 INFO L267 ElimStorePlain]: Start of recursive call 224: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:14,335 INFO L267 ElimStorePlain]: Start of recursive call 222: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:14,339 INFO L267 ElimStorePlain]: Start of recursive call 220: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:14,357 INFO L267 ElimStorePlain]: Start of recursive call 203: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-10 06:02:14,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 3 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:14,457 INFO L202 ElimStorePlain]: Needed 224 recursive calls to eliminate 22 variables, input treesize:154, output treesize:7 [2018-11-10 06:02:14,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 72 [2018-11-10 06:02:14,631 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 9 treesize of output 8 [2018-11-10 06:02:14,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:14,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 61 [2018-11-10 06:02:14,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 53 [2018-11-10 06:02:14,657 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 06:02:14,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2018-11-10 06:02:14,678 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:02:14,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 54 treesize of output 48 [2018-11-10 06:02:14,697 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:14,714 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-10 06:02:14,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 123 [2018-11-10 06:02:14,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 103 [2018-11-10 06:02:14,737 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:02:14,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 105 treesize of output 99 [2018-11-10 06:02:14,849 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:14,950 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 108 [2018-11-10 06:02:14,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 50 [2018-11-10 06:02:14,974 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 06:02:14,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:02:14,977 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:14,999 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-11-10 06:02:15,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 111 [2018-11-10 06:02:15,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 59 [2018-11-10 06:02:15,332 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 06:02:15,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 97 [2018-11-10 06:02:15,343 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 06:02:15,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 103 treesize of output 97 [2018-11-10 06:02:15,418 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:15,489 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2018-11-10 06:02:15,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 111 [2018-11-10 06:02:15,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 103 treesize of output 97 [2018-11-10 06:02:15,781 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:15,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 104 [2018-11-10 06:02:15,788 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 06:02:15,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 142 [2018-11-10 06:02:15,796 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 06:02:15,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 116 [2018-11-10 06:02:15,900 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-11-10 06:02:15,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 101 [2018-11-10 06:02:15,907 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:16,028 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-11-10 06:02:16,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 102 treesize of output 127 [2018-11-10 06:02:16,633 WARN L179 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 116 [2018-11-10 06:02:16,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 145 treesize of output 139 [2018-11-10 06:02:16,643 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:16,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 101 [2018-11-10 06:02:16,651 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:16,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 102 [2018-11-10 06:02:16,659 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:16,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 67 [2018-11-10 06:02:16,918 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-10 06:02:16,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 105 [2018-11-10 06:02:16,931 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-10 06:02:17,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 100 treesize of output 94 [2018-11-10 06:02:17,217 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:17,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 93 [2018-11-10 06:02:17,220 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:17,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 100 [2018-11-10 06:02:17,447 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:17,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 96 [2018-11-10 06:02:17,681 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:02:17,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 58 [2018-11-10 06:02:17,684 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:02:17,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 60 [2018-11-10 06:02:17,905 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:17,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 98 [2018-11-10 06:02:17,912 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:18,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 102 [2018-11-10 06:02:18,101 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:18,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 64 [2018-11-10 06:02:18,114 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:18,270 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, 7 dim-1 vars, End of recursive call: 7 dim-0 vars, and 14 xjuncts. [2018-11-10 06:02:18,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 101 [2018-11-10 06:02:18,837 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 06:02:18,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 141 [2018-11-10 06:02:18,845 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 06:02:18,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 97 [2018-11-10 06:02:18,852 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 06:02:18,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 103 [2018-11-10 06:02:18,859 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 06:02:19,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 99 treesize of output 124 [2018-11-10 06:02:19,747 WARN L179 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 115 [2018-11-10 06:02:19,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 93 [2018-11-10 06:02:19,751 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:19,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 97 [2018-11-10 06:02:19,754 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:19,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 131 [2018-11-10 06:02:19,758 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:19,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 64 [2018-11-10 06:02:19,963 INFO L267 ElimStorePlain]: Start of recursive call 47: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-10 06:02:19,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 102 [2018-11-10 06:02:19,977 INFO L267 ElimStorePlain]: Start of recursive call 48: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-10 06:02:20,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 99 [2018-11-10 06:02:20,207 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:20,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 57 [2018-11-10 06:02:20,216 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:20,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 61 [2018-11-10 06:02:20,445 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:20,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 99 [2018-11-10 06:02:20,459 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:20,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 53 [2018-11-10 06:02:20,663 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:20,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 91 [2018-11-10 06:02:20,671 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:20,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 93 [2018-11-10 06:02:20,831 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:02:20,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 55 [2018-11-10 06:02:20,834 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:02:20,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 94 [2018-11-10 06:02:20,989 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 06:02:20,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 93 treesize of output 87 [2018-11-10 06:02:20,991 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:21,118 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-0 vars, 7 dim-1 vars, End of recursive call: 7 dim-0 vars, and 12 xjuncts. [2018-11-10 06:02:21,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 102 treesize of output 127 [2018-11-10 06:02:22,088 WARN L179 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 116 [2018-11-10 06:02:22,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 98 [2018-11-10 06:02:22,095 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:22,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 60 [2018-11-10 06:02:22,102 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:22,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 100 [2018-11-10 06:02:22,349 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:22,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 101 [2018-11-10 06:02:22,358 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:22,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 67 [2018-11-10 06:02:22,596 INFO L267 ElimStorePlain]: Start of recursive call 64: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-10 06:02:22,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 105 [2018-11-10 06:02:22,610 INFO L267 ElimStorePlain]: Start of recursive call 65: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-10 06:02:22,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 64 [2018-11-10 06:02:22,868 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:22,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 102 [2018-11-10 06:02:22,882 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:23,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 97 [2018-11-10 06:02:23,091 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 06:02:23,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 100 treesize of output 94 [2018-11-10 06:02:23,093 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:23,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 96 [2018-11-10 06:02:23,269 INFO L267 ElimStorePlain]: Start of recursive call 70: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:02:23,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 58 [2018-11-10 06:02:23,272 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:02:23,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 98 [2018-11-10 06:02:23,433 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:23,572 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-0 vars, 7 dim-1 vars, End of recursive call: 7 dim-0 vars, and 12 xjuncts. [2018-11-10 06:02:24,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 106 [2018-11-10 06:02:24,423 INFO L267 ElimStorePlain]: Start of recursive call 73: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:02:25,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 102 treesize of output 127 [2018-11-10 06:02:25,439 WARN L179 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 116 [2018-11-10 06:02:25,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 60 [2018-11-10 06:02:25,445 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:25,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 98 [2018-11-10 06:02:25,453 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:25,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 96 [2018-11-10 06:02:25,707 INFO L267 ElimStorePlain]: Start of recursive call 77: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:02:25,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 58 [2018-11-10 06:02:25,710 INFO L267 ElimStorePlain]: Start of recursive call 78: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:02:25,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 100 treesize of output 94 [2018-11-10 06:02:25,931 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:25,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 101 [2018-11-10 06:02:25,938 INFO L267 ElimStorePlain]: Start of recursive call 80: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 06:02:26,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 100 [2018-11-10 06:02:26,126 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:26,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 101 [2018-11-10 06:02:26,135 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:26,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 105 [2018-11-10 06:02:26,319 INFO L267 ElimStorePlain]: Start of recursive call 83: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-10 06:02:26,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 67 [2018-11-10 06:02:26,335 INFO L267 ElimStorePlain]: Start of recursive call 84: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-10 06:02:26,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 102 [2018-11-10 06:02:26,545 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:26,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 102 [2018-11-10 06:02:26,734 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:26,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 64 [2018-11-10 06:02:26,746 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:26,890 INFO L267 ElimStorePlain]: Start of recursive call 74: 1 dim-0 vars, 7 dim-1 vars, End of recursive call: 7 dim-0 vars, and 13 xjuncts. [2018-11-10 06:02:27,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 106 treesize of output 100 [2018-11-10 06:02:27,885 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:28,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 103 [2018-11-10 06:02:28,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:02:28,957 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:28,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 50 [2018-11-10 06:02:28,964 INFO L267 ElimStorePlain]: Start of recursive call 91: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 06:02:28,984 INFO L267 ElimStorePlain]: Start of recursive call 89: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-11-10 06:02:30,042 INFO L267 ElimStorePlain]: Start of recursive call 8: 13 dim-1 vars, End of recursive call: 52 dim-0 vars, and 51 xjuncts. [2018-11-10 06:02:30,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 68 [2018-11-10 06:02:30,050 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 66 [2018-11-10 06:02:30,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 50 [2018-11-10 06:02:30,069 INFO L267 ElimStorePlain]: Start of recursive call 94: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 06:02:30,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:02:30,071 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:30,087 INFO L267 ElimStorePlain]: Start of recursive call 93: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-11-10 06:02:30,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 59 treesize of output 53 [2018-11-10 06:02:30,138 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:30,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 99 treesize of output 93 [2018-11-10 06:02:30,141 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:30,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 61 treesize of output 55 [2018-11-10 06:02:30,143 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:30,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 58 treesize of output 52 [2018-11-10 06:02:30,145 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:30,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 68 [2018-11-10 06:02:30,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 58 [2018-11-10 06:02:30,224 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:30,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 73 [2018-11-10 06:02:30,238 INFO L267 ElimStorePlain]: Start of recursive call 102: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-11-10 06:02:30,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 111 [2018-11-10 06:02:30,256 INFO L267 ElimStorePlain]: Start of recursive call 103: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-11-10 06:02:30,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 61 [2018-11-10 06:02:30,394 INFO L267 ElimStorePlain]: Start of recursive call 104: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 06:02:30,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 56 treesize of output 50 [2018-11-10 06:02:30,396 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:30,496 INFO L267 ElimStorePlain]: Start of recursive call 100: 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 9 xjuncts. [2018-11-10 06:02:30,619 INFO L267 ElimStorePlain]: Start of recursive call 92: 3 dim-1 vars, End of recursive call: 7 dim-0 vars, and 12 xjuncts. [2018-11-10 06:02:32,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 61 dim-0 vars, and 61 xjuncts. [2018-11-10 06:02:33,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2018-11-10 06:02:33,808 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 9 treesize of output 8 [2018-11-10 06:02:33,808 INFO L267 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:33,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 51 [2018-11-10 06:02:33,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 55 [2018-11-10 06:02:33,977 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 96 [2018-11-10 06:02:33,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 33 [2018-11-10 06:02:33,986 INFO L267 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 4 xjuncts. [2018-11-10 06:02:33,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2018-11-10 06:02:33,996 INFO L267 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 4 xjuncts. [2018-11-10 06:02:34,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 30 [2018-11-10 06:02:34,147 INFO L267 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:34,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 24 [2018-11-10 06:02:34,154 INFO L267 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:34,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2018-11-10 06:02:34,282 INFO L267 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:34,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2018-11-10 06:02:34,287 INFO L267 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:34,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2018-11-10 06:02:34,376 INFO L267 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:34,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 28 treesize of output 22 [2018-11-10 06:02:34,486 INFO L267 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:34,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-11-10 06:02:34,489 INFO L267 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:34,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 20 [2018-11-10 06:02:34,533 INFO L267 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:34,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2018-11-10 06:02:34,537 INFO L267 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:34,572 INFO L267 ElimStorePlain]: Start of recursive call 109: 7 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-10 06:02:34,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 33 treesize of output 27 [2018-11-10 06:02:34,734 INFO L267 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:34,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2018-11-10 06:02:34,810 INFO L267 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:34,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 39 [2018-11-10 06:02:34,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 26 treesize of output 20 [2018-11-10 06:02:34,924 INFO L267 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:34,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-11-10 06:02:34,925 INFO L267 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:34,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-11-10 06:02:34,927 INFO L267 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:34,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2018-11-10 06:02:34,956 INFO L267 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:34,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2018-11-10 06:02:34,961 INFO L267 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:34,981 INFO L267 ElimStorePlain]: Start of recursive call 123: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-10 06:02:35,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 55 [2018-11-10 06:02:35,205 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 100 [2018-11-10 06:02:35,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2018-11-10 06:02:35,215 INFO L267 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 4 xjuncts. [2018-11-10 06:02:35,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 33 [2018-11-10 06:02:35,224 INFO L267 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 4 xjuncts. [2018-11-10 06:02:35,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 38 [2018-11-10 06:02:35,386 INFO L267 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 8 xjuncts. [2018-11-10 06:02:35,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 36 [2018-11-10 06:02:35,400 INFO L267 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 8 xjuncts. [2018-11-10 06:02:35,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2018-11-10 06:02:35,546 INFO L267 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:35,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2018-11-10 06:02:35,551 INFO L267 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:35,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2018-11-10 06:02:35,637 INFO L267 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:35,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2018-11-10 06:02:35,782 INFO L267 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:35,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 24 treesize of output 18 [2018-11-10 06:02:35,784 INFO L267 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:35,821 INFO L267 ElimStorePlain]: Start of recursive call 129: 7 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-10 06:02:35,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 38 [2018-11-10 06:02:35,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-11-10 06:02:35,923 INFO L267 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:35,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 30 treesize of output 24 [2018-11-10 06:02:35,925 INFO L267 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:35,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2018-11-10 06:02:35,931 INFO L267 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:35,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 43 [2018-11-10 06:02:35,985 INFO L267 ElimStorePlain]: Start of recursive call 143: End of recursive call: and 8 xjuncts. [2018-11-10 06:02:35,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2018-11-10 06:02:35,990 INFO L267 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:36,039 INFO L267 ElimStorePlain]: Start of recursive call 139: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-10 06:02:36,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 52 [2018-11-10 06:02:36,475 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 97 [2018-11-10 06:02:36,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2018-11-10 06:02:36,484 INFO L267 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 4 xjuncts. [2018-11-10 06:02:36,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2018-11-10 06:02:36,493 INFO L267 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 4 xjuncts. [2018-11-10 06:02:36,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-11-10 06:02:36,639 INFO L267 ElimStorePlain]: Start of recursive call 148: End of recursive call: and 8 xjuncts. [2018-11-10 06:02:36,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-11-10 06:02:36,651 INFO L267 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 8 xjuncts. [2018-11-10 06:02:36,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 17 [2018-11-10 06:02:36,771 INFO L267 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:36,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 19 [2018-11-10 06:02:36,775 INFO L267 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:36,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 25 treesize of output 19 [2018-11-10 06:02:36,862 INFO L267 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:36,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2018-11-10 06:02:36,866 INFO L267 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:36,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2018-11-10 06:02:36,942 INFO L267 ElimStorePlain]: Start of recursive call 154: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:37,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2018-11-10 06:02:37,005 INFO L267 ElimStorePlain]: Start of recursive call 155: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:37,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2018-11-10 06:02:37,010 INFO L267 ElimStorePlain]: Start of recursive call 156: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:37,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2018-11-10 06:02:37,050 INFO L267 ElimStorePlain]: Start of recursive call 157: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:37,077 INFO L267 ElimStorePlain]: Start of recursive call 145: 7 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-10 06:02:37,129 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 23 treesize of output 21 [2018-11-10 06:02:37,129 INFO L267 ElimStorePlain]: Start of recursive call 158: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:37,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-11-10 06:02:37,131 INFO L267 ElimStorePlain]: Start of recursive call 159: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:37,166 INFO L267 ElimStorePlain]: Start of recursive call 108: 13 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-11-10 06:02:37,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2018-11-10 06:02:37,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 20 treesize of output 14 [2018-11-10 06:02:37,172 INFO L267 ElimStorePlain]: Start of recursive call 161: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:37,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-11-10 06:02:37,181 INFO L267 ElimStorePlain]: Start of recursive call 162: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:37,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2018-11-10 06:02:37,191 INFO L267 ElimStorePlain]: Start of recursive call 163: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:37,199 INFO L267 ElimStorePlain]: Start of recursive call 160: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:02:37,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2018-11-10 06:02:37,206 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-11-10 06:02:37,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:02:37,217 INFO L267 ElimStorePlain]: Start of recursive call 166: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:37,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2018-11-10 06:02:37,224 INFO L267 ElimStorePlain]: Start of recursive call 167: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:37,234 INFO L267 ElimStorePlain]: Start of recursive call 165: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 06:02:37,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 22 treesize of output 16 [2018-11-10 06:02:37,259 INFO L267 ElimStorePlain]: Start of recursive call 168: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:37,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 23 treesize of output 17 [2018-11-10 06:02:37,260 INFO L267 ElimStorePlain]: Start of recursive call 169: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:37,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 20 treesize of output 14 [2018-11-10 06:02:37,262 INFO L267 ElimStorePlain]: Start of recursive call 170: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:37,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 32 [2018-11-10 06:02:37,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 27 [2018-11-10 06:02:37,308 INFO L267 ElimStorePlain]: Start of recursive call 172: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:37,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 24 treesize of output 18 [2018-11-10 06:02:37,309 INFO L267 ElimStorePlain]: Start of recursive call 173: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:37,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2018-11-10 06:02:37,315 INFO L267 ElimStorePlain]: Start of recursive call 174: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:37,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 37 [2018-11-10 06:02:37,358 INFO L267 ElimStorePlain]: Start of recursive call 175: End of recursive call: and 8 xjuncts. [2018-11-10 06:02:37,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2018-11-10 06:02:37,364 INFO L267 ElimStorePlain]: Start of recursive call 176: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:37,399 INFO L267 ElimStorePlain]: Start of recursive call 171: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-10 06:02:37,427 INFO L267 ElimStorePlain]: Start of recursive call 164: 3 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-10 06:02:37,471 INFO L267 ElimStorePlain]: Start of recursive call 106: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 9 xjuncts. [2018-11-10 06:02:39,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 79 [2018-11-10 06:02:39,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 8 [2018-11-10 06:02:39,310 INFO L267 ElimStorePlain]: Start of recursive call 178: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:39,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2018-11-10 06:02:39,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-11-10 06:02:39,327 INFO L267 ElimStorePlain]: Start of recursive call 180: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:39,336 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-11-10 06:02:39,336 INFO L267 ElimStorePlain]: Start of recursive call 181: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:39,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 06:02:39,345 INFO L267 ElimStorePlain]: Start of recursive call 182: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:39,346 INFO L267 ElimStorePlain]: Start of recursive call 179: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:39,351 INFO L267 ElimStorePlain]: Start of recursive call 177: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:39,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 75 [2018-11-10 06:02:39,375 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 9 treesize of output 8 [2018-11-10 06:02:39,375 INFO L267 ElimStorePlain]: Start of recursive call 184: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:39,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-11-10 06:02:39,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-10 06:02:39,398 INFO L267 ElimStorePlain]: Start of recursive call 186: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:39,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 37 treesize of output 37 [2018-11-10 06:02:39,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 06:02:39,419 INFO L267 ElimStorePlain]: Start of recursive call 188: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:39,421 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 06:02:39,421 INFO L267 ElimStorePlain]: Start of recursive call 189: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:39,428 INFO L267 ElimStorePlain]: Start of recursive call 187: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:39,435 INFO L267 ElimStorePlain]: Start of recursive call 185: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:39,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 81 [2018-11-10 06:02:39,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 76 treesize of output 76 [2018-11-10 06:02:39,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 06:02:39,469 INFO L267 ElimStorePlain]: Start of recursive call 192: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:39,471 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 06:02:39,471 INFO L267 ElimStorePlain]: Start of recursive call 193: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:39,485 INFO L267 ElimStorePlain]: Start of recursive call 191: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:39,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 67 treesize of output 61 [2018-11-10 06:02:39,513 INFO L267 ElimStorePlain]: Start of recursive call 194: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:39,538 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 54 treesize of output 50 [2018-11-10 06:02:39,538 INFO L267 ElimStorePlain]: Start of recursive call 195: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:39,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-11-10 06:02:39,540 INFO L267 ElimStorePlain]: Start of recursive call 196: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:39,559 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 64 [2018-11-10 06:02:39,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 06:02:39,585 INFO L267 ElimStorePlain]: Start of recursive call 198: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:39,593 INFO L267 ElimStorePlain]: Start of recursive call 197: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:39,607 INFO L267 ElimStorePlain]: Start of recursive call 190: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:39,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 37 [2018-11-10 06:02:39,611 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 25 treesize of output 21 [2018-11-10 06:02:39,611 INFO L267 ElimStorePlain]: Start of recursive call 200: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:39,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-10 06:02:39,616 INFO L267 ElimStorePlain]: Start of recursive call 201: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:39,617 INFO L267 ElimStorePlain]: Start of recursive call 199: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:39,631 INFO L267 ElimStorePlain]: Start of recursive call 183: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:02:39,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2018-11-10 06:02:39,649 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 9 treesize of output 8 [2018-11-10 06:02:39,649 INFO L267 ElimStorePlain]: Start of recursive call 203: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:39,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2018-11-10 06:02:39,662 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2018-11-10 06:02:39,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2018-11-10 06:02:39,677 INFO L267 ElimStorePlain]: Start of recursive call 206: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:39,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:02:39,679 INFO L267 ElimStorePlain]: Start of recursive call 207: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:39,685 INFO L267 ElimStorePlain]: Start of recursive call 205: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:39,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 20 treesize of output 14 [2018-11-10 06:02:39,694 INFO L267 ElimStorePlain]: Start of recursive call 208: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:39,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 33 [2018-11-10 06:02:39,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2018-11-10 06:02:39,729 INFO L267 ElimStorePlain]: Start of recursive call 210: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:39,729 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 06:02:39,729 INFO L267 ElimStorePlain]: Start of recursive call 211: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:39,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 25 treesize of output 19 [2018-11-10 06:02:39,731 INFO L267 ElimStorePlain]: Start of recursive call 212: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:39,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2018-11-10 06:02:39,750 INFO L267 ElimStorePlain]: Start of recursive call 213: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:39,755 INFO L267 ElimStorePlain]: Start of recursive call 209: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:39,758 INFO L267 ElimStorePlain]: Start of recursive call 204: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:39,763 INFO L267 ElimStorePlain]: Start of recursive call 202: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:39,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2018-11-10 06:02:39,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 8 [2018-11-10 06:02:39,788 INFO L267 ElimStorePlain]: Start of recursive call 215: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:39,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2018-11-10 06:02:39,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-11-10 06:02:39,811 INFO L267 ElimStorePlain]: Start of recursive call 217: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:39,817 INFO L267 ElimStorePlain]: Start of recursive call 216: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:39,824 INFO L267 ElimStorePlain]: Start of recursive call 214: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:39,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2018-11-10 06:02:39,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 8 [2018-11-10 06:02:39,866 INFO L267 ElimStorePlain]: Start of recursive call 219: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:39,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2018-11-10 06:02:39,891 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-10 06:02:39,892 INFO L267 ElimStorePlain]: Start of recursive call 221: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:39,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-11-10 06:02:39,906 INFO L267 ElimStorePlain]: Start of recursive call 222: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:39,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-11-10 06:02:39,918 INFO L267 ElimStorePlain]: Start of recursive call 223: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:39,922 INFO L267 ElimStorePlain]: Start of recursive call 220: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:39,931 INFO L267 ElimStorePlain]: Start of recursive call 218: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:39,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 58 [2018-11-10 06:02:39,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 8 [2018-11-10 06:02:39,972 INFO L267 ElimStorePlain]: Start of recursive call 225: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:39,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2018-11-10 06:02:40,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 28 treesize of output 31 [2018-11-10 06:02:40,017 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 06:02:40,017 INFO L267 ElimStorePlain]: Start of recursive call 228: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:40,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-11-10 06:02:40,023 INFO L267 ElimStorePlain]: Start of recursive call 229: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:40,030 INFO L267 ElimStorePlain]: Start of recursive call 227: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:40,040 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-11-10 06:02:40,040 INFO L267 ElimStorePlain]: Start of recursive call 230: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:40,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 33 [2018-11-10 06:02:40,076 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 06:02:40,076 INFO L267 ElimStorePlain]: Start of recursive call 232: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:40,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-11-10 06:02:40,086 INFO L267 ElimStorePlain]: Start of recursive call 233: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:40,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 35 [2018-11-10 06:02:40,095 INFO L267 ElimStorePlain]: Start of recursive call 234: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:40,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-11-10 06:02:40,119 INFO L267 ElimStorePlain]: Start of recursive call 235: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:40,121 INFO L267 ElimStorePlain]: Start of recursive call 231: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:40,122 INFO L267 ElimStorePlain]: Start of recursive call 226: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:40,128 INFO L267 ElimStorePlain]: Start of recursive call 224: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:40,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 77 [2018-11-10 06:02:40,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 06:02:40,154 INFO L267 ElimStorePlain]: Start of recursive call 237: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:40,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 91 [2018-11-10 06:02:40,191 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 70 [2018-11-10 06:02:40,191 INFO L267 ElimStorePlain]: Start of recursive call 239: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:40,273 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 76 [2018-11-10 06:02:40,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2018-11-10 06:02:40,297 INFO L267 ElimStorePlain]: Start of recursive call 241: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:40,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-11-10 06:02:40,300 INFO L267 ElimStorePlain]: Start of recursive call 242: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:40,313 INFO L267 ElimStorePlain]: Start of recursive call 240: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:40,391 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 70 treesize of output 66 [2018-11-10 06:02:40,391 INFO L267 ElimStorePlain]: Start of recursive call 243: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:40,465 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 51 treesize of output 47 [2018-11-10 06:02:40,465 INFO L267 ElimStorePlain]: Start of recursive call 244: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:40,535 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 70 [2018-11-10 06:02:40,556 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2018-11-10 06:02:40,556 INFO L267 ElimStorePlain]: Start of recursive call 246: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:40,558 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 06:02:40,558 INFO L267 ElimStorePlain]: Start of recursive call 247: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:40,569 INFO L267 ElimStorePlain]: Start of recursive call 245: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:40,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2018-11-10 06:02:40,689 INFO L267 ElimStorePlain]: Start of recursive call 248: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:40,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 73 [2018-11-10 06:02:40,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-11-10 06:02:40,754 INFO L267 ElimStorePlain]: Start of recursive call 250: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:40,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2018-11-10 06:02:40,757 INFO L267 ElimStorePlain]: Start of recursive call 251: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:40,766 INFO L267 ElimStorePlain]: Start of recursive call 249: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:40,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 70 [2018-11-10 06:02:40,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2018-11-10 06:02:40,824 INFO L267 ElimStorePlain]: Start of recursive call 253: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:40,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-11-10 06:02:40,827 INFO L267 ElimStorePlain]: Start of recursive call 254: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:40,835 INFO L267 ElimStorePlain]: Start of recursive call 252: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:40,849 INFO L267 ElimStorePlain]: Start of recursive call 238: 13 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:40,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2018-11-10 06:02:40,857 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-11-10 06:02:40,857 INFO L267 ElimStorePlain]: Start of recursive call 256: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:40,870 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 31 treesize of output 27 [2018-11-10 06:02:40,870 INFO L267 ElimStorePlain]: Start of recursive call 257: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:40,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-11-10 06:02:40,881 INFO L267 ElimStorePlain]: Start of recursive call 258: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:40,885 INFO L267 ElimStorePlain]: Start of recursive call 255: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:40,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 55 [2018-11-10 06:02:40,893 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 50 [2018-11-10 06:02:40,911 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 06:02:40,912 INFO L267 ElimStorePlain]: Start of recursive call 261: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:40,914 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2018-11-10 06:02:40,914 INFO L267 ElimStorePlain]: Start of recursive call 262: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:40,924 INFO L267 ElimStorePlain]: Start of recursive call 260: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:40,939 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2018-11-10 06:02:40,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2018-11-10 06:02:40,959 INFO L267 ElimStorePlain]: Start of recursive call 264: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:40,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-11-10 06:02:40,962 INFO L267 ElimStorePlain]: Start of recursive call 265: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:40,971 INFO L267 ElimStorePlain]: Start of recursive call 263: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:40,983 INFO L267 ElimStorePlain]: Start of recursive call 259: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:40,995 INFO L267 ElimStorePlain]: Start of recursive call 236: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:40,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 75 [2018-11-10 06:02:41,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 8 [2018-11-10 06:02:41,020 INFO L267 ElimStorePlain]: Start of recursive call 267: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:41,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-11-10 06:02:41,044 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 06:02:41,044 INFO L267 ElimStorePlain]: Start of recursive call 269: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:41,051 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2018-11-10 06:02:41,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2018-11-10 06:02:41,069 INFO L267 ElimStorePlain]: Start of recursive call 271: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:41,070 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 06:02:41,070 INFO L267 ElimStorePlain]: Start of recursive call 272: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:41,078 INFO L267 ElimStorePlain]: Start of recursive call 270: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:41,084 INFO L267 ElimStorePlain]: Start of recursive call 268: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:41,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2018-11-10 06:02:41,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-11-10 06:02:41,093 INFO L267 ElimStorePlain]: Start of recursive call 274: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:41,104 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-11-10 06:02:41,104 INFO L267 ElimStorePlain]: Start of recursive call 275: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:41,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-11-10 06:02:41,115 INFO L267 ElimStorePlain]: Start of recursive call 276: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:41,119 INFO L267 ElimStorePlain]: Start of recursive call 273: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:41,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 86 [2018-11-10 06:02:41,133 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 70 [2018-11-10 06:02:41,133 INFO L267 ElimStorePlain]: Start of recursive call 278: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:41,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2018-11-10 06:02:41,175 INFO L267 ElimStorePlain]: Start of recursive call 279: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:41,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 77 [2018-11-10 06:02:41,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 58 [2018-11-10 06:02:41,285 INFO L267 ElimStorePlain]: Start of recursive call 281: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:41,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2018-11-10 06:02:41,292 INFO L267 ElimStorePlain]: Start of recursive call 282: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:41,325 INFO L267 ElimStorePlain]: Start of recursive call 280: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:41,360 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-10 06:02:41,360 INFO L267 ElimStorePlain]: Start of recursive call 283: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:41,361 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-11-10 06:02:41,362 INFO L267 ElimStorePlain]: Start of recursive call 284: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:41,389 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 67 [2018-11-10 06:02:41,407 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 06:02:41,407 INFO L267 ElimStorePlain]: Start of recursive call 286: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:41,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2018-11-10 06:02:41,413 INFO L267 ElimStorePlain]: Start of recursive call 287: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:41,425 INFO L267 ElimStorePlain]: Start of recursive call 285: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:41,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 67 treesize of output 82 [2018-11-10 06:02:41,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 31 [2018-11-10 06:02:41,559 INFO L267 ElimStorePlain]: Start of recursive call 289: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:41,560 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 06:02:41,561 INFO L267 ElimStorePlain]: Start of recursive call 290: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:41,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 48 [2018-11-10 06:02:41,564 INFO L267 ElimStorePlain]: Start of recursive call 291: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:41,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 40 [2018-11-10 06:02:41,609 INFO L267 ElimStorePlain]: Start of recursive call 292: End of recursive call: and 4 xjuncts. [2018-11-10 06:02:41,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2018-11-10 06:02:41,636 INFO L267 ElimStorePlain]: Start of recursive call 293: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:41,645 INFO L267 ElimStorePlain]: Start of recursive call 288: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:41,667 INFO L267 ElimStorePlain]: Start of recursive call 277: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:41,682 INFO L267 ElimStorePlain]: Start of recursive call 266: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:02:41,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2018-11-10 06:02:41,700 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 9 treesize of output 8 [2018-11-10 06:02:41,700 INFO L267 ElimStorePlain]: Start of recursive call 295: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:41,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-11-10 06:02:41,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-11-10 06:02:41,710 INFO L267 ElimStorePlain]: Start of recursive call 297: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:41,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-10 06:02:41,713 INFO L267 ElimStorePlain]: Start of recursive call 298: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:41,714 INFO L267 ElimStorePlain]: Start of recursive call 296: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:41,717 INFO L267 ElimStorePlain]: Start of recursive call 294: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:41,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 73 [2018-11-10 06:02:41,740 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 9 treesize of output 8 [2018-11-10 06:02:41,740 INFO L267 ElimStorePlain]: Start of recursive call 300: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:41,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 37 [2018-11-10 06:02:41,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-10 06:02:41,762 INFO L267 ElimStorePlain]: Start of recursive call 302: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:41,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-10 06:02:41,770 INFO L267 ElimStorePlain]: Start of recursive call 303: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:41,771 INFO L267 ElimStorePlain]: Start of recursive call 301: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:41,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-11-10 06:02:41,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-10 06:02:41,776 INFO L267 ElimStorePlain]: Start of recursive call 305: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:41,783 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2018-11-10 06:02:41,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2018-11-10 06:02:41,801 INFO L267 ElimStorePlain]: Start of recursive call 307: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:41,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:02:41,803 INFO L267 ElimStorePlain]: Start of recursive call 308: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:41,810 INFO L267 ElimStorePlain]: Start of recursive call 306: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:41,815 INFO L267 ElimStorePlain]: Start of recursive call 304: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:41,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 86 [2018-11-10 06:02:41,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2018-11-10 06:02:41,829 INFO L267 ElimStorePlain]: Start of recursive call 310: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:41,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 73 treesize of output 67 [2018-11-10 06:02:41,866 INFO L267 ElimStorePlain]: Start of recursive call 311: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:41,898 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 67 [2018-11-10 06:02:41,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:02:41,918 INFO L267 ElimStorePlain]: Start of recursive call 313: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:41,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2018-11-10 06:02:41,924 INFO L267 ElimStorePlain]: Start of recursive call 314: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:41,936 INFO L267 ElimStorePlain]: Start of recursive call 312: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:41,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 77 [2018-11-10 06:02:42,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 58 [2018-11-10 06:02:42,041 INFO L267 ElimStorePlain]: Start of recursive call 316: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:42,044 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 06:02:42,044 INFO L267 ElimStorePlain]: Start of recursive call 317: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:42,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 36 treesize of output 30 [2018-11-10 06:02:42,074 INFO L267 ElimStorePlain]: Start of recursive call 318: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:42,085 INFO L267 ElimStorePlain]: Start of recursive call 315: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:42,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-11-10 06:02:42,115 INFO L267 ElimStorePlain]: Start of recursive call 319: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:42,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 51 [2018-11-10 06:02:42,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 36 [2018-11-10 06:02:42,184 INFO L267 ElimStorePlain]: Start of recursive call 321: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:42,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 68 [2018-11-10 06:02:42,205 INFO L267 ElimStorePlain]: Start of recursive call 322: End of recursive call: and 8 xjuncts. [2018-11-10 06:02:42,206 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 06:02:42,206 INFO L267 ElimStorePlain]: Start of recursive call 323: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:42,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 30 treesize of output 24 [2018-11-10 06:02:42,248 INFO L267 ElimStorePlain]: Start of recursive call 324: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:42,256 INFO L267 ElimStorePlain]: Start of recursive call 320: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:42,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 67 treesize of output 87 [2018-11-10 06:02:42,515 WARN L179 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 117 [2018-11-10 06:02:42,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 73 [2018-11-10 06:02:42,523 INFO L267 ElimStorePlain]: Start of recursive call 326: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:42,523 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 06:02:42,523 INFO L267 ElimStorePlain]: Start of recursive call 327: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:42,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 57 [2018-11-10 06:02:42,530 INFO L267 ElimStorePlain]: Start of recursive call 328: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:42,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 57 [2018-11-10 06:02:42,669 INFO L267 ElimStorePlain]: Start of recursive call 329: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:42,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 65 [2018-11-10 06:02:42,748 INFO L267 ElimStorePlain]: Start of recursive call 330: End of recursive call: and 8 xjuncts. [2018-11-10 06:02:42,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 52 [2018-11-10 06:02:42,834 INFO L267 ElimStorePlain]: Start of recursive call 331: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:42,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 47 treesize of output 41 [2018-11-10 06:02:42,928 INFO L267 ElimStorePlain]: Start of recursive call 332: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:42,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 32 [2018-11-10 06:02:42,961 INFO L267 ElimStorePlain]: Start of recursive call 333: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:42,976 INFO L267 ElimStorePlain]: Start of recursive call 325: 7 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:42,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 27 treesize of output 21 [2018-11-10 06:02:42,996 INFO L267 ElimStorePlain]: Start of recursive call 334: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:43,003 INFO L267 ElimStorePlain]: Start of recursive call 309: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:43,014 INFO L267 ElimStorePlain]: Start of recursive call 299: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:43,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 81 [2018-11-10 06:02:43,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 8 [2018-11-10 06:02:43,045 INFO L267 ElimStorePlain]: Start of recursive call 336: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:43,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2018-11-10 06:02:43,063 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-11-10 06:02:43,063 INFO L267 ElimStorePlain]: Start of recursive call 338: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:43,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 06:02:43,075 INFO L267 ElimStorePlain]: Start of recursive call 339: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:43,078 INFO L267 ElimStorePlain]: Start of recursive call 337: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:43,083 INFO L267 ElimStorePlain]: Start of recursive call 335: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:43,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 72 [2018-11-10 06:02:43,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 06:02:43,113 INFO L267 ElimStorePlain]: Start of recursive call 341: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:43,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 91 [2018-11-10 06:02:43,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 76 treesize of output 76 [2018-11-10 06:02:43,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2018-11-10 06:02:43,180 INFO L267 ElimStorePlain]: Start of recursive call 344: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:43,182 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 06:02:43,182 INFO L267 ElimStorePlain]: Start of recursive call 345: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:43,202 INFO L267 ElimStorePlain]: Start of recursive call 343: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 06:02:43,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-11-10 06:02:43,353 INFO L267 ElimStorePlain]: Start of recursive call 346: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:43,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2018-11-10 06:02:43,355 INFO L267 ElimStorePlain]: Start of recursive call 347: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:43,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 58 [2018-11-10 06:02:43,358 INFO L267 ElimStorePlain]: Start of recursive call 348: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:43,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 80 [2018-11-10 06:02:43,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 44 [2018-11-10 06:02:43,572 INFO L267 ElimStorePlain]: Start of recursive call 350: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:43,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 61 [2018-11-10 06:02:43,579 INFO L267 ElimStorePlain]: Start of recursive call 351: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:43,629 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-11-10 06:02:43,629 INFO L267 ElimStorePlain]: Start of recursive call 352: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:43,657 INFO L267 ElimStorePlain]: Start of recursive call 349: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:02:43,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2018-11-10 06:02:43,804 INFO L267 ElimStorePlain]: Start of recursive call 353: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:43,806 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 58 treesize of output 54 [2018-11-10 06:02:43,806 INFO L267 ElimStorePlain]: Start of recursive call 354: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:43,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2018-11-10 06:02:43,808 INFO L267 ElimStorePlain]: Start of recursive call 355: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:43,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-10 06:02:43,937 INFO L267 ElimStorePlain]: Start of recursive call 356: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:43,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-11-10 06:02:43,939 INFO L267 ElimStorePlain]: Start of recursive call 357: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:43,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-11-10 06:02:43,941 INFO L267 ElimStorePlain]: Start of recursive call 358: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:44,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 80 [2018-11-10 06:02:44,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 55 [2018-11-10 06:02:44,124 INFO L267 ElimStorePlain]: Start of recursive call 360: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:44,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 38 [2018-11-10 06:02:44,132 INFO L267 ElimStorePlain]: Start of recursive call 361: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:44,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-11-10 06:02:44,173 INFO L267 ElimStorePlain]: Start of recursive call 362: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:44,191 INFO L267 ElimStorePlain]: Start of recursive call 359: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:02:44,297 INFO L267 ElimStorePlain]: Start of recursive call 342: 13 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:02:44,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 55 [2018-11-10 06:02:44,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2018-11-10 06:02:44,305 INFO L267 ElimStorePlain]: Start of recursive call 364: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:44,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 44 treesize of output 44 [2018-11-10 06:02:44,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2018-11-10 06:02:44,340 INFO L267 ElimStorePlain]: Start of recursive call 366: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:44,342 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 06:02:44,342 INFO L267 ElimStorePlain]: Start of recursive call 367: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:44,356 INFO L267 ElimStorePlain]: Start of recursive call 365: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 06:02:44,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2018-11-10 06:02:44,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-11-10 06:02:44,411 INFO L267 ElimStorePlain]: Start of recursive call 369: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:44,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2018-11-10 06:02:44,418 INFO L267 ElimStorePlain]: Start of recursive call 370: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:44,437 INFO L267 ElimStorePlain]: Start of recursive call 368: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 06:02:44,461 INFO L267 ElimStorePlain]: Start of recursive call 363: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:02:44,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2018-11-10 06:02:44,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-11-10 06:02:44,469 INFO L267 ElimStorePlain]: Start of recursive call 372: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:44,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-11-10 06:02:44,482 INFO L267 ElimStorePlain]: Start of recursive call 373: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:44,487 INFO L267 ElimStorePlain]: Start of recursive call 371: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:44,511 INFO L267 ElimStorePlain]: Start of recursive call 340: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-10 06:02:44,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2018-11-10 06:02:44,543 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 9 treesize of output 8 [2018-11-10 06:02:44,543 INFO L267 ElimStorePlain]: Start of recursive call 375: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:44,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2018-11-10 06:02:44,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-11-10 06:02:44,558 INFO L267 ElimStorePlain]: Start of recursive call 377: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:44,562 INFO L267 ElimStorePlain]: Start of recursive call 376: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:44,566 INFO L267 ElimStorePlain]: Start of recursive call 374: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:44,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 79 [2018-11-10 06:02:44,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 06:02:44,594 INFO L267 ElimStorePlain]: Start of recursive call 379: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:44,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 51 [2018-11-10 06:02:44,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-11-10 06:02:44,612 INFO L267 ElimStorePlain]: Start of recursive call 381: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:44,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2018-11-10 06:02:44,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 06:02:44,640 INFO L267 ElimStorePlain]: Start of recursive call 383: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:44,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 06:02:44,643 INFO L267 ElimStorePlain]: Start of recursive call 384: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:44,652 INFO L267 ElimStorePlain]: Start of recursive call 382: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:44,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 46 [2018-11-10 06:02:44,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-11-10 06:02:44,684 INFO L267 ElimStorePlain]: Start of recursive call 386: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:44,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-11-10 06:02:44,687 INFO L267 ElimStorePlain]: Start of recursive call 387: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:44,696 INFO L267 ElimStorePlain]: Start of recursive call 385: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:44,705 INFO L267 ElimStorePlain]: Start of recursive call 380: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:44,715 INFO L267 ElimStorePlain]: Start of recursive call 378: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:44,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 79 [2018-11-10 06:02:44,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 8 [2018-11-10 06:02:44,741 INFO L267 ElimStorePlain]: Start of recursive call 389: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:44,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-11-10 06:02:44,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 37 treesize of output 37 [2018-11-10 06:02:44,780 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 06:02:44,780 INFO L267 ElimStorePlain]: Start of recursive call 392: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:44,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 06:02:44,784 INFO L267 ElimStorePlain]: Start of recursive call 393: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:44,792 INFO L267 ElimStorePlain]: Start of recursive call 391: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:44,801 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 06:02:44,801 INFO L267 ElimStorePlain]: Start of recursive call 394: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:44,808 INFO L267 ElimStorePlain]: Start of recursive call 390: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:44,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 86 [2018-11-10 06:02:44,823 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 70 [2018-11-10 06:02:44,823 INFO L267 ElimStorePlain]: Start of recursive call 396: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:44,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2018-11-10 06:02:44,866 INFO L267 ElimStorePlain]: Start of recursive call 397: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:44,901 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 64 [2018-11-10 06:02:44,901 INFO L267 ElimStorePlain]: Start of recursive call 398: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:44,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 43 [2018-11-10 06:02:44,952 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 06:02:44,952 INFO L267 ElimStorePlain]: Start of recursive call 400: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:44,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 06:02:44,955 INFO L267 ElimStorePlain]: Start of recursive call 401: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:44,965 INFO L267 ElimStorePlain]: Start of recursive call 399: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:45,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 78 [2018-11-10 06:02:45,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 38 [2018-11-10 06:02:45,074 INFO L267 ElimStorePlain]: Start of recursive call 403: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:45,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 55 [2018-11-10 06:02:45,083 INFO L267 ElimStorePlain]: Start of recursive call 404: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:45,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-11-10 06:02:45,125 INFO L267 ElimStorePlain]: Start of recursive call 405: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2018-11-10 06:02:45,128 INFO L267 ElimStorePlain]: Start of recursive call 406: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,141 INFO L267 ElimStorePlain]: Start of recursive call 402: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:45,169 INFO L267 ElimStorePlain]: Start of recursive call 395: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:45,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2018-11-10 06:02:45,177 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-11-10 06:02:45,177 INFO L267 ElimStorePlain]: Start of recursive call 408: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-11-10 06:02:45,191 INFO L267 ElimStorePlain]: Start of recursive call 409: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-11-10 06:02:45,203 INFO L267 ElimStorePlain]: Start of recursive call 410: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,207 INFO L267 ElimStorePlain]: Start of recursive call 407: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,222 INFO L267 ElimStorePlain]: Start of recursive call 388: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:02:45,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 80 [2018-11-10 06:02:45,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 8 [2018-11-10 06:02:45,249 INFO L267 ElimStorePlain]: Start of recursive call 412: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2018-11-10 06:02:45,277 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 37 treesize of output 33 [2018-11-10 06:02:45,278 INFO L267 ElimStorePlain]: Start of recursive call 414: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-11-10 06:02:45,290 INFO L267 ElimStorePlain]: Start of recursive call 415: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,296 INFO L267 ElimStorePlain]: Start of recursive call 413: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-11-10 06:02:45,301 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2018-11-10 06:02:45,315 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 06:02:45,315 INFO L267 ElimStorePlain]: Start of recursive call 418: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,317 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2018-11-10 06:02:45,318 INFO L267 ElimStorePlain]: Start of recursive call 419: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,325 INFO L267 ElimStorePlain]: Start of recursive call 417: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,333 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 06:02:45,333 INFO L267 ElimStorePlain]: Start of recursive call 420: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,337 INFO L267 ElimStorePlain]: Start of recursive call 416: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 86 [2018-11-10 06:02:45,352 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 73 [2018-11-10 06:02:45,374 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 06:02:45,374 INFO L267 ElimStorePlain]: Start of recursive call 423: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,377 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2018-11-10 06:02:45,377 INFO L267 ElimStorePlain]: Start of recursive call 424: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,389 INFO L267 ElimStorePlain]: Start of recursive call 422: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,429 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 70 [2018-11-10 06:02:45,448 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2018-11-10 06:02:45,449 INFO L267 ElimStorePlain]: Start of recursive call 426: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,451 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 06:02:45,451 INFO L267 ElimStorePlain]: Start of recursive call 427: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,460 INFO L267 ElimStorePlain]: Start of recursive call 425: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,495 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 73 treesize of output 69 [2018-11-10 06:02:45,495 INFO L267 ElimStorePlain]: Start of recursive call 428: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,526 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2018-11-10 06:02:45,526 INFO L267 ElimStorePlain]: Start of recursive call 429: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,556 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 43 [2018-11-10 06:02:45,573 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 06:02:45,573 INFO L267 ElimStorePlain]: Start of recursive call 431: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,575 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2018-11-10 06:02:45,575 INFO L267 ElimStorePlain]: Start of recursive call 432: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,584 INFO L267 ElimStorePlain]: Start of recursive call 430: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,612 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-10 06:02:45,613 INFO L267 ElimStorePlain]: Start of recursive call 433: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2018-11-10 06:02:45,642 INFO L267 ElimStorePlain]: Start of recursive call 434: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,652 INFO L267 ElimStorePlain]: Start of recursive call 421: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,665 INFO L267 ElimStorePlain]: Start of recursive call 411: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:45,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2018-11-10 06:02:45,687 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 9 treesize of output 8 [2018-11-10 06:02:45,687 INFO L267 ElimStorePlain]: Start of recursive call 436: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-11-10 06:02:45,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 18 treesize of output 22 [2018-11-10 06:02:45,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-11-10 06:02:45,709 INFO L267 ElimStorePlain]: Start of recursive call 439: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,711 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 06:02:45,711 INFO L267 ElimStorePlain]: Start of recursive call 440: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,713 INFO L267 ElimStorePlain]: Start of recursive call 438: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-10 06:02:45,717 INFO L267 ElimStorePlain]: Start of recursive call 441: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,718 INFO L267 ElimStorePlain]: Start of recursive call 437: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,724 INFO L267 ElimStorePlain]: Start of recursive call 435: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 103 [2018-11-10 06:02:45,759 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 9 treesize of output 8 [2018-11-10 06:02:45,759 INFO L267 ElimStorePlain]: Start of recursive call 443: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2018-11-10 06:02:45,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-10 06:02:45,775 INFO L267 ElimStorePlain]: Start of recursive call 445: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,782 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 37 treesize of output 31 [2018-11-10 06:02:45,782 INFO L267 ElimStorePlain]: Start of recursive call 446: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,783 INFO L267 ElimStorePlain]: Start of recursive call 444: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,788 INFO L267 ElimStorePlain]: Start of recursive call 442: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2018-11-10 06:02:45,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 06:02:45,813 INFO L267 ElimStorePlain]: Start of recursive call 448: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-11-10 06:02:45,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-11-10 06:02:45,825 INFO L267 ElimStorePlain]: Start of recursive call 450: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 06:02:45,829 INFO L267 ElimStorePlain]: Start of recursive call 451: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,830 INFO L267 ElimStorePlain]: Start of recursive call 449: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,835 INFO L267 ElimStorePlain]: Start of recursive call 447: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 76 [2018-11-10 06:02:45,860 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 9 treesize of output 8 [2018-11-10 06:02:45,860 INFO L267 ElimStorePlain]: Start of recursive call 453: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 37 [2018-11-10 06:02:45,883 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 25 treesize of output 21 [2018-11-10 06:02:45,883 INFO L267 ElimStorePlain]: Start of recursive call 455: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-10 06:02:45,888 INFO L267 ElimStorePlain]: Start of recursive call 456: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,889 INFO L267 ElimStorePlain]: Start of recursive call 454: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-11-10 06:02:45,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-10 06:02:45,894 INFO L267 ElimStorePlain]: Start of recursive call 458: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 37 treesize of output 37 [2018-11-10 06:02:45,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 06:02:45,921 INFO L267 ElimStorePlain]: Start of recursive call 460: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:02:45,923 INFO L267 ElimStorePlain]: Start of recursive call 461: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,930 INFO L267 ElimStorePlain]: Start of recursive call 459: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:45,937 INFO L267 ElimStorePlain]: Start of recursive call 457: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:45,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 86 [2018-11-10 06:02:45,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 71 [2018-11-10 06:02:45,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 06:02:45,984 INFO L267 ElimStorePlain]: Start of recursive call 464: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:45,993 INFO L267 ElimStorePlain]: Start of recursive call 463: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:46,035 INFO L267 ElimStorePlain]: Start of recursive call 462: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:46,050 INFO L267 ElimStorePlain]: Start of recursive call 452: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:02:46,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 50 [2018-11-10 06:02:46,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 06:02:46,069 INFO L267 ElimStorePlain]: Start of recursive call 466: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:46,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2018-11-10 06:02:46,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-11-10 06:02:46,091 INFO L267 ElimStorePlain]: Start of recursive call 468: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:46,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-11-10 06:02:46,102 INFO L267 ElimStorePlain]: Start of recursive call 469: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:46,107 INFO L267 ElimStorePlain]: Start of recursive call 467: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:46,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2018-11-10 06:02:46,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2018-11-10 06:02:46,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2018-11-10 06:02:46,135 INFO L267 ElimStorePlain]: Start of recursive call 472: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:46,135 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 06:02:46,135 INFO L267 ElimStorePlain]: Start of recursive call 473: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:46,148 INFO L267 ElimStorePlain]: Start of recursive call 471: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:46,168 INFO L267 ElimStorePlain]: Start of recursive call 470: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:46,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2018-11-10 06:02:46,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-11-10 06:02:46,185 INFO L267 ElimStorePlain]: Start of recursive call 475: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:46,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2018-11-10 06:02:46,259 INFO L267 ElimStorePlain]: Start of recursive call 476: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:46,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2018-11-10 06:02:46,324 INFO L267 ElimStorePlain]: Start of recursive call 477: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:46,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 55 [2018-11-10 06:02:46,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 35 [2018-11-10 06:02:46,431 INFO L267 ElimStorePlain]: Start of recursive call 479: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:46,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 28 [2018-11-10 06:02:46,438 INFO L267 ElimStorePlain]: Start of recursive call 480: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:46,456 INFO L267 ElimStorePlain]: Start of recursive call 478: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:46,489 INFO L267 ElimStorePlain]: Start of recursive call 474: 13 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:46,500 INFO L267 ElimStorePlain]: Start of recursive call 465: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:02:46,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 76 [2018-11-10 06:02:46,525 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 9 treesize of output 8 [2018-11-10 06:02:46,525 INFO L267 ElimStorePlain]: Start of recursive call 482: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:46,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 37 [2018-11-10 06:02:46,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-10 06:02:46,549 INFO L267 ElimStorePlain]: Start of recursive call 484: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:46,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-10 06:02:46,553 INFO L267 ElimStorePlain]: Start of recursive call 485: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:46,554 INFO L267 ElimStorePlain]: Start of recursive call 483: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:46,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-11-10 06:02:46,559 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2018-11-10 06:02:46,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:02:46,574 INFO L267 ElimStorePlain]: Start of recursive call 488: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:46,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2018-11-10 06:02:46,581 INFO L267 ElimStorePlain]: Start of recursive call 489: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:46,589 INFO L267 ElimStorePlain]: Start of recursive call 487: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:46,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-10 06:02:46,600 INFO L267 ElimStorePlain]: Start of recursive call 490: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:46,606 INFO L267 ElimStorePlain]: Start of recursive call 486: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:46,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 81 [2018-11-10 06:02:46,618 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 76 [2018-11-10 06:02:46,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2018-11-10 06:02:46,648 INFO L267 ElimStorePlain]: Start of recursive call 493: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:46,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:02:46,651 INFO L267 ElimStorePlain]: Start of recursive call 494: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:46,664 INFO L267 ElimStorePlain]: Start of recursive call 492: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:46,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 74 [2018-11-10 06:02:46,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 55 [2018-11-10 06:02:46,750 INFO L267 ElimStorePlain]: Start of recursive call 496: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:46,751 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 06:02:46,751 INFO L267 ElimStorePlain]: Start of recursive call 497: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:46,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 33 treesize of output 27 [2018-11-10 06:02:46,777 INFO L267 ElimStorePlain]: Start of recursive call 498: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:46,786 INFO L267 ElimStorePlain]: Start of recursive call 495: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:46,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 54 treesize of output 48 [2018-11-10 06:02:46,802 INFO L267 ElimStorePlain]: Start of recursive call 499: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:46,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 27 treesize of output 21 [2018-11-10 06:02:46,816 INFO L267 ElimStorePlain]: Start of recursive call 500: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:46,825 INFO L267 ElimStorePlain]: Start of recursive call 491: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:46,837 INFO L267 ElimStorePlain]: Start of recursive call 481: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:46,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2018-11-10 06:02:46,860 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 9 treesize of output 8 [2018-11-10 06:02:46,860 INFO L267 ElimStorePlain]: Start of recursive call 502: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:46,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2018-11-10 06:02:46,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-11-10 06:02:46,876 INFO L267 ElimStorePlain]: Start of recursive call 504: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:46,880 INFO L267 ElimStorePlain]: Start of recursive call 503: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:46,884 INFO L267 ElimStorePlain]: Start of recursive call 501: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:46,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 78 [2018-11-10 06:02:46,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 06:02:46,911 INFO L267 ElimStorePlain]: Start of recursive call 506: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:46,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-11-10 06:02:46,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2018-11-10 06:02:46,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 06:02:46,958 INFO L267 ElimStorePlain]: Start of recursive call 509: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:46,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 06:02:46,961 INFO L267 ElimStorePlain]: Start of recursive call 510: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:46,969 INFO L267 ElimStorePlain]: Start of recursive call 508: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:46,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 06:02:46,980 INFO L267 ElimStorePlain]: Start of recursive call 511: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:46,987 INFO L267 ElimStorePlain]: Start of recursive call 507: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:46,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 86 [2018-11-10 06:02:47,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 79 [2018-11-10 06:02:47,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-11-10 06:02:47,041 INFO L267 ElimStorePlain]: Start of recursive call 514: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,051 INFO L267 ElimStorePlain]: Start of recursive call 513: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:47,094 INFO L267 ElimStorePlain]: Start of recursive call 512: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:47,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2018-11-10 06:02:47,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-11-10 06:02:47,103 INFO L267 ElimStorePlain]: Start of recursive call 516: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-11-10 06:02:47,117 INFO L267 ElimStorePlain]: Start of recursive call 517: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,124 INFO L267 ElimStorePlain]: Start of recursive call 515: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,141 INFO L267 ElimStorePlain]: Start of recursive call 505: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:02:47,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 80 [2018-11-10 06:02:47,167 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 9 treesize of output 8 [2018-11-10 06:02:47,167 INFO L267 ElimStorePlain]: Start of recursive call 519: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 37 [2018-11-10 06:02:47,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-10 06:02:47,193 INFO L267 ElimStorePlain]: Start of recursive call 521: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-10 06:02:47,200 INFO L267 ElimStorePlain]: Start of recursive call 522: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,201 INFO L267 ElimStorePlain]: Start of recursive call 520: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 81 [2018-11-10 06:02:47,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 76 treesize of output 70 [2018-11-10 06:02:47,213 INFO L267 ElimStorePlain]: Start of recursive call 524: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,233 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 64 [2018-11-10 06:02:47,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:02:47,253 INFO L267 ElimStorePlain]: Start of recursive call 526: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 31 treesize of output 21 [2018-11-10 06:02:47,255 INFO L267 ElimStorePlain]: Start of recursive call 527: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,271 INFO L267 ElimStorePlain]: Start of recursive call 525: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-11-10 06:02:47,286 INFO L267 ElimStorePlain]: Start of recursive call 528: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 67 [2018-11-10 06:02:47,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:02:47,317 INFO L267 ElimStorePlain]: Start of recursive call 530: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 31 treesize of output 21 [2018-11-10 06:02:47,319 INFO L267 ElimStorePlain]: Start of recursive call 531: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,327 INFO L267 ElimStorePlain]: Start of recursive call 529: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 27 treesize of output 21 [2018-11-10 06:02:47,338 INFO L267 ElimStorePlain]: Start of recursive call 532: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,345 INFO L267 ElimStorePlain]: Start of recursive call 523: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-11-10 06:02:47,349 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2018-11-10 06:02:47,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:02:47,363 INFO L267 ElimStorePlain]: Start of recursive call 535: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 31 treesize of output 21 [2018-11-10 06:02:47,365 INFO L267 ElimStorePlain]: Start of recursive call 536: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,372 INFO L267 ElimStorePlain]: Start of recursive call 534: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-10 06:02:47,379 INFO L267 ElimStorePlain]: Start of recursive call 537: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,384 INFO L267 ElimStorePlain]: Start of recursive call 533: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,397 INFO L267 ElimStorePlain]: Start of recursive call 518: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:47,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2018-11-10 06:02:47,419 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 9 treesize of output 8 [2018-11-10 06:02:47,419 INFO L267 ElimStorePlain]: Start of recursive call 539: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-11-10 06:02:47,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-10 06:02:47,431 INFO L267 ElimStorePlain]: Start of recursive call 541: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-11-10 06:02:47,435 INFO L267 ElimStorePlain]: Start of recursive call 542: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,436 INFO L267 ElimStorePlain]: Start of recursive call 540: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,441 INFO L267 ElimStorePlain]: Start of recursive call 538: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2018-11-10 06:02:47,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 8 [2018-11-10 06:02:47,474 INFO L267 ElimStorePlain]: Start of recursive call 544: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2018-11-10 06:02:47,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-11-10 06:02:47,489 INFO L267 ElimStorePlain]: Start of recursive call 546: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,492 INFO L267 ElimStorePlain]: Start of recursive call 545: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,497 INFO L267 ElimStorePlain]: Start of recursive call 543: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 79 [2018-11-10 06:02:47,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 8 [2018-11-10 06:02:47,532 INFO L267 ElimStorePlain]: Start of recursive call 548: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 37 [2018-11-10 06:02:47,573 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 06:02:47,573 INFO L267 ElimStorePlain]: Start of recursive call 550: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-10 06:02:47,582 INFO L267 ElimStorePlain]: Start of recursive call 551: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,587 INFO L267 ElimStorePlain]: Start of recursive call 549: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-11-10 06:02:47,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 37 treesize of output 37 [2018-11-10 06:02:47,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 06:02:47,614 INFO L267 ElimStorePlain]: Start of recursive call 554: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,616 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 06:02:47,616 INFO L267 ElimStorePlain]: Start of recursive call 555: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,624 INFO L267 ElimStorePlain]: Start of recursive call 553: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:47,634 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 06:02:47,634 INFO L267 ElimStorePlain]: Start of recursive call 556: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,641 INFO L267 ElimStorePlain]: Start of recursive call 552: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:47,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 86 [2018-11-10 06:02:47,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 78 [2018-11-10 06:02:47,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 63 [2018-11-10 06:02:47,708 INFO L267 ElimStorePlain]: Start of recursive call 559: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:47,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 85 [2018-11-10 06:02:47,716 INFO L267 ElimStorePlain]: Start of recursive call 560: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:47,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 68 [2018-11-10 06:02:47,725 INFO L267 ElimStorePlain]: Start of recursive call 561: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:47,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2018-11-10 06:02:47,797 INFO L267 ElimStorePlain]: Start of recursive call 562: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,799 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2018-11-10 06:02:47,799 INFO L267 ElimStorePlain]: Start of recursive call 563: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,823 INFO L267 ElimStorePlain]: Start of recursive call 558: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:47,873 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 67 [2018-11-10 06:02:47,873 INFO L267 ElimStorePlain]: Start of recursive call 564: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2018-11-10 06:02:47,918 INFO L267 ElimStorePlain]: Start of recursive call 565: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:47,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 73 [2018-11-10 06:02:47,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 06:02:47,991 INFO L267 ElimStorePlain]: Start of recursive call 567: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:48,001 INFO L267 ElimStorePlain]: Start of recursive call 566: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:48,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-11-10 06:02:48,044 INFO L267 ElimStorePlain]: Start of recursive call 568: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:48,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-11-10 06:02:48,046 INFO L267 ElimStorePlain]: Start of recursive call 569: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:48,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 78 [2018-11-10 06:02:48,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 38 [2018-11-10 06:02:48,174 INFO L267 ElimStorePlain]: Start of recursive call 571: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:48,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 55 [2018-11-10 06:02:48,182 INFO L267 ElimStorePlain]: Start of recursive call 572: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:48,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-11-10 06:02:48,223 INFO L267 ElimStorePlain]: Start of recursive call 573: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:48,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2018-11-10 06:02:48,226 INFO L267 ElimStorePlain]: Start of recursive call 574: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:48,239 INFO L267 ElimStorePlain]: Start of recursive call 570: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:48,254 INFO L267 ElimStorePlain]: Start of recursive call 557: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:48,270 INFO L267 ElimStorePlain]: Start of recursive call 547: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:02:48,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2018-11-10 06:02:48,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 06:02:48,294 INFO L267 ElimStorePlain]: Start of recursive call 576: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:48,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2018-11-10 06:02:48,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-10 06:02:48,309 INFO L267 ElimStorePlain]: Start of recursive call 578: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:48,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-11-10 06:02:48,318 INFO L267 ElimStorePlain]: Start of recursive call 579: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:48,321 INFO L267 ElimStorePlain]: Start of recursive call 577: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:48,326 INFO L267 ElimStorePlain]: Start of recursive call 575: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:48,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 85 [2018-11-10 06:02:48,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 8 [2018-11-10 06:02:48,360 INFO L267 ElimStorePlain]: Start of recursive call 581: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:48,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 34 [2018-11-10 06:02:48,377 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 06:02:48,377 INFO L267 ElimStorePlain]: Start of recursive call 583: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:48,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-10 06:02:48,383 INFO L267 ElimStorePlain]: Start of recursive call 584: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:48,385 INFO L267 ElimStorePlain]: Start of recursive call 582: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:48,391 INFO L267 ElimStorePlain]: Start of recursive call 580: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:48,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 103 [2018-11-10 06:02:48,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 8 [2018-11-10 06:02:48,428 INFO L267 ElimStorePlain]: Start of recursive call 586: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:48,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 51 [2018-11-10 06:02:48,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2018-11-10 06:02:48,449 INFO L267 ElimStorePlain]: Start of recursive call 588: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:48,453 INFO L267 ElimStorePlain]: Start of recursive call 587: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:48,457 INFO L267 ElimStorePlain]: Start of recursive call 585: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:48,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 76 [2018-11-10 06:02:48,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 06:02:48,483 INFO L267 ElimStorePlain]: Start of recursive call 590: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:48,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 37 [2018-11-10 06:02:48,508 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 25 treesize of output 21 [2018-11-10 06:02:48,508 INFO L267 ElimStorePlain]: Start of recursive call 592: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:48,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-10 06:02:48,513 INFO L267 ElimStorePlain]: Start of recursive call 593: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:48,514 INFO L267 ElimStorePlain]: Start of recursive call 591: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:48,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-11-10 06:02:48,520 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2018-11-10 06:02:48,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2018-11-10 06:02:48,538 INFO L267 ElimStorePlain]: Start of recursive call 596: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:48,539 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 06:02:48,539 INFO L267 ElimStorePlain]: Start of recursive call 597: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:48,547 INFO L267 ElimStorePlain]: Start of recursive call 595: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:48,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-10 06:02:48,558 INFO L267 ElimStorePlain]: Start of recursive call 598: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:48,565 INFO L267 ElimStorePlain]: Start of recursive call 594: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:48,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 86 [2018-11-10 06:02:48,579 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 76 [2018-11-10 06:02:48,601 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 06:02:48,601 INFO L267 ElimStorePlain]: Start of recursive call 601: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:48,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2018-11-10 06:02:48,607 INFO L267 ElimStorePlain]: Start of recursive call 602: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:48,622 INFO L267 ElimStorePlain]: Start of recursive call 600: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:48,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 80 [2018-11-10 06:02:48,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2018-11-10 06:02:48,776 INFO L267 ElimStorePlain]: Start of recursive call 604: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:48,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2018-11-10 06:02:48,779 INFO L267 ElimStorePlain]: Start of recursive call 605: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:48,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 49 [2018-11-10 06:02:48,814 INFO L267 ElimStorePlain]: Start of recursive call 606: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:48,832 INFO L267 ElimStorePlain]: Start of recursive call 603: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:48,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 57 treesize of output 51 [2018-11-10 06:02:48,878 INFO L267 ElimStorePlain]: Start of recursive call 607: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:48,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 68 [2018-11-10 06:02:48,933 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 06:02:48,933 INFO L267 ElimStorePlain]: Start of recursive call 609: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:48,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2018-11-10 06:02:48,939 INFO L267 ElimStorePlain]: Start of recursive call 610: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:48,951 INFO L267 ElimStorePlain]: Start of recursive call 608: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:48,987 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 48 treesize of output 44 [2018-11-10 06:02:48,988 INFO L267 ElimStorePlain]: Start of recursive call 611: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:49,044 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 74 [2018-11-10 06:02:49,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 55 [2018-11-10 06:02:49,112 INFO L267 ElimStorePlain]: Start of recursive call 613: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:49,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 38 [2018-11-10 06:02:49,118 INFO L267 ElimStorePlain]: Start of recursive call 614: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:49,146 INFO L267 ElimStorePlain]: Start of recursive call 612: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:49,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 27 treesize of output 21 [2018-11-10 06:02:49,165 INFO L267 ElimStorePlain]: Start of recursive call 615: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:49,172 INFO L267 ElimStorePlain]: Start of recursive call 599: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:49,187 INFO L267 ElimStorePlain]: Start of recursive call 589: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:02:49,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2018-11-10 06:02:49,206 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 9 treesize of output 8 [2018-11-10 06:02:49,207 INFO L267 ElimStorePlain]: Start of recursive call 617: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:49,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2018-11-10 06:02:49,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 28 treesize of output 22 [2018-11-10 06:02:49,220 INFO L267 ElimStorePlain]: Start of recursive call 619: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:49,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-11-10 06:02:49,246 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 06:02:49,246 INFO L267 ElimStorePlain]: Start of recursive call 621: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:49,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2018-11-10 06:02:49,252 INFO L267 ElimStorePlain]: Start of recursive call 622: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:49,257 INFO L267 ElimStorePlain]: Start of recursive call 620: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:49,263 INFO L267 ElimStorePlain]: Start of recursive call 618: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:49,269 INFO L267 ElimStorePlain]: Start of recursive call 616: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:49,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 76 [2018-11-10 06:02:49,295 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 9 treesize of output 8 [2018-11-10 06:02:49,296 INFO L267 ElimStorePlain]: Start of recursive call 624: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:49,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2018-11-10 06:02:49,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-10 06:02:49,309 INFO L267 ElimStorePlain]: Start of recursive call 626: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:49,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 37 treesize of output 37 [2018-11-10 06:02:49,329 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 06:02:49,329 INFO L267 ElimStorePlain]: Start of recursive call 628: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:49,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 06:02:49,332 INFO L267 ElimStorePlain]: Start of recursive call 629: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:49,340 INFO L267 ElimStorePlain]: Start of recursive call 627: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:49,344 INFO L267 ElimStorePlain]: Start of recursive call 625: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:49,353 INFO L267 ElimStorePlain]: Start of recursive call 623: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:49,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2018-11-10 06:02:49,386 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 9 treesize of output 8 [2018-11-10 06:02:49,386 INFO L267 ElimStorePlain]: Start of recursive call 631: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:49,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-11-10 06:02:49,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-10 06:02:49,397 INFO L267 ElimStorePlain]: Start of recursive call 633: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:49,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-11-10 06:02:49,401 INFO L267 ElimStorePlain]: Start of recursive call 634: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:49,402 INFO L267 ElimStorePlain]: Start of recursive call 632: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:49,407 INFO L267 ElimStorePlain]: Start of recursive call 630: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:49,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 55 [2018-11-10 06:02:49,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 8 [2018-11-10 06:02:49,429 INFO L267 ElimStorePlain]: Start of recursive call 636: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:49,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2018-11-10 06:02:49,444 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2018-11-10 06:02:49,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-11-10 06:02:49,456 INFO L267 ElimStorePlain]: Start of recursive call 639: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:49,456 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 06:02:49,456 INFO L267 ElimStorePlain]: Start of recursive call 640: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:49,461 INFO L267 ElimStorePlain]: Start of recursive call 638: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:49,469 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-11-10 06:02:49,469 INFO L267 ElimStorePlain]: Start of recursive call 641: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:49,476 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-11-10 06:02:49,484 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 06:02:49,485 INFO L267 ElimStorePlain]: Start of recursive call 643: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:49,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-11-10 06:02:49,487 INFO L267 ElimStorePlain]: Start of recursive call 644: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:49,489 INFO L267 ElimStorePlain]: Start of recursive call 642: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:49,490 INFO L267 ElimStorePlain]: Start of recursive call 637: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:49,495 INFO L267 ElimStorePlain]: Start of recursive call 635: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:49,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 81 [2018-11-10 06:02:49,526 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 9 treesize of output 8 [2018-11-10 06:02:49,527 INFO L267 ElimStorePlain]: Start of recursive call 646: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:49,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 34 [2018-11-10 06:02:49,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-10 06:02:49,542 INFO L267 ElimStorePlain]: Start of recursive call 648: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:49,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-10 06:02:49,548 INFO L267 ElimStorePlain]: Start of recursive call 649: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:49,549 INFO L267 ElimStorePlain]: Start of recursive call 647: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:49,554 INFO L267 ElimStorePlain]: Start of recursive call 645: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:49,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 80 [2018-11-10 06:02:49,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 8 [2018-11-10 06:02:49,584 INFO L267 ElimStorePlain]: Start of recursive call 651: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:49,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 51 [2018-11-10 06:02:49,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 48 [2018-11-10 06:02:49,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 38 [2018-11-10 06:02:49,642 INFO L267 ElimStorePlain]: Start of recursive call 654: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:49,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 55 [2018-11-10 06:02:49,650 INFO L267 ElimStorePlain]: Start of recursive call 655: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:49,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 33 [2018-11-10 06:02:49,656 INFO L267 ElimStorePlain]: Start of recursive call 656: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:49,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-11-10 06:02:49,695 INFO L267 ElimStorePlain]: Start of recursive call 657: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:49,697 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-11-10 06:02:49,697 INFO L267 ElimStorePlain]: Start of recursive call 658: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:49,709 INFO L267 ElimStorePlain]: Start of recursive call 653: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:49,724 INFO L267 ElimStorePlain]: Start of recursive call 652: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:49,733 INFO L267 ElimStorePlain]: Start of recursive call 650: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:49,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 73 [2018-11-10 06:02:49,758 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 9 treesize of output 8 [2018-11-10 06:02:49,758 INFO L267 ElimStorePlain]: Start of recursive call 660: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:49,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 91 [2018-11-10 06:02:49,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 73 treesize of output 67 [2018-11-10 06:02:49,796 INFO L267 ElimStorePlain]: Start of recursive call 662: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:49,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 73 treesize of output 73 [2018-11-10 06:02:49,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 06:02:49,918 INFO L267 ElimStorePlain]: Start of recursive call 664: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:49,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:02:49,920 INFO L267 ElimStorePlain]: Start of recursive call 665: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:49,933 INFO L267 ElimStorePlain]: Start of recursive call 663: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:50,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 71 [2018-11-10 06:02:50,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 06:02:50,072 INFO L267 ElimStorePlain]: Start of recursive call 667: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:50,081 INFO L267 ElimStorePlain]: Start of recursive call 666: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:50,330 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 70 treesize of output 66 [2018-11-10 06:02:50,330 INFO L267 ElimStorePlain]: Start of recursive call 668: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:50,375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2018-11-10 06:02:50,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:02:50,392 INFO L267 ElimStorePlain]: Start of recursive call 670: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:50,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 06:02:50,396 INFO L267 ElimStorePlain]: Start of recursive call 671: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:50,405 INFO L267 ElimStorePlain]: Start of recursive call 669: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:50,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 68 [2018-11-10 06:02:50,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 06:02:50,463 INFO L267 ElimStorePlain]: Start of recursive call 673: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:50,475 INFO L267 ElimStorePlain]: Start of recursive call 672: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:50,498 INFO L267 ElimStorePlain]: Start of recursive call 661: 13 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:50,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 55 [2018-11-10 06:02:50,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 50 treesize of output 50 [2018-11-10 06:02:50,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:02:50,525 INFO L267 ElimStorePlain]: Start of recursive call 676: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:50,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 06:02:50,528 INFO L267 ElimStorePlain]: Start of recursive call 677: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:50,538 INFO L267 ElimStorePlain]: Start of recursive call 675: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:50,558 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2018-11-10 06:02:50,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:02:50,575 INFO L267 ElimStorePlain]: Start of recursive call 679: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:50,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 06:02:50,578 INFO L267 ElimStorePlain]: Start of recursive call 680: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:50,587 INFO L267 ElimStorePlain]: Start of recursive call 678: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:50,606 INFO L267 ElimStorePlain]: Start of recursive call 674: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:50,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2018-11-10 06:02:50,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-11-10 06:02:50,615 INFO L267 ElimStorePlain]: Start of recursive call 682: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:50,621 INFO L267 ElimStorePlain]: Start of recursive call 681: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:50,634 INFO L267 ElimStorePlain]: Start of recursive call 659: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:02:50,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 84 [2018-11-10 06:02:50,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 06:02:50,667 INFO L267 ElimStorePlain]: Start of recursive call 684: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:50,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 34 [2018-11-10 06:02:50,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 06:02:50,683 INFO L267 ElimStorePlain]: Start of recursive call 686: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:50,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-10 06:02:50,689 INFO L267 ElimStorePlain]: Start of recursive call 687: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:50,690 INFO L267 ElimStorePlain]: Start of recursive call 685: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:50,697 INFO L267 ElimStorePlain]: Start of recursive call 683: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:50,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2018-11-10 06:02:50,712 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 9 treesize of output 8 [2018-11-10 06:02:50,713 INFO L267 ElimStorePlain]: Start of recursive call 689: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:50,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2018-11-10 06:02:50,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-10 06:02:50,724 INFO L267 ElimStorePlain]: Start of recursive call 691: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:50,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2018-11-10 06:02:50,735 INFO L267 ElimStorePlain]: Start of recursive call 692: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:50,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 10 treesize of output 3 [2018-11-10 06:02:50,741 INFO L267 ElimStorePlain]: Start of recursive call 693: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:50,745 INFO L267 ElimStorePlain]: Start of recursive call 690: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:02:50,751 INFO L267 ElimStorePlain]: Start of recursive call 688: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:02:50,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 76 [2018-11-10 06:02:50,776 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 9 treesize of output 8 [2018-11-10 06:02:50,776 INFO L267 ElimStorePlain]: Start of recursive call 695: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:50,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-11-10 06:02:50,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 37 treesize of output 37 [2018-11-10 06:02:50,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 06:02:50,815 INFO L267 ElimStorePlain]: Start of recursive call 698: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:50,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:02:50,818 INFO L267 ElimStorePlain]: Start of recursive call 699: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:50,835 INFO L267 ElimStorePlain]: Start of recursive call 697: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:50,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-10 06:02:50,847 INFO L267 ElimStorePlain]: Start of recursive call 700: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:50,855 INFO L267 ElimStorePlain]: Start of recursive call 696: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:50,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2018-11-10 06:02:50,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 37 treesize of output 31 [2018-11-10 06:02:50,865 INFO L267 ElimStorePlain]: Start of recursive call 702: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:50,881 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 31 treesize of output 27 [2018-11-10 06:02:50,882 INFO L267 ElimStorePlain]: Start of recursive call 703: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:50,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-11-10 06:02:50,895 INFO L267 ElimStorePlain]: Start of recursive call 704: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:50,900 INFO L267 ElimStorePlain]: Start of recursive call 701: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:50,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 86 [2018-11-10 06:02:50,918 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 76 [2018-11-10 06:02:50,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 06:02:50,963 INFO L267 ElimStorePlain]: Start of recursive call 707: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:50,978 INFO L267 ElimStorePlain]: Start of recursive call 706: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:51,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 13 treesize of output 7 [2018-11-10 06:02:51,023 INFO L267 ElimStorePlain]: Start of recursive call 708: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:51,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 30 treesize of output 24 [2018-11-10 06:02:51,024 INFO L267 ElimStorePlain]: Start of recursive call 709: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:51,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 60 [2018-11-10 06:02:51,056 INFO L267 ElimStorePlain]: Start of recursive call 710: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:51,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 37 treesize of output 37 [2018-11-10 06:02:51,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:02:51,110 INFO L267 ElimStorePlain]: Start of recursive call 712: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:51,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 06:02:51,113 INFO L267 ElimStorePlain]: Start of recursive call 713: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:51,121 INFO L267 ElimStorePlain]: Start of recursive call 711: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:51,137 INFO L267 ElimStorePlain]: Start of recursive call 705: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:51,152 INFO L267 ElimStorePlain]: Start of recursive call 694: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:02:51,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 78 [2018-11-10 06:02:51,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 06:02:51,178 INFO L267 ElimStorePlain]: Start of recursive call 715: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:51,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-11-10 06:02:51,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 06:02:51,203 INFO L267 ElimStorePlain]: Start of recursive call 717: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:51,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2018-11-10 06:02:51,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 06:02:51,225 INFO L267 ElimStorePlain]: Start of recursive call 719: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:51,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 06:02:51,227 INFO L267 ElimStorePlain]: Start of recursive call 720: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:51,236 INFO L267 ElimStorePlain]: Start of recursive call 718: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:51,242 INFO L267 ElimStorePlain]: Start of recursive call 716: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:51,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 86 [2018-11-10 06:02:51,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 67 [2018-11-10 06:02:51,257 INFO L267 ElimStorePlain]: Start of recursive call 722: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:51,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2018-11-10 06:02:51,301 INFO L267 ElimStorePlain]: Start of recursive call 723: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:51,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 73 [2018-11-10 06:02:51,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 06:02:51,359 INFO L267 ElimStorePlain]: Start of recursive call 725: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:51,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 06:02:51,362 INFO L267 ElimStorePlain]: Start of recursive call 726: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:51,376 INFO L267 ElimStorePlain]: Start of recursive call 724: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:51,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 49 [2018-11-10 06:02:51,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-11-10 06:02:51,443 INFO L267 ElimStorePlain]: Start of recursive call 728: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:51,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-11-10 06:02:51,448 INFO L267 ElimStorePlain]: Start of recursive call 729: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:51,458 INFO L267 ElimStorePlain]: Start of recursive call 727: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:51,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 64 [2018-11-10 06:02:51,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 06:02:51,564 INFO L267 ElimStorePlain]: Start of recursive call 731: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:51,572 INFO L267 ElimStorePlain]: Start of recursive call 730: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:51,586 INFO L267 ElimStorePlain]: Start of recursive call 721: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:51,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 37 [2018-11-10 06:02:51,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 06:02:51,591 INFO L267 ElimStorePlain]: Start of recursive call 733: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:51,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-10 06:02:51,598 INFO L267 ElimStorePlain]: Start of recursive call 734: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:51,600 INFO L267 ElimStorePlain]: Start of recursive call 732: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:51,616 INFO L267 ElimStorePlain]: Start of recursive call 714: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:02:51,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 76 [2018-11-10 06:02:51,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 8 [2018-11-10 06:02:51,640 INFO L267 ElimStorePlain]: Start of recursive call 736: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:51,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 86 [2018-11-10 06:02:51,673 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 76 treesize of output 72 [2018-11-10 06:02:51,673 INFO L267 ElimStorePlain]: Start of recursive call 738: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:51,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 63 [2018-11-10 06:02:51,711 INFO L267 ElimStorePlain]: Start of recursive call 739: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:51,735 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2018-11-10 06:02:51,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:02:51,751 INFO L267 ElimStorePlain]: Start of recursive call 741: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:51,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2018-11-10 06:02:51,757 INFO L267 ElimStorePlain]: Start of recursive call 742: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:51,765 INFO L267 ElimStorePlain]: Start of recursive call 740: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:51,809 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 74 [2018-11-10 06:02:51,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 55 [2018-11-10 06:02:51,870 INFO L267 ElimStorePlain]: Start of recursive call 744: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:51,870 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 06:02:51,871 INFO L267 ElimStorePlain]: Start of recursive call 745: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:51,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 33 treesize of output 27 [2018-11-10 06:02:51,898 INFO L267 ElimStorePlain]: Start of recursive call 746: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:51,907 INFO L267 ElimStorePlain]: Start of recursive call 743: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:51,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 67 treesize of output 82 [2018-11-10 06:02:52,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2018-11-10 06:02:52,043 INFO L267 ElimStorePlain]: Start of recursive call 748: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,045 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 06:02:52,046 INFO L267 ElimStorePlain]: Start of recursive call 749: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-11-10 06:02:52,087 INFO L267 ElimStorePlain]: Start of recursive call 750: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 60 [2018-11-10 06:02:52,115 INFO L267 ElimStorePlain]: Start of recursive call 751: End of recursive call: and 4 xjuncts. [2018-11-10 06:02:52,130 INFO L267 ElimStorePlain]: Start of recursive call 747: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,139 INFO L267 ElimStorePlain]: Start of recursive call 737: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-11-10 06:02:52,143 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2018-11-10 06:02:52,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:02:52,158 INFO L267 ElimStorePlain]: Start of recursive call 754: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2018-11-10 06:02:52,164 INFO L267 ElimStorePlain]: Start of recursive call 755: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:52,171 INFO L267 ElimStorePlain]: Start of recursive call 753: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,178 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 06:02:52,178 INFO L267 ElimStorePlain]: Start of recursive call 756: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,182 INFO L267 ElimStorePlain]: Start of recursive call 752: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2018-11-10 06:02:52,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-11-10 06:02:52,191 INFO L267 ElimStorePlain]: Start of recursive call 758: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,197 INFO L267 ElimStorePlain]: Start of recursive call 757: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,209 INFO L267 ElimStorePlain]: Start of recursive call 735: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:52,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2018-11-10 06:02:52,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 8 [2018-11-10 06:02:52,245 INFO L267 ElimStorePlain]: Start of recursive call 760: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-11-10 06:02:52,257 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 06:02:52,258 INFO L267 ElimStorePlain]: Start of recursive call 762: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-11-10 06:02:52,262 INFO L267 ElimStorePlain]: Start of recursive call 763: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,263 INFO L267 ElimStorePlain]: Start of recursive call 761: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,269 INFO L267 ElimStorePlain]: Start of recursive call 759: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2018-11-10 06:02:52,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 06:02:52,304 INFO L267 ElimStorePlain]: Start of recursive call 765: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2018-11-10 06:02:52,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-11-10 06:02:52,320 INFO L267 ElimStorePlain]: Start of recursive call 767: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,323 INFO L267 ElimStorePlain]: Start of recursive call 766: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,329 INFO L267 ElimStorePlain]: Start of recursive call 764: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 50 [2018-11-10 06:02:52,346 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 9 treesize of output 8 [2018-11-10 06:02:52,346 INFO L267 ElimStorePlain]: Start of recursive call 769: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-10 06:02:52,362 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 12 treesize of output 10 [2018-11-10 06:02:52,363 INFO L267 ElimStorePlain]: Start of recursive call 771: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-10 06:02:52,367 INFO L267 ElimStorePlain]: Start of recursive call 772: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,368 INFO L267 ElimStorePlain]: Start of recursive call 770: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-11-10 06:02:52,373 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2018-11-10 06:02:52,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2018-11-10 06:02:52,386 INFO L267 ElimStorePlain]: Start of recursive call 775: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:52,386 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 06:02:52,386 INFO L267 ElimStorePlain]: Start of recursive call 776: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,392 INFO L267 ElimStorePlain]: Start of recursive call 774: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:52,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-10 06:02:52,399 INFO L267 ElimStorePlain]: Start of recursive call 777: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,404 INFO L267 ElimStorePlain]: Start of recursive call 773: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:52,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 51 [2018-11-10 06:02:52,413 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 49 [2018-11-10 06:02:52,426 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 06:02:52,426 INFO L267 ElimStorePlain]: Start of recursive call 780: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2018-11-10 06:02:52,432 INFO L267 ElimStorePlain]: Start of recursive call 781: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:52,441 INFO L267 ElimStorePlain]: Start of recursive call 779: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:52,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 25 treesize of output 19 [2018-11-10 06:02:52,461 INFO L267 ElimStorePlain]: Start of recursive call 782: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 32 treesize of output 26 [2018-11-10 06:02:52,462 INFO L267 ElimStorePlain]: Start of recursive call 783: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 37 treesize of output 31 [2018-11-10 06:02:52,479 INFO L267 ElimStorePlain]: Start of recursive call 784: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,492 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 26 treesize of output 24 [2018-11-10 06:02:52,493 INFO L267 ElimStorePlain]: Start of recursive call 785: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-11-10 06:02:52,494 INFO L267 ElimStorePlain]: Start of recursive call 786: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,512 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 43 [2018-11-10 06:02:52,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2018-11-10 06:02:52,543 INFO L267 ElimStorePlain]: Start of recursive call 788: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:52,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-11-10 06:02:52,549 INFO L267 ElimStorePlain]: Start of recursive call 789: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:52,563 INFO L267 ElimStorePlain]: Start of recursive call 787: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:52,569 INFO L267 ElimStorePlain]: Start of recursive call 778: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:52,580 INFO L267 ElimStorePlain]: Start of recursive call 768: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:02:52,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2018-11-10 06:02:52,610 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 9 treesize of output 8 [2018-11-10 06:02:52,610 INFO L267 ElimStorePlain]: Start of recursive call 791: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2018-11-10 06:02:52,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-11-10 06:02:52,625 INFO L267 ElimStorePlain]: Start of recursive call 793: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,630 INFO L267 ElimStorePlain]: Start of recursive call 792: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,634 INFO L267 ElimStorePlain]: Start of recursive call 790: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 76 [2018-11-10 06:02:52,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 8 [2018-11-10 06:02:52,661 INFO L267 ElimStorePlain]: Start of recursive call 795: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2018-11-10 06:02:52,689 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-11-10 06:02:52,689 INFO L267 ElimStorePlain]: Start of recursive call 797: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-11-10 06:02:52,702 INFO L267 ElimStorePlain]: Start of recursive call 798: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-11-10 06:02:52,714 INFO L267 ElimStorePlain]: Start of recursive call 799: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,718 INFO L267 ElimStorePlain]: Start of recursive call 796: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 91 [2018-11-10 06:02:52,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 81 [2018-11-10 06:02:52,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2018-11-10 06:02:52,813 INFO L267 ElimStorePlain]: Start of recursive call 802: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 51 [2018-11-10 06:02:52,816 INFO L267 ElimStorePlain]: Start of recursive call 803: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:52,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2018-11-10 06:02:52,859 INFO L267 ElimStorePlain]: Start of recursive call 804: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:52,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 58 [2018-11-10 06:02:52,867 INFO L267 ElimStorePlain]: Start of recursive call 805: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:52,885 INFO L267 ElimStorePlain]: Start of recursive call 801: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:52,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 81 [2018-11-10 06:02:53,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 41 [2018-11-10 06:02:53,068 INFO L267 ElimStorePlain]: Start of recursive call 807: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:53,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 58 [2018-11-10 06:02:53,076 INFO L267 ElimStorePlain]: Start of recursive call 808: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:53,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-11-10 06:02:53,124 INFO L267 ElimStorePlain]: Start of recursive call 809: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:53,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2018-11-10 06:02:53,127 INFO L267 ElimStorePlain]: Start of recursive call 810: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:53,143 INFO L267 ElimStorePlain]: Start of recursive call 806: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:53,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 78 [2018-11-10 06:02:53,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2018-11-10 06:02:53,267 INFO L267 ElimStorePlain]: Start of recursive call 812: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:53,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2018-11-10 06:02:53,270 INFO L267 ElimStorePlain]: Start of recursive call 813: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:53,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 55 [2018-11-10 06:02:53,310 INFO L267 ElimStorePlain]: Start of recursive call 814: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:53,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 38 [2018-11-10 06:02:53,317 INFO L267 ElimStorePlain]: Start of recursive call 815: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:53,334 INFO L267 ElimStorePlain]: Start of recursive call 811: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:53,382 INFO L267 ElimStorePlain]: Start of recursive call 800: 13 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:53,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 55 [2018-11-10 06:02:53,391 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2018-11-10 06:02:53,391 INFO L267 ElimStorePlain]: Start of recursive call 817: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:53,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 44 treesize of output 44 [2018-11-10 06:02:53,424 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 06:02:53,424 INFO L267 ElimStorePlain]: Start of recursive call 819: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:53,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 06:02:53,427 INFO L267 ElimStorePlain]: Start of recursive call 820: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:53,437 INFO L267 ElimStorePlain]: Start of recursive call 818: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:53,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 52 [2018-11-10 06:02:53,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2018-11-10 06:02:53,504 INFO L267 ElimStorePlain]: Start of recursive call 822: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:53,505 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-11-10 06:02:53,505 INFO L267 ElimStorePlain]: Start of recursive call 823: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:53,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2018-11-10 06:02:53,508 INFO L267 ElimStorePlain]: Start of recursive call 824: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:53,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 42 [2018-11-10 06:02:53,549 INFO L267 ElimStorePlain]: Start of recursive call 825: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:53,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 37 [2018-11-10 06:02:53,555 INFO L267 ElimStorePlain]: Start of recursive call 826: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:53,574 INFO L267 ElimStorePlain]: Start of recursive call 821: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:53,586 INFO L267 ElimStorePlain]: Start of recursive call 816: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:53,600 INFO L267 ElimStorePlain]: Start of recursive call 794: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:02:53,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 75 [2018-11-10 06:02:53,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 06:02:53,625 INFO L267 ElimStorePlain]: Start of recursive call 828: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:53,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2018-11-10 06:02:53,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-11-10 06:02:53,652 INFO L267 ElimStorePlain]: Start of recursive call 830: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:53,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-11-10 06:02:53,665 INFO L267 ElimStorePlain]: Start of recursive call 831: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:53,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-11-10 06:02:53,675 INFO L267 ElimStorePlain]: Start of recursive call 832: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:53,679 INFO L267 ElimStorePlain]: Start of recursive call 829: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:53,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 91 [2018-11-10 06:02:53,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 70 [2018-11-10 06:02:53,708 INFO L267 ElimStorePlain]: Start of recursive call 834: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:53,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2018-11-10 06:02:53,810 INFO L267 ElimStorePlain]: Start of recursive call 835: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:53,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 79 [2018-11-10 06:02:53,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-11-10 06:02:53,936 INFO L267 ElimStorePlain]: Start of recursive call 837: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:53,946 INFO L267 ElimStorePlain]: Start of recursive call 836: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:54,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 79 [2018-11-10 06:02:54,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-11-10 06:02:54,089 INFO L267 ElimStorePlain]: Start of recursive call 839: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,099 INFO L267 ElimStorePlain]: Start of recursive call 838: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:54,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 76 [2018-11-10 06:02:54,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-11-10 06:02:54,166 INFO L267 ElimStorePlain]: Start of recursive call 841: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,176 INFO L267 ElimStorePlain]: Start of recursive call 840: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:54,216 INFO L267 ElimStorePlain]: Start of recursive call 833: 13 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:54,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 55 [2018-11-10 06:02:54,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 50 [2018-11-10 06:02:54,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 06:02:54,244 INFO L267 ElimStorePlain]: Start of recursive call 844: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 06:02:54,246 INFO L267 ElimStorePlain]: Start of recursive call 845: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,257 INFO L267 ElimStorePlain]: Start of recursive call 843: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:54,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-11-10 06:02:54,277 INFO L267 ElimStorePlain]: Start of recursive call 846: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-11-10 06:02:54,279 INFO L267 ElimStorePlain]: Start of recursive call 847: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2018-11-10 06:02:54,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-11-10 06:02:54,319 INFO L267 ElimStorePlain]: Start of recursive call 849: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-11-10 06:02:54,322 INFO L267 ElimStorePlain]: Start of recursive call 850: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,332 INFO L267 ElimStorePlain]: Start of recursive call 848: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:54,344 INFO L267 ElimStorePlain]: Start of recursive call 842: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:54,358 INFO L267 ElimStorePlain]: Start of recursive call 827: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:02:54,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 80 [2018-11-10 06:02:54,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 8 [2018-11-10 06:02:54,384 INFO L267 ElimStorePlain]: Start of recursive call 852: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 37 [2018-11-10 06:02:54,407 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 06:02:54,407 INFO L267 ElimStorePlain]: Start of recursive call 854: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,414 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 25 treesize of output 21 [2018-11-10 06:02:54,414 INFO L267 ElimStorePlain]: Start of recursive call 855: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,416 INFO L267 ElimStorePlain]: Start of recursive call 853: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-11-10 06:02:54,421 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 06:02:54,421 INFO L267 ElimStorePlain]: Start of recursive call 857: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,428 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2018-11-10 06:02:54,443 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 06:02:54,443 INFO L267 ElimStorePlain]: Start of recursive call 859: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,445 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2018-11-10 06:02:54,445 INFO L267 ElimStorePlain]: Start of recursive call 860: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,453 INFO L267 ElimStorePlain]: Start of recursive call 858: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,458 INFO L267 ElimStorePlain]: Start of recursive call 856: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 86 [2018-11-10 06:02:54,472 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 67 [2018-11-10 06:02:54,472 INFO L267 ElimStorePlain]: Start of recursive call 862: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 70 [2018-11-10 06:02:54,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-11-10 06:02:54,533 INFO L267 ElimStorePlain]: Start of recursive call 864: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2018-11-10 06:02:54,536 INFO L267 ElimStorePlain]: Start of recursive call 865: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,545 INFO L267 ElimStorePlain]: Start of recursive call 863: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,571 INFO L267 ElimStorePlain]: Start of recursive call 861: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,583 INFO L267 ElimStorePlain]: Start of recursive call 851: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:54,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2018-11-10 06:02:54,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 8 [2018-11-10 06:02:54,602 INFO L267 ElimStorePlain]: Start of recursive call 867: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2018-11-10 06:02:54,617 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 22 treesize of output 20 [2018-11-10 06:02:54,617 INFO L267 ElimStorePlain]: Start of recursive call 869: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,629 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-11-10 06:02:54,630 INFO L267 ElimStorePlain]: Start of recursive call 870: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-11-10 06:02:54,637 INFO L267 ElimStorePlain]: Start of recursive call 871: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,638 INFO L267 ElimStorePlain]: Start of recursive call 868: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,642 INFO L267 ElimStorePlain]: Start of recursive call 866: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2018-11-10 06:02:54,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 06:02:54,671 INFO L267 ElimStorePlain]: Start of recursive call 873: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2018-11-10 06:02:54,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2018-11-10 06:02:54,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-11-10 06:02:54,705 INFO L267 ElimStorePlain]: Start of recursive call 876: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,708 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 06:02:54,708 INFO L267 ElimStorePlain]: Start of recursive call 877: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,713 INFO L267 ElimStorePlain]: Start of recursive call 875: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2018-11-10 06:02:54,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-11-10 06:02:54,739 INFO L267 ElimStorePlain]: Start of recursive call 879: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,743 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 06:02:54,743 INFO L267 ElimStorePlain]: Start of recursive call 880: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,745 INFO L267 ElimStorePlain]: Start of recursive call 878: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,748 INFO L267 ElimStorePlain]: Start of recursive call 874: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,758 INFO L267 ElimStorePlain]: Start of recursive call 872: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 78 [2018-11-10 06:02:54,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 06:02:54,793 INFO L267 ElimStorePlain]: Start of recursive call 882: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2018-11-10 06:02:54,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-11-10 06:02:54,818 INFO L267 ElimStorePlain]: Start of recursive call 884: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-11-10 06:02:54,832 INFO L267 ElimStorePlain]: Start of recursive call 885: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 06:02:54,843 INFO L267 ElimStorePlain]: Start of recursive call 886: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,844 INFO L267 ElimStorePlain]: Start of recursive call 883: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,850 INFO L267 ElimStorePlain]: Start of recursive call 881: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 77 [2018-11-10 06:02:54,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 8 [2018-11-10 06:02:54,879 INFO L267 ElimStorePlain]: Start of recursive call 888: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:54,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 91 [2018-11-10 06:02:54,925 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 67 [2018-11-10 06:02:54,925 INFO L267 ElimStorePlain]: Start of recursive call 890: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,026 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 76 [2018-11-10 06:02:55,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2018-11-10 06:02:55,060 INFO L267 ElimStorePlain]: Start of recursive call 892: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-11-10 06:02:55,064 INFO L267 ElimStorePlain]: Start of recursive call 893: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,080 INFO L267 ElimStorePlain]: Start of recursive call 891: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 73 [2018-11-10 06:02:55,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2018-11-10 06:02:55,189 INFO L267 ElimStorePlain]: Start of recursive call 895: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-11-10 06:02:55,191 INFO L267 ElimStorePlain]: Start of recursive call 896: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,200 INFO L267 ElimStorePlain]: Start of recursive call 894: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 73 [2018-11-10 06:02:55,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-11-10 06:02:55,305 INFO L267 ElimStorePlain]: Start of recursive call 898: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2018-11-10 06:02:55,309 INFO L267 ElimStorePlain]: Start of recursive call 899: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,318 INFO L267 ElimStorePlain]: Start of recursive call 897: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 70 [2018-11-10 06:02:55,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-11-10 06:02:55,405 INFO L267 ElimStorePlain]: Start of recursive call 901: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2018-11-10 06:02:55,408 INFO L267 ElimStorePlain]: Start of recursive call 902: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,417 INFO L267 ElimStorePlain]: Start of recursive call 900: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,434 INFO L267 ElimStorePlain]: Start of recursive call 889: 13 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2018-11-10 06:02:55,442 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-11-10 06:02:55,442 INFO L267 ElimStorePlain]: Start of recursive call 904: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,455 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 31 treesize of output 27 [2018-11-10 06:02:55,455 INFO L267 ElimStorePlain]: Start of recursive call 905: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-11-10 06:02:55,466 INFO L267 ElimStorePlain]: Start of recursive call 906: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,470 INFO L267 ElimStorePlain]: Start of recursive call 903: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 55 [2018-11-10 06:02:55,479 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2018-11-10 06:02:55,479 INFO L267 ElimStorePlain]: Start of recursive call 908: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,492 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 44 [2018-11-10 06:02:55,509 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2018-11-10 06:02:55,509 INFO L267 ElimStorePlain]: Start of recursive call 910: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,511 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 06:02:55,511 INFO L267 ElimStorePlain]: Start of recursive call 911: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,521 INFO L267 ElimStorePlain]: Start of recursive call 909: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,534 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2018-11-10 06:02:55,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-11-10 06:02:55,553 INFO L267 ElimStorePlain]: Start of recursive call 913: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2018-11-10 06:02:55,556 INFO L267 ElimStorePlain]: Start of recursive call 914: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,565 INFO L267 ElimStorePlain]: Start of recursive call 912: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,573 INFO L267 ElimStorePlain]: Start of recursive call 907: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,585 INFO L267 ElimStorePlain]: Start of recursive call 887: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:55,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 82 [2018-11-10 06:02:55,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 8 [2018-11-10 06:02:55,616 INFO L267 ElimStorePlain]: Start of recursive call 916: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 34 [2018-11-10 06:02:55,631 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 06:02:55,631 INFO L267 ElimStorePlain]: Start of recursive call 918: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-10 06:02:55,637 INFO L267 ElimStorePlain]: Start of recursive call 919: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,638 INFO L267 ElimStorePlain]: Start of recursive call 917: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,644 INFO L267 ElimStorePlain]: Start of recursive call 915: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 104 [2018-11-10 06:02:55,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 8 [2018-11-10 06:02:55,679 INFO L267 ElimStorePlain]: Start of recursive call 921: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2018-11-10 06:02:55,694 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 06:02:55,694 INFO L267 ElimStorePlain]: Start of recursive call 923: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,702 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 37 treesize of output 31 [2018-11-10 06:02:55,702 INFO L267 ElimStorePlain]: Start of recursive call 924: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,703 INFO L267 ElimStorePlain]: Start of recursive call 922: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,708 INFO L267 ElimStorePlain]: Start of recursive call 920: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 72 [2018-11-10 06:02:55,732 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 9 treesize of output 8 [2018-11-10 06:02:55,732 INFO L267 ElimStorePlain]: Start of recursive call 926: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 37 [2018-11-10 06:02:55,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-10 06:02:55,754 INFO L267 ElimStorePlain]: Start of recursive call 928: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-10 06:02:55,764 INFO L267 ElimStorePlain]: Start of recursive call 929: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,765 INFO L267 ElimStorePlain]: Start of recursive call 927: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 81 [2018-11-10 06:02:55,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 80 [2018-11-10 06:02:55,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 44 [2018-11-10 06:02:55,853 INFO L267 ElimStorePlain]: Start of recursive call 932: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:55,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 61 [2018-11-10 06:02:55,860 INFO L267 ElimStorePlain]: Start of recursive call 933: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:55,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 37 treesize of output 31 [2018-11-10 06:02:55,906 INFO L267 ElimStorePlain]: Start of recursive call 934: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,927 INFO L267 ElimStorePlain]: Start of recursive call 931: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:02:55,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 30 treesize of output 24 [2018-11-10 06:02:55,954 INFO L267 ElimStorePlain]: Start of recursive call 935: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 13 treesize of output 7 [2018-11-10 06:02:55,956 INFO L267 ElimStorePlain]: Start of recursive call 936: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:55,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 31 treesize of output 25 [2018-11-10 06:02:55,958 INFO L267 ElimStorePlain]: Start of recursive call 937: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:56,004 INFO L267 ElimStorePlain]: Start of recursive call 930: 5 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:02:56,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-11-10 06:02:56,009 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2018-11-10 06:02:56,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2018-11-10 06:02:56,028 INFO L267 ElimStorePlain]: Start of recursive call 940: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:56,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 4 [2018-11-10 06:02:56,030 INFO L267 ElimStorePlain]: Start of recursive call 941: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:56,043 INFO L267 ElimStorePlain]: Start of recursive call 939: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 06:02:56,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-10 06:02:56,065 INFO L267 ElimStorePlain]: Start of recursive call 942: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:56,078 INFO L267 ElimStorePlain]: Start of recursive call 938: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:02:56,102 INFO L267 ElimStorePlain]: Start of recursive call 925: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-10 06:02:56,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 76 [2018-11-10 06:02:56,128 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 9 treesize of output 8 [2018-11-10 06:02:56,128 INFO L267 ElimStorePlain]: Start of recursive call 944: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:56,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2018-11-10 06:02:56,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 34 treesize of output 28 [2018-11-10 06:02:56,144 INFO L267 ElimStorePlain]: Start of recursive call 946: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:56,155 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 28 treesize of output 24 [2018-11-10 06:02:56,156 INFO L267 ElimStorePlain]: Start of recursive call 947: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:56,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 06:02:56,164 INFO L267 ElimStorePlain]: Start of recursive call 948: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:56,166 INFO L267 ElimStorePlain]: Start of recursive call 945: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:56,170 INFO L267 ElimStorePlain]: Start of recursive call 943: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:56,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2018-11-10 06:02:56,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 06:02:56,203 INFO L267 ElimStorePlain]: Start of recursive call 950: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:56,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2018-11-10 06:02:56,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-11-10 06:02:56,219 INFO L267 ElimStorePlain]: Start of recursive call 952: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:56,222 INFO L267 ElimStorePlain]: Start of recursive call 951: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:56,227 INFO L267 ElimStorePlain]: Start of recursive call 949: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:56,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2018-11-10 06:02:56,254 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 9 treesize of output 8 [2018-11-10 06:02:56,254 INFO L267 ElimStorePlain]: Start of recursive call 954: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:56,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2018-11-10 06:02:56,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 22 treesize of output 16 [2018-11-10 06:02:56,267 INFO L267 ElimStorePlain]: Start of recursive call 956: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:56,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-11-10 06:02:56,276 INFO L267 ElimStorePlain]: Start of recursive call 957: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:56,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2018-11-10 06:02:56,286 INFO L267 ElimStorePlain]: Start of recursive call 958: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:56,290 INFO L267 ElimStorePlain]: Start of recursive call 955: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:02:56,298 INFO L267 ElimStorePlain]: Start of recursive call 953: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:02:56,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 3 dim-2 vars, End of recursive call: 12 dim-0 vars, and 12 xjuncts. [2018-11-10 06:02:56,656 INFO L202 ElimStorePlain]: Needed 958 recursive calls to eliminate 16 variables, input treesize:123, output treesize:153 [2018-11-10 06:02:57,133 WARN L179 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 61 [2018-11-10 06:02:57,727 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-11-10 06:02:58,030 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2018-11-10 06:02:58,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-11-10 06:02:58,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:58,137 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:58,137 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:58,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-11-10 06:02:58,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:58,167 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:58,167 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:58,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-10 06:02:58,168 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:58,168 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-11-10 06:02:58,169 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:58,185 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:58,186 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:58,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-11-10 06:02:58,186 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:58,187 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 8 [2018-11-10 06:02:58,187 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:58,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:02:58,199 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 20 variables, input treesize:138, output treesize:7 [2018-11-10 06:02:58,545 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2018-11-10 06:02:58,836 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 06:02:58,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 06:02:58,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 23] total 50 [2018-11-10 06:02:58,852 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 06:02:58,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-10 06:02:58,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-10 06:02:58,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2404, Unknown=8, NotChecked=0, Total=2550 [2018-11-10 06:02:58,853 INFO L87 Difference]: Start difference. First operand 386 states and 414 transitions. Second operand 31 states. [2018-11-10 06:02:59,970 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2018-11-10 06:03:05,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:03:05,133 INFO L93 Difference]: Finished difference Result 434 states and 466 transitions. [2018-11-10 06:03:05,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-10 06:03:05,133 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 89 [2018-11-10 06:03:05,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:03:05,134 INFO L225 Difference]: With dead ends: 434 [2018-11-10 06:03:05,134 INFO L226 Difference]: Without dead ends: 434 [2018-11-10 06:03:05,135 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 142 SyntacticMatches, 15 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=403, Invalid=5139, Unknown=8, NotChecked=0, Total=5550 [2018-11-10 06:03:05,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-11-10 06:03:05,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 385. [2018-11-10 06:03:05,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-11-10 06:03:05,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 413 transitions. [2018-11-10 06:03:05,141 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 413 transitions. Word has length 89 [2018-11-10 06:03:05,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:03:05,141 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 413 transitions. [2018-11-10 06:03:05,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-10 06:03:05,141 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 413 transitions. [2018-11-10 06:03:05,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-10 06:03:05,142 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:03:05,142 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] WARNING: YOUR LOGFILE WAS TOO LONG, SOME LINES IN THE MIDDLE WERE REMOVED. [2018-11-10 06:05:34,656 WARN L854 $PredicateComparison]: unable to prove that (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |c_#length| (store |c_old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|)))) is different from true [2018-11-10 06:05:34,667 WARN L854 $PredicateComparison]: unable to prove that (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_28 (_ BitVec 32)) (v_prenex_29 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (let ((.cse1 (store |c_old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)))) (let ((.cse0 (store .cse1 v_prenex_29 (_ bv1 1)))) (and (= (bvadd (select .cse0 |dll_create_generic_~#dll~0.base|) (_ bv1 1)) (_ bv0 1)) (= |c_#length| (store (store (store |c_old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_29 v_prenex_28) alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select .cse0 alloc_or_die_slave_~ptr~0.base) (_ bv0 1)) (= (_ bv0 1) (select |c_old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select .cse1 v_prenex_29) (_ bv0 1)))))) is different from true [2018-11-10 06:05:34,751 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:34,752 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:34,753 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:34,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 44 [2018-11-10 06:05:34,788 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:34,790 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:34,790 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:05:34,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-11-10 06:05:34,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:34,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:34,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-11-10 06:05:34,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-11-10 06:05:34,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-11-10 06:05:34,880 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:34,900 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:34,914 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:34,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:34,949 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:63, output treesize:9 [2018-11-10 06:05:35,034 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 19 not checked. [2018-11-10 06:05:35,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:05:35,764 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2018-11-10 06:05:37,697 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2018-11-10 06:05:37,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:05:37,700 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b11e9207-cf0a-4e6a-8dbe-c5ae5686e94c/bin-2019/utaipan/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:05:37,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:05:37,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:05:37,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:05:37,823 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-11-10 06:05:37,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:37,829 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-11-10 06:05:37,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:37,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:37,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-10 06:05:37,843 WARN L854 $PredicateComparison]: unable to prove that (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |c_old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) is different from true [2018-11-10 06:05:38,155 WARN L854 $PredicateComparison]: unable to prove that (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_37 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32)) (v_prenex_36 (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)))) (and (= |c_#length| (store (store (store |c_old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_37 v_prenex_36)) (= (select .cse0 alloc_or_die_slave_~ptr~0.base) (_ bv0 1)) (= (_ bv0 1) (select |c_old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store .cse0 alloc_or_die_slave_~ptr~0.base (_ bv1 1)) v_prenex_37) (_ bv0 1))))) is different from true [2018-11-10 06:05:38,228 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:38,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-11-10 06:05:38,243 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:38,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-11-10 06:05:38,257 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:38,258 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:38,260 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:38,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-11-10 06:05:38,281 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:38,302 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:38,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:38,350 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:38,352 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:38,353 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:38,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 44 [2018-11-10 06:05:38,390 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:38,391 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:38,393 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:38,394 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:38,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2018-11-10 06:05:38,395 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:38,409 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:38,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:38,446 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:52, output treesize:9 [2018-11-10 06:05:38,468 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 0 refuted. 1 times theorem prover too weak. 6 trivial. 20 not checked. [2018-11-10 06:05:38,468 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:05:39,051 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2018-11-10 06:05:40,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:05:40,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 27 [2018-11-10 06:05:40,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-10 06:05:40,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-10 06:05:40,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=582, Unknown=13, NotChecked=260, Total=930 [2018-11-10 06:05:40,356 INFO L87 Difference]: Start difference. First operand 398 states and 424 transitions. Second operand 28 states. [2018-11-10 06:05:42,012 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_37 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32)) (v_prenex_36 (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)))) (and (= |c_#length| (store (store (store |c_old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_37 v_prenex_36)) (= (select .cse0 alloc_or_die_slave_~ptr~0.base) (_ bv0 1)) (= (_ bv0 1) (select |c_old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store .cse0 alloc_or_die_slave_~ptr~0.base (_ bv1 1)) v_prenex_37) (_ bv0 1))))) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_28 (_ BitVec 32)) (v_prenex_29 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (let ((.cse2 (store |c_old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)))) (let ((.cse1 (store .cse2 v_prenex_29 (_ bv1 1)))) (and (= (bvadd (select .cse1 |dll_create_generic_~#dll~0.base|) (_ bv1 1)) (_ bv0 1)) (= |c_#length| (store (store (store |c_old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_29 v_prenex_28) alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select .cse1 alloc_or_die_slave_~ptr~0.base) (_ bv0 1)) (= (_ bv0 1) (select |c_old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select .cse2 v_prenex_29) (_ bv0 1))))))) is different from true [2018-11-10 06:05:46,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:05:46,464 INFO L93 Difference]: Finished difference Result 448 states and 482 transitions. [2018-11-10 06:05:46,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 06:05:46,465 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 109 [2018-11-10 06:05:46,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:05:46,465 INFO L225 Difference]: With dead ends: 448 [2018-11-10 06:05:46,465 INFO L226 Difference]: Without dead ends: 448 [2018-11-10 06:05:46,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 193 SyntacticMatches, 8 SemanticMatches, 33 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=95, Invalid=727, Unknown=14, NotChecked=354, Total=1190 [2018-11-10 06:05:46,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-11-10 06:05:46,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 400. [2018-11-10 06:05:46,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-11-10 06:05:46,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 426 transitions. [2018-11-10 06:05:46,470 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 426 transitions. Word has length 109 [2018-11-10 06:05:46,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:05:46,471 INFO L481 AbstractCegarLoop]: Abstraction has 400 states and 426 transitions. [2018-11-10 06:05:46,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-10 06:05:46,471 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 426 transitions. [2018-11-10 06:05:46,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 06:05:46,471 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:05:46,471 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:05:46,472 INFO L424 AbstractCegarLoop]: === Iteration 33 === [dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 06:05:46,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:05:46,472 INFO L82 PathProgramCache]: Analyzing trace with hash 556216158, now seen corresponding path program 1 times [2018-11-10 06:05:46,472 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 06:05:46,472 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b11e9207-cf0a-4e6a-8dbe-c5ae5686e94c/bin-2019/utaipan/cvc4nyu Starting monitored process 41 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 06:05:46,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:05:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:05:47,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:05:47,071 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-11-10 06:05:47,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:47,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:47,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 06:05:47,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 11 [2018-11-10 06:05:47,150 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:47,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:47,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-11-10 06:05:47,289 WARN L854 $PredicateComparison]: unable to prove that (exists ((alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |c_#valid| (store |c_old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))) is different from true [2018-11-10 06:05:47,502 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-11-10 06:05:47,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:47,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:47,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-11-10 06:05:47,774 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:47,778 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:47,781 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:47,789 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:47,792 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:47,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 71 [2018-11-10 06:05:47,898 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2018-11-10 06:05:47,912 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:47,913 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:47,917 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:47,918 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:47,920 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:47,921 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:47,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 77 [2018-11-10 06:05:47,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 74 [2018-11-10 06:05:47,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 62 [2018-11-10 06:05:47,937 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:47,964 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:47,994 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:48,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:48,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-10 06:05:48,039 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:62, output treesize:54 [2018-11-10 06:05:48,213 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:48,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-11-10 06:05:48,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:48,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-10 06:05:48,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:50 [2018-11-10 06:05:48,329 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2018-11-10 06:05:48,329 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:05:48,914 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2018-11-10 06:05:49,120 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 12 treesize of output 10 [2018-11-10 06:05:49,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:05:49,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-11-10 06:05:49,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:108 [2018-11-10 06:05:49,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:05:49,426 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b11e9207-cf0a-4e6a-8dbe-c5ae5686e94c/bin-2019/utaipan/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:05:49,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:05:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:05:49,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:05:49,576 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-11-10 06:05:49,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:49,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:49,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 06:05:49,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 11 [2018-11-10 06:05:49,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:49,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:49,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-11-10 06:05:50,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 06:05:50,358 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 8 treesize of output 7 [2018-11-10 06:05:50,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:50,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:50,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:50,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:25 [2018-11-10 06:05:51,291 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_232| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_230| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |c_old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_232| |v_alloc_or_die_slave_write~$Pointer$_#value.base_230|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))))) is different from true [2018-11-10 06:05:51,661 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_232| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_230| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select (select (store |c_old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |c_old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_232| |v_alloc_or_die_slave_write~$Pointer$_#value.base_230|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset|) c_dll_insert_slave_~next~0.base) (= (select |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)))) is different from true [2018-11-10 06:05:51,665 WARN L854 $PredicateComparison]: unable to prove that (exists ((|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)))) is different from true [2018-11-10 06:05:51,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-11-10 06:05:51,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2018-11-10 06:05:51,676 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:05:51,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:05:51,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 06:05:51,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:37 [2018-11-10 06:05:51,817 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_create_generic_ULTIMATE.dealloc_~addr.base (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse1 (store |c_old(#valid)| dll_create_generic_ULTIMATE.dealloc_~addr.base (_ bv1 1)))) (let ((.cse0 (store .cse1 v_arrayElimCell_39 (_ bv1 1)))) (and (= (_ bv0 1) (select .cse0 |alloc_or_die_slave_write~$Pointer$_#ptr.base|)) (= (_ bv0 1) (select |c_old(#valid)| dll_create_generic_ULTIMATE.dealloc_~addr.base)) (= |c_#valid| (store (store .cse0 |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) dll_create_generic_ULTIMATE.dealloc_~addr.base (_ bv0 1))) (= (select .cse1 v_arrayElimCell_39) (_ bv0 1)))))) is different from true [2018-11-10 06:05:51,858 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:51,860 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:51,863 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:51,868 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:51,869 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:51,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 69 [2018-11-10 06:05:51,975 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:51,977 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:51,979 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:51,986 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:51,988 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:51,990 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:51,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 85 [2018-11-10 06:05:51,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 80 [2018-11-10 06:05:52,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 66 [2018-11-10 06:05:52,003 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:52,023 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:52,046 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:52,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:52,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-10 06:05:52,090 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2018-11-10 06:05:52,433 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2018-11-10 06:05:52,433 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:05:53,187 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-11-10 06:05:53,677 WARN L179 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2018-11-10 06:05:57,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:05:57,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 40] total 61 [2018-11-10 06:05:57,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-11-10 06:05:57,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-11-10 06:05:57,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=3421, Unknown=27, NotChecked=610, Total=4290 [2018-11-10 06:05:57,961 INFO L87 Difference]: Start difference. First operand 400 states and 426 transitions. Second operand 62 states. [2018-11-10 06:06:00,402 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2018-11-10 06:06:01,546 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2018-11-10 06:06:12,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:06:12,991 INFO L93 Difference]: Finished difference Result 491 states and 539 transitions. [2018-11-10 06:06:12,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-10 06:06:12,991 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 110 [2018-11-10 06:06:12,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:06:12,992 INFO L225 Difference]: With dead ends: 491 [2018-11-10 06:06:12,993 INFO L226 Difference]: Without dead ends: 491 [2018-11-10 06:06:12,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 161 SyntacticMatches, 5 SemanticMatches, 91 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2516 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=484, Invalid=7132, Unknown=60, NotChecked=880, Total=8556 [2018-11-10 06:06:12,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-11-10 06:06:12,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 435. [2018-11-10 06:06:12,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-11-10 06:06:12,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 480 transitions. [2018-11-10 06:06:12,999 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 480 transitions. Word has length 110 [2018-11-10 06:06:13,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:06:13,000 INFO L481 AbstractCegarLoop]: Abstraction has 435 states and 480 transitions. [2018-11-10 06:06:13,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-11-10 06:06:13,000 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 480 transitions. [2018-11-10 06:06:13,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-10 06:06:13,000 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:06:13,000 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:06:13,001 INFO L424 AbstractCegarLoop]: === Iteration 34 === [dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 06:06:13,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:06:13,001 INFO L82 PathProgramCache]: Analyzing trace with hash 62831805, now seen corresponding path program 1 times [2018-11-10 06:06:13,001 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 06:06:13,002 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b11e9207-cf0a-4e6a-8dbe-c5ae5686e94c/bin-2019/utaipan/cvc4nyu Starting monitored process 43 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 06:06:13,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:06:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:06:13,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:06:13,632 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-11-10 06:06:13,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:13,640 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-11-10 06:06:13,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:13,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:06:13,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-10 06:06:13,724 WARN L854 $PredicateComparison]: unable to prove that (exists ((|alloc_or_die_master_#Ultimate.alloc_#res.base| (_ BitVec 32)) (|alloc_or_die_master_#Ultimate.alloc_~size| (_ BitVec 32))) (and (= (select |c_old(#valid)| |alloc_or_die_master_#Ultimate.alloc_#res.base|) (_ bv0 1)) (= |c_#length| (store |c_old(#length)| |alloc_or_die_master_#Ultimate.alloc_#res.base| |alloc_or_die_master_#Ultimate.alloc_~size|)))) is different from true [2018-11-10 06:06:13,729 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:06:13,730 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:06:13,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 06:06:13,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:13,743 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-11-10 06:06:13,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:13,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:06:13,752 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-11-10 06:06:13,814 WARN L854 $PredicateComparison]: unable to prove that (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |c_old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) is different from true [2018-11-10 06:06:13,822 WARN L854 $PredicateComparison]: unable to prove that (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= (select (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| |c_dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) is different from true [2018-11-10 06:06:13,857 WARN L854 $PredicateComparison]: unable to prove that (exists ((alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| alloc_or_die_slave_~ptr~0.base (_ bv8 32)))) is different from true [2018-11-10 06:06:13,864 WARN L854 $PredicateComparison]: unable to prove that (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|) (_ bv0 1)) (= |c_#length| (store (store (store |c_old(#length)| |c_dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) alloc_or_die_slave_~ptr~0.base (_ bv8 32))))) is different from true [2018-11-10 06:06:13,870 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-11-10 06:06:13,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:13,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-11-10 06:06:13,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:27, output treesize:26 [2018-11-10 06:06:13,890 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_create_generic_ULTIMATE.dealloc_~addr.base (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |c_old(#valid)| dll_create_generic_ULTIMATE.dealloc_~addr.base (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|) (_ bv0 1)) (= |c_#length| (store (store (store |c_old(#length)| dll_create_generic_ULTIMATE.dealloc_~addr.base |dll_create_generic_#Ultimate.alloc_~size|) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) alloc_or_die_slave_~ptr~0.base (_ bv8 32))) (= (_ bv0 1) (select |c_#valid| dll_create_generic_ULTIMATE.dealloc_~addr.base)))) is different from true [2018-11-10 06:06:13,918 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:06:13,920 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:06:13,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 06:06:13,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:13,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 24 [2018-11-10 06:06:13,957 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-11-10 06:06:13,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 17 treesize of output 28 [2018-11-10 06:06:13,984 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-11-10 06:06:14,024 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:06:14,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 30 [2018-11-10 06:06:14,125 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:06:14,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 22 treesize of output 49 [2018-11-10 06:06:14,162 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 16 xjuncts. [2018-11-10 06:06:14,269 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 06:06:14,348 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-10 06:06:14,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 7 xjuncts. [2018-11-10 06:06:14,431 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:41, output treesize:126 [2018-11-10 06:06:14,606 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:06:14,607 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:06:14,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-11-10 06:06:14,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:14,659 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:06:14,660 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:06:14,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-11-10 06:06:14,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:14,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 06:06:14,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:86, output treesize:38 [2018-11-10 06:06:14,749 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 21 not checked. [2018-11-10 06:06:14,749 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:06:15,440 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2018-11-10 06:06:15,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:15,490 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-10 06:06:15,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:15,538 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-11-10 06:06:15,538 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:15,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-11-10 06:06:15,581 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:82, output treesize:64 [2018-11-10 06:06:19,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:06:19,800 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b11e9207-cf0a-4e6a-8dbe-c5ae5686e94c/bin-2019/utaipan/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:06:19,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:06:19,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:06:19,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:06:19,953 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-11-10 06:06:19,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:19,962 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-11-10 06:06:19,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:19,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:06:19,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-11-10 06:06:20,135 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:06:20,137 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 14 treesize of output 17 [2018-11-10 06:06:20,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:20,154 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:06:20,155 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:06:20,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-10 06:06:20,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:20,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:06:20,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-11-10 06:06:21,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 06:06:21,058 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 8 treesize of output 7 [2018-11-10 06:06:21,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:21,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:06:21,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:06:21,070 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:25 [2018-11-10 06:06:21,938 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_alloc_or_die_slave_write~$Pointer$_#value.base_257| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_259| (_ BitVec 32))) (and (= (select |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= (store |c_old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |c_old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_259| |v_alloc_or_die_slave_write~$Pointer$_#value.base_257|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |c_#memory_$Pointer$.base|) (= |c_#length| (store |c_old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv8 32))))) is different from true [2018-11-10 06:06:22,273 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_alloc_or_die_slave_write~$Pointer$_#value.base_257| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_259| (_ BitVec 32))) (and (= (select |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= (select (select (store |c_old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |c_old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_259| |v_alloc_or_die_slave_write~$Pointer$_#value.base_257|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset|) c_dll_insert_slave_~next~0.base) (= |c_#length| (store |c_old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv8 32))))) is different from true [2018-11-10 06:06:22,276 WARN L854 $PredicateComparison]: unable to prove that (exists ((|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |c_#length| (store |c_old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv8 32))))) is different from true [2018-11-10 06:06:22,282 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:06:22,284 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:06:22,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-10 06:06:22,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:22,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 25 [2018-11-10 06:06:22,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-10 06:06:22,306 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:06:22,317 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:06:22,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-10 06:06:22,330 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:46, output treesize:30 [2018-11-10 06:06:22,486 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_create_generic_ULTIMATE.dealloc_~addr.base (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_arrayElimCell_42 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (not (= |alloc_or_die_slave_write~$Pointer$_#ptr.base| dll_create_generic_ULTIMATE.dealloc_~addr.base)) (= (_ bv0 1) (select |c_old(#valid)| dll_create_generic_ULTIMATE.dealloc_~addr.base)) (= (_ bv0 1) (select (store |c_old(#valid)| dll_create_generic_ULTIMATE.dealloc_~addr.base (_ bv1 1)) v_arrayElimCell_42)) (= |c_#length| (store (store (store |c_old(#length)| dll_create_generic_ULTIMATE.dealloc_~addr.base |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_42 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv8 32))))) is different from true [2018-11-10 06:06:22,554 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:06:22,557 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:06:22,561 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:06:22,561 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:06:22,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-11-10 06:06:22,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:22,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-11-10 06:06:22,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2018-11-10 06:06:22,646 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:06:22,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 45 [2018-11-10 06:06:22,667 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-11-10 06:06:22,733 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:06:22,779 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:06:22,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-10 06:06:22,843 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:57, output treesize:58 [2018-11-10 06:06:23,190 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2018-11-10 06:06:23,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:06:24,292 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-11-10 06:06:24,717 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-11-10 06:06:24,885 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:06:24,885 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:06:24,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-11-10 06:06:24,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:24,950 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:06:24,951 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:06:24,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2018-11-10 06:06:24,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:25,019 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:06:25,019 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:06:25,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-11-10 06:06:25,020 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:25,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-11-10 06:06:25,073 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:109, output treesize:76 [2018-11-10 06:06:37,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:06:37,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 41] total 54 [2018-11-10 06:06:37,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-10 06:06:37,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-10 06:06:37,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2382, Unknown=26, NotChecked=1070, Total=3660 [2018-11-10 06:06:37,829 INFO L87 Difference]: Start difference. First operand 435 states and 480 transitions. Second operand 55 states. [2018-11-10 06:06:44,040 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2018-11-10 06:06:45,867 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2018-11-10 06:06:47,803 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2018-11-10 06:06:49,360 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2018-11-10 06:06:50,006 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2018-11-10 06:06:51,300 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((dll_create_generic_ULTIMATE.dealloc_~addr.base (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_arrayElimCell_42 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (not (= |alloc_or_die_slave_write~$Pointer$_#ptr.base| dll_create_generic_ULTIMATE.dealloc_~addr.base)) (= (_ bv0 1) (select |c_old(#valid)| dll_create_generic_ULTIMATE.dealloc_~addr.base)) (= (_ bv0 1) (select (store |c_old(#valid)| dll_create_generic_ULTIMATE.dealloc_~addr.base (_ bv1 1)) v_arrayElimCell_42)) (= |c_#length| (store (store (store |c_old(#length)| dll_create_generic_ULTIMATE.dealloc_~addr.base |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_42 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv8 32))))) (exists ((dll_create_generic_ULTIMATE.dealloc_~addr.base (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |c_old(#valid)| dll_create_generic_ULTIMATE.dealloc_~addr.base (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|) (_ bv0 1)) (= |c_#length| (store (store (store |c_old(#length)| dll_create_generic_ULTIMATE.dealloc_~addr.base |dll_create_generic_#Ultimate.alloc_~size|) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) alloc_or_die_slave_~ptr~0.base (_ bv8 32))) (= (_ bv0 1) (select |c_#valid| dll_create_generic_ULTIMATE.dealloc_~addr.base))))) is different from true [2018-11-10 06:06:52,023 WARN L179 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 44 [2018-11-10 06:07:03,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:07:03,506 INFO L93 Difference]: Finished difference Result 490 states and 543 transitions. [2018-11-10 06:07:03,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-10 06:07:03,507 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 111 [2018-11-10 06:07:03,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:07:03,509 INFO L225 Difference]: With dead ends: 490 [2018-11-10 06:07:03,509 INFO L226 Difference]: Without dead ends: 490 [2018-11-10 06:07:03,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 171 SyntacticMatches, 6 SemanticMatches, 88 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 1365 ImplicationChecksByTransitivity, 28.9s TimeCoverageRelationStatistics Valid=386, Invalid=5766, Unknown=54, NotChecked=1804, Total=8010 [2018-11-10 06:07:03,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2018-11-10 06:07:03,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 436. [2018-11-10 06:07:03,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-11-10 06:07:03,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 481 transitions. [2018-11-10 06:07:03,519 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 481 transitions. Word has length 111 [2018-11-10 06:07:03,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:07:03,519 INFO L481 AbstractCegarLoop]: Abstraction has 436 states and 481 transitions. [2018-11-10 06:07:03,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-10 06:07:03,520 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 481 transitions. [2018-11-10 06:07:03,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-10 06:07:03,520 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:07:03,521 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:07:03,521 INFO L424 AbstractCegarLoop]: === Iteration 35 === [dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 06:07:03,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:07:03,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1327978442, now seen corresponding path program 1 times [2018-11-10 06:07:03,522 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 06:07:03,522 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b11e9207-cf0a-4e6a-8dbe-c5ae5686e94c/bin-2019/utaipan/cvc4nyu Starting monitored process 45 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 06:07:03,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:07:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:07:04,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:07:04,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 06:07:04,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:07:04,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:07:04,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 06:07:04,404 WARN L854 $PredicateComparison]: unable to prove that (exists ((alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |c_#valid| (store |c_old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))) is different from true [2018-11-10 06:07:04,640 WARN L854 $PredicateComparison]: unable to prove that (exists ((alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1)))) is different from true [2018-11-10 06:07:04,716 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_create_generic_ULTIMATE.dealloc_~addr.base (_ BitVec 32)) (v_prenex_71 (_ BitVec 32)) (v_prenex_72 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (let ((.cse1 (store |c_old(#valid)| dll_create_generic_ULTIMATE.dealloc_~addr.base (_ bv1 1)))) (let ((.cse0 (store .cse1 v_prenex_71 (_ bv1 1)))) (and (= (_ bv0 1) (select |c_old(#valid)| dll_create_generic_ULTIMATE.dealloc_~addr.base)) (= (_ bv0 1) (select .cse0 alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select .cse1 v_prenex_71)) (= |c_#valid| (store (store (store .cse0 alloc_or_die_slave_~ptr~0.base (_ bv1 1)) v_prenex_72 (_ bv1 1)) dll_create_generic_ULTIMATE.dealloc_~addr.base (_ bv0 1))))))) is different from true [2018-11-10 06:07:04,746 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:04,748 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:04,750 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:04,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 59 [2018-11-10 06:07:04,794 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:04,795 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:04,795 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:07:04,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 71 [2018-11-10 06:07:04,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 68 [2018-11-10 06:07:04,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 56 [2018-11-10 06:07:04,823 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:04,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 54 [2018-11-10 06:07:04,833 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-10 06:07:04,877 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:07:04,908 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:07:04,941 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:07:04,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:07:05,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-11-10 06:07:05,016 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:50, output treesize:72 [2018-11-10 06:07:05,199 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 10 proven. 10 refuted. 2 times theorem prover too weak. 20 trivial. 53 not checked. [2018-11-10 06:07:05,199 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:07:05,641 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2018-11-10 06:07:05,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:07:05,923 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b11e9207-cf0a-4e6a-8dbe-c5ae5686e94c/bin-2019/utaipan/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:07:05,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:07:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:07:06,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:07:06,120 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-11-10 06:07:06,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:07:06,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:07:06,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 06:07:06,126 WARN L854 $PredicateComparison]: unable to prove that (exists ((|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) is different from true [2018-11-10 06:07:06,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 06:07:06,566 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 8 treesize of output 7 [2018-11-10 06:07:06,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:07:06,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:07:06,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:07:06,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-11-10 06:07:07,306 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_alloc_or_die_slave_write~$Pointer$_#value.base_288| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_290| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= (store |c_old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |c_old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_290| |v_alloc_or_die_slave_write~$Pointer$_#value.base_288|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |c_#memory_$Pointer$.base|) (= |c_#valid| (store |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)))) is different from true [2018-11-10 06:07:07,581 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_alloc_or_die_slave_write~$Pointer$_#value.base_288| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_290| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= (select (select (store |c_old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |c_old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_290| |v_alloc_or_die_slave_write~$Pointer$_#value.base_288|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset|) c_dll_insert_slave_~next~0.base))) is different from true [2018-11-10 06:07:07,587 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_alloc_or_die_slave_write~$Pointer$_#value.base_288| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_290| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= (select (select (store |c_old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |c_old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_290| |v_alloc_or_die_slave_write~$Pointer$_#value.base_288|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset|) |c_dll_insert_slave_write~$Pointer$_#ptr.base|) (= |c_#valid| (store |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)))) is different from true [2018-11-10 06:07:07,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-11-10 06:07:07,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-11-10 06:07:07,971 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:07:07,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:07:07,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-10 06:07:07,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:73, output treesize:43 [2018-11-10 06:07:08,156 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_create_generic_ULTIMATE.dealloc_~addr.base (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (let ((.cse1 (store |c_old(#valid)| dll_create_generic_ULTIMATE.dealloc_~addr.base (_ bv1 1)))) (let ((.cse0 (store (store .cse1 alloc_or_die_slave_~ptr~0.base (_ bv1 1)) v_arrayElimCell_45 (_ bv1 1)))) (and (= (_ bv0 1) (select .cse0 |alloc_or_die_slave_write~$Pointer$_#ptr.base|)) (= |c_#valid| (store (store .cse0 |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) dll_create_generic_ULTIMATE.dealloc_~addr.base (_ bv0 1))) (= (_ bv0 1) (select |c_old(#valid)| dll_create_generic_ULTIMATE.dealloc_~addr.base)) (= (_ bv0 1) (select .cse1 alloc_or_die_slave_~ptr~0.base)))))) is different from true [2018-11-10 06:07:08,197 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:08,198 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:08,200 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:08,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 60 [2018-11-10 06:07:08,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2018-11-10 06:07:08,315 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:08,320 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:08,328 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:08,328 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:07:08,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 69 [2018-11-10 06:07:08,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 60 [2018-11-10 06:07:08,348 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:08,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 58 [2018-11-10 06:07:08,360 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-10 06:07:08,415 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:07:08,448 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:07:08,495 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:07:08,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:07:08,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-11-10 06:07:08,588 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:53, output treesize:76 [2018-11-10 06:07:08,688 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 29 proven. 13 refuted. 2 times theorem prover too weak. 3 trivial. 48 not checked. [2018-11-10 06:07:08,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:07:09,465 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-11-10 06:07:10,148 WARN L179 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2018-11-10 06:07:10,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:07:10,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 37] total 49 [2018-11-10 06:07:10,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-10 06:07:10,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-10 06:07:10,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1701, Unknown=96, NotChecked=728, Total=2652 [2018-11-10 06:07:10,480 INFO L87 Difference]: Start difference. First operand 436 states and 481 transitions. Second operand 50 states. [2018-11-10 06:07:14,157 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2018-11-10 06:07:17,252 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2018-11-10 06:07:17,956 WARN L179 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2018-11-10 06:07:18,815 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2018-11-10 06:07:19,296 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2018-11-10 06:07:20,132 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2018-11-10 06:07:20,640 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2018-11-10 06:07:23,629 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((dll_create_generic_ULTIMATE.dealloc_~addr.base (_ BitVec 32)) (v_prenex_71 (_ BitVec 32)) (v_prenex_72 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (let ((.cse1 (store |c_old(#valid)| dll_create_generic_ULTIMATE.dealloc_~addr.base (_ bv1 1)))) (let ((.cse0 (store .cse1 v_prenex_71 (_ bv1 1)))) (and (= (_ bv0 1) (select |c_old(#valid)| dll_create_generic_ULTIMATE.dealloc_~addr.base)) (= (_ bv0 1) (select .cse0 alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select .cse1 v_prenex_71)) (= |c_#valid| (store (store (store .cse0 alloc_or_die_slave_~ptr~0.base (_ bv1 1)) v_prenex_72 (_ bv1 1)) dll_create_generic_ULTIMATE.dealloc_~addr.base (_ bv0 1))))))) (exists ((dll_create_generic_ULTIMATE.dealloc_~addr.base (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (let ((.cse3 (store |c_old(#valid)| dll_create_generic_ULTIMATE.dealloc_~addr.base (_ bv1 1)))) (let ((.cse2 (store (store .cse3 alloc_or_die_slave_~ptr~0.base (_ bv1 1)) v_arrayElimCell_45 (_ bv1 1)))) (and (= (_ bv0 1) (select .cse2 |alloc_or_die_slave_write~$Pointer$_#ptr.base|)) (= |c_#valid| (store (store .cse2 |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) dll_create_generic_ULTIMATE.dealloc_~addr.base (_ bv0 1))) (= (_ bv0 1) (select |c_old(#valid)| dll_create_generic_ULTIMATE.dealloc_~addr.base)) (= (_ bv0 1) (select .cse3 alloc_or_die_slave_~ptr~0.base))))))) is different from true [2018-11-10 06:07:33,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:07:33,368 INFO L93 Difference]: Finished difference Result 523 states and 589 transitions. [2018-11-10 06:07:33,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-10 06:07:33,368 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 140 [2018-11-10 06:07:33,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:07:33,369 INFO L225 Difference]: With dead ends: 523 [2018-11-10 06:07:33,370 INFO L226 Difference]: Without dead ends: 523 [2018-11-10 06:07:33,370 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 230 SyntacticMatches, 6 SemanticMatches, 82 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=386, Invalid=4947, Unknown=253, NotChecked=1386, Total=6972 [2018-11-10 06:07:33,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-11-10 06:07:33,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 451. [2018-11-10 06:07:33,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-11-10 06:07:33,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 502 transitions. [2018-11-10 06:07:33,376 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 502 transitions. Word has length 140 [2018-11-10 06:07:33,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:07:33,376 INFO L481 AbstractCegarLoop]: Abstraction has 451 states and 502 transitions. [2018-11-10 06:07:33,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-10 06:07:33,376 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 502 transitions. [2018-11-10 06:07:33,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-10 06:07:33,377 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:07:33,377 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:07:33,377 INFO L424 AbstractCegarLoop]: === Iteration 36 === [dll_destroy_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_masterErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_create_genericErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroy_slaveErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroy_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_destroy_slaveErr3ASSERT_VIOLATIONMEMORY_FREE, dll_reinit_nested_listsErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_reinit_nested_listsErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_initErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_baseErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_fullErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, alloc_or_die_masterErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, dll_insert_slaveErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, inspect_danglingErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 06:07:33,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:07:33,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1782341345, now seen corresponding path program 1 times [2018-11-10 06:07:33,378 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 06:07:33,378 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b11e9207-cf0a-4e6a-8dbe-c5ae5686e94c/bin-2019/utaipan/cvc4nyu Starting monitored process 47 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 06:07:33,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:07:34,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:07:34,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:07:34,360 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-11-10 06:07:34,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:07:34,367 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-11-10 06:07:34,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:07:34,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:07:34,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-10 06:07:34,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 06:07:34,786 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 8 treesize of output 7 [2018-11-10 06:07:34,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:07:34,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:07:34,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:07:34,801 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:35 [2018-11-10 06:07:35,477 WARN L854 $PredicateComparison]: unable to prove that (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |c_old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |c_#length| (store |c_old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) is different from true [2018-11-10 06:07:35,730 WARN L854 $PredicateComparison]: unable to prove that (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select (select (store |c_old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |c_old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset|) c_dll_insert_slave_~next~0.base) (= (select |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |c_#length| (store |c_old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) is different from true [2018-11-10 06:07:35,734 WARN L854 $PredicateComparison]: unable to prove that (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |c_old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |c_#length| (store |c_old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) is different from true [2018-11-10 06:07:35,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2018-11-10 06:07:35,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-11-10 06:07:35,748 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:07:35,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:07:35,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-11-10 06:07:35,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:65, output treesize:49 [2018-11-10 06:07:35,797 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)))) (let ((.cse1 (store .cse0 v_arrayElimCell_48 (_ bv1 1)))) (and (= (select .cse0 v_arrayElimCell_48) (_ bv0 1)) (= |c_#length| (store (store (store |c_old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79)) (= (_ bv0 1) (select |c_old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select .cse1 |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |c_#valid| (store .cse1 |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))))))) is different from true [2018-11-10 06:07:35,863 WARN L854 $PredicateComparison]: unable to prove that (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |c_#length| (store |c_old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|)))) is different from true [2018-11-10 06:07:35,875 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)))) (let ((.cse1 (store .cse0 v_arrayElimCell_48 (_ bv1 1)))) (and (= (select .cse0 v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store .cse1 |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |c_old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select .cse1 |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |c_#length| (store (store (store (store |c_old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80)))))) is different from true [2018-11-10 06:07:35,990 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:36,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2018-11-10 06:07:36,013 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:36,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2018-11-10 06:07:36,052 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:36,055 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:36,057 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:36,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 53 [2018-11-10 06:07:36,103 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:36,106 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:36,109 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:36,111 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:36,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 68 [2018-11-10 06:07:36,155 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:07:36,191 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:07:36,217 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:07:36,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:07:36,300 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:36,302 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:36,303 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:36,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 57 [2018-11-10 06:07:36,363 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:36,364 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:36,365 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:07:36,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 63 [2018-11-10 06:07:36,417 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:36,419 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:36,420 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:36,422 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:36,424 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:36,425 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:36,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-11-10 06:07:36,426 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 06:07:36,456 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:07:36,485 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:07:36,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:07:36,547 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 10 variables, input treesize:69, output treesize:11 [2018-11-10 06:07:36,711 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 20 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 54 not checked. [2018-11-10 06:07:36,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:07:37,637 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-10 06:07:37,816 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-10 06:07:38,060 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-11-10 06:07:38,957 WARN L179 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2018-11-10 06:07:45,574 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-11-10 06:07:45,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:07:45,577 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b11e9207-cf0a-4e6a-8dbe-c5ae5686e94c/bin-2019/utaipan/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:07:45,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:07:45,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:07:45,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:07:45,834 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-11-10 06:07:45,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:07:45,845 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-11-10 06:07:45,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:07:45,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:07:45,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-10 06:07:45,987 WARN L854 $PredicateComparison]: unable to prove that (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |c_old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) is different from true [2018-11-10 06:07:46,768 WARN L854 $PredicateComparison]: unable to prove that (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |c_old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) is different from true [2018-11-10 06:07:46,883 WARN L854 $PredicateComparison]: unable to prove that (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (let ((.cse1 (store |c_old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)))) (let ((.cse0 (store .cse1 v_prenex_90 (_ bv1 1)))) (and (= (_ bv0 1) (select .cse0 |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |c_old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select .cse1 v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store .cse0 |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |c_#length| (store (store (store (store |c_old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91)))))) is different from true [2018-11-10 06:07:46,975 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:46,977 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:46,980 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:46,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 55 [2018-11-10 06:07:47,035 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:47,036 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:47,038 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:47,040 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:47,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 63 [2018-11-10 06:07:47,096 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:47,097 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:47,099 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:47,100 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:47,101 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:07:47,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 41 [2018-11-10 06:07:47,102 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:07:47,135 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:07:47,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:07:47,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2018-11-10 06:07:47,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2018-11-10 06:07:47,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 53 [2018-11-10 06:07:47,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 68 [2018-11-10 06:07:47,320 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 06:07:47,354 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:07:47,380 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:07:47,402 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:07:47,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:07:47,469 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 10 variables, input treesize:69, output treesize:11 [2018-11-10 06:07:47,508 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 16 proven. 0 refuted. 1 times theorem prover too weak. 32 trivial. 46 not checked. [2018-11-10 06:07:47,508 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:07:48,160 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2018-11-10 06:07:56,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:07:56,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 18] total 45 [2018-11-10 06:07:56,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-10 06:07:56,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-10 06:07:56,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1433, Unknown=32, NotChecked=756, Total=2352 [2018-11-10 06:07:56,459 INFO L87 Difference]: Start difference. First operand 451 states and 502 transitions. Second operand 46 states. [2018-11-10 06:07:59,863 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 38 [2018-11-10 06:08:01,517 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 43 [2018-11-10 06:08:02,463 WARN L179 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2018-11-10 06:08:03,642 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 43 [2018-11-10 06:08:04,849 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 38 [2018-11-10 06:08:14,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:08:14,844 INFO L93 Difference]: Finished difference Result 497 states and 554 transitions. [2018-11-10 06:08:14,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-10 06:08:14,844 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 141 [2018-11-10 06:08:14,844 INFO L84 Accepts]: Finished accepts. each prefix is rejected. [2018-11-10 06:08:14,844 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 141 [2018-11-10 06:08:14,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:08:14,855 FATAL L832 BasicCegarLoop]: -- [2018-11-10 06:08:14,855 FATAL L833 BasicCegarLoop]: enhanced interpolant automaton broken: counterexample not accepted [2018-11-10 06:08:14,855 FATAL L834 BasicCegarLoop]: word: [2018-11-10 06:08:14,855 FATAL L836 BasicCegarLoop]: call ULTIMATE.init(); [2018-11-10 06:08:14,856 FATAL L836 BasicCegarLoop]: #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; [2018-11-10 06:08:14,856 FATAL L836 BasicCegarLoop]: assume true; [2018-11-10 06:08:14,856 FATAL L836 BasicCegarLoop]: #749#return; [2018-11-10 06:08:14,856 FATAL L836 BasicCegarLoop]: call #t~ret46 := main(); [2018-11-10 06:08:14,856 FATAL L836 BasicCegarLoop]: call #t~ret45.base, #t~ret45.offset := dll_create_master(); [2018-11-10 06:08:14,856 FATAL L836 BasicCegarLoop]: call #t~ret20.base, #t~ret20.offset := dll_create_generic(#funAddr~dll_insert_master.base, #funAddr~dll_insert_master.offset); [2018-11-10 06:08:14,856 FATAL L836 BasicCegarLoop]: ~insert_fnc.base, ~insert_fnc.offset := #in~insert_fnc.base, #in~insert_fnc.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#dll~0.base, ~#dll~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~#dll~0.base, ~#dll~0.offset, 4bv32; [2018-11-10 06:08:14,857 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-11-10 06:08:14,857 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true; [2018-11-10 06:08:14,857 FATAL L836 BasicCegarLoop]: call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset); [2018-11-10 06:08:14,857 FATAL L836 BasicCegarLoop]: #~9.base, #~9.offset := #in~9.base, #in~9.offset; [2018-11-10 06:08:14,857 FATAL L836 BasicCegarLoop]: assume #in~#fp.base == #funAddr~dll_insert_master.base && #in~#fp.offset == #funAddr~dll_insert_master.offset; [2018-11-10 06:08:14,857 FATAL L836 BasicCegarLoop]: call dll_insert_master(#~9.base, #~9.offset); [2018-11-10 06:08:14,857 FATAL L836 BasicCegarLoop]: ~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset; [2018-11-10 06:08:14,857 FATAL L836 BasicCegarLoop]: call #t~ret17.base, #t~ret17.offset := alloc_or_die_master(); [2018-11-10 06:08:14,857 FATAL L836 BasicCegarLoop]: #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 12bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ptr~1.base, ~ptr~1.offset := #t~malloc3.base, #t~malloc3.offset; [2018-11-10 06:08:14,858 FATAL L836 BasicCegarLoop]: assume !(~ptr~1.base == 0bv32 && ~ptr~1.offset == 0bv32); [2018-11-10 06:08:14,858 FATAL L836 BasicCegarLoop]: write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~1.base, ~bvadd32(~ptr~1.offset, 0bv32), 4bv32; [2018-11-10 06:08:14,858 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-11-10 06:08:14,858 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~1.base, ~bvadd32(~ptr~1.offset, 4bv32), 4bv32; [2018-11-10 06:08:14,858 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-11-10 06:08:14,858 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~1.base, ~bvadd32(~ptr~1.offset, 8bv32), 4bv32; [2018-11-10 06:08:14,858 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-11-10 06:08:14,858 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;#res.base, #res.offset := ~ptr~1.base, ~ptr~1.offset; [2018-11-10 06:08:14,859 FATAL L836 BasicCegarLoop]: assume true; [2018-11-10 06:08:14,859 FATAL L836 BasicCegarLoop]: #691#return; [2018-11-10 06:08:14,859 FATAL L836 BasicCegarLoop]: ~item~1.base, ~item~1.offset := #t~ret17.base, #t~ret17.offset;havoc #t~ret17.base, #t~ret17.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~dll.offset, 4bv32; [2018-11-10 06:08:14,859 FATAL L836 BasicCegarLoop]: assume #valid[read~$Pointer$_#ptr.base] == 1bv1; [2018-11-10 06:08:14,859 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem18.base, #t~mem18.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~3.base, ~next~3.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~next~3.base, ~next~3.offset, ~item~1.base, ~bvadd32(~item~1.offset, 0bv32), 4bv32; [2018-11-10 06:08:14,859 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-11-10 06:08:14,859 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true; [2018-11-10 06:08:14,860 FATAL L836 BasicCegarLoop]: assume !(~next~3.base != 0bv32 || ~next~3.offset != 0bv32); [2018-11-10 06:08:14,860 FATAL L836 BasicCegarLoop]: call #t~ret19.base, #t~ret19.offset := dll_create_slave(); [2018-11-10 06:08:14,860 FATAL L836 BasicCegarLoop]: call #t~ret11.base, #t~ret11.offset := dll_create_generic(#funAddr~dll_insert_slave.base, #funAddr~dll_insert_slave.offset); [2018-11-10 06:08:14,860 FATAL L836 BasicCegarLoop]: ~insert_fnc.base, ~insert_fnc.offset := #in~insert_fnc.base, #in~insert_fnc.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#dll~0.base, ~#dll~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~#dll~0.base, ~#dll~0.offset, 4bv32; [2018-11-10 06:08:14,860 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-11-10 06:08:14,860 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true; [2018-11-10 06:08:14,860 FATAL L836 BasicCegarLoop]: call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset); [2018-11-10 06:08:14,860 FATAL L836 BasicCegarLoop]: #~9.base, #~9.offset := #in~9.base, #in~9.offset; [2018-11-10 06:08:14,860 FATAL L836 BasicCegarLoop]: assume !(#in~#fp.base == #funAddr~dll_insert_master.base && #in~#fp.offset == #funAddr~dll_insert_master.offset); [2018-11-10 06:08:14,860 FATAL L836 BasicCegarLoop]: call dll_insert_slave(#~9.base, #~9.offset); [2018-11-10 06:08:14,861 FATAL L836 BasicCegarLoop]: ~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset; [2018-11-10 06:08:14,861 FATAL L836 BasicCegarLoop]: call #t~ret4.base, #t~ret4.offset := alloc_or_die_slave(); [2018-11-10 06:08:14,861 FATAL L836 BasicCegarLoop]: #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ptr~0.base, ~ptr~0.offset := #t~malloc2.base, #t~malloc2.offset; [2018-11-10 06:08:14,861 FATAL L836 BasicCegarLoop]: assume !(~ptr~0.base == 0bv32 && ~ptr~0.offset == 0bv32); [2018-11-10 06:08:14,861 FATAL L836 BasicCegarLoop]: write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 0bv32), 4bv32; [2018-11-10 06:08:14,861 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-11-10 06:08:14,861 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 4bv32), 4bv32; [2018-11-10 06:08:14,861 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-11-10 06:08:14,861 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset; [2018-11-10 06:08:14,862 FATAL L836 BasicCegarLoop]: assume true; [2018-11-10 06:08:14,862 FATAL L836 BasicCegarLoop]: #753#return; [2018-11-10 06:08:14,862 FATAL L836 BasicCegarLoop]: ~item~0.base, ~item~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~dll.offset, 4bv32; [2018-11-10 06:08:14,862 FATAL L836 BasicCegarLoop]: assume #valid[read~$Pointer$_#ptr.base] == 1bv1; [2018-11-10 06:08:14,862 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem5.base, #t~mem5.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~0.base, ~next~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~next~0.base, ~next~0.offset, ~item~0.base, ~bvadd32(~item~0.offset, 0bv32), 4bv32; [2018-11-10 06:08:14,862 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-11-10 06:08:14,862 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true; [2018-11-10 06:08:14,862 FATAL L836 BasicCegarLoop]: assume !(~next~0.base != 0bv32 || ~next~0.offset != 0bv32); [2018-11-10 06:08:14,862 FATAL L836 BasicCegarLoop]: write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~dll.base, ~dll.offset, 4bv32; [2018-11-10 06:08:14,863 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-11-10 06:08:14,863 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true; [2018-11-10 06:08:14,863 FATAL L836 BasicCegarLoop]: assume true; [2018-11-10 06:08:14,863 FATAL L836 BasicCegarLoop]: #717#return; [2018-11-10 06:08:14,863 FATAL L836 BasicCegarLoop]: assume true; [2018-11-10 06:08:14,863 FATAL L836 BasicCegarLoop]: #695#return; [2018-11-10 06:08:14,863 FATAL L836 BasicCegarLoop]: call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset); [2018-11-10 06:08:14,863 FATAL L836 BasicCegarLoop]: #~9.base, #~9.offset := #in~9.base, #in~9.offset; [2018-11-10 06:08:14,863 FATAL L836 BasicCegarLoop]: assume !(#in~#fp.base == #funAddr~dll_insert_master.base && #in~#fp.offset == #funAddr~dll_insert_master.offset); [2018-11-10 06:08:14,864 FATAL L836 BasicCegarLoop]: call dll_insert_slave(#~9.base, #~9.offset); [2018-11-10 06:08:14,864 FATAL L836 BasicCegarLoop]: ~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset; [2018-11-10 06:08:14,864 FATAL L836 BasicCegarLoop]: call #t~ret4.base, #t~ret4.offset := alloc_or_die_slave(); [2018-11-10 06:08:14,864 FATAL L836 BasicCegarLoop]: #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ptr~0.base, ~ptr~0.offset := #t~malloc2.base, #t~malloc2.offset; [2018-11-10 06:08:14,864 FATAL L836 BasicCegarLoop]: assume !(~ptr~0.base == 0bv32 && ~ptr~0.offset == 0bv32); [2018-11-10 06:08:14,864 FATAL L836 BasicCegarLoop]: write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 0bv32), 4bv32; [2018-11-10 06:08:14,864 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-11-10 06:08:14,864 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 4bv32), 4bv32; [2018-11-10 06:08:14,864 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-11-10 06:08:14,864 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset; [2018-11-10 06:08:14,864 FATAL L836 BasicCegarLoop]: assume true; [2018-11-10 06:08:14,864 FATAL L836 BasicCegarLoop]: #753#return; [2018-11-10 06:08:14,865 FATAL L836 BasicCegarLoop]: ~item~0.base, ~item~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~dll.offset, 4bv32; [2018-11-10 06:08:14,865 FATAL L836 BasicCegarLoop]: assume #valid[read~$Pointer$_#ptr.base] == 1bv1; [2018-11-10 06:08:14,865 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem5.base, #t~mem5.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~0.base, ~next~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~next~0.base, ~next~0.offset, ~item~0.base, ~bvadd32(~item~0.offset, 0bv32), 4bv32; [2018-11-10 06:08:14,865 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-11-10 06:08:14,865 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true; [2018-11-10 06:08:14,865 FATAL L836 BasicCegarLoop]: assume ~next~0.base != 0bv32 || ~next~0.offset != 0bv32;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~next~0.base, ~bvadd32(~next~0.offset, 4bv32), 4bv32; [2018-11-10 06:08:14,865 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-11-10 06:08:14,865 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true; [2018-11-10 06:08:14,865 FATAL L836 BasicCegarLoop]: write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~dll.base, ~dll.offset, 4bv32; [2018-11-10 06:08:14,865 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-11-10 06:08:14,866 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true; [2018-11-10 06:08:14,866 FATAL L836 BasicCegarLoop]: assume true; [2018-11-10 06:08:14,866 FATAL L836 BasicCegarLoop]: #717#return; [2018-11-10 06:08:14,866 FATAL L836 BasicCegarLoop]: assume true; [2018-11-10 06:08:14,866 FATAL L836 BasicCegarLoop]: #697#return; [2018-11-10 06:08:14,866 FATAL L836 BasicCegarLoop]: assume true; [2018-11-10 06:08:14,866 FATAL L836 BasicCegarLoop]: assume !!(#t~nondet8 != 0bv32);havoc #t~nondet8; [2018-11-10 06:08:14,866 FATAL L836 BasicCegarLoop]: call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset); [2018-11-10 06:08:14,866 FATAL L836 BasicCegarLoop]: #~9.base, #~9.offset := #in~9.base, #in~9.offset; [2018-11-10 06:08:14,866 FATAL L836 BasicCegarLoop]: assume !(#in~#fp.base == #funAddr~dll_insert_master.base && #in~#fp.offset == #funAddr~dll_insert_master.offset); [2018-11-10 06:08:14,867 FATAL L836 BasicCegarLoop]: call dll_insert_slave(#~9.base, #~9.offset); [2018-11-10 06:08:14,867 FATAL L836 BasicCegarLoop]: ~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset; [2018-11-10 06:08:14,867 FATAL L836 BasicCegarLoop]: call #t~ret4.base, #t~ret4.offset := alloc_or_die_slave(); [2018-11-10 06:08:14,867 FATAL L836 BasicCegarLoop]: #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ptr~0.base, ~ptr~0.offset := #t~malloc2.base, #t~malloc2.offset; [2018-11-10 06:08:14,867 FATAL L836 BasicCegarLoop]: assume !(~ptr~0.base == 0bv32 && ~ptr~0.offset == 0bv32); [2018-11-10 06:08:14,867 FATAL L836 BasicCegarLoop]: write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 0bv32), 4bv32; [2018-11-10 06:08:14,867 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-11-10 06:08:14,867 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 4bv32), 4bv32; [2018-11-10 06:08:14,867 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-11-10 06:08:14,867 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset; [2018-11-10 06:08:14,867 FATAL L836 BasicCegarLoop]: assume true; [2018-11-10 06:08:14,868 FATAL L836 BasicCegarLoop]: #753#return; [2018-11-10 06:08:14,868 FATAL L836 BasicCegarLoop]: ~item~0.base, ~item~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~dll.offset, 4bv32; [2018-11-10 06:08:14,868 FATAL L836 BasicCegarLoop]: assume #valid[read~$Pointer$_#ptr.base] == 1bv1; [2018-11-10 06:08:14,868 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem5.base, #t~mem5.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~0.base, ~next~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~next~0.base, ~next~0.offset, ~item~0.base, ~bvadd32(~item~0.offset, 0bv32), 4bv32; [2018-11-10 06:08:14,868 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-11-10 06:08:14,868 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true; [2018-11-10 06:08:14,868 FATAL L836 BasicCegarLoop]: assume ~next~0.base != 0bv32 || ~next~0.offset != 0bv32;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~next~0.base, ~bvadd32(~next~0.offset, 4bv32), 4bv32; [2018-11-10 06:08:14,868 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-11-10 06:08:14,868 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true; [2018-11-10 06:08:14,868 FATAL L836 BasicCegarLoop]: write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~dll.base, ~dll.offset, 4bv32; [2018-11-10 06:08:14,868 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-11-10 06:08:14,868 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true; [2018-11-10 06:08:14,869 FATAL L836 BasicCegarLoop]: assume true; [2018-11-10 06:08:14,869 FATAL L836 BasicCegarLoop]: #717#return; [2018-11-10 06:08:14,869 FATAL L836 BasicCegarLoop]: assume true; [2018-11-10 06:08:14,869 FATAL L836 BasicCegarLoop]: #699#return; [2018-11-10 06:08:14,869 FATAL L836 BasicCegarLoop]: assume true; [2018-11-10 06:08:14,869 FATAL L836 BasicCegarLoop]: assume !(#t~nondet8 != 0bv32);havoc #t~nondet8; [2018-11-10 06:08:14,869 FATAL L836 BasicCegarLoop]: assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~#dll~0.base, ~#dll~0.offset, 4bv32; [2018-11-10 06:08:14,869 FATAL L836 BasicCegarLoop]: assume #valid[read~$Pointer$_#ptr.base] == 1bv1; [2018-11-10 06:08:14,869 FATAL L836 BasicCegarLoop]: assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem10.base, #t~mem10.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;#res.base, #res.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~#dll~0.base, ~#dll~0.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0bv1];assume { :end_inline_ULTIMATE.dealloc } true;havoc ~#dll~0.base, ~#dll~0.offset; [2018-11-10 06:08:14,870 FATAL L836 BasicCegarLoop]: assume true; [2018-11-10 06:08:14,870 FATAL L836 BasicCegarLoop]: #685#return; [2018-11-10 06:08:14,870 FATAL L836 BasicCegarLoop]: #res.base, #res.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset; [2018-11-10 06:08:14,870 FATAL L836 BasicCegarLoop]: assume true; [2018-11-10 06:08:14,870 FATAL L836 BasicCegarLoop]: #693#return; [2018-11-10 06:08:14,870 FATAL L836 BasicCegarLoop]: write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := #t~ret19.base, #t~ret19.offset, ~item~1.base, ~bvadd32(~item~1.offset, 8bv32), 4bv32; [2018-11-10 06:08:14,870 FATAL L836 BasicCegarLoop]: assume #valid[write~$Pointer$_#ptr.base] == 1bv1; [2018-11-10 06:08:14,870 FATAL L836 BasicCegarLoop]: assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset)); [2018-11-10 06:08:14,871 FATAL L838 BasicCegarLoop]: original automaton: [2018-11-10 06:08:14,871 FATAL L839 BasicCegarLoop]: NestedWordAutomaton nwa = ( callAlphabet = {"call dll_destroy_nested_lists(~dll~1.base, ~dll~1.offset);" "call inspect_dangling(~dll~1.base, ~dll~1.offset);" "call dll_reinit_nested_lists(~dll~1.base, ~dll~1.offset);" "call inspect_init(~dll~1.base, ~dll~1.offset);" "call dll_destroy_master(~dll~1.base, ~dll~1.offset);" "call dll_insert_master(#~9.base, #~9.offset);" "call dll_insert_slave(#~9.base, #~9.offset);" "call inspect_base(~dll.base, ~dll.offset);" "call fail();" "call fail();" "call fail();" "call fail();" "call fail();" "call fail();" "call fail();" "call inspect_base(~dll.base, ~dll.offset);" "call fail();" "call fail();" "call fail();" "call fail();" "call fail();" "call fail();" "call ULTIMATE.init();" "call #t~ret11.base, #t~ret11.offset := dll_create_generic(#funAddr~dll_insert_slave.base, #funAddr~dll_insert_slave.offset);" "call #t~ret46 := main();" "call #t~ret20.base, #t~ret20.offset := dll_create_generic(#funAddr~dll_insert_master.base, #funAddr~dll_insert_master.offset);" "call dll_destroy_slave(#t~mem13.base, #t~mem13.offset);" "call #t~ret4.base, #t~ret4.offset := alloc_or_die_slave();" "call inspect_base(~dll.base, ~dll.offset);" "call #t~ret17.base, #t~ret17.offset := alloc_or_die_master();" "call fail();" "call #t~ret19.base, #t~ret19.offset := dll_create_slave();" "call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset);" "call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset);" "call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset);" "call #t~ret45.base, #t~ret45.offset := dll_create_master();" "call inspect_full(~dll~1.base, ~dll~1.offset);" }, internalAlphabet = {"SUMMARY for call #t~ret11.base, #t~ret11.offset := dll_create_generic(#funAddr~dll_insert_slave.base, #funAddr~dll_insert_slave.offset); srcloc: dll_create_slaveENTRY" "#res.base, #res.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;" "assume true;" "SUMMARY for call #t~ret20.base, #t~ret20.offset := dll_create_generic(#funAddr~dll_insert_master.base, #funAddr~dll_insert_master.offset); srcloc: dll_create_masterENTRY" "#res.base, #res.offset := #t~ret20.base, #t~ret20.offset;havoc #t~ret20.base, #t~ret20.offset;" "assume true;" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "assume true;" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 8bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem13.base, #t~mem13.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "SUMMARY for call dll_destroy_slave(#t~mem13.base, #t~mem13.offset); srcloc: L599" "havoc #t~mem13.base, #t~mem13.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem14.base, #t~mem14.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset;" "assume !true;" "assume true;" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "SUMMARY for call #t~ret17.base, #t~ret17.offset := alloc_or_die_master(); srcloc: L620" "~item~1.base, ~item~1.offset := #t~ret17.base, #t~ret17.offset;havoc #t~ret17.base, #t~ret17.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~dll.offset, 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem18.base, #t~mem18.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~3.base, ~next~3.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~next~3.base, ~next~3.offset, ~item~1.base, ~bvadd32(~item~1.offset, 0bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "assume ~next~3.base != 0bv32 || ~next~3.offset != 0bv32;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~1.base, ~item~1.offset, ~next~3.base, ~bvadd32(~next~3.offset, 4bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "assume !(~next~3.base != 0bv32 || ~next~3.offset != 0bv32);" "SUMMARY for call #t~ret19.base, #t~ret19.offset := dll_create_slave(); srcloc: L623-2" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := #t~ret19.base, #t~ret19.offset, ~item~1.base, ~bvadd32(~item~1.offset, 8bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;havoc #t~ret19.base, #t~ret19.offset;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~1.base, ~item~1.offset, ~dll.base, ~dll.offset, 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "assume true;" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "assume true;" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem16.base, #t~mem16.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~2.base, ~next~2.offset := #t~mem16.base, #t~mem16.offset;havoc #t~mem16.base, #t~mem16.offset;" "assume !(~dll.offset == 0bv32);" "assume ~dll.offset == 0bv32;" "assume !(~dll.base == 0bv32 || #valid[~dll.base] == 1bv1);" "assume ~dll.base == 0bv32 || #valid[~dll.base] == 1bv1;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~dll.base, ~dll.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0bv1];assume { :end_inline_ULTIMATE.dealloc } true;~dll.base, ~dll.offset := ~next~2.base, ~next~2.offset;" "assume !true;" "assume true;" "~insert_fnc.base, ~insert_fnc.offset := #in~insert_fnc.base, #in~insert_fnc.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#dll~0.base, ~#dll~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~#dll~0.base, ~#dll~0.offset, 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "SUMMARY for call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset); srcloc: L578" "SUMMARY for call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset); srcloc: L578-1" "assume true;" "assume !(#t~nondet8 != 0bv32);havoc #t~nondet8;" "assume !!(#t~nondet8 != 0bv32);havoc #t~nondet8;" "SUMMARY for call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset); srcloc: L581" "assume !true;" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~#dll~0.base, ~#dll~0.offset, 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem10.base, #t~mem10.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;#res.base, #res.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~#dll~0.base, ~#dll~0.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0bv1];assume { :end_inline_ULTIMATE.dealloc } true;havoc ~#dll~0.base, ~#dll~0.offset;" "assume true;" "SUMMARY for call #t~ret45.base, #t~ret45.offset := dll_create_master(); srcloc: mainENTRY" "~dll~1.base, ~dll~1.offset := #t~ret45.base, #t~ret45.offset;havoc #t~ret45.base, #t~ret45.offset;" "SUMMARY for call inspect_full(~dll~1.base, ~dll~1.offset); srcloc: L673" "SUMMARY for call dll_destroy_nested_lists(~dll~1.base, ~dll~1.offset); srcloc: L673-1" "SUMMARY for call inspect_dangling(~dll~1.base, ~dll~1.offset); srcloc: L674" "SUMMARY for call dll_reinit_nested_lists(~dll~1.base, ~dll~1.offset); srcloc: L675" "SUMMARY for call inspect_init(~dll~1.base, ~dll~1.offset); srcloc: L676" "SUMMARY for call dll_destroy_master(~dll~1.base, ~dll~1.offset); srcloc: L677" "#res := 0bv32;" "assume #valid == old(#valid);" "assume !(#valid == old(#valid));" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "assume true;" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem12.base, #t~mem12.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~1.base, ~next~1.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;" "assume !(~dll.offset == 0bv32);" "assume ~dll.offset == 0bv32;" "assume !(~dll.base == 0bv32 || #valid[~dll.base] == 1bv1);" "assume ~dll.base == 0bv32 || #valid[~dll.base] == 1bv1;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~dll.base, ~dll.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0bv1];assume { :end_inline_ULTIMATE.dealloc } true;~dll.base, ~dll.offset := ~next~1.base, ~next~1.offset;" "assume !true;" "assume true;" "assume false;" "assume true;" "#NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];" "assume true;" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "assume true;" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~dll.base, ~bvadd32(~dll.offset, 8bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem15.base, #t~mem15.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset;" "assume !true;" "assume true;" "#~9.base, #~9.offset := #in~9.base, #in~9.offset;" "assume #in~#fp.base == #funAddr~dll_insert_master.base && #in~#fp.offset == #funAddr~dll_insert_master.offset;" "SUMMARY for call dll_insert_master(#~9.base, #~9.offset); srcloc: L-1-1" "assume !(#in~#fp.base == #funAddr~dll_insert_master.base && #in~#fp.offset == #funAddr~dll_insert_master.offset);" "SUMMARY for call dll_insert_slave(#~9.base, #~9.offset); srcloc: L-1-3" "assume true;" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "SUMMARY for call inspect_base(~dll.base, ~dll.offset); srcloc: L666" "assume true;" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 8bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem44.base, #t~mem44.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume !(#t~mem44.base == 0bv32 && #t~mem44.offset == 0bv32);havoc #t~mem44.base, #t~mem44.offset;" "SUMMARY for call fail(); srcloc: L668-2" "assume !!(#t~mem44.base == 0bv32 && #t~mem44.offset == 0bv32);havoc #t~mem44.base, #t~mem44.offset;" "assume true;" "assume !true;" "assume !true;" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem43.base, #t~mem43.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset;" "assume !true;" "assume true;" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "assume true;" "assume ~dll.base == 0bv32 && ~dll.offset == 0bv32;" "SUMMARY for call fail(); srcloc: L634-2" "assume !(~dll.base == 0bv32 && ~dll.offset == 0bv32);" "assume true;" "assume !true;" "assume !true;" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem21.base, #t~mem21.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume #t~mem21.base == 0bv32 && #t~mem21.offset == 0bv32;havoc #t~mem21.base, #t~mem21.offset;" "SUMMARY for call fail(); srcloc: L635-1" "assume !(#t~mem21.base == 0bv32 && #t~mem21.offset == 0bv32);havoc #t~mem21.base, #t~mem21.offset;" "assume true;" "assume !true;" "assume !true;" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 4bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem22.base, #t~mem22.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume !(#t~mem22.base == 0bv32 && #t~mem22.offset == 0bv32);havoc #t~mem22.base, #t~mem22.offset;" "SUMMARY for call fail(); srcloc: L636-1" "assume !!(#t~mem22.base == 0bv32 && #t~mem22.offset == 0bv32);havoc #t~mem22.base, #t~mem22.offset;" "assume true;" "assume !true;" "assume !true;" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem23.base, #t~mem23.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset;" "assume true;" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 4bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem25.base, #t~mem25.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume #t~mem25.base == 0bv32 && #t~mem25.offset == 0bv32;havoc #t~mem25.base, #t~mem25.offset;" "SUMMARY for call fail(); srcloc: L638-2" "assume !(#t~mem25.base == 0bv32 && #t~mem25.offset == 0bv32);havoc #t~mem25.base, #t~mem25.offset;" "assume true;" "assume !true;" "assume !true;" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 4bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem26.base, #t~mem26.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := #t~mem26.base, ~bvadd32(#t~mem26.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem27.base, #t~mem27.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume #t~mem27.base == 0bv32 && #t~mem27.offset == 0bv32;havoc #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;" "SUMMARY for call fail(); srcloc: L639-1" "assume !(#t~mem27.base == 0bv32 && #t~mem27.offset == 0bv32);havoc #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;" "assume true;" "assume !true;" "assume !true;" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 4bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem28.base, #t~mem28.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := #t~mem28.base, ~bvadd32(#t~mem28.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem29.base, #t~mem29.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume !(#t~mem29.base == ~dll.base && #t~mem29.offset == ~dll.offset);havoc #t~mem28.base, #t~mem28.offset;havoc #t~mem29.base, #t~mem29.offset;" "SUMMARY for call fail(); srcloc: L640-1" "assume !!(#t~mem29.base == ~dll.base && #t~mem29.offset == ~dll.offset);havoc #t~mem28.base, #t~mem28.offset;havoc #t~mem29.base, #t~mem29.offset;" "assume true;" "assume !true;" "assume !true;" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem24.base, #t~mem24.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem24.base, #t~mem24.offset;havoc #t~mem24.base, #t~mem24.offset;" "assume !true;" "assume true;" "#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ptr~0.base, ~ptr~0.offset := #t~malloc2.base, #t~malloc2.offset;" "assume ~ptr~0.base == 0bv32 && ~ptr~0.offset == 0bv32;assume false;" "assume !(~ptr~0.base == 0bv32 && ~ptr~0.offset == 0bv32);" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 0bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 4bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset;" "assume true;" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "SUMMARY for call inspect_base(~dll.base, ~dll.offset); srcloc: L645" "assume true;" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 8bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem31.base, #t~mem31.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~pos~0.base, ~pos~0.offset := #t~mem31.base, #t~mem31.offset;havoc #t~mem31.base, #t~mem31.offset;" "assume true;" "assume ~pos~0.base == 0bv32 && ~pos~0.offset == 0bv32;" "SUMMARY for call fail(); srcloc: L648-2" "assume !(~pos~0.base == 0bv32 && ~pos~0.offset == 0bv32);" "assume true;" "assume !true;" "assume !true;" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem32.base, #t~mem32.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume #t~mem32.base == 0bv32 && #t~mem32.offset == 0bv32;havoc #t~mem32.base, #t~mem32.offset;" "SUMMARY for call fail(); srcloc: L649-1" "assume !(#t~mem32.base == 0bv32 && #t~mem32.offset == 0bv32);havoc #t~mem32.base, #t~mem32.offset;" "assume true;" "assume !true;" "assume !true;" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 4bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem33.base, #t~mem33.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume !(#t~mem33.base == 0bv32 && #t~mem33.offset == 0bv32);havoc #t~mem33.base, #t~mem33.offset;" "SUMMARY for call fail(); srcloc: L650-1" "assume !!(#t~mem33.base == 0bv32 && #t~mem33.offset == 0bv32);havoc #t~mem33.base, #t~mem33.offset;" "assume true;" "assume !true;" "assume !true;" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem34.base, #t~mem34.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~pos~0.base, ~pos~0.offset := #t~mem34.base, #t~mem34.offset;havoc #t~mem34.base, #t~mem34.offset;" "assume true;" "assume !(~pos~0.base != 0bv32 || ~pos~0.offset != 0bv32);" "assume !!(~pos~0.base != 0bv32 || ~pos~0.offset != 0bv32);" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 4bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem36.base, #t~mem36.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume #t~mem36.base == 0bv32 && #t~mem36.offset == 0bv32;havoc #t~mem36.base, #t~mem36.offset;" "SUMMARY for call fail(); srcloc: L652-2" "assume !(#t~mem36.base == 0bv32 && #t~mem36.offset == 0bv32);havoc #t~mem36.base, #t~mem36.offset;" "assume true;" "assume !true;" "assume !true;" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 4bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem37.base, #t~mem37.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := #t~mem37.base, ~bvadd32(#t~mem37.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem38.base, #t~mem38.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume #t~mem38.base == 0bv32 && #t~mem38.offset == 0bv32;havoc #t~mem38.base, #t~mem38.offset;havoc #t~mem37.base, #t~mem37.offset;" "SUMMARY for call fail(); srcloc: L653-1" "assume !(#t~mem38.base == 0bv32 && #t~mem38.offset == 0bv32);havoc #t~mem38.base, #t~mem38.offset;havoc #t~mem37.base, #t~mem37.offset;" "assume true;" "assume !true;" "assume !true;" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 4bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem39.base, #t~mem39.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := #t~mem39.base, ~bvadd32(#t~mem39.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem40.base, #t~mem40.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume !(#t~mem40.base == ~pos~0.base && #t~mem40.offset == ~pos~0.offset);havoc #t~mem40.base, #t~mem40.offset;havoc #t~mem39.base, #t~mem39.offset;" "SUMMARY for call fail(); srcloc: L654-1" "assume !!(#t~mem40.base == ~pos~0.base && #t~mem40.offset == ~pos~0.offset);havoc #t~mem40.base, #t~mem40.offset;havoc #t~mem39.base, #t~mem39.offset;" "assume true;" "assume !true;" "assume !true;" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem35.base, #t~mem35.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~pos~0.base, ~pos~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset;" "assume !true;" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem30.base, #t~mem30.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem30.base, #t~mem30.offset;havoc #t~mem30.base, #t~mem30.offset;" "assume !true;" "assume true;" "#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 12bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ptr~1.base, ~ptr~1.offset := #t~malloc3.base, #t~malloc3.offset;" "assume ~ptr~1.base == 0bv32 && ~ptr~1.offset == 0bv32;assume false;" "assume !(~ptr~1.base == 0bv32 && ~ptr~1.offset == 0bv32);" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~1.base, ~bvadd32(~ptr~1.offset, 0bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~1.base, ~bvadd32(~ptr~1.offset, 4bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~1.base, ~bvadd32(~ptr~1.offset, 8bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;#res.base, #res.offset := ~ptr~1.base, ~ptr~1.offset;" "assume true;" "SUMMARY for call ULTIMATE.init(); srcloc: ULTIMATE.startENTRY" "SUMMARY for call #t~ret46 := main(); srcloc: L-1" "assume true;" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "SUMMARY for call #t~ret4.base, #t~ret4.offset := alloc_or_die_slave(); srcloc: L568" "~item~0.base, ~item~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~dll.offset, 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem5.base, #t~mem5.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~0.base, ~next~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~next~0.base, ~next~0.offset, ~item~0.base, ~bvadd32(~item~0.offset, 0bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "assume ~next~0.base != 0bv32 || ~next~0.offset != 0bv32;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~next~0.base, ~bvadd32(~next~0.offset, 4bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "assume !(~next~0.base != 0bv32 || ~next~0.offset != 0bv32);" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~dll.base, ~dll.offset, 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "assume true;" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "SUMMARY for call inspect_base(~dll.base, ~dll.offset); srcloc: L660" "assume true;" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 8bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem42.base, #t~mem42.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume #t~mem42.base == 0bv32 && #t~mem42.offset == 0bv32;havoc #t~mem42.base, #t~mem42.offset;" "SUMMARY for call fail(); srcloc: L662-2" "assume !(#t~mem42.base == 0bv32 && #t~mem42.offset == 0bv32);havoc #t~mem42.base, #t~mem42.offset;" "assume true;" "assume !true;" "assume !true;" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem41.base, #t~mem41.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem41.base, #t~mem41.offset;havoc #t~mem41.base, #t~mem41.offset;" "assume !true;" "assume true;" }, returnAlphabet = {"#705#return;" "#707#return;" "#709#return;" "#711#return;" "#713#return;" "#715#return;" "#717#return;" "#719#return;" "#721#return;" "#723#return;" "#725#return;" "#727#return;" "#729#return;" "#731#return;" "#733#return;" "#735#return;" "#737#return;" "#739#return;" "#741#return;" "#743#return;" "#745#return;" "#747#return;" "#749#return;" "#685#return;" "#751#return;" "#687#return;" "#689#return;" "#753#return;" "#755#return;" "#691#return;" "#757#return;" "#693#return;" "#695#return;" "#697#return;" "#699#return;" "#701#return;" "#703#return;" }, states = {"39360#(exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "39236#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "39300#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) (_ bv1 1)) |#valid|) (= (_ bv1 1) (select |#valid| |dll_insert_slave_#in~dll.base|)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|))))" "39367#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base))" "39176#(and (= (_ bv12 32) (select |#length| |alloc_or_die_master_#res.base|)) (= (bvadd (select |#valid| |alloc_or_die_master_#res.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |alloc_or_die_master_#res.offset|))" "39817#(and (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))))" "39243#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))" "39307#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) (_ bv1 1))) (= (_ bv1 1) (select |#valid| |##fun~$Pointer$~TO~VOID_#in~9.base|)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|)) (_ bv0 1)))" "39371#(and (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |dll_insert_slave_#in~dll.base| |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_read~$Pointer$_#ptr.offset| |dll_insert_slave_#in~dll.offset|))" "39183#(and (= (_ bv12 32) (select |#length| |dll_insert_master_#t~ret17.base|)) (= (_ bv0 32) |dll_insert_master_#t~ret17.offset|) (= (_ bv1 1) (select |#valid| |dll_insert_master_#t~ret17.base|)))" "39314#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|) (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "39378#(exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select (select (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) dll_insert_slave_~next~0.base) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "39444#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)))" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "39769#(and (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|) (_ bv0 1)) (= |#length| (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)))" "39322#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))" "39388#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "39262#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| |alloc_or_die_slave_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)) (= |#valid| (store |old(#valid)| |alloc_or_die_slave_#res.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#res.base|)))" "39776#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|))" "39332#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "39269#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |#valid| (store |old(#valid)| |dll_insert_slave_#t~ret4.base| (_ bv1 1))) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= (_ bv0 1) (select |old(#valid)| |dll_insert_slave_#t~ret4.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_insert_slave_#t~ret4.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "39273#(and (= (_ bv0 1) (select |old(#valid)| dll_insert_slave_~item~0.base)) (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "39786#(and (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "39339#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "39916#(and (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))))" "39213#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))" "39277#(and (= (_ bv0 1) (select |old(#valid)| dll_insert_slave_~item~0.base)) (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))" "39346#(and (= alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (= |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))" "39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))" "39416#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)))))" "39353#(and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (exists ((|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32))) (= (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|)) |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "39098#true" "39226#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|))" "39546#(and (= (_ bv0 32) dll_insert_master_~item~1.offset) (= (bvadd (select |#length| dll_insert_master_~item~1.base) (_ bv4294967284 32)) (_ bv0 32)))" "39099#false" "39293#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_insert_slave_write~$Pointer$_#value.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (bvadd (select |#valid| |dll_insert_slave_write~$Pointer$_#ptr.base|) (_ bv1 1)) (_ bv0 1)) (= |dll_insert_slave_#in~dll.offset| |dll_insert_slave_write~$Pointer$_#ptr.offset|) (= |dll_insert_slave_write~$Pointer$_#ptr.base| |dll_insert_slave_#in~dll.base|) (= |#valid| (store |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base|)))" "39677#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))" "39550#(and (= (bvadd |dll_insert_master_write~$Pointer$_#sizeOfWrittenType| (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv8 32) |dll_insert_master_write~$Pointer$_#ptr.offset|) (= (bvadd (select |#length| |dll_insert_master_write~$Pointer$_#ptr.base|) (_ bv4294967284 32)) (_ bv0 32)))" }, initialStates = {"39098#true" }, finalStates = {"39099#false" }, callTransitions = { ("39236#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "call #t~ret4.base, #t~ret4.offset := alloc_or_die_slave();" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39314#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|) (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "call #t~ret19.base, #t~ret19.offset := dll_create_slave();" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39769#(and (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|) (_ bv0 1)) (= |#length| (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)))" "call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset);" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39322#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "call dll_insert_slave(#~9.base, #~9.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39776#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|))" "call dll_insert_slave(#~9.base, #~9.offset);" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39332#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "call #t~ret4.base, #t~ret4.offset := alloc_or_die_slave();" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "call #t~ret4.base, #t~ret4.offset := alloc_or_die_slave();" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "call #t~ret11.base, #t~ret11.offset := dll_create_generic(#funAddr~dll_insert_slave.base, #funAddr~dll_insert_slave.offset);" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "call dll_insert_slave(#~9.base, #~9.offset);" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39786#(and (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "call #t~ret4.base, #t~ret4.offset := alloc_or_die_slave();" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39213#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))" "call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset);" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))" "call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset);" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39416#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)))))" "call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset);" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39098#true" "call #t~ret17.base, #t~ret17.offset := alloc_or_die_master();" "39098#true") ("39098#true" "call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset);" "39098#true") ("39098#true" "call dll_insert_master(#~9.base, #~9.offset);" "39098#true") ("39098#true" "call ULTIMATE.init();" "39098#true") ("39098#true" "call #t~ret45.base, #t~ret45.offset := dll_create_master();" "39098#true") ("39098#true" "call #t~ret46 := main();" "39098#true") ("39098#true" "call #t~ret20.base, #t~ret20.offset := dll_create_generic(#funAddr~dll_insert_master.base, #funAddr~dll_insert_master.offset);" "39098#true") ("39226#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|))" "call dll_insert_slave(#~9.base, #~9.offset);" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39677#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))" "call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset);" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") }, internalTransitions = { ("39360#(exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume true;" "39360#(exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39300#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) (_ bv1 1)) |#valid|) (= (_ bv1 1) (select |#valid| |dll_insert_slave_#in~dll.base|)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|))))" "assume true;" "39300#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) (_ bv1 1)) |#valid|) (= (_ bv1 1) (select |#valid| |dll_insert_slave_#in~dll.base|)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|))))") ("39367#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base))" "~item~0.base, ~item~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~dll.offset, 4bv32;" "39371#(and (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |dll_insert_slave_#in~dll.base| |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_read~$Pointer$_#ptr.offset| |dll_insert_slave_#in~dll.offset|))") ("39176#(and (= (_ bv12 32) (select |#length| |alloc_or_die_master_#res.base|)) (= (bvadd (select |#valid| |alloc_or_die_master_#res.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |alloc_or_die_master_#res.offset|))" "assume true;" "39176#(and (= (_ bv12 32) (select |#length| |alloc_or_die_master_#res.base|)) (= (bvadd (select |#valid| |alloc_or_die_master_#res.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |alloc_or_die_master_#res.offset|))") ("39817#(and (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))))" "~item~0.base, ~item~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~dll.offset, 4bv32;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39243#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 4bv32), 4bv32;" "39243#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))") ("39243#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39243#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))") ("39243#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset;" "39262#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| |alloc_or_die_slave_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)) (= |#valid| (store |old(#valid)| |alloc_or_die_slave_#res.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#res.base|)))") ("39243#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))" "assume !(~ptr~0.base == 0bv32 && ~ptr~0.offset == 0bv32);" "39243#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))") ("39243#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 0bv32), 4bv32;" "39243#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))") ("39243#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39243#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))") ("39307#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) (_ bv1 1))) (= (_ bv1 1) (select |#valid| |##fun~$Pointer$~TO~VOID_#in~9.base|)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|)) (_ bv0 1)))" "assume true;" "39307#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) (_ bv1 1))) (= (_ bv1 1) (select |#valid| |##fun~$Pointer$~TO~VOID_#in~9.base|)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|)) (_ bv0 1)))") ("39371#(and (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |dll_insert_slave_#in~dll.base| |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_read~$Pointer$_#ptr.offset| |dll_insert_slave_#in~dll.offset|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39371#(and (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |dll_insert_slave_#in~dll.base| |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_read~$Pointer$_#ptr.offset| |dll_insert_slave_#in~dll.offset|))") ("39371#(and (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |dll_insert_slave_#in~dll.base| |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_read~$Pointer$_#ptr.offset| |dll_insert_slave_#in~dll.offset|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem5.base, #t~mem5.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~0.base, ~next~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~next~0.base, ~next~0.offset, ~item~0.base, ~bvadd32(~item~0.offset, 0bv32), 4bv32;" "39378#(exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select (select (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) dll_insert_slave_~next~0.base) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39183#(and (= (_ bv12 32) (select |#length| |dll_insert_master_#t~ret17.base|)) (= (_ bv0 32) |dll_insert_master_#t~ret17.offset|) (= (_ bv1 1) (select |#valid| |dll_insert_master_#t~ret17.base|)))" "~item~1.base, ~item~1.offset := #t~ret17.base, #t~ret17.offset;havoc #t~ret17.base, #t~ret17.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~dll.offset, 4bv32;" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))") ("39378#(exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select (select (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) dll_insert_slave_~next~0.base) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39378#(exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select (select (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) dll_insert_slave_~next~0.base) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39378#(exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select (select (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) dll_insert_slave_~next~0.base) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume ~next~0.base != 0bv32 || ~next~0.offset != 0bv32;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~next~0.base, ~bvadd32(~next~0.offset, 4bv32), 4bv32;" "39388#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39378#(exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select (select (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) dll_insert_slave_~next~0.base) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39378#(exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select (select (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) dll_insert_slave_~next~0.base) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "assume !(~next~3.base != 0bv32 || ~next~3.offset != 0bv32);" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))") ("39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))") ("39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem18.base, #t~mem18.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~3.base, ~next~3.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~next~3.base, ~next~3.offset, ~item~1.base, ~bvadd32(~item~1.offset, 0bv32), 4bv32;" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))") ("39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))") ("39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume true;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume !(~ptr~0.base == 0bv32 && ~ptr~0.offset == 0bv32);" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 0bv32), 4bv32;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem5.base, #t~mem5.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~0.base, ~next~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~next~0.base, ~next~0.offset, ~item~0.base, ~bvadd32(~item~0.offset, 0bv32), 4bv32;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 4bv32), 4bv32;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume ~next~0.base != 0bv32 || ~next~0.offset != 0bv32;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~next~0.base, ~bvadd32(~next~0.offset, 4bv32), 4bv32;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume true;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume true;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~dll.base, ~dll.offset, 4bv32;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39444#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)))" "assume !(~ptr~0.base == 0bv32 && ~ptr~0.offset == 0bv32);" "39444#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)))") ("39444#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)))" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 0bv32), 4bv32;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ptr~0.base, ~ptr~0.offset := #t~malloc2.base, #t~malloc2.offset;" "39339#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "39332#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#~9.base, #~9.offset := #in~9.base, #in~9.offset;" "39322#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume true;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "~item~0.base, ~item~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~dll.offset, 4bv32;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume !(~ptr~0.base == 0bv32 && ~ptr~0.offset == 0bv32);" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 0bv32), 4bv32;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem5.base, #t~mem5.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~0.base, ~next~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~next~0.base, ~next~0.offset, ~item~0.base, ~bvadd32(~item~0.offset, 0bv32), 4bv32;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 4bv32), 4bv32;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume ~next~0.base != 0bv32 || ~next~0.offset != 0bv32;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~next~0.base, ~bvadd32(~next~0.offset, 4bv32), 4bv32;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume true;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume true;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume !(~next~0.base != 0bv32 || ~next~0.offset != 0bv32);" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~dll.base, ~dll.offset, 4bv32;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39322#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#in~#fp.base == #funAddr~dll_insert_master.base && #in~#fp.offset == #funAddr~dll_insert_master.offset);" "39322#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))" "assume true;" "39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))") ("39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))" "assume true;" "39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))") ("39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))" "#res.base, #res.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;" "39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))") ("39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))" "assume true;" "39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))") ("39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))" "assume !(#t~nondet8 != 0bv32);havoc #t~nondet8;" "39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))") ("39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~#dll~0.base, ~#dll~0.offset, 4bv32;" "39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))") ("39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))") ("39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem10.base, #t~mem10.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;#res.base, #res.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~#dll~0.base, ~#dll~0.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0bv1];assume { :end_inline_ULTIMATE.dealloc } true;havoc ~#dll~0.base, ~#dll~0.offset;" "39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume true;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "~item~0.base, ~item~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~dll.offset, 4bv32;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem5.base, #t~mem5.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~0.base, ~next~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~next~0.base, ~next~0.offset, ~item~0.base, ~bvadd32(~item~0.offset, 0bv32), 4bv32;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 4bv32), 4bv32;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume ~next~0.base != 0bv32 || ~next~0.offset != 0bv32;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~next~0.base, ~bvadd32(~next~0.offset, 4bv32), 4bv32;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume true;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume true;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~dll.base, ~dll.offset, 4bv32;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))" "assume true;" "39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))") ("39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))" "assume true;" "39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))") ("39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))" "#res.base, #res.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;" "39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))") ("39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))" "assume true;" "39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))") ("39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))" "assume !(#t~nondet8 != 0bv32);havoc #t~nondet8;" "39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))") ("39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~#dll~0.base, ~#dll~0.offset, 4bv32;" "39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))") ("39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))") ("39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem10.base, #t~mem10.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;#res.base, #res.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~#dll~0.base, ~#dll~0.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0bv1];assume { :end_inline_ULTIMATE.dealloc } true;havoc ~#dll~0.base, ~#dll~0.offset;" "39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))") ("39388#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume true;" "39388#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39388#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39388#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39388#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39388#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39388#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume true;" "39388#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39388#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~dll.base, ~dll.offset, 4bv32;" "39388#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39388#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39388#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39388#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39388#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39262#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| |alloc_or_die_slave_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)) (= |#valid| (store |old(#valid)| |alloc_or_die_slave_#res.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#res.base|)))" "assume true;" "39262#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| |alloc_or_die_slave_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)) (= |#valid| (store |old(#valid)| |alloc_or_die_slave_#res.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#res.base|)))") ("39776#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|))" "assume !(#in~#fp.base == #funAddr~dll_insert_master.base && #in~#fp.offset == #funAddr~dll_insert_master.offset);" "39776#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|))") ("39269#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |#valid| (store |old(#valid)| |dll_insert_slave_#t~ret4.base| (_ bv1 1))) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= (_ bv0 1) (select |old(#valid)| |dll_insert_slave_#t~ret4.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_insert_slave_#t~ret4.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "~item~0.base, ~item~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~dll.offset, 4bv32;" "39273#(and (= (_ bv0 1) (select |old(#valid)| dll_insert_slave_~item~0.base)) (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "assume !(#in~#fp.base == #funAddr~dll_insert_master.base && #in~#fp.offset == #funAddr~dll_insert_master.offset);" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ptr~0.base, ~ptr~0.offset := #t~malloc2.base, #t~malloc2.offset;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ptr~0.base, ~ptr~0.offset := #t~malloc2.base, #t~malloc2.offset;" "39444#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ptr~0.base, ~ptr~0.offset := #t~malloc2.base, #t~malloc2.offset;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ptr~0.base, ~ptr~0.offset := #t~malloc2.base, #t~malloc2.offset;" "39243#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "~insert_fnc.base, ~insert_fnc.offset := #in~insert_fnc.base, #in~insert_fnc.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#dll~0.base, ~#dll~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~#dll~0.base, ~#dll~0.offset, 4bv32;" "39213#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "~insert_fnc.base, ~insert_fnc.offset := #in~insert_fnc.base, #in~insert_fnc.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#dll~0.base, ~#dll~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~#dll~0.base, ~#dll~0.offset, 4bv32;" "39677#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "39236#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "39786#(and (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "#~9.base, #~9.offset := #in~9.base, #in~9.offset;" "39776#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "#~9.base, #~9.offset := #in~9.base, #in~9.offset;" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "#~9.base, #~9.offset := #in~9.base, #in~9.offset;" "39226#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|))") ("39273#(and (= (_ bv0 1) (select |old(#valid)| dll_insert_slave_~item~0.base)) (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39277#(and (= (_ bv0 1) (select |old(#valid)| dll_insert_slave_~item~0.base)) (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))") ("39339#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(~ptr~0.base == 0bv32 && ~ptr~0.offset == 0bv32);" "39339#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39339#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 0bv32), 4bv32;" "39346#(and (= alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (= |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))") ("39916#(and (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))))" "~item~0.base, ~item~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~dll.offset, 4bv32;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39213#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39213#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))") ("39213#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39213#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))") ("39277#(and (= (_ bv0 1) (select |old(#valid)| dll_insert_slave_~item~0.base)) (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39277#(and (= (_ bv0 1) (select |old(#valid)| dll_insert_slave_~item~0.base)) (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))") ("39277#(and (= (_ bv0 1) (select |old(#valid)| dll_insert_slave_~item~0.base)) (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "assume !(~next~0.base != 0bv32 || ~next~0.offset != 0bv32);" "39277#(and (= (_ bv0 1) (select |old(#valid)| dll_insert_slave_~item~0.base)) (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))") ("39277#(and (= (_ bv0 1) (select |old(#valid)| dll_insert_slave_~item~0.base)) (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~dll.base, ~dll.offset, 4bv32;" "39293#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_insert_slave_write~$Pointer$_#value.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (bvadd (select |#valid| |dll_insert_slave_write~$Pointer$_#ptr.base|) (_ bv1 1)) (_ bv0 1)) (= |dll_insert_slave_#in~dll.offset| |dll_insert_slave_write~$Pointer$_#ptr.offset|) (= |dll_insert_slave_write~$Pointer$_#ptr.base| |dll_insert_slave_#in~dll.base|) (= |#valid| (store |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base|)))") ("39277#(and (= (_ bv0 1) (select |old(#valid)| dll_insert_slave_~item~0.base)) (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem5.base, #t~mem5.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~0.base, ~next~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~next~0.base, ~next~0.offset, ~item~0.base, ~bvadd32(~item~0.offset, 0bv32), 4bv32;" "39277#(and (= (_ bv0 1) (select |old(#valid)| dll_insert_slave_~item~0.base)) (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))") ("39277#(and (= (_ bv0 1) (select |old(#valid)| dll_insert_slave_~item~0.base)) (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39277#(and (= (_ bv0 1) (select |old(#valid)| dll_insert_slave_~item~0.base)) (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))") ("39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;#res.base, #res.offset := ~ptr~1.base, ~ptr~1.offset;" "39176#(and (= (_ bv12 32) (select |#length| |alloc_or_die_master_#res.base|)) (= (bvadd (select |#valid| |alloc_or_die_master_#res.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |alloc_or_die_master_#res.offset|))") ("39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))" "assume !(~ptr~1.base == 0bv32 && ~ptr~1.offset == 0bv32);" "39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))") ("39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~1.base, ~bvadd32(~ptr~1.offset, 0bv32), 4bv32;" "39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))") ("39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))") ("39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~1.base, ~bvadd32(~ptr~1.offset, 4bv32), 4bv32;" "39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))") ("39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))") ("39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~1.base, ~bvadd32(~ptr~1.offset, 8bv32), 4bv32;" "39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))") ("39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))") ("39346#(and (= alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (= |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 4bv32), 4bv32;" "39353#(and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (exists ((|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32))) (= (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|)) |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39346#(and (= alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (= |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39346#(and (= alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (= |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))") ("39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))" "assume true;" "39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))") ("39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))" "assume !!(#t~nondet8 != 0bv32);havoc #t~nondet8;" "39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))") ("39416#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)))))" "assume true;" "39416#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)))))") ("39416#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)))))" "assume !!(#t~nondet8 != 0bv32);havoc #t~nondet8;" "39416#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)))))") ("39353#(and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (exists ((|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32))) (= (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|)) |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39353#(and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (exists ((|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32))) (= (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|)) |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39353#(and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (exists ((|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32))) (= (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|)) |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset;" "39360#(exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39098#true" "assume #in~#fp.base == #funAddr~dll_insert_master.base && #in~#fp.offset == #funAddr~dll_insert_master.offset;" "39098#true") ("39098#true" "#NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];" "39098#true") ("39098#true" "assume true;" "39098#true") ("39098#true" "~insert_fnc.base, ~insert_fnc.offset := #in~insert_fnc.base, #in~insert_fnc.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#dll~0.base, ~#dll~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~#dll~0.base, ~#dll~0.offset, 4bv32;" "39098#true") ("39098#true" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39098#true") ("39098#true" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39098#true") ("39098#true" "#~9.base, #~9.offset := #in~9.base, #in~9.offset;" "39098#true") ("39098#true" "#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 12bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ptr~1.base, ~ptr~1.offset := #t~malloc3.base, #t~malloc3.offset;" "39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))") ("39098#true" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "39098#true") ("39226#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|))" "assume !(#in~#fp.base == #funAddr~dll_insert_master.base && #in~#fp.offset == #funAddr~dll_insert_master.offset);" "39226#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|))") ("39546#(and (= (_ bv0 32) dll_insert_master_~item~1.offset) (= (bvadd (select |#length| dll_insert_master_~item~1.base) (_ bv4294967284 32)) (_ bv0 32)))" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := #t~ret19.base, #t~ret19.offset, ~item~1.base, ~bvadd32(~item~1.offset, 8bv32), 4bv32;" "39550#(and (= (bvadd |dll_insert_master_write~$Pointer$_#sizeOfWrittenType| (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv8 32) |dll_insert_master_write~$Pointer$_#ptr.offset|) (= (bvadd (select |#length| |dll_insert_master_write~$Pointer$_#ptr.base|) (_ bv4294967284 32)) (_ bv0 32)))") ("39293#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_insert_slave_write~$Pointer$_#value.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (bvadd (select |#valid| |dll_insert_slave_write~$Pointer$_#ptr.base|) (_ bv1 1)) (_ bv0 1)) (= |dll_insert_slave_#in~dll.offset| |dll_insert_slave_write~$Pointer$_#ptr.offset|) (= |dll_insert_slave_write~$Pointer$_#ptr.base| |dll_insert_slave_#in~dll.base|) (= |#valid| (store |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base|)))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39293#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_insert_slave_write~$Pointer$_#value.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (bvadd (select |#valid| |dll_insert_slave_write~$Pointer$_#ptr.base|) (_ bv1 1)) (_ bv0 1)) (= |dll_insert_slave_#in~dll.offset| |dll_insert_slave_write~$Pointer$_#ptr.offset|) (= |dll_insert_slave_write~$Pointer$_#ptr.base| |dll_insert_slave_#in~dll.base|) (= |#valid| (store |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base|)))") ("39293#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_insert_slave_write~$Pointer$_#value.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (bvadd (select |#valid| |dll_insert_slave_write~$Pointer$_#ptr.base|) (_ bv1 1)) (_ bv0 1)) (= |dll_insert_slave_#in~dll.offset| |dll_insert_slave_write~$Pointer$_#ptr.offset|) (= |dll_insert_slave_write~$Pointer$_#ptr.base| |dll_insert_slave_#in~dll.base|) (= |#valid| (store |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base|)))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39300#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) (_ bv1 1)) |#valid|) (= (_ bv1 1) (select |#valid| |dll_insert_slave_#in~dll.base|)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|))))") ("39677#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39677#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))") ("39677#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39677#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))") ("39550#(and (= (bvadd |dll_insert_master_write~$Pointer$_#sizeOfWrittenType| (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv8 32) |dll_insert_master_write~$Pointer$_#ptr.offset|) (= (bvadd (select |#length| |dll_insert_master_write~$Pointer$_#ptr.base|) (_ bv4294967284 32)) (_ bv0 32)))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39550#(and (= (bvadd |dll_insert_master_write~$Pointer$_#sizeOfWrittenType| (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv8 32) |dll_insert_master_write~$Pointer$_#ptr.offset|) (= (bvadd (select |#length| |dll_insert_master_write~$Pointer$_#ptr.base|) (_ bv4294967284 32)) (_ bv0 32)))") ("39550#(and (= (bvadd |dll_insert_master_write~$Pointer$_#sizeOfWrittenType| (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv8 32) |dll_insert_master_write~$Pointer$_#ptr.offset|) (= (bvadd (select |#length| |dll_insert_master_write~$Pointer$_#ptr.base|) (_ bv4294967284 32)) (_ bv0 32)))" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "39099#false") }, returnTransitions = { ("39360#(exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "39332#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#753#return;" "39367#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base))") ("39300#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) (_ bv1 1)) |#valid|) (= (_ bv1 1) (select |#valid| |dll_insert_slave_#in~dll.base|)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|))))" "39226#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|))" "#717#return;" "39307#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) (_ bv1 1))) (= (_ bv1 1) (select |#valid| |##fun~$Pointer$~TO~VOID_#in~9.base|)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|)) (_ bv0 1)))") ("39176#(and (= (_ bv12 32) (select |#length| |alloc_or_die_master_#res.base|)) (= (bvadd (select |#valid| |alloc_or_die_master_#res.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |alloc_or_die_master_#res.offset|))" "39098#true" "#691#return;" "39183#(and (= (_ bv12 32) (select |#length| |dll_insert_master_#t~ret17.base|)) (= (_ bv0 32) |dll_insert_master_#t~ret17.offset|) (= (_ bv1 1) (select |#valid| |dll_insert_master_#t~ret17.base|)))") ("39307#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) (_ bv1 1))) (= (_ bv1 1) (select |#valid| |##fun~$Pointer$~TO~VOID_#in~9.base|)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|)) (_ bv0 1)))" "39213#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))" "#695#return;" "39314#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|) (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "39776#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|))" "#717#return;" "39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))" "#699#return;" "39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))") ("39891#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "39786#(and (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "#753#return;" "39916#(and (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "39776#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|))" "#717#return;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "#753#return;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "#717#return;" "39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "39769#(and (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|) (_ bv0 1)) (= |#length| (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)))" "#697#return;" "39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "39786#(and (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "#753#return;" "39817#(and (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))))") ("39705#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|))))" "39677#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))" "#695#return;" "39769#(and (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|) (_ bv0 1)) (= |#length| (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)))") ("39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "#693#return;" "39546#(and (= (_ bv0 32) dll_insert_master_~item~1.offset) (= (bvadd (select |#length| dll_insert_master_~item~1.base) (_ bv4294967284 32)) (_ bv0 32)))") ("39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "#685#return;" "39962#(exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_91 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_92 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) v_prenex_92)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) v_prenex_92 v_prenex_91))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "#753#return;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "#717#return;" "39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39451#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "39416#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)))))" "#699#return;" "39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))") ("39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "#693#return;" "39546#(and (= (_ bv0 32) dll_insert_master_~item~1.offset) (= (bvadd (select |#length| dll_insert_master_~item~1.base) (_ bv4294967284 32)) (_ bv0 32)))") ("39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "#685#return;" "39515#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (v_prenex_80 (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32)) (alloc_or_die_slave_~ptr~0.base (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= (_ bv0 1) (select (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)) alloc_or_die_slave_~ptr~0.base)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79) alloc_or_die_slave_~ptr~0.base v_prenex_80))))") ("39388#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "39314#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|) (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "#697#return;" "39416#(exists ((v_arrayElimCell_48 (_ BitVec 32)) (|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|dll_create_generic_~#dll~0.base| (_ BitVec 32)) (v_prenex_79 (_ BitVec 32))) (and (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48) (_ bv0 1)) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_arrayElimCell_48 |alloc_or_die_slave_#Ultimate.alloc_~size|) |alloc_or_die_slave_write~$Pointer$_#ptr.base| v_prenex_79)) (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_arrayElimCell_48 (_ bv1 1)) |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1)))))") ("39388#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))" "39322#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#717#return;" "39388#(exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39262#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| |alloc_or_die_slave_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)) (= |#valid| (store |old(#valid)| |alloc_or_die_slave_#res.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#res.base|)))" "39236#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "#753#return;" "39269#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |#valid| (store |old(#valid)| |dll_insert_slave_#t~ret4.base| (_ bv1 1))) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= (_ bv0 1) (select |old(#valid)| |dll_insert_slave_#t~ret4.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_insert_slave_#t~ret4.base| |alloc_or_die_slave_#Ultimate.alloc_~size|))))") ("39098#true" "39098#true" "#749#return;" "39098#true") } ); [2018-11-10 06:08:15,156 FATAL L840 BasicCegarLoop]: enhanced automaton: [2018-11-10 06:08:15,156 FATAL L841 BasicCegarLoop]: NestedWordAutomaton nwa = ( callAlphabet = {"call dll_destroy_nested_lists(~dll~1.base, ~dll~1.offset);" "call inspect_dangling(~dll~1.base, ~dll~1.offset);" "call dll_reinit_nested_lists(~dll~1.base, ~dll~1.offset);" "call inspect_init(~dll~1.base, ~dll~1.offset);" "call dll_destroy_master(~dll~1.base, ~dll~1.offset);" "call dll_insert_master(#~9.base, #~9.offset);" "call dll_insert_slave(#~9.base, #~9.offset);" "call inspect_base(~dll.base, ~dll.offset);" "call fail();" "call fail();" "call fail();" "call fail();" "call fail();" "call fail();" "call fail();" "call inspect_base(~dll.base, ~dll.offset);" "call fail();" "call fail();" "call fail();" "call fail();" "call fail();" "call fail();" "call ULTIMATE.init();" "call #t~ret11.base, #t~ret11.offset := dll_create_generic(#funAddr~dll_insert_slave.base, #funAddr~dll_insert_slave.offset);" "call #t~ret46 := main();" "call #t~ret20.base, #t~ret20.offset := dll_create_generic(#funAddr~dll_insert_master.base, #funAddr~dll_insert_master.offset);" "call dll_destroy_slave(#t~mem13.base, #t~mem13.offset);" "call #t~ret4.base, #t~ret4.offset := alloc_or_die_slave();" "call inspect_base(~dll.base, ~dll.offset);" "call #t~ret17.base, #t~ret17.offset := alloc_or_die_master();" "call fail();" "call #t~ret19.base, #t~ret19.offset := dll_create_slave();" "call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset);" "call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset);" "call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset);" "call #t~ret45.base, #t~ret45.offset := dll_create_master();" "call inspect_full(~dll~1.base, ~dll~1.offset);" }, internalAlphabet = {"SUMMARY for call #t~ret11.base, #t~ret11.offset := dll_create_generic(#funAddr~dll_insert_slave.base, #funAddr~dll_insert_slave.offset); srcloc: dll_create_slaveENTRY" "#res.base, #res.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;" "assume true;" "SUMMARY for call #t~ret20.base, #t~ret20.offset := dll_create_generic(#funAddr~dll_insert_master.base, #funAddr~dll_insert_master.offset); srcloc: dll_create_masterENTRY" "#res.base, #res.offset := #t~ret20.base, #t~ret20.offset;havoc #t~ret20.base, #t~ret20.offset;" "assume true;" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "assume true;" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 8bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem13.base, #t~mem13.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "SUMMARY for call dll_destroy_slave(#t~mem13.base, #t~mem13.offset); srcloc: L599" "havoc #t~mem13.base, #t~mem13.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem14.base, #t~mem14.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset;" "assume !true;" "assume true;" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "SUMMARY for call #t~ret17.base, #t~ret17.offset := alloc_or_die_master(); srcloc: L620" "~item~1.base, ~item~1.offset := #t~ret17.base, #t~ret17.offset;havoc #t~ret17.base, #t~ret17.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~dll.offset, 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem18.base, #t~mem18.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~3.base, ~next~3.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~next~3.base, ~next~3.offset, ~item~1.base, ~bvadd32(~item~1.offset, 0bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "assume ~next~3.base != 0bv32 || ~next~3.offset != 0bv32;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~1.base, ~item~1.offset, ~next~3.base, ~bvadd32(~next~3.offset, 4bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "assume !(~next~3.base != 0bv32 || ~next~3.offset != 0bv32);" "SUMMARY for call #t~ret19.base, #t~ret19.offset := dll_create_slave(); srcloc: L623-2" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := #t~ret19.base, #t~ret19.offset, ~item~1.base, ~bvadd32(~item~1.offset, 8bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;havoc #t~ret19.base, #t~ret19.offset;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~1.base, ~item~1.offset, ~dll.base, ~dll.offset, 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "assume true;" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "assume true;" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem16.base, #t~mem16.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~2.base, ~next~2.offset := #t~mem16.base, #t~mem16.offset;havoc #t~mem16.base, #t~mem16.offset;" "assume !(~dll.offset == 0bv32);" "assume ~dll.offset == 0bv32;" "assume !(~dll.base == 0bv32 || #valid[~dll.base] == 1bv1);" "assume ~dll.base == 0bv32 || #valid[~dll.base] == 1bv1;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~dll.base, ~dll.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0bv1];assume { :end_inline_ULTIMATE.dealloc } true;~dll.base, ~dll.offset := ~next~2.base, ~next~2.offset;" "assume !true;" "assume true;" "~insert_fnc.base, ~insert_fnc.offset := #in~insert_fnc.base, #in~insert_fnc.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#dll~0.base, ~#dll~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~#dll~0.base, ~#dll~0.offset, 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "SUMMARY for call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset); srcloc: L578" "SUMMARY for call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset); srcloc: L578-1" "assume true;" "assume !(#t~nondet8 != 0bv32);havoc #t~nondet8;" "assume !!(#t~nondet8 != 0bv32);havoc #t~nondet8;" "SUMMARY for call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset); srcloc: L581" "assume !true;" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~#dll~0.base, ~#dll~0.offset, 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem10.base, #t~mem10.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;#res.base, #res.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~#dll~0.base, ~#dll~0.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0bv1];assume { :end_inline_ULTIMATE.dealloc } true;havoc ~#dll~0.base, ~#dll~0.offset;" "assume true;" "SUMMARY for call #t~ret45.base, #t~ret45.offset := dll_create_master(); srcloc: mainENTRY" "~dll~1.base, ~dll~1.offset := #t~ret45.base, #t~ret45.offset;havoc #t~ret45.base, #t~ret45.offset;" "SUMMARY for call inspect_full(~dll~1.base, ~dll~1.offset); srcloc: L673" "SUMMARY for call dll_destroy_nested_lists(~dll~1.base, ~dll~1.offset); srcloc: L673-1" "SUMMARY for call inspect_dangling(~dll~1.base, ~dll~1.offset); srcloc: L674" "SUMMARY for call dll_reinit_nested_lists(~dll~1.base, ~dll~1.offset); srcloc: L675" "SUMMARY for call inspect_init(~dll~1.base, ~dll~1.offset); srcloc: L676" "SUMMARY for call dll_destroy_master(~dll~1.base, ~dll~1.offset); srcloc: L677" "#res := 0bv32;" "assume #valid == old(#valid);" "assume !(#valid == old(#valid));" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "assume true;" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem12.base, #t~mem12.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~1.base, ~next~1.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;" "assume !(~dll.offset == 0bv32);" "assume ~dll.offset == 0bv32;" "assume !(~dll.base == 0bv32 || #valid[~dll.base] == 1bv1);" "assume ~dll.base == 0bv32 || #valid[~dll.base] == 1bv1;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~dll.base, ~dll.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0bv1];assume { :end_inline_ULTIMATE.dealloc } true;~dll.base, ~dll.offset := ~next~1.base, ~next~1.offset;" "assume !true;" "assume true;" "assume false;" "assume true;" "#NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];" "assume true;" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "assume true;" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~dll.base, ~bvadd32(~dll.offset, 8bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem15.base, #t~mem15.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset;" "assume !true;" "assume true;" "#~9.base, #~9.offset := #in~9.base, #in~9.offset;" "assume #in~#fp.base == #funAddr~dll_insert_master.base && #in~#fp.offset == #funAddr~dll_insert_master.offset;" "SUMMARY for call dll_insert_master(#~9.base, #~9.offset); srcloc: L-1-1" "assume !(#in~#fp.base == #funAddr~dll_insert_master.base && #in~#fp.offset == #funAddr~dll_insert_master.offset);" "SUMMARY for call dll_insert_slave(#~9.base, #~9.offset); srcloc: L-1-3" "assume true;" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "SUMMARY for call inspect_base(~dll.base, ~dll.offset); srcloc: L666" "assume true;" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 8bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem44.base, #t~mem44.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume !(#t~mem44.base == 0bv32 && #t~mem44.offset == 0bv32);havoc #t~mem44.base, #t~mem44.offset;" "SUMMARY for call fail(); srcloc: L668-2" "assume !!(#t~mem44.base == 0bv32 && #t~mem44.offset == 0bv32);havoc #t~mem44.base, #t~mem44.offset;" "assume true;" "assume !true;" "assume !true;" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem43.base, #t~mem43.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset;" "assume !true;" "assume true;" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "assume true;" "assume ~dll.base == 0bv32 && ~dll.offset == 0bv32;" "SUMMARY for call fail(); srcloc: L634-2" "assume !(~dll.base == 0bv32 && ~dll.offset == 0bv32);" "assume true;" "assume !true;" "assume !true;" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem21.base, #t~mem21.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume #t~mem21.base == 0bv32 && #t~mem21.offset == 0bv32;havoc #t~mem21.base, #t~mem21.offset;" "SUMMARY for call fail(); srcloc: L635-1" "assume !(#t~mem21.base == 0bv32 && #t~mem21.offset == 0bv32);havoc #t~mem21.base, #t~mem21.offset;" "assume true;" "assume !true;" "assume !true;" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 4bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem22.base, #t~mem22.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume !(#t~mem22.base == 0bv32 && #t~mem22.offset == 0bv32);havoc #t~mem22.base, #t~mem22.offset;" "SUMMARY for call fail(); srcloc: L636-1" "assume !!(#t~mem22.base == 0bv32 && #t~mem22.offset == 0bv32);havoc #t~mem22.base, #t~mem22.offset;" "assume true;" "assume !true;" "assume !true;" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem23.base, #t~mem23.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset;" "assume true;" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 4bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem25.base, #t~mem25.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume #t~mem25.base == 0bv32 && #t~mem25.offset == 0bv32;havoc #t~mem25.base, #t~mem25.offset;" "SUMMARY for call fail(); srcloc: L638-2" "assume !(#t~mem25.base == 0bv32 && #t~mem25.offset == 0bv32);havoc #t~mem25.base, #t~mem25.offset;" "assume true;" "assume !true;" "assume !true;" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 4bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem26.base, #t~mem26.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := #t~mem26.base, ~bvadd32(#t~mem26.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem27.base, #t~mem27.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume #t~mem27.base == 0bv32 && #t~mem27.offset == 0bv32;havoc #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;" "SUMMARY for call fail(); srcloc: L639-1" "assume !(#t~mem27.base == 0bv32 && #t~mem27.offset == 0bv32);havoc #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;" "assume true;" "assume !true;" "assume !true;" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 4bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem28.base, #t~mem28.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := #t~mem28.base, ~bvadd32(#t~mem28.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem29.base, #t~mem29.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume !(#t~mem29.base == ~dll.base && #t~mem29.offset == ~dll.offset);havoc #t~mem28.base, #t~mem28.offset;havoc #t~mem29.base, #t~mem29.offset;" "SUMMARY for call fail(); srcloc: L640-1" "assume !!(#t~mem29.base == ~dll.base && #t~mem29.offset == ~dll.offset);havoc #t~mem28.base, #t~mem28.offset;havoc #t~mem29.base, #t~mem29.offset;" "assume true;" "assume !true;" "assume !true;" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem24.base, #t~mem24.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem24.base, #t~mem24.offset;havoc #t~mem24.base, #t~mem24.offset;" "assume !true;" "assume true;" "#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ptr~0.base, ~ptr~0.offset := #t~malloc2.base, #t~malloc2.offset;" "assume ~ptr~0.base == 0bv32 && ~ptr~0.offset == 0bv32;assume false;" "assume !(~ptr~0.base == 0bv32 && ~ptr~0.offset == 0bv32);" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 0bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 4bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset;" "assume true;" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "SUMMARY for call inspect_base(~dll.base, ~dll.offset); srcloc: L645" "assume true;" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 8bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem31.base, #t~mem31.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~pos~0.base, ~pos~0.offset := #t~mem31.base, #t~mem31.offset;havoc #t~mem31.base, #t~mem31.offset;" "assume true;" "assume ~pos~0.base == 0bv32 && ~pos~0.offset == 0bv32;" "SUMMARY for call fail(); srcloc: L648-2" "assume !(~pos~0.base == 0bv32 && ~pos~0.offset == 0bv32);" "assume true;" "assume !true;" "assume !true;" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem32.base, #t~mem32.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume #t~mem32.base == 0bv32 && #t~mem32.offset == 0bv32;havoc #t~mem32.base, #t~mem32.offset;" "SUMMARY for call fail(); srcloc: L649-1" "assume !(#t~mem32.base == 0bv32 && #t~mem32.offset == 0bv32);havoc #t~mem32.base, #t~mem32.offset;" "assume true;" "assume !true;" "assume !true;" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 4bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem33.base, #t~mem33.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume !(#t~mem33.base == 0bv32 && #t~mem33.offset == 0bv32);havoc #t~mem33.base, #t~mem33.offset;" "SUMMARY for call fail(); srcloc: L650-1" "assume !!(#t~mem33.base == 0bv32 && #t~mem33.offset == 0bv32);havoc #t~mem33.base, #t~mem33.offset;" "assume true;" "assume !true;" "assume !true;" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem34.base, #t~mem34.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~pos~0.base, ~pos~0.offset := #t~mem34.base, #t~mem34.offset;havoc #t~mem34.base, #t~mem34.offset;" "assume true;" "assume !(~pos~0.base != 0bv32 || ~pos~0.offset != 0bv32);" "assume !!(~pos~0.base != 0bv32 || ~pos~0.offset != 0bv32);" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 4bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem36.base, #t~mem36.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume #t~mem36.base == 0bv32 && #t~mem36.offset == 0bv32;havoc #t~mem36.base, #t~mem36.offset;" "SUMMARY for call fail(); srcloc: L652-2" "assume !(#t~mem36.base == 0bv32 && #t~mem36.offset == 0bv32);havoc #t~mem36.base, #t~mem36.offset;" "assume true;" "assume !true;" "assume !true;" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 4bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem37.base, #t~mem37.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := #t~mem37.base, ~bvadd32(#t~mem37.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem38.base, #t~mem38.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume #t~mem38.base == 0bv32 && #t~mem38.offset == 0bv32;havoc #t~mem38.base, #t~mem38.offset;havoc #t~mem37.base, #t~mem37.offset;" "SUMMARY for call fail(); srcloc: L653-1" "assume !(#t~mem38.base == 0bv32 && #t~mem38.offset == 0bv32);havoc #t~mem38.base, #t~mem38.offset;havoc #t~mem37.base, #t~mem37.offset;" "assume true;" "assume !true;" "assume !true;" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 4bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem39.base, #t~mem39.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := #t~mem39.base, ~bvadd32(#t~mem39.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem40.base, #t~mem40.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume !(#t~mem40.base == ~pos~0.base && #t~mem40.offset == ~pos~0.offset);havoc #t~mem40.base, #t~mem40.offset;havoc #t~mem39.base, #t~mem39.offset;" "SUMMARY for call fail(); srcloc: L654-1" "assume !!(#t~mem40.base == ~pos~0.base && #t~mem40.offset == ~pos~0.offset);havoc #t~mem40.base, #t~mem40.offset;havoc #t~mem39.base, #t~mem39.offset;" "assume true;" "assume !true;" "assume !true;" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem35.base, #t~mem35.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~pos~0.base, ~pos~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset;" "assume !true;" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem30.base, #t~mem30.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem30.base, #t~mem30.offset;havoc #t~mem30.base, #t~mem30.offset;" "assume !true;" "assume true;" "#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 12bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ptr~1.base, ~ptr~1.offset := #t~malloc3.base, #t~malloc3.offset;" "assume ~ptr~1.base == 0bv32 && ~ptr~1.offset == 0bv32;assume false;" "assume !(~ptr~1.base == 0bv32 && ~ptr~1.offset == 0bv32);" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~1.base, ~bvadd32(~ptr~1.offset, 0bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~1.base, ~bvadd32(~ptr~1.offset, 4bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~1.base, ~bvadd32(~ptr~1.offset, 8bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;#res.base, #res.offset := ~ptr~1.base, ~ptr~1.offset;" "assume true;" "SUMMARY for call ULTIMATE.init(); srcloc: ULTIMATE.startENTRY" "SUMMARY for call #t~ret46 := main(); srcloc: L-1" "assume true;" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "SUMMARY for call #t~ret4.base, #t~ret4.offset := alloc_or_die_slave(); srcloc: L568" "~item~0.base, ~item~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~dll.offset, 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem5.base, #t~mem5.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~0.base, ~next~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~next~0.base, ~next~0.offset, ~item~0.base, ~bvadd32(~item~0.offset, 0bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "assume ~next~0.base != 0bv32 || ~next~0.offset != 0bv32;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~next~0.base, ~bvadd32(~next~0.offset, 4bv32), 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "assume !(~next~0.base != 0bv32 || ~next~0.offset != 0bv32);" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~dll.base, ~dll.offset, 4bv32;" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "assume true;" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "SUMMARY for call inspect_base(~dll.base, ~dll.offset); srcloc: L660" "assume true;" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 8bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem42.base, #t~mem42.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "assume #t~mem42.base == 0bv32 && #t~mem42.offset == 0bv32;havoc #t~mem42.base, #t~mem42.offset;" "SUMMARY for call fail(); srcloc: L662-2" "assume !(#t~mem42.base == 0bv32 && #t~mem42.offset == 0bv32);havoc #t~mem42.base, #t~mem42.offset;" "assume true;" "assume !true;" "assume !true;" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem41.base, #t~mem41.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem41.base, #t~mem41.offset;havoc #t~mem41.base, #t~mem41.offset;" "assume !true;" "assume true;" }, returnAlphabet = {"#705#return;" "#707#return;" "#709#return;" "#711#return;" "#713#return;" "#715#return;" "#717#return;" "#719#return;" "#721#return;" "#723#return;" "#725#return;" "#727#return;" "#729#return;" "#731#return;" "#733#return;" "#735#return;" "#737#return;" "#739#return;" "#741#return;" "#743#return;" "#745#return;" "#747#return;" "#749#return;" "#685#return;" "#751#return;" "#687#return;" "#689#return;" "#753#return;" "#755#return;" "#691#return;" "#757#return;" "#693#return;" "#695#return;" "#697#return;" "#699#return;" "#701#return;" "#703#return;" }, states = {"40066#(and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (exists ((|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32))) (= (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|)) |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))" "40070#(and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= |#valid| (store |old(#valid)| |alloc_or_die_slave_#res.base| (_ bv1 1))) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (exists ((|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32))) (= (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|)) |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))" "40074#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |#valid| (store |old(#valid)| |dll_insert_slave_#t~ret4.base| (_ bv1 1))) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base))" "39307#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) (_ bv1 1))) (= (_ bv1 1) (select |#valid| |##fun~$Pointer$~TO~VOID_#in~9.base|)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|)) (_ bv0 1)))" "40077#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_read~$Pointer$_#ptr.offset| |dll_insert_slave_#in~dll.offset|) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))" "39183#(and (= (_ bv12 32) (select |#length| |dll_insert_master_#t~ret17.base|)) (= (_ bv0 32) |dll_insert_master_#t~ret17.offset|) (= (_ bv1 1) (select |#valid| |dll_insert_master_#t~ret17.base|)))" "40080#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |dll_insert_slave_#in~dll.base| |dll_insert_slave_read~$Pointer$_#ptr.base|) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_read~$Pointer$_#ptr.offset| |dll_insert_slave_#in~dll.offset|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))" "39314#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|) (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "40083#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |dll_insert_slave_#in~dll.base| |dll_insert_slave_read~$Pointer$_#ptr.base|) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_read~$Pointer$_#ptr.offset| |dll_insert_slave_#in~dll.offset|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select (select (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) dll_insert_slave_~next~0.base) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "40087#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select (select (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) dll_insert_slave_~next~0.base) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))" "39322#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "40090#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))" "40093#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= (bvadd (select |#valid| |dll_insert_slave_write~$Pointer$_#ptr.base|) (_ bv1 1)) (_ bv0 1)) (= |dll_insert_slave_#in~dll.offset| |dll_insert_slave_write~$Pointer$_#ptr.offset|) (= |dll_insert_slave_write~$Pointer$_#ptr.base| |dll_insert_slave_#in~dll.base|) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (= |#valid| (store |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "40097#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_#in~dll.offset| |dll_insert_slave_write~$Pointer$_#ptr.offset|) (= |dll_insert_slave_write~$Pointer$_#ptr.base| |dll_insert_slave_#in~dll.base|) (= (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) (_ bv1 1)) |#valid|) (= (_ bv1 1) (select |#valid| |dll_insert_slave_#in~dll.base|)) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (= |#valid| (store |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "39332#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "40037#(and (= (_ bv12 32) (select |#length| |alloc_or_die_master_#res.base|)) (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)) (= (bvadd (select |#valid| |alloc_or_die_master_#res.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |alloc_or_die_master_#res.offset|))" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "39339#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "39213#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))" "39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))" "39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))" "39098#true" "40062#(and (= alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (= |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" }, initialStates = {"39098#true" }, finalStates = {}, callTransitions = { ("39314#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|) (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "call #t~ret19.base, #t~ret19.offset := dll_create_slave();" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "call dll_destroy_slave(#t~mem13.base, #t~mem13.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "call #t~ret17.base, #t~ret17.offset := alloc_or_die_master();" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "call inspect_base(~dll.base, ~dll.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "call #t~ret45.base, #t~ret45.offset := dll_create_master();" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "call #t~ret11.base, #t~ret11.offset := dll_create_generic(#funAddr~dll_insert_slave.base, #funAddr~dll_insert_slave.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "call #t~ret20.base, #t~ret20.offset := dll_create_generic(#funAddr~dll_insert_master.base, #funAddr~dll_insert_master.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "call inspect_base(~dll.base, ~dll.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "call inspect_base(~dll.base, ~dll.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39322#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "call dll_insert_master(#~9.base, #~9.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39322#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "call dll_insert_slave(#~9.base, #~9.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39332#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "call #t~ret4.base, #t~ret4.offset := alloc_or_die_slave();" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39213#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))" "call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))" "call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39098#true" "call dll_destroy_nested_lists(~dll~1.base, ~dll~1.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39098#true" "call dll_destroy_slave(#t~mem13.base, #t~mem13.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39098#true" "call inspect_dangling(~dll~1.base, ~dll~1.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39098#true" "call dll_reinit_nested_lists(~dll~1.base, ~dll~1.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39098#true" "call inspect_init(~dll~1.base, ~dll~1.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39098#true" "call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39098#true" "call dll_destroy_master(~dll~1.base, ~dll~1.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39098#true" "call ##fun~$Pointer$~TO~VOID(~#dll~0.base, ~#dll~0.offset, ~insert_fnc.base, ~insert_fnc.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39098#true" "call ULTIMATE.init();" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39098#true" "call #t~ret46 := main();" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39098#true" "call inspect_full(~dll~1.base, ~dll~1.offset);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") }, internalTransitions = { ("40066#(and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (exists ((|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32))) (= (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|)) |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "40066#(and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (exists ((|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32))) (= (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|)) |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))") ("40066#(and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (exists ((|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32))) (= (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|)) |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset;" "40070#(and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= |#valid| (store |old(#valid)| |alloc_or_die_slave_#res.base| (_ bv1 1))) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (exists ((|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32))) (= (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|)) |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))") ("40070#(and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= |#valid| (store |old(#valid)| |alloc_or_die_slave_#res.base| (_ bv1 1))) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (exists ((|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32))) (= (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|)) |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))" "assume true;" "40070#(and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= |#valid| (store |old(#valid)| |alloc_or_die_slave_#res.base| (_ bv1 1))) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (exists ((|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32))) (= (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|)) |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))") ("40074#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |#valid| (store |old(#valid)| |dll_insert_slave_#t~ret4.base| (_ bv1 1))) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base))" "~item~0.base, ~item~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~dll.offset, 4bv32;" "40077#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_read~$Pointer$_#ptr.offset| |dll_insert_slave_#in~dll.offset|) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))") ("39307#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) (_ bv1 1))) (= (_ bv1 1) (select |#valid| |##fun~$Pointer$~TO~VOID_#in~9.base|)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|)) (_ bv0 1)))" "assume true;" "39307#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) (_ bv1 1))) (= (_ bv1 1) (select |#valid| |##fun~$Pointer$~TO~VOID_#in~9.base|)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|)) (_ bv0 1)))") ("40077#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_read~$Pointer$_#ptr.offset| |dll_insert_slave_#in~dll.offset|) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "40080#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |dll_insert_slave_#in~dll.base| |dll_insert_slave_read~$Pointer$_#ptr.base|) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_read~$Pointer$_#ptr.offset| |dll_insert_slave_#in~dll.offset|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))") ("39183#(and (= (_ bv12 32) (select |#length| |dll_insert_master_#t~ret17.base|)) (= (_ bv0 32) |dll_insert_master_#t~ret17.offset|) (= (_ bv1 1) (select |#valid| |dll_insert_master_#t~ret17.base|)))" "~item~1.base, ~item~1.offset := #t~ret17.base, #t~ret17.offset;havoc #t~ret17.base, #t~ret17.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~dll.offset, 4bv32;" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))") ("40080#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |dll_insert_slave_#in~dll.base| |dll_insert_slave_read~$Pointer$_#ptr.base|) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_read~$Pointer$_#ptr.offset| |dll_insert_slave_#in~dll.offset|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem5.base, #t~mem5.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~0.base, ~next~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~next~0.base, ~next~0.offset, ~item~0.base, ~bvadd32(~item~0.offset, 0bv32), 4bv32;" "40083#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |dll_insert_slave_#in~dll.base| |dll_insert_slave_read~$Pointer$_#ptr.base|) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_read~$Pointer$_#ptr.offset| |dll_insert_slave_#in~dll.offset|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select (select (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) dll_insert_slave_~next~0.base) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))") ("39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))") ("39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "assume !(~next~3.base != 0bv32 || ~next~3.offset != 0bv32);" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))") ("39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))") ("39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))") ("39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))") ("39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem18.base, #t~mem18.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~3.base, ~next~3.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~next~3.base, ~next~3.offset, ~item~1.base, ~bvadd32(~item~1.offset, 0bv32), 4bv32;" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))") ("39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))") ("39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))") ("39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "assume ~next~3.base != 0bv32 || ~next~3.offset != 0bv32;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~1.base, ~item~1.offset, ~next~3.base, ~bvadd32(~next~3.offset, 4bv32), 4bv32;" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))") ("39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))") ("39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))") ("39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))") ("40083#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |dll_insert_slave_#in~dll.base| |dll_insert_slave_read~$Pointer$_#ptr.base|) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_read~$Pointer$_#ptr.offset| |dll_insert_slave_#in~dll.offset|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select (select (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) dll_insert_slave_~next~0.base) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "40087#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select (select (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) dll_insert_slave_~next~0.base) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))") ("40083#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |dll_insert_slave_#in~dll.base| |dll_insert_slave_read~$Pointer$_#ptr.base|) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_read~$Pointer$_#ptr.offset| |dll_insert_slave_#in~dll.offset|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select (select (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) dll_insert_slave_~next~0.base) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "40083#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |dll_insert_slave_#in~dll.base| |dll_insert_slave_read~$Pointer$_#ptr.base|) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_read~$Pointer$_#ptr.offset| |dll_insert_slave_#in~dll.offset|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select (select (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) dll_insert_slave_~next~0.base) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 4bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem37.base, #t~mem37.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := #t~mem37.base, ~bvadd32(#t~mem37.offset, 0bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 8bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem38.base, #t~mem38.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem13.base, #t~mem13.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "havoc #t~mem13.base, #t~mem13.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#t~mem38.base == 0bv32 && #t~mem38.offset == 0bv32);havoc #t~mem38.base, #t~mem38.offset;havoc #t~mem37.base, #t~mem37.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem14.base, #t~mem14.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 4bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem39.base, #t~mem39.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := #t~mem39.base, ~bvadd32(#t~mem39.offset, 0bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem40.base, #t~mem40.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !!(#t~mem40.base == ~pos~0.base && #t~mem40.offset == ~pos~0.offset);havoc #t~mem40.base, #t~mem40.offset;havoc #t~mem39.base, #t~mem39.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 0bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem35.base, #t~mem35.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~pos~0.base, ~pos~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem30.base, #t~mem30.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem30.base, #t~mem30.offset;havoc #t~mem30.base, #t~mem30.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem16.base, #t~mem16.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~2.base, ~next~2.offset := #t~mem16.base, #t~mem16.offset;havoc #t~mem16.base, #t~mem16.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 12bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ptr~1.base, ~ptr~1.offset := #t~malloc3.base, #t~malloc3.offset;" "39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(~dll.offset == 0bv32);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume ~dll.offset == 0bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(~dll.base == 0bv32 || #valid[~dll.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume ~dll.base == 0bv32 || #valid[~dll.base] == 1bv1;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~dll.base, ~dll.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0bv1];assume { :end_inline_ULTIMATE.dealloc } true;~dll.base, ~dll.offset := ~next~2.base, ~next~2.offset;" "39098#true") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "~insert_fnc.base, ~insert_fnc.offset := #in~insert_fnc.base, #in~insert_fnc.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#dll~0.base, ~#dll~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~#dll~0.base, ~#dll~0.offset, 4bv32;" "39213#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "39332#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem12.base, #t~mem12.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~1.base, ~next~1.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(~dll.offset == 0bv32);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume ~dll.offset == 0bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(~dll.base == 0bv32 || #valid[~dll.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume ~dll.base == 0bv32 || #valid[~dll.base] == 1bv1;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~dll.base, ~dll.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0bv1];assume { :end_inline_ULTIMATE.dealloc } true;~dll.base, ~dll.offset := ~next~1.base, ~next~1.offset;" "39098#true") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 8bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem42.base, #t~mem42.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];" "39098#true") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#t~mem42.base == 0bv32 && #t~mem42.offset == 0bv32);havoc #t~mem42.base, #t~mem42.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~dll.base, ~bvadd32(~dll.offset, 8bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem41.base, #t~mem41.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem41.base, #t~mem41.offset;havoc #t~mem41.base, #t~mem41.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#~9.base, #~9.offset := #in~9.base, #in~9.offset;" "39322#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 8bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem44.base, #t~mem44.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !!(#t~mem44.base == 0bv32 && #t~mem44.offset == 0bv32);havoc #t~mem44.base, #t~mem44.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem43.base, #t~mem43.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(~dll.base == 0bv32 && ~dll.offset == 0bv32);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem21.base, #t~mem21.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#t~mem21.base == 0bv32 && #t~mem21.offset == 0bv32);havoc #t~mem21.base, #t~mem21.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 4bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem22.base, #t~mem22.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !!(#t~mem22.base == 0bv32 && #t~mem22.offset == 0bv32);havoc #t~mem22.base, #t~mem22.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem23.base, #t~mem23.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 4bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem25.base, #t~mem25.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#t~mem25.base == 0bv32 && #t~mem25.offset == 0bv32);havoc #t~mem25.base, #t~mem25.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 4bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem26.base, #t~mem26.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := #t~mem26.base, ~bvadd32(#t~mem26.offset, 0bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem27.base, #t~mem27.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#t~mem27.base == 0bv32 && #t~mem27.offset == 0bv32);havoc #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 4bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem28.base, #t~mem28.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := #t~mem28.base, ~bvadd32(#t~mem28.offset, 0bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem29.base, #t~mem29.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !!(#t~mem29.base == ~dll.base && #t~mem29.offset == ~dll.offset);havoc #t~mem28.base, #t~mem28.offset;havoc #t~mem29.base, #t~mem29.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem24.base, #t~mem24.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem24.base, #t~mem24.offset;havoc #t~mem24.base, #t~mem24.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8bv32;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0bv1;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1bv1];assume #Ultimate.alloc_#res.offset == 0bv32;assume #Ultimate.alloc_#res.base != 0bv32;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ptr~0.base, ~ptr~0.offset := #t~malloc2.base, #t~malloc2.offset;" "39339#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "~dll.base, ~dll.offset := #in~dll.base, #in~dll.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 8bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem31.base, #t~mem31.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~pos~0.base, ~pos~0.offset := #t~mem31.base, #t~mem31.offset;havoc #t~mem31.base, #t~mem31.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(~pos~0.base == 0bv32 && ~pos~0.offset == 0bv32);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 0bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem32.base, #t~mem32.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#t~mem32.base == 0bv32 && #t~mem32.offset == 0bv32);havoc #t~mem32.base, #t~mem32.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 4bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem33.base, #t~mem33.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !!(#t~mem33.base == 0bv32 && #t~mem33.offset == 0bv32);havoc #t~mem33.base, #t~mem33.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 0bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem34.base, #t~mem34.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~pos~0.base, ~pos~0.offset := #t~mem34.base, #t~mem34.offset;havoc #t~mem34.base, #t~mem34.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(~pos~0.base != 0bv32 || ~pos~0.offset != 0bv32);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !!(~pos~0.base != 0bv32 || ~pos~0.offset != 0bv32);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~pos~0.base, ~bvadd32(~pos~0.offset, 4bv32), 4bv32;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem36.base, #t~mem36.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#t~mem36.base == 0bv32 && #t~mem36.offset == 0bv32);havoc #t~mem36.base, #t~mem36.offset;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("40087#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select (select (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) dll_insert_slave_~next~0.base) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))" "assume ~next~0.base != 0bv32 || ~next~0.offset != 0bv32;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~next~0.base, ~bvadd32(~next~0.offset, 4bv32), 4bv32;" "40090#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))") ("40087#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select (select (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|)) |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) dll_insert_slave_~next~0.base) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))" "assume !(~next~0.base != 0bv32 || ~next~0.offset != 0bv32);" "40090#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))") ("39322#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #in~#fp.base == #funAddr~dll_insert_master.base && #in~#fp.offset == #funAddr~dll_insert_master.offset;" "39322#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39322#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(#in~#fp.base == #funAddr~dll_insert_master.base && #in~#fp.offset == #funAddr~dll_insert_master.offset);" "39322#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("40090#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "40090#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))") ("40090#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "40090#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))") ("40090#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= (_ bv1 1) (select |#valid| dll_insert_slave_~dll.base)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))))" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~0.base, ~item~0.offset, ~dll.base, ~dll.offset, 4bv32;" "40093#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= (bvadd (select |#valid| |dll_insert_slave_write~$Pointer$_#ptr.base|) (_ bv1 1)) (_ bv0 1)) (= |dll_insert_slave_#in~dll.offset| |dll_insert_slave_write~$Pointer$_#ptr.offset|) (= |dll_insert_slave_write~$Pointer$_#ptr.base| |dll_insert_slave_#in~dll.base|) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (= |#valid| (store |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))") ("40093#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= (bvadd (select |#valid| |dll_insert_slave_write~$Pointer$_#ptr.base|) (_ bv1 1)) (_ bv0 1)) (= |dll_insert_slave_#in~dll.offset| |dll_insert_slave_write~$Pointer$_#ptr.offset|) (= |dll_insert_slave_write~$Pointer$_#ptr.base| |dll_insert_slave_#in~dll.base|) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (= |#valid| (store |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "40093#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= (bvadd (select |#valid| |dll_insert_slave_write~$Pointer$_#ptr.base|) (_ bv1 1)) (_ bv0 1)) (= |dll_insert_slave_#in~dll.offset| |dll_insert_slave_write~$Pointer$_#ptr.offset|) (= |dll_insert_slave_write~$Pointer$_#ptr.base| |dll_insert_slave_#in~dll.base|) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (= |#valid| (store |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))") ("40093#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= (bvadd (select |#valid| |dll_insert_slave_write~$Pointer$_#ptr.base|) (_ bv1 1)) (_ bv0 1)) (= |dll_insert_slave_#in~dll.offset| |dll_insert_slave_write~$Pointer$_#ptr.offset|) (= |dll_insert_slave_write~$Pointer$_#ptr.base| |dll_insert_slave_#in~dll.base|) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (= |#valid| (store |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "40097#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_#in~dll.offset| |dll_insert_slave_write~$Pointer$_#ptr.offset|) (= |dll_insert_slave_write~$Pointer$_#ptr.base| |dll_insert_slave_#in~dll.base|) (= (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) (_ bv1 1)) |#valid|) (= (_ bv1 1) (select |#valid| |dll_insert_slave_#in~dll.base|)) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (= |#valid| (store |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))") ("40097#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_#in~dll.offset| |dll_insert_slave_write~$Pointer$_#ptr.offset|) (= |dll_insert_slave_write~$Pointer$_#ptr.base| |dll_insert_slave_#in~dll.base|) (= (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) (_ bv1 1)) |#valid|) (= (_ bv1 1) (select |#valid| |dll_insert_slave_#in~dll.base|)) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (= |#valid| (store |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "assume true;" "40097#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_#in~dll.offset| |dll_insert_slave_write~$Pointer$_#ptr.offset|) (= |dll_insert_slave_write~$Pointer$_#ptr.base| |dll_insert_slave_#in~dll.base|) (= (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) (_ bv1 1)) |#valid|) (= (_ bv1 1) (select |#valid| |dll_insert_slave_#in~dll.base|)) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (= |#valid| (store |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))") ("40037#(and (= (_ bv12 32) (select |#length| |alloc_or_die_master_#res.base|)) (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)) (= (bvadd (select |#valid| |alloc_or_die_master_#res.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |alloc_or_die_master_#res.offset|))" "assume true;" "40037#(and (= (_ bv12 32) (select |#length| |alloc_or_die_master_#res.base|)) (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)) (= (bvadd (select |#valid| |alloc_or_die_master_#res.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |alloc_or_die_master_#res.offset|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~dll.base, ~bvadd32(~dll.offset, 8bv32), 4bv32;" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem15.base, #t~mem15.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset;" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "assume true;" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "assume true;" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))") ("39339#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume !(~ptr~0.base == 0bv32 && ~ptr~0.offset == 0bv32);" "39339#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39339#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= (_ bv0 1) (select |old(#valid)| alloc_or_die_slave_~ptr~0.base)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 0bv32), 4bv32;" "40062#(and (= alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (= |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39213#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39213#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))") ("39213#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39213#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))") ("39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;#res.base, #res.offset := ~ptr~1.base, ~ptr~1.offset;" "40037#(and (= (_ bv12 32) (select |#length| |alloc_or_die_master_#res.base|)) (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)) (= (bvadd (select |#valid| |alloc_or_die_master_#res.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |alloc_or_die_master_#res.offset|))") ("39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))" "assume !(~ptr~1.base == 0bv32 && ~ptr~1.offset == 0bv32);" "39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))") ("39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~1.base, ~bvadd32(~ptr~1.offset, 0bv32), 4bv32;" "39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))") ("39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))") ("39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~1.base, ~bvadd32(~ptr~1.offset, 4bv32), 4bv32;" "39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))") ("39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))") ("39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~1.base, ~bvadd32(~ptr~1.offset, 8bv32), 4bv32;" "39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))") ("39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39151#(and (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)))") ("39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))" "assume true;" "39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))") ("39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))" "assume !(#t~nondet8 != 0bv32);havoc #t~nondet8;" "39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))") ("39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))" "assume !!(#t~nondet8 != 0bv32);havoc #t~nondet8;" "39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))") ("39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~#dll~0.base, ~#dll~0.offset, 4bv32;" "39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))") ("39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))") ("39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem10.base, #t~mem10.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;#res.base, #res.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~#dll~0.base, ~#dll~0.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0bv1];assume { :end_inline_ULTIMATE.dealloc } true;havoc ~#dll~0.base, ~#dll~0.offset;" "39098#true") ("39098#true" "assume true;" "39098#true") ("39098#true" "#res.base, #res.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;" "39098#true") ("39098#true" "assume true;" "39098#true") ("39098#true" "#res.base, #res.offset := #t~ret20.base, #t~ret20.offset;havoc #t~ret20.base, #t~ret20.offset;" "39098#true") ("39098#true" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "39098#true") ("39098#true" "assume true;" "39098#true") ("39098#true" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "39098#true") ("39098#true" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39098#true") ("39098#true" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39098#true") ("39098#true" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39098#true") ("39098#true" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem12.base, #t~mem12.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~1.base, ~next~1.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;" "39098#true") ("39098#true" "assume true;" "39098#true") ("39098#true" "assume !(~dll.offset == 0bv32);" "39098#true") ("39098#true" "assume ~dll.offset == 0bv32;" "39098#true") ("39098#true" "assume !(~dll.base == 0bv32 || #valid[~dll.base] == 1bv1);" "39098#true") ("39098#true" "assume ~dll.base == 0bv32 || #valid[~dll.base] == 1bv1;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~dll.base, ~dll.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0bv1];assume { :end_inline_ULTIMATE.dealloc } true;~dll.base, ~dll.offset := ~next~1.base, ~next~1.offset;" "39098#true") ("39098#true" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "39098#true") ("39098#true" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 8bv32), 4bv32;" "39098#true") ("39098#true" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39098#true") ("39098#true" "assume true;" "39098#true") ("39098#true" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39098#true") ("39098#true" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39098#true") ("39098#true" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem13.base, #t~mem13.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;" "39098#true") ("39098#true" "assume true;" "39098#true") ("39098#true" "havoc #t~mem13.base, #t~mem13.offset;assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "39098#true") ("39098#true" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39098#true") ("39098#true" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39098#true") ("39098#true" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39098#true") ("39098#true" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem14.base, #t~mem14.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~dll.base, ~dll.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset;" "39098#true") ("39098#true" "assume true;" "39098#true") ("39098#true" "write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := #t~ret19.base, #t~ret19.offset, ~item~1.base, ~bvadd32(~item~1.offset, 8bv32), 4bv32;" "39098#true") ("39098#true" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "39098#true") ("39098#true" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39098#true") ("39098#true" "assume true;" "39098#true") ("39098#true" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "39098#true") ("39098#true" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;havoc #t~ret19.base, #t~ret19.offset;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := ~item~1.base, ~item~1.offset, ~dll.base, ~dll.offset, 4bv32;" "39098#true") ("39098#true" "assume !(#valid[write~$Pointer$_#ptr.base] == 1bv1);" "39098#true") ("39098#true" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "39098#true") ("39098#true" "assume !((~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset));" "39098#true") ("39098#true" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;" "39098#true") ("39098#true" "assume true;" "39098#true") ("39098#true" "assume true;" "39098#true") ("39098#true" "assume !(~dll.base != 0bv32 || ~dll.offset != 0bv32);" "39098#true") ("39098#true" "assume !!(~dll.base != 0bv32 || ~dll.offset != 0bv32);assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~dll.base, ~bvadd32(~dll.offset, 0bv32), 4bv32;" "39098#true") ("39098#true" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39098#true") ("39098#true" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39098#true") ("39098#true" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39098#true") ("39098#true" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem16.base, #t~mem16.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;~next~2.base, ~next~2.offset := #t~mem16.base, #t~mem16.offset;havoc #t~mem16.base, #t~mem16.offset;" "39098#true") ("39098#true" "assume !(~dll.offset == 0bv32);" "39098#true") ("39098#true" "assume ~dll.offset == 0bv32;" "39098#true") ("39098#true" "assume !(~dll.base == 0bv32 || #valid[~dll.base] == 1bv1);" "39098#true") ("39098#true" "assume ~dll.base == 0bv32 || #valid[~dll.base] == 1bv1;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~dll.base, ~dll.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0bv1];assume { :end_inline_ULTIMATE.dealloc } true;~dll.base, ~dll.offset := ~next~2.base, ~next~2.offset;" "39098#true") ("39098#true" "assume true;" "39098#true") ("39098#true" "assume true;" "39098#true") ("39098#true" "assume !(#t~nondet8 != 0bv32);havoc #t~nondet8;" "39098#true") ("39098#true" "assume !!(#t~nondet8 != 0bv32);havoc #t~nondet8;" "39098#true") ("39098#true" "assume { :begin_inline_read~$Pointer$ } true;read~$Pointer$_#ptr.base, read~$Pointer$_#ptr.offset, read~$Pointer$_#sizeOfReadType := ~#dll~0.base, ~#dll~0.offset, 4bv32;" "39098#true") ("39098#true" "assume !(#valid[read~$Pointer$_#ptr.base] == 1bv1);" "39098#true") ("39098#true" "assume #valid[read~$Pointer$_#ptr.base] == 1bv1;" "39098#true") ("39098#true" "assume !((~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset));" "39098#true") ("39098#true" "assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);assume #valid[read~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset), #length[read~$Pointer$_#ptr.base]) && ~bvsle32(read~$Pointer$_#ptr.offset, ~bvadd32(read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, read~$Pointer$_#ptr.offset);havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset] && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base,read~$Pointer$_#ptr.offset];#t~mem10.base, #t~mem10.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset;assume { :end_inline_read~$Pointer$ } true;#res.base, #res.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~#dll~0.base, ~#dll~0.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0bv1];assume { :end_inline_ULTIMATE.dealloc } true;havoc ~#dll~0.base, ~#dll~0.offset;" "39098#true") ("39098#true" "assume true;" "39098#true") ("39098#true" "~dll~1.base, ~dll~1.offset := #t~ret45.base, #t~ret45.offset;havoc #t~ret45.base, #t~ret45.offset;" "39098#true") ("39098#true" "#res := 0bv32;" "39098#true") ("39098#true" "assume !(#valid == old(#valid));" "39098#true") ("40062#(and (= alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (= |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);assume #valid[write~$Pointer$_#ptr.base] == 1bv1;assume (~bvsle32(~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset), #length[write~$Pointer$_#ptr.base]) && ~bvsle32(write~$Pointer$_#ptr.offset, ~bvadd32(write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#ptr.offset))) && ~bvsle32(0bv32, write~$Pointer$_#ptr.offset);havoc #memory_$Pointer$.base, #memory_$Pointer$.offset;assume #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base] && #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base,write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset];assume { :end_inline_write~$Pointer$ } true;write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset;assume { :begin_inline_write~$Pointer$ } true;write~$Pointer$_#value.base, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType := 0bv32, 0bv32, ~ptr~0.base, ~bvadd32(~ptr~0.offset, 4bv32), 4bv32;" "40066#(and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (exists ((|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32))) (= (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|)) |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))") ("40062#(and (= alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (= |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "assume #valid[write~$Pointer$_#ptr.base] == 1bv1;" "40062#(and (= alloc_or_die_slave_~ptr~0.base |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (= |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (store |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |alloc_or_die_slave_#Ultimate.alloc_#res.base|)))) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") }, returnTransitions = { ("40070#(and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= |#valid| (store |old(#valid)| |alloc_or_die_slave_#res.base| (_ bv1 1))) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (exists ((|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32))) (= (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|)) |alloc_or_die_slave_write~$Pointer$_old_#memory_$Pointer$.base|)) (= |#valid| (store |old(#valid)| alloc_or_die_slave_~ptr~0.base (_ bv1 1))))" "39332#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#753#return;" "40074#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (exists ((|alloc_or_die_slave_write~$Pointer$_#value.base| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| (_ BitVec 32)) (|v_alloc_or_die_slave_write~$Pointer$_#value.base_317| (_ BitVec 32)) (|alloc_or_die_slave_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (_ bv1 1))) (= (select |old(#valid)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| (store (store (select |old(#memory_$Pointer$.base)| |alloc_or_die_slave_write~$Pointer$_#ptr.base|) |v_alloc_or_die_slave_write~$Pointer$_#ptr.offset_319| |v_alloc_or_die_slave_write~$Pointer$_#value.base_317|) |alloc_or_die_slave_write~$Pointer$_#ptr.offset| |alloc_or_die_slave_write~$Pointer$_#value.base|))) (= |#length| (store |old(#length)| |alloc_or_die_slave_write~$Pointer$_#ptr.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)))) (= |#valid| (store |old(#valid)| |dll_insert_slave_#t~ret4.base| (_ bv1 1))) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base))") ("39307#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) (_ bv1 1))) (= (_ bv1 1) (select |#valid| |##fun~$Pointer$~TO~VOID_#in~9.base|)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|)) (_ bv0 1)))" "39314#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|) (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "#697#return;" "39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))") ("39307#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) (_ bv1 1))) (= (_ bv1 1) (select |#valid| |##fun~$Pointer$~TO~VOID_#in~9.base|)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|)) (_ bv0 1)))" "39863#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base|)) (= |#valid| (store (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90 (_ bv1 1)) |alloc_or_die_slave_#Ultimate.alloc_#res.base| (_ bv1 1))) (= |#length| (store (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) v_prenex_90 v_prenex_89) |alloc_or_die_slave_#Ultimate.alloc_#res.base| |alloc_or_die_slave_#Ultimate.alloc_~size|)) (= (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) v_prenex_90) (_ bv0 1)))))" "#699#return;" "39098#true") ("39307#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) (_ bv1 1))) (= (_ bv1 1) (select |#valid| |##fun~$Pointer$~TO~VOID_#in~9.base|)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|)) (_ bv0 1)))" "39098#true" "#699#return;" "39098#true") ("39307#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) (_ bv1 1))) (= (_ bv1 1) (select |#valid| |##fun~$Pointer$~TO~VOID_#in~9.base|)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|)) (_ bv0 1)))" "39213#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))" "#695#return;" "39314#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|) (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32)) (|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|) (select (select |#memory_$Pointer$.base| |dll_create_generic_~#dll~0.base|) |dll_create_generic_~#dll~0.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#689#return;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#755#return;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#735#return;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#719#return;" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "39098#true" "#705#return;" "39098#true") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "39098#true" "#689#return;" "39098#true") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "39098#true" "#707#return;" "39098#true") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "39098#true" "#709#return;" "39098#true") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "39098#true" "#711#return;" "39098#true") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "39098#true" "#713#return;" "39098#true") ("39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "39098#true" "#703#return;" "39098#true") ("40097#(and (= dll_insert_slave_~dll.offset |dll_insert_slave_#in~dll.offset|) (= |dll_insert_slave_#in~dll.base| dll_insert_slave_~dll.base) (= dll_insert_slave_~dll.base |dll_insert_slave_read~$Pointer$_#ptr.base|) (= |dll_insert_slave_#in~dll.offset| |dll_insert_slave_write~$Pointer$_#ptr.offset|) (= |dll_insert_slave_write~$Pointer$_#ptr.base| |dll_insert_slave_#in~dll.base|) (= (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_insert_slave_#in~dll.base|) |dll_insert_slave_#in~dll.offset|) (_ bv1 1)) |#valid|) (= (_ bv1 1) (select |#valid| |dll_insert_slave_#in~dll.base|)) (= |#valid| (store |old(#valid)| dll_insert_slave_~item~0.base (_ bv1 1))) (= |#valid| (store |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| |dll_insert_slave_write~$Pointer$_#value.base|)) (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= (store |old(#length)| dll_insert_slave_~item~0.base |alloc_or_die_slave_#Ultimate.alloc_~size|) |#length|)))" "39322#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#717#return;" "39307#(and (exists ((|alloc_or_die_slave_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) |alloc_or_die_slave_#Ultimate.alloc_~size|))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|) (_ bv1 1))) (= (_ bv1 1) (select |#valid| |##fun~$Pointer$~TO~VOID_#in~9.base|)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) |##fun~$Pointer$~TO~VOID_#in~9.offset|)) (_ bv0 1)))") ("40037#(and (= (_ bv12 32) (select |#length| |alloc_or_die_master_#res.base|)) (= (_ bv0 32) alloc_or_die_master_~ptr~1.offset) (= (_ bv1 1) (select |#valid| alloc_or_die_master_~ptr~1.base)) (= (_ bv12 32) (select |#length| alloc_or_die_master_~ptr~1.base)) (= (bvadd (select |#valid| |alloc_or_die_master_#res.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |alloc_or_die_master_#res.offset|))" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#691#return;" "39183#(and (= (_ bv12 32) (select |#length| |dll_insert_master_#t~ret17.base|)) (= (_ bv0 32) |dll_insert_master_#t~ret17.offset|) (= (_ bv1 1) (select |#valid| |dll_insert_master_#t~ret17.base|)))") ("39206#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))" "39098#true" "#709#return;" "39098#true") ("39098#true" "39187#(and (= (bvadd (select |#valid| dll_insert_master_~item~1.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv12 32) (select |#length| dll_insert_master_~item~1.base)) (= (_ bv0 32) dll_insert_master_~item~1.offset))" "#693#return;" "39098#true") ("39098#true" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#689#return;" "39098#true") ("39098#true" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#685#return;" "39098#true") ("39098#true" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#701#return;" "39098#true") ("39098#true" "39318#(and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#687#return;" "39098#true") ("39098#true" "39098#true" "#705#return;" "39098#true") ("39098#true" "39098#true" "#689#return;" "39098#true") ("39098#true" "39098#true" "#697#return;" "39098#true") ("39098#true" "39098#true" "#713#return;" "39098#true") ("39098#true" "39098#true" "#699#return;" "39098#true") ("39098#true" "39098#true" "#749#return;" "39098#true") ("39098#true" "39322#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~9.offset| |##fun~$Pointer$~TO~VOID_#in~9.offset|) (= |#length| |old(#length)|) (= |##fun~$Pointer$~TO~VOID_#~9.base| |##fun~$Pointer$~TO~VOID_#in~9.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))" "#715#return;" "39098#true") ("39098#true" "39213#(and (= (_ bv0 1) (select |old(#valid)| |dll_create_generic_~#dll~0.base|)) (= |#valid| (store |old(#valid)| |dll_create_generic_~#dll~0.base| (_ bv1 1))) (= (_ bv0 32) |dll_create_generic_~#dll~0.offset|) (exists ((|dll_create_generic_#Ultimate.alloc_~size| (_ BitVec 32))) (= |#length| (store |old(#length)| |dll_create_generic_~#dll~0.base| |dll_create_generic_#Ultimate.alloc_~size|))))" "#695#return;" "39098#true") } ); [2018-11-10 06:08:15,925 FATAL L842 BasicCegarLoop]: -- [2018-11-10 06:08:15,926 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: enhanced interpolant automaton in iteration 36 broken: counterexample of length 142 not accepted (original is ok) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.checkEnhancement(BasicCegarLoop.java:817) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:719) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-10 06:08:15,937 INFO L168 Benchmark]: Toolchain (without parser) took 294579.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.9 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -144.0 MB). Peak memory consumption was 68.9 MB. Max. memory is 11.5 GB. [2018-11-10 06:08:15,938 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:08:15,938 INFO L168 Benchmark]: CACSL2BoogieTranslator took 390.13 ms. Allocated memory is still 1.0 GB. Free memory was 945.5 MB in the beginning and 913.2 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2018-11-10 06:08:15,938 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 49.3 MB). Free memory was 913.2 MB in the beginning and 1.0 GB in the end (delta: -112.7 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-10 06:08:15,939 INFO L168 Benchmark]: Boogie Preprocessor took 92.05 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 188.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -184.0 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2018-11-10 06:08:15,951 INFO L168 Benchmark]: RCFGBuilder took 1253.96 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 109.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 11.5 GB. [2018-11-10 06:08:15,951 INFO L168 Benchmark]: TraceAbstraction took 292772.57 ms. Allocated memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: -24.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:08:15,953 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 390.13 ms. Allocated memory is still 1.0 GB. Free memory was 945.5 MB in the beginning and 913.2 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 49.3 MB). Free memory was 913.2 MB in the beginning and 1.0 GB in the end (delta: -112.7 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 92.05 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 188.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -184.0 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1253.96 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 109.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 292772.57 ms. Allocated memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: -24.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: enhanced interpolant automaton in iteration 36 broken: counterexample of length 142 not accepted (original is ok) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: enhanced interpolant automaton in iteration 36 broken: counterexample of length 142 not accepted (original is ok): de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.checkEnhancement(BasicCegarLoop.java:817) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...