/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-simple/dll2n_remove_all.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:27:45,553 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:27:45,555 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:27:45,568 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:27:45,569 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:27:45,570 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:27:45,571 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:27:45,573 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:27:45,575 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:27:45,576 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:27:45,577 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:27:45,578 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:27:45,578 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:27:45,579 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:27:45,580 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:27:45,581 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:27:45,582 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:27:45,583 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:27:45,585 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:27:45,587 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:27:45,588 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:27:45,589 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:27:45,590 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:27:45,591 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:27:45,593 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:27:45,594 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:27:45,594 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:27:45,595 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:27:45,595 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:27:45,596 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:27:45,596 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:27:45,597 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:27:45,597 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:27:45,598 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:27:45,599 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:27:45,599 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:27:45,600 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:27:45,600 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:27:45,601 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:27:45,602 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:27:45,602 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:27:45,603 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-08 12:27:45,618 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:27:45,618 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:27:45,619 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:27:45,619 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:27:45,620 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:27:45,620 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:27:45,620 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:27:45,620 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:27:45,620 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:27:45,621 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:27:45,621 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:27:45,621 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:27:45,621 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:27:45,621 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:27:45,622 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:27:45,622 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:27:45,622 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:27:45,622 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:27:45,622 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:27:45,623 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:27:45,623 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:27:45,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:27:45,623 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:27:45,623 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:27:45,624 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:27:45,624 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:27:45,624 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:27:45,624 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:27:45,624 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:27:45,624 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:27:45,975 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:27:45,989 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:27:45,993 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:27:45,995 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:27:45,995 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:27:45,996 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_remove_all.i [2020-07-08 12:27:46,062 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ba064b7c/e772337a72dd4e6a90d949eca847b46b/FLAGac6709da5 [2020-07-08 12:27:46,559 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:27:46,559 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_remove_all.i [2020-07-08 12:27:46,573 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ba064b7c/e772337a72dd4e6a90d949eca847b46b/FLAGac6709da5 [2020-07-08 12:27:46,913 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ba064b7c/e772337a72dd4e6a90d949eca847b46b [2020-07-08 12:27:46,922 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:27:46,924 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:27:46,925 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:27:46,926 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:27:46,929 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:27:46,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:27:46" (1/1) ... [2020-07-08 12:27:46,935 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12330b82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:46, skipping insertion in model container [2020-07-08 12:27:46,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:27:46" (1/1) ... [2020-07-08 12:27:46,946 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:27:47,007 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:27:47,465 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:27:47,485 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:27:47,593 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:27:47,679 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:27:47,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:47 WrapperNode [2020-07-08 12:27:47,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:27:47,681 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:27:47,681 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:27:47,681 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:27:47,696 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:47" (1/1) ... [2020-07-08 12:27:47,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:47" (1/1) ... [2020-07-08 12:27:47,726 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:47" (1/1) ... [2020-07-08 12:27:47,726 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:47" (1/1) ... [2020-07-08 12:27:47,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:47" (1/1) ... [2020-07-08 12:27:47,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:47" (1/1) ... [2020-07-08 12:27:47,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:47" (1/1) ... [2020-07-08 12:27:47,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:27:47,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:27:47,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:27:47,770 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:27:47,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:27:47,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:27:47,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:27:47,836 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-08 12:27:47,836 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-08 12:27:47,836 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-07-08 12:27:47,836 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2020-07-08 12:27:47,836 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2020-07-08 12:27:47,837 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_remove_first [2020-07-08 12:27:47,837 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:27:47,837 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:27:47,837 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-08 12:27:47,837 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-08 12:27:47,837 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-08 12:27:47,838 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-08 12:27:47,838 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-08 12:27:47,838 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-08 12:27:47,838 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-08 12:27:47,838 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-08 12:27:47,838 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-08 12:27:47,839 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-08 12:27:47,839 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-08 12:27:47,839 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-08 12:27:47,839 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-08 12:27:47,839 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-08 12:27:47,839 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-08 12:27:47,840 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-08 12:27:47,840 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-08 12:27:47,840 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-08 12:27:47,840 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-08 12:27:47,840 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-08 12:27:47,840 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-08 12:27:47,841 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-08 12:27:47,841 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-08 12:27:47,841 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-08 12:27:47,841 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-08 12:27:47,841 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-08 12:27:47,841 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-08 12:27:47,842 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-08 12:27:47,842 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-08 12:27:47,842 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-08 12:27:47,842 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-08 12:27:47,842 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-08 12:27:47,842 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-08 12:27:47,842 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-08 12:27:47,843 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-08 12:27:47,843 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-08 12:27:47,843 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-08 12:27:47,843 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-08 12:27:47,843 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-08 12:27:47,843 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-08 12:27:47,843 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-08 12:27:47,844 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-08 12:27:47,844 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-08 12:27:47,844 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-08 12:27:47,844 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-08 12:27:47,844 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-08 12:27:47,844 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-08 12:27:47,844 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-08 12:27:47,845 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-08 12:27:47,845 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-08 12:27:47,845 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-08 12:27:47,845 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-08 12:27:47,845 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-08 12:27:47,845 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-08 12:27:47,846 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-08 12:27:47,846 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-08 12:27:47,846 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-08 12:27:47,846 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-08 12:27:47,846 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-08 12:27:47,846 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-08 12:27:47,847 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-08 12:27:47,847 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 12:27:47,847 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-08 12:27:47,847 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-08 12:27:47,847 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-08 12:27:47,847 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-08 12:27:47,847 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-08 12:27:47,848 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-08 12:27:47,848 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-08 12:27:47,848 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-08 12:27:47,848 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-08 12:27:47,848 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-08 12:27:47,848 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-08 12:27:47,849 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-08 12:27:47,849 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-08 12:27:47,849 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-08 12:27:47,849 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-08 12:27:47,849 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-08 12:27:47,849 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-08 12:27:47,849 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-08 12:27:47,850 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-08 12:27:47,850 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-08 12:27:47,850 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-08 12:27:47,850 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-08 12:27:47,850 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-08 12:27:47,850 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-08 12:27:47,850 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-08 12:27:47,851 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-08 12:27:47,851 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-08 12:27:47,851 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-08 12:27:47,851 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-08 12:27:47,851 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-08 12:27:47,851 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-08 12:27:47,852 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-08 12:27:47,852 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-08 12:27:47,852 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-08 12:27:47,852 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-08 12:27:47,852 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-08 12:27:47,852 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-08 12:27:47,852 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-08 12:27:47,852 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-08 12:27:47,853 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-08 12:27:47,853 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-08 12:27:47,853 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-08 12:27:47,853 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-08 12:27:47,853 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-07-08 12:27:47,853 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2020-07-08 12:27:47,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-08 12:27:47,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-08 12:27:47,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 12:27:47,854 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2020-07-08 12:27:47,854 INFO L130 BoogieDeclarations]: Found specification of procedure dll_remove_first [2020-07-08 12:27:47,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-08 12:27:47,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 12:27:47,855 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:27:47,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 12:27:47,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-07-08 12:27:47,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:27:47,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:27:47,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 12:27:48,263 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-07-08 12:27:48,524 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:27:48,524 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-08 12:27:48,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:27:48 BoogieIcfgContainer [2020-07-08 12:27:48,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:27:48,530 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:27:48,530 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:27:48,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:27:48,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:27:46" (1/3) ... [2020-07-08 12:27:48,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd2967e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:27:48, skipping insertion in model container [2020-07-08 12:27:48,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:47" (2/3) ... [2020-07-08 12:27:48,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd2967e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:27:48, skipping insertion in model container [2020-07-08 12:27:48,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:27:48" (3/3) ... [2020-07-08 12:27:48,539 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all.i [2020-07-08 12:27:48,550 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:27:48,559 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:27:48,575 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:27:48,601 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:27:48,601 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:27:48,601 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:27:48,602 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:27:48,602 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:27:48,602 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:27:48,602 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:27:48,602 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:27:48,621 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2020-07-08 12:27:48,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-08 12:27:48,628 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:27:48,629 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:27:48,630 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:27:48,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:27:48,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1664510762, now seen corresponding path program 1 times [2020-07-08 12:27:48,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:27:48,648 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634558716] [2020-07-08 12:27:48,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:27:48,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:48,896 INFO L280 TraceCheckUtils]: 0: Hoare triple {49#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {39#true} is VALID [2020-07-08 12:27:48,896 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-08 12:27:48,897 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #98#return; {39#true} is VALID [2020-07-08 12:27:48,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:48,931 INFO L280 TraceCheckUtils]: 0: Hoare triple {50#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {39#true} is VALID [2020-07-08 12:27:48,932 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} assume !true; {40#false} is VALID [2020-07-08 12:27:48,933 INFO L280 TraceCheckUtils]: 2: Hoare triple {40#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {40#false} is VALID [2020-07-08 12:27:48,933 INFO L280 TraceCheckUtils]: 3: Hoare triple {40#false} assume true; {40#false} is VALID [2020-07-08 12:27:48,933 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {40#false} {39#true} #92#return; {40#false} is VALID [2020-07-08 12:27:48,935 INFO L263 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {49#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:27:48,935 INFO L280 TraceCheckUtils]: 1: Hoare triple {49#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {39#true} is VALID [2020-07-08 12:27:48,936 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-08 12:27:48,936 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #98#return; {39#true} is VALID [2020-07-08 12:27:48,936 INFO L263 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret11 := main(); {39#true} is VALID [2020-07-08 12:27:48,937 INFO L280 TraceCheckUtils]: 5: Hoare triple {39#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.allocOnStack(4); {39#true} is VALID [2020-07-08 12:27:48,938 INFO L263 TraceCheckUtils]: 6: Hoare triple {39#true} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {50#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:27:48,939 INFO L280 TraceCheckUtils]: 7: Hoare triple {50#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {39#true} is VALID [2020-07-08 12:27:48,940 INFO L280 TraceCheckUtils]: 8: Hoare triple {39#true} assume !true; {40#false} is VALID [2020-07-08 12:27:48,940 INFO L280 TraceCheckUtils]: 9: Hoare triple {40#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {40#false} is VALID [2020-07-08 12:27:48,940 INFO L280 TraceCheckUtils]: 10: Hoare triple {40#false} assume true; {40#false} is VALID [2020-07-08 12:27:48,941 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {40#false} {39#true} #92#return; {40#false} is VALID [2020-07-08 12:27:48,941 INFO L280 TraceCheckUtils]: 12: Hoare triple {40#false} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {40#false} is VALID [2020-07-08 12:27:48,942 INFO L280 TraceCheckUtils]: 13: Hoare triple {40#false} assume !(~i~0 >= 0); {40#false} is VALID [2020-07-08 12:27:48,942 INFO L280 TraceCheckUtils]: 14: Hoare triple {40#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {40#false} is VALID [2020-07-08 12:27:48,942 INFO L280 TraceCheckUtils]: 15: Hoare triple {40#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {40#false} is VALID [2020-07-08 12:27:48,943 INFO L280 TraceCheckUtils]: 16: Hoare triple {40#false} assume !false; {40#false} is VALID [2020-07-08 12:27:48,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:27:48,946 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634558716] [2020-07-08 12:27:48,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:27:48,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 12:27:48,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135317874] [2020-07-08 12:27:48,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-07-08 12:27:48,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:27:48,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 12:27:48,991 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:48,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 12:27:48,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:27:49,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 12:27:49,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 12:27:49,003 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 4 states. [2020-07-08 12:27:49,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:49,377 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2020-07-08 12:27:49,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 12:27:49,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-07-08 12:27:49,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:27:49,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:27:49,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2020-07-08 12:27:49,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:27:49,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2020-07-08 12:27:49,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 73 transitions. [2020-07-08 12:27:49,565 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:49,579 INFO L225 Difference]: With dead ends: 61 [2020-07-08 12:27:49,580 INFO L226 Difference]: Without dead ends: 34 [2020-07-08 12:27:49,584 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:27:49,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-08 12:27:49,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2020-07-08 12:27:49,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:27:49,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 29 states. [2020-07-08 12:27:49,646 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 29 states. [2020-07-08 12:27:49,646 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 29 states. [2020-07-08 12:27:49,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:49,651 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2020-07-08 12:27:49,651 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2020-07-08 12:27:49,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:49,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:49,652 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 34 states. [2020-07-08 12:27:49,652 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 34 states. [2020-07-08 12:27:49,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:49,657 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2020-07-08 12:27:49,657 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2020-07-08 12:27:49,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:49,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:49,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:27:49,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:27:49,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-08 12:27:49,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2020-07-08 12:27:49,663 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 17 [2020-07-08 12:27:49,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:27:49,664 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2020-07-08 12:27:49,664 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 12:27:49,664 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2020-07-08 12:27:49,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-08 12:27:49,665 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:27:49,665 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:27:49,666 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:27:49,666 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:27:49,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:27:49,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1646407191, now seen corresponding path program 1 times [2020-07-08 12:27:49,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:27:49,667 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861799142] [2020-07-08 12:27:49,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:27:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:49,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:49,768 INFO L280 TraceCheckUtils]: 0: Hoare triple {255#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {244#true} is VALID [2020-07-08 12:27:49,768 INFO L280 TraceCheckUtils]: 1: Hoare triple {244#true} assume true; {244#true} is VALID [2020-07-08 12:27:49,768 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {244#true} {244#true} #98#return; {244#true} is VALID [2020-07-08 12:27:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:49,840 INFO L280 TraceCheckUtils]: 0: Hoare triple {256#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {257#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-08 12:27:49,841 INFO L280 TraceCheckUtils]: 1: Hoare triple {257#(= dll_create_~len |dll_create_#in~len|)} assume !(~len > 0); {258#(<= |dll_create_#in~len| 0)} is VALID [2020-07-08 12:27:49,842 INFO L280 TraceCheckUtils]: 2: Hoare triple {258#(<= |dll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {258#(<= |dll_create_#in~len| 0)} is VALID [2020-07-08 12:27:49,843 INFO L280 TraceCheckUtils]: 3: Hoare triple {258#(<= |dll_create_#in~len| 0)} assume true; {258#(<= |dll_create_#in~len| 0)} is VALID [2020-07-08 12:27:49,845 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {258#(<= |dll_create_#in~len| 0)} {249#(<= 2 main_~len~0)} #92#return; {245#false} is VALID [2020-07-08 12:27:49,847 INFO L263 TraceCheckUtils]: 0: Hoare triple {244#true} call ULTIMATE.init(); {255#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:27:49,847 INFO L280 TraceCheckUtils]: 1: Hoare triple {255#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {244#true} is VALID [2020-07-08 12:27:49,848 INFO L280 TraceCheckUtils]: 2: Hoare triple {244#true} assume true; {244#true} is VALID [2020-07-08 12:27:49,848 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {244#true} {244#true} #98#return; {244#true} is VALID [2020-07-08 12:27:49,848 INFO L263 TraceCheckUtils]: 4: Hoare triple {244#true} call #t~ret11 := main(); {244#true} is VALID [2020-07-08 12:27:49,850 INFO L280 TraceCheckUtils]: 5: Hoare triple {244#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.allocOnStack(4); {249#(<= 2 main_~len~0)} is VALID [2020-07-08 12:27:49,852 INFO L263 TraceCheckUtils]: 6: Hoare triple {249#(<= 2 main_~len~0)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {256#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:27:49,853 INFO L280 TraceCheckUtils]: 7: Hoare triple {256#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {257#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-08 12:27:49,854 INFO L280 TraceCheckUtils]: 8: Hoare triple {257#(= dll_create_~len |dll_create_#in~len|)} assume !(~len > 0); {258#(<= |dll_create_#in~len| 0)} is VALID [2020-07-08 12:27:49,855 INFO L280 TraceCheckUtils]: 9: Hoare triple {258#(<= |dll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {258#(<= |dll_create_#in~len| 0)} is VALID [2020-07-08 12:27:49,855 INFO L280 TraceCheckUtils]: 10: Hoare triple {258#(<= |dll_create_#in~len| 0)} assume true; {258#(<= |dll_create_#in~len| 0)} is VALID [2020-07-08 12:27:49,857 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {258#(<= |dll_create_#in~len| 0)} {249#(<= 2 main_~len~0)} #92#return; {245#false} is VALID [2020-07-08 12:27:49,858 INFO L280 TraceCheckUtils]: 12: Hoare triple {245#false} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {245#false} is VALID [2020-07-08 12:27:49,858 INFO L280 TraceCheckUtils]: 13: Hoare triple {245#false} assume !(~i~0 >= 0); {245#false} is VALID [2020-07-08 12:27:49,859 INFO L280 TraceCheckUtils]: 14: Hoare triple {245#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {245#false} is VALID [2020-07-08 12:27:49,859 INFO L280 TraceCheckUtils]: 15: Hoare triple {245#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {245#false} is VALID [2020-07-08 12:27:49,859 INFO L280 TraceCheckUtils]: 16: Hoare triple {245#false} assume !false; {245#false} is VALID [2020-07-08 12:27:49,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:27:49,862 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861799142] [2020-07-08 12:27:49,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:27:49,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 12:27:49,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585875338] [2020-07-08 12:27:49,865 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-07-08 12:27:49,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:27:49,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 12:27:49,895 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:49,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 12:27:49,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:27:49,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 12:27:49,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:27:49,897 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 7 states. [2020-07-08 12:27:50,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:50,430 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2020-07-08 12:27:50,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 12:27:50,431 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-07-08 12:27:50,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:27:50,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:27:50,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2020-07-08 12:27:50,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:27:50,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2020-07-08 12:27:50,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 57 transitions. [2020-07-08 12:27:50,515 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:50,518 INFO L225 Difference]: With dead ends: 51 [2020-07-08 12:27:50,518 INFO L226 Difference]: Without dead ends: 35 [2020-07-08 12:27:50,519 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-07-08 12:27:50,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-08 12:27:50,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2020-07-08 12:27:50,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:27:50,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 30 states. [2020-07-08 12:27:50,543 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 30 states. [2020-07-08 12:27:50,543 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 30 states. [2020-07-08 12:27:50,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:50,545 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-08 12:27:50,546 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-08 12:27:50,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:50,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:50,547 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 35 states. [2020-07-08 12:27:50,547 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 35 states. [2020-07-08 12:27:50,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:50,550 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-08 12:27:50,550 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-08 12:27:50,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:50,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:50,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:27:50,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:27:50,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-08 12:27:50,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2020-07-08 12:27:50,553 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 17 [2020-07-08 12:27:50,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:27:50,553 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2020-07-08 12:27:50,554 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 12:27:50,554 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-08 12:27:50,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-08 12:27:50,555 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:27:50,555 INFO L422 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] [2020-07-08 12:27:50,555 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 12:27:50,555 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:27:50,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:27:50,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1603407070, now seen corresponding path program 1 times [2020-07-08 12:27:50,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:27:50,556 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821539293] [2020-07-08 12:27:50,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:27:50,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:50,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:50,646 INFO L280 TraceCheckUtils]: 0: Hoare triple {463#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {447#true} is VALID [2020-07-08 12:27:50,646 INFO L280 TraceCheckUtils]: 1: Hoare triple {447#true} assume true; {447#true} is VALID [2020-07-08 12:27:50,647 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {447#true} {447#true} #98#return; {447#true} is VALID [2020-07-08 12:27:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:50,708 INFO L280 TraceCheckUtils]: 0: Hoare triple {464#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {465#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-08 12:27:50,709 INFO L280 TraceCheckUtils]: 1: Hoare triple {465#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {465#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-08 12:27:50,710 INFO L280 TraceCheckUtils]: 2: Hoare triple {465#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {465#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-08 12:27:50,711 INFO L280 TraceCheckUtils]: 3: Hoare triple {465#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {465#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-08 12:27:50,712 INFO L280 TraceCheckUtils]: 4: Hoare triple {465#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {448#false} is VALID [2020-07-08 12:27:50,712 INFO L280 TraceCheckUtils]: 5: Hoare triple {448#false} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {448#false} is VALID [2020-07-08 12:27:50,712 INFO L280 TraceCheckUtils]: 6: Hoare triple {448#false} assume !(~len > 0); {448#false} is VALID [2020-07-08 12:27:50,713 INFO L280 TraceCheckUtils]: 7: Hoare triple {448#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {448#false} is VALID [2020-07-08 12:27:50,713 INFO L280 TraceCheckUtils]: 8: Hoare triple {448#false} assume true; {448#false} is VALID [2020-07-08 12:27:50,713 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {448#false} {452#(<= 2 main_~len~0)} #92#return; {448#false} is VALID [2020-07-08 12:27:50,715 INFO L263 TraceCheckUtils]: 0: Hoare triple {447#true} call ULTIMATE.init(); {463#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:27:50,715 INFO L280 TraceCheckUtils]: 1: Hoare triple {463#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {447#true} is VALID [2020-07-08 12:27:50,715 INFO L280 TraceCheckUtils]: 2: Hoare triple {447#true} assume true; {447#true} is VALID [2020-07-08 12:27:50,716 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {447#true} {447#true} #98#return; {447#true} is VALID [2020-07-08 12:27:50,716 INFO L263 TraceCheckUtils]: 4: Hoare triple {447#true} call #t~ret11 := main(); {447#true} is VALID [2020-07-08 12:27:50,718 INFO L280 TraceCheckUtils]: 5: Hoare triple {447#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.allocOnStack(4); {452#(<= 2 main_~len~0)} is VALID [2020-07-08 12:27:50,721 INFO L263 TraceCheckUtils]: 6: Hoare triple {452#(<= 2 main_~len~0)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {464#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:27:50,722 INFO L280 TraceCheckUtils]: 7: Hoare triple {464#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {465#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-08 12:27:50,724 INFO L280 TraceCheckUtils]: 8: Hoare triple {465#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {465#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-08 12:27:50,726 INFO L280 TraceCheckUtils]: 9: Hoare triple {465#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {465#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-08 12:27:50,727 INFO L280 TraceCheckUtils]: 10: Hoare triple {465#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {465#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-08 12:27:50,729 INFO L280 TraceCheckUtils]: 11: Hoare triple {465#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {448#false} is VALID [2020-07-08 12:27:50,729 INFO L280 TraceCheckUtils]: 12: Hoare triple {448#false} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {448#false} is VALID [2020-07-08 12:27:50,730 INFO L280 TraceCheckUtils]: 13: Hoare triple {448#false} assume !(~len > 0); {448#false} is VALID [2020-07-08 12:27:50,730 INFO L280 TraceCheckUtils]: 14: Hoare triple {448#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {448#false} is VALID [2020-07-08 12:27:50,730 INFO L280 TraceCheckUtils]: 15: Hoare triple {448#false} assume true; {448#false} is VALID [2020-07-08 12:27:50,730 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {448#false} {452#(<= 2 main_~len~0)} #92#return; {448#false} is VALID [2020-07-08 12:27:50,731 INFO L280 TraceCheckUtils]: 17: Hoare triple {448#false} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {448#false} is VALID [2020-07-08 12:27:50,731 INFO L280 TraceCheckUtils]: 18: Hoare triple {448#false} assume !(~i~0 >= 0); {448#false} is VALID [2020-07-08 12:27:50,731 INFO L280 TraceCheckUtils]: 19: Hoare triple {448#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {448#false} is VALID [2020-07-08 12:27:50,732 INFO L280 TraceCheckUtils]: 20: Hoare triple {448#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {448#false} is VALID [2020-07-08 12:27:50,732 INFO L280 TraceCheckUtils]: 21: Hoare triple {448#false} assume !false; {448#false} is VALID [2020-07-08 12:27:50,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:27:50,734 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821539293] [2020-07-08 12:27:50,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:27:50,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 12:27:50,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288982924] [2020-07-08 12:27:50,735 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-07-08 12:27:50,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:27:50,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:27:50,763 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:50,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:27:50,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:27:50,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:27:50,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:27:50,765 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 6 states. [2020-07-08 12:27:51,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:51,169 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2020-07-08 12:27:51,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:27:51,169 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-07-08 12:27:51,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:27:51,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:27:51,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2020-07-08 12:27:51,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:27:51,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2020-07-08 12:27:51,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 63 transitions. [2020-07-08 12:27:51,298 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:51,299 INFO L225 Difference]: With dead ends: 56 [2020-07-08 12:27:51,299 INFO L226 Difference]: Without dead ends: 35 [2020-07-08 12:27:51,303 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:27:51,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-08 12:27:51,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2020-07-08 12:27:51,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:27:51,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 33 states. [2020-07-08 12:27:51,330 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 33 states. [2020-07-08 12:27:51,330 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 33 states. [2020-07-08 12:27:51,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:51,333 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2020-07-08 12:27:51,333 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-07-08 12:27:51,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:51,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:51,334 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 35 states. [2020-07-08 12:27:51,334 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 35 states. [2020-07-08 12:27:51,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:51,336 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2020-07-08 12:27:51,336 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-07-08 12:27:51,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:51,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:51,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:27:51,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:27:51,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-08 12:27:51,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2020-07-08 12:27:51,339 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 22 [2020-07-08 12:27:51,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:27:51,339 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2020-07-08 12:27:51,340 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:27:51,340 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2020-07-08 12:27:51,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-08 12:27:51,341 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:27:51,341 INFO L422 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] [2020-07-08 12:27:51,341 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 12:27:51,341 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:27:51,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:27:51,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1990495648, now seen corresponding path program 1 times [2020-07-08 12:27:51,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:27:51,342 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359000095] [2020-07-08 12:27:51,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:27:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:51,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:51,395 INFO L280 TraceCheckUtils]: 0: Hoare triple {677#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {661#true} is VALID [2020-07-08 12:27:51,396 INFO L280 TraceCheckUtils]: 1: Hoare triple {661#true} assume true; {661#true} is VALID [2020-07-08 12:27:51,396 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {661#true} {661#true} #98#return; {661#true} is VALID [2020-07-08 12:27:51,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:51,461 INFO L280 TraceCheckUtils]: 0: Hoare triple {678#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {679#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-08 12:27:51,462 INFO L280 TraceCheckUtils]: 1: Hoare triple {679#(= dll_create_~len |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {679#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-08 12:27:51,463 INFO L280 TraceCheckUtils]: 2: Hoare triple {679#(= dll_create_~len |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {679#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-08 12:27:51,464 INFO L280 TraceCheckUtils]: 3: Hoare triple {679#(= dll_create_~len |dll_create_#in~len|)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {679#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-08 12:27:51,464 INFO L280 TraceCheckUtils]: 4: Hoare triple {679#(= dll_create_~len |dll_create_#in~len|)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {679#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-08 12:27:51,468 INFO L280 TraceCheckUtils]: 5: Hoare triple {679#(= dll_create_~len |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {680#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-08 12:27:51,468 INFO L280 TraceCheckUtils]: 6: Hoare triple {680#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !(~len > 0); {681#(<= |dll_create_#in~len| 1)} is VALID [2020-07-08 12:27:51,469 INFO L280 TraceCheckUtils]: 7: Hoare triple {681#(<= |dll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {681#(<= |dll_create_#in~len| 1)} is VALID [2020-07-08 12:27:51,469 INFO L280 TraceCheckUtils]: 8: Hoare triple {681#(<= |dll_create_#in~len| 1)} assume true; {681#(<= |dll_create_#in~len| 1)} is VALID [2020-07-08 12:27:51,470 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {681#(<= |dll_create_#in~len| 1)} {666#(<= 2 main_~len~0)} #92#return; {662#false} is VALID [2020-07-08 12:27:51,478 INFO L263 TraceCheckUtils]: 0: Hoare triple {661#true} call ULTIMATE.init(); {677#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:27:51,478 INFO L280 TraceCheckUtils]: 1: Hoare triple {677#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {661#true} is VALID [2020-07-08 12:27:51,478 INFO L280 TraceCheckUtils]: 2: Hoare triple {661#true} assume true; {661#true} is VALID [2020-07-08 12:27:51,479 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {661#true} {661#true} #98#return; {661#true} is VALID [2020-07-08 12:27:51,479 INFO L263 TraceCheckUtils]: 4: Hoare triple {661#true} call #t~ret11 := main(); {661#true} is VALID [2020-07-08 12:27:51,480 INFO L280 TraceCheckUtils]: 5: Hoare triple {661#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.allocOnStack(4); {666#(<= 2 main_~len~0)} is VALID [2020-07-08 12:27:51,488 INFO L263 TraceCheckUtils]: 6: Hoare triple {666#(<= 2 main_~len~0)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {678#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:27:51,489 INFO L280 TraceCheckUtils]: 7: Hoare triple {678#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {679#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-08 12:27:51,489 INFO L280 TraceCheckUtils]: 8: Hoare triple {679#(= dll_create_~len |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {679#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-08 12:27:51,490 INFO L280 TraceCheckUtils]: 9: Hoare triple {679#(= dll_create_~len |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {679#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-08 12:27:51,490 INFO L280 TraceCheckUtils]: 10: Hoare triple {679#(= dll_create_~len |dll_create_#in~len|)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {679#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-08 12:27:51,491 INFO L280 TraceCheckUtils]: 11: Hoare triple {679#(= dll_create_~len |dll_create_#in~len|)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {679#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-08 12:27:51,491 INFO L280 TraceCheckUtils]: 12: Hoare triple {679#(= dll_create_~len |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {680#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-08 12:27:51,493 INFO L280 TraceCheckUtils]: 13: Hoare triple {680#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !(~len > 0); {681#(<= |dll_create_#in~len| 1)} is VALID [2020-07-08 12:27:51,493 INFO L280 TraceCheckUtils]: 14: Hoare triple {681#(<= |dll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {681#(<= |dll_create_#in~len| 1)} is VALID [2020-07-08 12:27:51,494 INFO L280 TraceCheckUtils]: 15: Hoare triple {681#(<= |dll_create_#in~len| 1)} assume true; {681#(<= |dll_create_#in~len| 1)} is VALID [2020-07-08 12:27:51,495 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {681#(<= |dll_create_#in~len| 1)} {666#(<= 2 main_~len~0)} #92#return; {662#false} is VALID [2020-07-08 12:27:51,495 INFO L280 TraceCheckUtils]: 17: Hoare triple {662#false} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {662#false} is VALID [2020-07-08 12:27:51,496 INFO L280 TraceCheckUtils]: 18: Hoare triple {662#false} assume !(~i~0 >= 0); {662#false} is VALID [2020-07-08 12:27:51,496 INFO L280 TraceCheckUtils]: 19: Hoare triple {662#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {662#false} is VALID [2020-07-08 12:27:51,496 INFO L280 TraceCheckUtils]: 20: Hoare triple {662#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {662#false} is VALID [2020-07-08 12:27:51,496 INFO L280 TraceCheckUtils]: 21: Hoare triple {662#false} assume !false; {662#false} is VALID [2020-07-08 12:27:51,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:27:51,498 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359000095] [2020-07-08 12:27:51,498 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484952949] [2020-07-08 12:27:51,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:27:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:51,616 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-08 12:27:51,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:51,633 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:27:51,731 INFO L263 TraceCheckUtils]: 0: Hoare triple {661#true} call ULTIMATE.init(); {661#true} is VALID [2020-07-08 12:27:51,731 INFO L280 TraceCheckUtils]: 1: Hoare triple {661#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {661#true} is VALID [2020-07-08 12:27:51,732 INFO L280 TraceCheckUtils]: 2: Hoare triple {661#true} assume true; {661#true} is VALID [2020-07-08 12:27:51,732 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {661#true} {661#true} #98#return; {661#true} is VALID [2020-07-08 12:27:51,732 INFO L263 TraceCheckUtils]: 4: Hoare triple {661#true} call #t~ret11 := main(); {661#true} is VALID [2020-07-08 12:27:51,733 INFO L280 TraceCheckUtils]: 5: Hoare triple {661#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.allocOnStack(4); {666#(<= 2 main_~len~0)} is VALID [2020-07-08 12:27:51,734 INFO L263 TraceCheckUtils]: 6: Hoare triple {666#(<= 2 main_~len~0)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {661#true} is VALID [2020-07-08 12:27:51,735 INFO L280 TraceCheckUtils]: 7: Hoare triple {661#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {706#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2020-07-08 12:27:51,735 INFO L280 TraceCheckUtils]: 8: Hoare triple {706#(<= |dll_create_#in~len| dll_create_~len)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {706#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2020-07-08 12:27:51,736 INFO L280 TraceCheckUtils]: 9: Hoare triple {706#(<= |dll_create_#in~len| dll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {706#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2020-07-08 12:27:51,737 INFO L280 TraceCheckUtils]: 10: Hoare triple {706#(<= |dll_create_#in~len| dll_create_~len)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {706#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2020-07-08 12:27:51,737 INFO L280 TraceCheckUtils]: 11: Hoare triple {706#(<= |dll_create_#in~len| dll_create_~len)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {706#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2020-07-08 12:27:51,738 INFO L280 TraceCheckUtils]: 12: Hoare triple {706#(<= |dll_create_#in~len| dll_create_~len)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {680#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-08 12:27:51,740 INFO L280 TraceCheckUtils]: 13: Hoare triple {680#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !(~len > 0); {681#(<= |dll_create_#in~len| 1)} is VALID [2020-07-08 12:27:51,740 INFO L280 TraceCheckUtils]: 14: Hoare triple {681#(<= |dll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {681#(<= |dll_create_#in~len| 1)} is VALID [2020-07-08 12:27:51,741 INFO L280 TraceCheckUtils]: 15: Hoare triple {681#(<= |dll_create_#in~len| 1)} assume true; {681#(<= |dll_create_#in~len| 1)} is VALID [2020-07-08 12:27:51,743 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {681#(<= |dll_create_#in~len| 1)} {666#(<= 2 main_~len~0)} #92#return; {662#false} is VALID [2020-07-08 12:27:51,743 INFO L280 TraceCheckUtils]: 17: Hoare triple {662#false} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {662#false} is VALID [2020-07-08 12:27:51,743 INFO L280 TraceCheckUtils]: 18: Hoare triple {662#false} assume !(~i~0 >= 0); {662#false} is VALID [2020-07-08 12:27:51,744 INFO L280 TraceCheckUtils]: 19: Hoare triple {662#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {662#false} is VALID [2020-07-08 12:27:51,744 INFO L280 TraceCheckUtils]: 20: Hoare triple {662#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {662#false} is VALID [2020-07-08 12:27:51,744 INFO L280 TraceCheckUtils]: 21: Hoare triple {662#false} assume !false; {662#false} is VALID [2020-07-08 12:27:51,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:27:51,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:27:51,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2020-07-08 12:27:51,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3021241] [2020-07-08 12:27:51,747 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-07-08 12:27:51,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:27:51,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 12:27:51,789 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:51,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 12:27:51,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:27:51,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 12:27:51,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-08 12:27:51,790 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 9 states. [2020-07-08 12:27:52,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:52,263 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2020-07-08 12:27:52,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 12:27:52,263 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-07-08 12:27:52,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:27:52,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 12:27:52,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2020-07-08 12:27:52,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 12:27:52,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2020-07-08 12:27:52,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 62 transitions. [2020-07-08 12:27:52,350 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:52,351 INFO L225 Difference]: With dead ends: 56 [2020-07-08 12:27:52,352 INFO L226 Difference]: Without dead ends: 40 [2020-07-08 12:27:52,354 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-07-08 12:27:52,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-08 12:27:52,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2020-07-08 12:27:52,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:27:52,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 35 states. [2020-07-08 12:27:52,386 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 35 states. [2020-07-08 12:27:52,387 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 35 states. [2020-07-08 12:27:52,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:52,388 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-08 12:27:52,389 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-08 12:27:52,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:52,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:52,389 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 40 states. [2020-07-08 12:27:52,390 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 40 states. [2020-07-08 12:27:52,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:52,392 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-08 12:27:52,392 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-08 12:27:52,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:52,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:52,393 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:27:52,393 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:27:52,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-08 12:27:52,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2020-07-08 12:27:52,395 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 22 [2020-07-08 12:27:52,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:27:52,395 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2020-07-08 12:27:52,395 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 12:27:52,396 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-07-08 12:27:52,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-08 12:27:52,396 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:27:52,397 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:27:52,608 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:27:52,609 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:27:52,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:27:52,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1511329333, now seen corresponding path program 1 times [2020-07-08 12:27:52,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:27:52,611 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466918097] [2020-07-08 12:27:52,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:27:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:52,688 INFO L280 TraceCheckUtils]: 0: Hoare triple {978#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {956#true} is VALID [2020-07-08 12:27:52,689 INFO L280 TraceCheckUtils]: 1: Hoare triple {956#true} assume true; {956#true} is VALID [2020-07-08 12:27:52,689 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {956#true} {956#true} #98#return; {956#true} is VALID [2020-07-08 12:27:52,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:52,737 INFO L280 TraceCheckUtils]: 0: Hoare triple {979#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {956#true} is VALID [2020-07-08 12:27:52,738 INFO L280 TraceCheckUtils]: 1: Hoare triple {956#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {956#true} is VALID [2020-07-08 12:27:52,738 INFO L280 TraceCheckUtils]: 2: Hoare triple {956#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {956#true} is VALID [2020-07-08 12:27:52,738 INFO L280 TraceCheckUtils]: 3: Hoare triple {956#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {956#true} is VALID [2020-07-08 12:27:52,738 INFO L280 TraceCheckUtils]: 4: Hoare triple {956#true} assume !(~head~0.base != 0 || ~head~0.offset != 0); {956#true} is VALID [2020-07-08 12:27:52,738 INFO L280 TraceCheckUtils]: 5: Hoare triple {956#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {956#true} is VALID [2020-07-08 12:27:52,739 INFO L280 TraceCheckUtils]: 6: Hoare triple {956#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {956#true} is VALID [2020-07-08 12:27:52,739 INFO L280 TraceCheckUtils]: 7: Hoare triple {956#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {956#true} is VALID [2020-07-08 12:27:52,739 INFO L280 TraceCheckUtils]: 8: Hoare triple {956#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {956#true} is VALID [2020-07-08 12:27:52,739 INFO L280 TraceCheckUtils]: 9: Hoare triple {956#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {956#true} is VALID [2020-07-08 12:27:52,739 INFO L280 TraceCheckUtils]: 10: Hoare triple {956#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {956#true} is VALID [2020-07-08 12:27:52,740 INFO L280 TraceCheckUtils]: 11: Hoare triple {956#true} assume !(~len > 0); {956#true} is VALID [2020-07-08 12:27:52,740 INFO L280 TraceCheckUtils]: 12: Hoare triple {956#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {956#true} is VALID [2020-07-08 12:27:52,740 INFO L280 TraceCheckUtils]: 13: Hoare triple {956#true} assume true; {956#true} is VALID [2020-07-08 12:27:52,741 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {956#true} {961#(<= 2 main_~len~0)} #92#return; {961#(<= 2 main_~len~0)} is VALID [2020-07-08 12:27:52,748 INFO L263 TraceCheckUtils]: 0: Hoare triple {956#true} call ULTIMATE.init(); {978#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:27:52,749 INFO L280 TraceCheckUtils]: 1: Hoare triple {978#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {956#true} is VALID [2020-07-08 12:27:52,749 INFO L280 TraceCheckUtils]: 2: Hoare triple {956#true} assume true; {956#true} is VALID [2020-07-08 12:27:52,749 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {956#true} {956#true} #98#return; {956#true} is VALID [2020-07-08 12:27:52,749 INFO L263 TraceCheckUtils]: 4: Hoare triple {956#true} call #t~ret11 := main(); {956#true} is VALID [2020-07-08 12:27:52,750 INFO L280 TraceCheckUtils]: 5: Hoare triple {956#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.allocOnStack(4); {961#(<= 2 main_~len~0)} is VALID [2020-07-08 12:27:52,751 INFO L263 TraceCheckUtils]: 6: Hoare triple {961#(<= 2 main_~len~0)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {979#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:27:52,751 INFO L280 TraceCheckUtils]: 7: Hoare triple {979#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {956#true} is VALID [2020-07-08 12:27:52,752 INFO L280 TraceCheckUtils]: 8: Hoare triple {956#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {956#true} is VALID [2020-07-08 12:27:52,752 INFO L280 TraceCheckUtils]: 9: Hoare triple {956#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {956#true} is VALID [2020-07-08 12:27:52,752 INFO L280 TraceCheckUtils]: 10: Hoare triple {956#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {956#true} is VALID [2020-07-08 12:27:52,752 INFO L280 TraceCheckUtils]: 11: Hoare triple {956#true} assume !(~head~0.base != 0 || ~head~0.offset != 0); {956#true} is VALID [2020-07-08 12:27:52,753 INFO L280 TraceCheckUtils]: 12: Hoare triple {956#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {956#true} is VALID [2020-07-08 12:27:52,753 INFO L280 TraceCheckUtils]: 13: Hoare triple {956#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {956#true} is VALID [2020-07-08 12:27:52,753 INFO L280 TraceCheckUtils]: 14: Hoare triple {956#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {956#true} is VALID [2020-07-08 12:27:52,753 INFO L280 TraceCheckUtils]: 15: Hoare triple {956#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {956#true} is VALID [2020-07-08 12:27:52,753 INFO L280 TraceCheckUtils]: 16: Hoare triple {956#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {956#true} is VALID [2020-07-08 12:27:52,754 INFO L280 TraceCheckUtils]: 17: Hoare triple {956#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {956#true} is VALID [2020-07-08 12:27:52,754 INFO L280 TraceCheckUtils]: 18: Hoare triple {956#true} assume !(~len > 0); {956#true} is VALID [2020-07-08 12:27:52,754 INFO L280 TraceCheckUtils]: 19: Hoare triple {956#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {956#true} is VALID [2020-07-08 12:27:52,754 INFO L280 TraceCheckUtils]: 20: Hoare triple {956#true} assume true; {956#true} is VALID [2020-07-08 12:27:52,755 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {956#true} {961#(<= 2 main_~len~0)} #92#return; {961#(<= 2 main_~len~0)} is VALID [2020-07-08 12:27:52,756 INFO L280 TraceCheckUtils]: 22: Hoare triple {961#(<= 2 main_~len~0)} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {977#(<= 1 main_~i~0)} is VALID [2020-07-08 12:27:52,757 INFO L280 TraceCheckUtils]: 23: Hoare triple {977#(<= 1 main_~i~0)} assume !(~i~0 >= 0); {957#false} is VALID [2020-07-08 12:27:52,757 INFO L280 TraceCheckUtils]: 24: Hoare triple {957#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {957#false} is VALID [2020-07-08 12:27:52,757 INFO L280 TraceCheckUtils]: 25: Hoare triple {957#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {957#false} is VALID [2020-07-08 12:27:52,757 INFO L280 TraceCheckUtils]: 26: Hoare triple {957#false} assume !false; {957#false} is VALID [2020-07-08 12:27:52,759 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-08 12:27:52,759 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466918097] [2020-07-08 12:27:52,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:27:52,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 12:27:52,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684637759] [2020-07-08 12:27:52,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-08 12:27:52,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:27:52,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:27:52,799 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:52,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:27:52,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:27:52,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:27:52,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:27:52,812 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 6 states. [2020-07-08 12:27:53,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:53,174 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2020-07-08 12:27:53,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:27:53,175 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-08 12:27:53,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:27:53,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:27:53,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2020-07-08 12:27:53,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:27:53,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2020-07-08 12:27:53,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2020-07-08 12:27:53,261 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:53,264 INFO L225 Difference]: With dead ends: 43 [2020-07-08 12:27:53,264 INFO L226 Difference]: Without dead ends: 39 [2020-07-08 12:27:53,265 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:27:53,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-08 12:27:53,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2020-07-08 12:27:53,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:27:53,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 36 states. [2020-07-08 12:27:53,298 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 36 states. [2020-07-08 12:27:53,298 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 36 states. [2020-07-08 12:27:53,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:53,302 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2020-07-08 12:27:53,302 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-07-08 12:27:53,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:53,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:53,303 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 39 states. [2020-07-08 12:27:53,303 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 39 states. [2020-07-08 12:27:53,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:53,306 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2020-07-08 12:27:53,306 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-07-08 12:27:53,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:53,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:53,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:27:53,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:27:53,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-08 12:27:53,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2020-07-08 12:27:53,309 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 27 [2020-07-08 12:27:53,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:27:53,309 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2020-07-08 12:27:53,309 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:27:53,309 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2020-07-08 12:27:53,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-08 12:27:53,310 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:27:53,311 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-08 12:27:53,311 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 12:27:53,311 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:27:53,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:27:53,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1801861723, now seen corresponding path program 1 times [2020-07-08 12:27:53,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:27:53,312 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926038099] [2020-07-08 12:27:53,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:27:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:53,387 INFO L280 TraceCheckUtils]: 0: Hoare triple {1202#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1174#true} is VALID [2020-07-08 12:27:53,387 INFO L280 TraceCheckUtils]: 1: Hoare triple {1174#true} assume true; {1174#true} is VALID [2020-07-08 12:27:53,387 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1174#true} {1174#true} #98#return; {1174#true} is VALID [2020-07-08 12:27:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:53,423 INFO L280 TraceCheckUtils]: 0: Hoare triple {1203#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1174#true} is VALID [2020-07-08 12:27:53,424 INFO L280 TraceCheckUtils]: 1: Hoare triple {1174#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1174#true} is VALID [2020-07-08 12:27:53,424 INFO L280 TraceCheckUtils]: 2: Hoare triple {1174#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1174#true} is VALID [2020-07-08 12:27:53,424 INFO L280 TraceCheckUtils]: 3: Hoare triple {1174#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1174#true} is VALID [2020-07-08 12:27:53,424 INFO L280 TraceCheckUtils]: 4: Hoare triple {1174#true} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1174#true} is VALID [2020-07-08 12:27:53,425 INFO L280 TraceCheckUtils]: 5: Hoare triple {1174#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1174#true} is VALID [2020-07-08 12:27:53,425 INFO L280 TraceCheckUtils]: 6: Hoare triple {1174#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1174#true} is VALID [2020-07-08 12:27:53,425 INFO L280 TraceCheckUtils]: 7: Hoare triple {1174#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1174#true} is VALID [2020-07-08 12:27:53,425 INFO L280 TraceCheckUtils]: 8: Hoare triple {1174#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1174#true} is VALID [2020-07-08 12:27:53,426 INFO L280 TraceCheckUtils]: 9: Hoare triple {1174#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {1174#true} is VALID [2020-07-08 12:27:53,426 INFO L280 TraceCheckUtils]: 10: Hoare triple {1174#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1174#true} is VALID [2020-07-08 12:27:53,426 INFO L280 TraceCheckUtils]: 11: Hoare triple {1174#true} assume !(~len > 0); {1174#true} is VALID [2020-07-08 12:27:53,426 INFO L280 TraceCheckUtils]: 12: Hoare triple {1174#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1174#true} is VALID [2020-07-08 12:27:53,427 INFO L280 TraceCheckUtils]: 13: Hoare triple {1174#true} assume true; {1174#true} is VALID [2020-07-08 12:27:53,428 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1174#true} {1179#(<= 2 main_~len~0)} #92#return; {1179#(<= 2 main_~len~0)} is VALID [2020-07-08 12:27:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:53,451 INFO L280 TraceCheckUtils]: 0: Hoare triple {1204#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset; {1174#true} is VALID [2020-07-08 12:27:53,451 INFO L280 TraceCheckUtils]: 1: Hoare triple {1174#true} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {1174#true} is VALID [2020-07-08 12:27:53,452 INFO L280 TraceCheckUtils]: 2: Hoare triple {1174#true} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {1174#true} is VALID [2020-07-08 12:27:53,452 INFO L280 TraceCheckUtils]: 3: Hoare triple {1174#true} assume true; {1174#true} is VALID [2020-07-08 12:27:53,453 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1174#true} {1195#(<= 1 main_~i~0)} #94#return; {1195#(<= 1 main_~i~0)} is VALID [2020-07-08 12:27:53,454 INFO L263 TraceCheckUtils]: 0: Hoare triple {1174#true} call ULTIMATE.init(); {1202#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:27:53,454 INFO L280 TraceCheckUtils]: 1: Hoare triple {1202#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1174#true} is VALID [2020-07-08 12:27:53,454 INFO L280 TraceCheckUtils]: 2: Hoare triple {1174#true} assume true; {1174#true} is VALID [2020-07-08 12:27:53,454 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1174#true} {1174#true} #98#return; {1174#true} is VALID [2020-07-08 12:27:53,455 INFO L263 TraceCheckUtils]: 4: Hoare triple {1174#true} call #t~ret11 := main(); {1174#true} is VALID [2020-07-08 12:27:53,456 INFO L280 TraceCheckUtils]: 5: Hoare triple {1174#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.allocOnStack(4); {1179#(<= 2 main_~len~0)} is VALID [2020-07-08 12:27:53,457 INFO L263 TraceCheckUtils]: 6: Hoare triple {1179#(<= 2 main_~len~0)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {1203#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:27:53,457 INFO L280 TraceCheckUtils]: 7: Hoare triple {1203#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1174#true} is VALID [2020-07-08 12:27:53,458 INFO L280 TraceCheckUtils]: 8: Hoare triple {1174#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1174#true} is VALID [2020-07-08 12:27:53,458 INFO L280 TraceCheckUtils]: 9: Hoare triple {1174#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1174#true} is VALID [2020-07-08 12:27:53,458 INFO L280 TraceCheckUtils]: 10: Hoare triple {1174#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1174#true} is VALID [2020-07-08 12:27:53,458 INFO L280 TraceCheckUtils]: 11: Hoare triple {1174#true} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1174#true} is VALID [2020-07-08 12:27:53,459 INFO L280 TraceCheckUtils]: 12: Hoare triple {1174#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1174#true} is VALID [2020-07-08 12:27:53,459 INFO L280 TraceCheckUtils]: 13: Hoare triple {1174#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1174#true} is VALID [2020-07-08 12:27:53,459 INFO L280 TraceCheckUtils]: 14: Hoare triple {1174#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1174#true} is VALID [2020-07-08 12:27:53,459 INFO L280 TraceCheckUtils]: 15: Hoare triple {1174#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1174#true} is VALID [2020-07-08 12:27:53,460 INFO L280 TraceCheckUtils]: 16: Hoare triple {1174#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {1174#true} is VALID [2020-07-08 12:27:53,460 INFO L280 TraceCheckUtils]: 17: Hoare triple {1174#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1174#true} is VALID [2020-07-08 12:27:53,460 INFO L280 TraceCheckUtils]: 18: Hoare triple {1174#true} assume !(~len > 0); {1174#true} is VALID [2020-07-08 12:27:53,460 INFO L280 TraceCheckUtils]: 19: Hoare triple {1174#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1174#true} is VALID [2020-07-08 12:27:53,461 INFO L280 TraceCheckUtils]: 20: Hoare triple {1174#true} assume true; {1174#true} is VALID [2020-07-08 12:27:53,462 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1174#true} {1179#(<= 2 main_~len~0)} #92#return; {1179#(<= 2 main_~len~0)} is VALID [2020-07-08 12:27:53,463 INFO L280 TraceCheckUtils]: 22: Hoare triple {1179#(<= 2 main_~len~0)} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {1195#(<= 1 main_~i~0)} is VALID [2020-07-08 12:27:53,464 INFO L280 TraceCheckUtils]: 23: Hoare triple {1195#(<= 1 main_~i~0)} assume !!(~i~0 >= 0); {1195#(<= 1 main_~i~0)} is VALID [2020-07-08 12:27:53,465 INFO L263 TraceCheckUtils]: 24: Hoare triple {1195#(<= 1 main_~i~0)} call dll_remove_first(~#s~0.base, ~#s~0.offset); {1204#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:27:53,465 INFO L280 TraceCheckUtils]: 25: Hoare triple {1204#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset; {1174#true} is VALID [2020-07-08 12:27:53,465 INFO L280 TraceCheckUtils]: 26: Hoare triple {1174#true} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {1174#true} is VALID [2020-07-08 12:27:53,466 INFO L280 TraceCheckUtils]: 27: Hoare triple {1174#true} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {1174#true} is VALID [2020-07-08 12:27:53,466 INFO L280 TraceCheckUtils]: 28: Hoare triple {1174#true} assume true; {1174#true} is VALID [2020-07-08 12:27:53,467 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1174#true} {1195#(<= 1 main_~i~0)} #94#return; {1195#(<= 1 main_~i~0)} is VALID [2020-07-08 12:27:53,468 INFO L280 TraceCheckUtils]: 30: Hoare triple {1195#(<= 1 main_~i~0)} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {1201#(<= 0 main_~i~0)} is VALID [2020-07-08 12:27:53,468 INFO L280 TraceCheckUtils]: 31: Hoare triple {1201#(<= 0 main_~i~0)} assume !(~i~0 >= 0); {1175#false} is VALID [2020-07-08 12:27:53,469 INFO L280 TraceCheckUtils]: 32: Hoare triple {1175#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {1175#false} is VALID [2020-07-08 12:27:53,469 INFO L280 TraceCheckUtils]: 33: Hoare triple {1175#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1175#false} is VALID [2020-07-08 12:27:53,469 INFO L280 TraceCheckUtils]: 34: Hoare triple {1175#false} assume !false; {1175#false} is VALID [2020-07-08 12:27:53,471 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-08 12:27:53,471 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926038099] [2020-07-08 12:27:53,471 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705786391] [2020-07-08 12:27:53,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:27:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:53,577 INFO L264 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-08 12:27:53,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:53,592 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:27:53,645 INFO L263 TraceCheckUtils]: 0: Hoare triple {1174#true} call ULTIMATE.init(); {1174#true} is VALID [2020-07-08 12:27:53,646 INFO L280 TraceCheckUtils]: 1: Hoare triple {1174#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1174#true} is VALID [2020-07-08 12:27:53,646 INFO L280 TraceCheckUtils]: 2: Hoare triple {1174#true} assume true; {1174#true} is VALID [2020-07-08 12:27:53,646 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1174#true} {1174#true} #98#return; {1174#true} is VALID [2020-07-08 12:27:53,647 INFO L263 TraceCheckUtils]: 4: Hoare triple {1174#true} call #t~ret11 := main(); {1174#true} is VALID [2020-07-08 12:27:53,648 INFO L280 TraceCheckUtils]: 5: Hoare triple {1174#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.allocOnStack(4); {1179#(<= 2 main_~len~0)} is VALID [2020-07-08 12:27:53,648 INFO L263 TraceCheckUtils]: 6: Hoare triple {1179#(<= 2 main_~len~0)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {1174#true} is VALID [2020-07-08 12:27:53,648 INFO L280 TraceCheckUtils]: 7: Hoare triple {1174#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1174#true} is VALID [2020-07-08 12:27:53,648 INFO L280 TraceCheckUtils]: 8: Hoare triple {1174#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1174#true} is VALID [2020-07-08 12:27:53,648 INFO L280 TraceCheckUtils]: 9: Hoare triple {1174#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1174#true} is VALID [2020-07-08 12:27:53,649 INFO L280 TraceCheckUtils]: 10: Hoare triple {1174#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1174#true} is VALID [2020-07-08 12:27:53,649 INFO L280 TraceCheckUtils]: 11: Hoare triple {1174#true} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1174#true} is VALID [2020-07-08 12:27:53,649 INFO L280 TraceCheckUtils]: 12: Hoare triple {1174#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1174#true} is VALID [2020-07-08 12:27:53,649 INFO L280 TraceCheckUtils]: 13: Hoare triple {1174#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1174#true} is VALID [2020-07-08 12:27:53,650 INFO L280 TraceCheckUtils]: 14: Hoare triple {1174#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1174#true} is VALID [2020-07-08 12:27:53,650 INFO L280 TraceCheckUtils]: 15: Hoare triple {1174#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1174#true} is VALID [2020-07-08 12:27:53,650 INFO L280 TraceCheckUtils]: 16: Hoare triple {1174#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {1174#true} is VALID [2020-07-08 12:27:53,650 INFO L280 TraceCheckUtils]: 17: Hoare triple {1174#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1174#true} is VALID [2020-07-08 12:27:53,651 INFO L280 TraceCheckUtils]: 18: Hoare triple {1174#true} assume !(~len > 0); {1174#true} is VALID [2020-07-08 12:27:53,651 INFO L280 TraceCheckUtils]: 19: Hoare triple {1174#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1174#true} is VALID [2020-07-08 12:27:53,651 INFO L280 TraceCheckUtils]: 20: Hoare triple {1174#true} assume true; {1174#true} is VALID [2020-07-08 12:27:53,652 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1174#true} {1179#(<= 2 main_~len~0)} #92#return; {1179#(<= 2 main_~len~0)} is VALID [2020-07-08 12:27:53,653 INFO L280 TraceCheckUtils]: 22: Hoare triple {1179#(<= 2 main_~len~0)} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {1195#(<= 1 main_~i~0)} is VALID [2020-07-08 12:27:53,654 INFO L280 TraceCheckUtils]: 23: Hoare triple {1195#(<= 1 main_~i~0)} assume !!(~i~0 >= 0); {1195#(<= 1 main_~i~0)} is VALID [2020-07-08 12:27:53,654 INFO L263 TraceCheckUtils]: 24: Hoare triple {1195#(<= 1 main_~i~0)} call dll_remove_first(~#s~0.base, ~#s~0.offset); {1174#true} is VALID [2020-07-08 12:27:53,654 INFO L280 TraceCheckUtils]: 25: Hoare triple {1174#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset; {1174#true} is VALID [2020-07-08 12:27:53,654 INFO L280 TraceCheckUtils]: 26: Hoare triple {1174#true} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {1174#true} is VALID [2020-07-08 12:27:53,655 INFO L280 TraceCheckUtils]: 27: Hoare triple {1174#true} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {1174#true} is VALID [2020-07-08 12:27:53,655 INFO L280 TraceCheckUtils]: 28: Hoare triple {1174#true} assume true; {1174#true} is VALID [2020-07-08 12:27:53,656 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1174#true} {1195#(<= 1 main_~i~0)} #94#return; {1195#(<= 1 main_~i~0)} is VALID [2020-07-08 12:27:53,657 INFO L280 TraceCheckUtils]: 30: Hoare triple {1195#(<= 1 main_~i~0)} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {1201#(<= 0 main_~i~0)} is VALID [2020-07-08 12:27:53,657 INFO L280 TraceCheckUtils]: 31: Hoare triple {1201#(<= 0 main_~i~0)} assume !(~i~0 >= 0); {1175#false} is VALID [2020-07-08 12:27:53,658 INFO L280 TraceCheckUtils]: 32: Hoare triple {1175#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {1175#false} is VALID [2020-07-08 12:27:53,658 INFO L280 TraceCheckUtils]: 33: Hoare triple {1175#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1175#false} is VALID [2020-07-08 12:27:53,658 INFO L280 TraceCheckUtils]: 34: Hoare triple {1175#false} assume !false; {1175#false} is VALID [2020-07-08 12:27:53,675 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-08 12:27:53,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:27:53,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 8 [2020-07-08 12:27:53,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735307627] [2020-07-08 12:27:53,677 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2020-07-08 12:27:53,677 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:27:53,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 12:27:53,715 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:53,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 12:27:53,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:27:53,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 12:27:53,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:27:53,716 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 8 states. [2020-07-08 12:27:54,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:54,176 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2020-07-08 12:27:54,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:27:54,177 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2020-07-08 12:27:54,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:27:54,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:27:54,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2020-07-08 12:27:54,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:27:54,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2020-07-08 12:27:54,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 43 transitions. [2020-07-08 12:27:54,235 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:54,237 INFO L225 Difference]: With dead ends: 44 [2020-07-08 12:27:54,237 INFO L226 Difference]: Without dead ends: 40 [2020-07-08 12:27:54,238 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-07-08 12:27:54,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-08 12:27:54,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2020-07-08 12:27:54,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:27:54,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2020-07-08 12:27:54,271 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2020-07-08 12:27:54,271 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2020-07-08 12:27:54,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:54,275 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-08 12:27:54,275 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-08 12:27:54,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:54,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:54,276 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2020-07-08 12:27:54,276 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2020-07-08 12:27:54,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:54,280 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-08 12:27:54,280 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-08 12:27:54,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:54,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:54,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:27:54,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:27:54,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-08 12:27:54,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-07-08 12:27:54,284 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 35 [2020-07-08 12:27:54,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:27:54,287 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-07-08 12:27:54,287 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 12:27:54,287 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-07-08 12:27:54,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-08 12:27:54,290 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:27:54,290 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-08 12:27:54,505 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:27:54,506 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:27:54,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:27:54,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1626595457, now seen corresponding path program 2 times [2020-07-08 12:27:54,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:27:54,507 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099795990] [2020-07-08 12:27:54,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:27:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:54,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:54,806 INFO L280 TraceCheckUtils]: 0: Hoare triple {1548#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1512#true} is VALID [2020-07-08 12:27:54,807 INFO L280 TraceCheckUtils]: 1: Hoare triple {1512#true} assume true; {1512#true} is VALID [2020-07-08 12:27:54,807 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1512#true} {1512#true} #98#return; {1512#true} is VALID [2020-07-08 12:27:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:55,556 INFO L280 TraceCheckUtils]: 0: Hoare triple {1549#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1550#(and (= |#valid| |old(#valid)|) (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-08 12:27:55,559 INFO L280 TraceCheckUtils]: 1: Hoare triple {1550#(and (= |#valid| |old(#valid)|) (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1551#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 dll_create_~new_head~0.offset) (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base) (= 1 (select |#valid| dll_create_~new_head~0.base)))} is VALID [2020-07-08 12:27:55,559 INFO L280 TraceCheckUtils]: 2: Hoare triple {1551#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 dll_create_~new_head~0.offset) (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base) (= 1 (select |#valid| dll_create_~new_head~0.base)))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1551#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 dll_create_~new_head~0.offset) (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base) (= 1 (select |#valid| dll_create_~new_head~0.base)))} is VALID [2020-07-08 12:27:55,561 INFO L280 TraceCheckUtils]: 3: Hoare triple {1551#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 dll_create_~new_head~0.offset) (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base) (= 1 (select |#valid| dll_create_~new_head~0.base)))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1552#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 dll_create_~new_head~0.offset) (= 0 dll_create_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) 0) (= 0 dll_create_~head~0.base) (= 1 (select |#valid| dll_create_~new_head~0.base)))} is VALID [2020-07-08 12:27:55,561 INFO L280 TraceCheckUtils]: 4: Hoare triple {1552#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 dll_create_~new_head~0.offset) (= 0 dll_create_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) 0) (= 0 dll_create_~head~0.base) (= 1 (select |#valid| dll_create_~new_head~0.base)))} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1553#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) 0) (= 1 (select |#valid| dll_create_~new_head~0.base)))} is VALID [2020-07-08 12:27:55,562 INFO L280 TraceCheckUtils]: 5: Hoare triple {1553#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) 0) (= 1 (select |#valid| dll_create_~new_head~0.base)))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1554#(and (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= (select |#valid| dll_create_~head~0.base) 1))} is VALID [2020-07-08 12:27:55,563 INFO L280 TraceCheckUtils]: 6: Hoare triple {1554#(and (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= (select |#valid| dll_create_~head~0.base) 1))} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1555#(and (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))} is VALID [2020-07-08 12:27:55,564 INFO L280 TraceCheckUtils]: 7: Hoare triple {1555#(and (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1555#(and (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))} is VALID [2020-07-08 12:27:55,566 INFO L280 TraceCheckUtils]: 8: Hoare triple {1555#(and (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1556#(and (= (select |old(#valid)| (select (select (store |#memory_$Pointer$.base| dll_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.base)) dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 0) (= 0 dll_create_~new_head~0.offset) (= 0 (select (store (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.base) 4)) (= 0 (select (store (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.offset) 4)) (= 0 (select (select (store |#memory_$Pointer$.offset| dll_create_~head~0.base (store (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.offset)) dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)) (= (select (select (store |#memory_$Pointer$.base| dll_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.base)) dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) dll_create_~head~0.base))} is VALID [2020-07-08 12:27:55,569 INFO L280 TraceCheckUtils]: 9: Hoare triple {1556#(and (= (select |old(#valid)| (select (select (store |#memory_$Pointer$.base| dll_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.base)) dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 0) (= 0 dll_create_~new_head~0.offset) (= 0 (select (store (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.base) 4)) (= 0 (select (store (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.offset) 4)) (= 0 (select (select (store |#memory_$Pointer$.offset| dll_create_~head~0.base (store (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.offset)) dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)) (= (select (select (store |#memory_$Pointer$.base| dll_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.base)) dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) dll_create_~head~0.base))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {1557#(and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 4) 0) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 4)))} is VALID [2020-07-08 12:27:55,570 INFO L280 TraceCheckUtils]: 10: Hoare triple {1557#(and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 4) 0) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 4)))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1558#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4))))} is VALID [2020-07-08 12:27:55,571 INFO L280 TraceCheckUtils]: 11: Hoare triple {1558#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4))))} assume !(~len > 0); {1558#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4))))} is VALID [2020-07-08 12:27:55,576 INFO L280 TraceCheckUtils]: 12: Hoare triple {1558#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4))))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1559#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) 4)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 0) (= 0 |dll_create_#res.offset|))} is VALID [2020-07-08 12:27:55,577 INFO L280 TraceCheckUtils]: 13: Hoare triple {1559#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) 4)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 0) (= 0 |dll_create_#res.offset|))} assume true; {1559#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) 4)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 0) (= 0 |dll_create_#res.offset|))} is VALID [2020-07-08 12:27:55,584 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1559#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) 4)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 0) (= 0 |dll_create_#res.offset|))} {1517#(= (select |#valid| |main_~#s~0.base|) 1)} #92#return; {1533#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) 4)) 4)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) 4))) (= 0 |main_#t~ret8.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~ret8.base|) 4)))} is VALID [2020-07-08 12:27:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:55,882 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 36 [2020-07-08 12:27:56,146 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2020-07-08 12:27:56,253 INFO L280 TraceCheckUtils]: 0: Hoare triple {1560#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset; {1561#(and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (or (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)) dll_remove_first_~temp~1.base) (= 0 (+ dll_remove_first_~temp~1.offset 4))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)) dll_remove_first_~temp~1.offset)) (not (= 0 (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset)))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|))} is VALID [2020-07-08 12:27:56,257 INFO L280 TraceCheckUtils]: 1: Hoare triple {1561#(and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (or (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)) dll_remove_first_~temp~1.base) (= 0 (+ dll_remove_first_~temp~1.offset 4))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)) dll_remove_first_~temp~1.offset)) (not (= 0 (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset)))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|))} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {1562#(or (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (not (= 0 (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset))) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)) (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (or (and (or (= dll_remove_first_~temp~1.base dll_remove_first_~head.base) (and (= dll_remove_first_~temp~1.base (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4)) (= (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~temp~1.base) 4) (select (select (store |#memory_$Pointer$.base| dll_remove_first_~head.base (store (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset dll_remove_first_~temp~1.base)) dll_remove_first_~temp~1.base) 4)) (= (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~temp~1.base) 4) (select (select (store |#memory_$Pointer$.offset| dll_remove_first_~head.base (store (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset dll_remove_first_~temp~1.offset)) dll_remove_first_~temp~1.base) 4)))) (or (not (= dll_remove_first_~temp~1.base dll_remove_first_~head.base)) (= |dll_remove_first_#in~head.base| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4)))) (= 0 (+ dll_remove_first_~temp~1.offset 4))) (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4) dll_remove_first_~temp~1.offset) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)))} is VALID [2020-07-08 12:27:56,260 INFO L280 TraceCheckUtils]: 2: Hoare triple {1562#(or (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (not (= 0 (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset))) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)) (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (or (and (or (= dll_remove_first_~temp~1.base dll_remove_first_~head.base) (and (= dll_remove_first_~temp~1.base (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4)) (= (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~temp~1.base) 4) (select (select (store |#memory_$Pointer$.base| dll_remove_first_~head.base (store (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset dll_remove_first_~temp~1.base)) dll_remove_first_~temp~1.base) 4)) (= (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~temp~1.base) 4) (select (select (store |#memory_$Pointer$.offset| dll_remove_first_~head.base (store (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset dll_remove_first_~temp~1.offset)) dll_remove_first_~temp~1.base) 4)))) (or (not (= dll_remove_first_~temp~1.base dll_remove_first_~head.base)) (= |dll_remove_first_#in~head.base| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4)))) (= 0 (+ dll_remove_first_~temp~1.offset 4))) (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4) dll_remove_first_~temp~1.offset) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)))} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {1563#(or (not (= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0)) (and (= (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (or (not (= 0 (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|))) (= |dll_remove_first_#in~head.base| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) 4))))))} is VALID [2020-07-08 12:27:56,267 INFO L280 TraceCheckUtils]: 3: Hoare triple {1563#(or (not (= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0)) (and (= (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (or (not (= 0 (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|))) (= |dll_remove_first_#in~head.base| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) 4))))))} assume true; {1563#(or (not (= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0)) (and (= (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (or (not (= 0 (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|))) (= |dll_remove_first_#in~head.base| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) 4))))))} is VALID [2020-07-08 12:27:56,269 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1563#(or (not (= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0)) (and (= (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (or (not (= 0 (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|))) (= |dll_remove_first_#in~head.base| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) 4))))))} {1534#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) |main_~#s~0.base|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) 4)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} #94#return; {1540#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} is VALID [2020-07-08 12:27:56,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:56,587 INFO L280 TraceCheckUtils]: 0: Hoare triple {1560#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset; {1564#(and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (or (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)) dll_remove_first_~temp~1.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)) dll_remove_first_~temp~1.offset)) (not (= 0 (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset)))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|))} is VALID [2020-07-08 12:27:56,593 INFO L280 TraceCheckUtils]: 1: Hoare triple {1564#(and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (or (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)) dll_remove_first_~temp~1.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)) dll_remove_first_~temp~1.offset)) (not (= 0 (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset)))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|))} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {1565#(or (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (not (= 0 (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset))) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)) (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (= dll_remove_first_~temp~1.base (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4)) (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4) dll_remove_first_~temp~1.offset) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)))} is VALID [2020-07-08 12:27:56,594 INFO L280 TraceCheckUtils]: 2: Hoare triple {1565#(or (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (not (= 0 (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset))) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)) (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (= dll_remove_first_~temp~1.base (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4)) (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4) dll_remove_first_~temp~1.offset) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)))} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {1566#(or (and (= (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4))) (not (= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0)))} is VALID [2020-07-08 12:27:56,596 INFO L280 TraceCheckUtils]: 3: Hoare triple {1566#(or (and (= (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4))) (not (= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0)))} assume true; {1566#(or (and (= (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4))) (not (= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0)))} is VALID [2020-07-08 12:27:56,598 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1566#(or (and (= (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4))) (not (= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0)))} {1540#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} #94#return; {1546#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} is VALID [2020-07-08 12:27:56,599 INFO L263 TraceCheckUtils]: 0: Hoare triple {1512#true} call ULTIMATE.init(); {1548#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:27:56,599 INFO L280 TraceCheckUtils]: 1: Hoare triple {1548#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1512#true} is VALID [2020-07-08 12:27:56,599 INFO L280 TraceCheckUtils]: 2: Hoare triple {1512#true} assume true; {1512#true} is VALID [2020-07-08 12:27:56,599 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1512#true} {1512#true} #98#return; {1512#true} is VALID [2020-07-08 12:27:56,600 INFO L263 TraceCheckUtils]: 4: Hoare triple {1512#true} call #t~ret11 := main(); {1512#true} is VALID [2020-07-08 12:27:56,607 INFO L280 TraceCheckUtils]: 5: Hoare triple {1512#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.allocOnStack(4); {1517#(= (select |#valid| |main_~#s~0.base|) 1)} is VALID [2020-07-08 12:27:56,609 INFO L263 TraceCheckUtils]: 6: Hoare triple {1517#(= (select |#valid| |main_~#s~0.base|) 1)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {1549#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:27:56,610 INFO L280 TraceCheckUtils]: 7: Hoare triple {1549#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1550#(and (= |#valid| |old(#valid)|) (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-08 12:27:56,611 INFO L280 TraceCheckUtils]: 8: Hoare triple {1550#(and (= |#valid| |old(#valid)|) (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1551#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 dll_create_~new_head~0.offset) (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base) (= 1 (select |#valid| dll_create_~new_head~0.base)))} is VALID [2020-07-08 12:27:56,612 INFO L280 TraceCheckUtils]: 9: Hoare triple {1551#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 dll_create_~new_head~0.offset) (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base) (= 1 (select |#valid| dll_create_~new_head~0.base)))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1551#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 dll_create_~new_head~0.offset) (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base) (= 1 (select |#valid| dll_create_~new_head~0.base)))} is VALID [2020-07-08 12:27:56,614 INFO L280 TraceCheckUtils]: 10: Hoare triple {1551#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 dll_create_~new_head~0.offset) (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base) (= 1 (select |#valid| dll_create_~new_head~0.base)))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1552#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 dll_create_~new_head~0.offset) (= 0 dll_create_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) 0) (= 0 dll_create_~head~0.base) (= 1 (select |#valid| dll_create_~new_head~0.base)))} is VALID [2020-07-08 12:27:56,615 INFO L280 TraceCheckUtils]: 11: Hoare triple {1552#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 dll_create_~new_head~0.offset) (= 0 dll_create_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) 0) (= 0 dll_create_~head~0.base) (= 1 (select |#valid| dll_create_~new_head~0.base)))} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1553#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) 0) (= 1 (select |#valid| dll_create_~new_head~0.base)))} is VALID [2020-07-08 12:27:56,618 INFO L280 TraceCheckUtils]: 12: Hoare triple {1553#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) 0) (= 1 (select |#valid| dll_create_~new_head~0.base)))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1554#(and (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= (select |#valid| dll_create_~head~0.base) 1))} is VALID [2020-07-08 12:27:56,621 INFO L280 TraceCheckUtils]: 13: Hoare triple {1554#(and (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= (select |#valid| dll_create_~head~0.base) 1))} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1555#(and (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))} is VALID [2020-07-08 12:27:56,622 INFO L280 TraceCheckUtils]: 14: Hoare triple {1555#(and (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1555#(and (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))} is VALID [2020-07-08 12:27:56,624 INFO L280 TraceCheckUtils]: 15: Hoare triple {1555#(and (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1556#(and (= (select |old(#valid)| (select (select (store |#memory_$Pointer$.base| dll_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.base)) dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 0) (= 0 dll_create_~new_head~0.offset) (= 0 (select (store (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.base) 4)) (= 0 (select (store (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.offset) 4)) (= 0 (select (select (store |#memory_$Pointer$.offset| dll_create_~head~0.base (store (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.offset)) dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)) (= (select (select (store |#memory_$Pointer$.base| dll_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.base)) dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) dll_create_~head~0.base))} is VALID [2020-07-08 12:27:56,626 INFO L280 TraceCheckUtils]: 16: Hoare triple {1556#(and (= (select |old(#valid)| (select (select (store |#memory_$Pointer$.base| dll_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.base)) dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 0) (= 0 dll_create_~new_head~0.offset) (= 0 (select (store (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.base) 4)) (= 0 (select (store (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.offset) 4)) (= 0 (select (select (store |#memory_$Pointer$.offset| dll_create_~head~0.base (store (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.offset)) dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)) (= (select (select (store |#memory_$Pointer$.base| dll_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8) dll_create_~new_head~0.base)) dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) dll_create_~head~0.base))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {1557#(and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 4) 0) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 4)))} is VALID [2020-07-08 12:27:56,627 INFO L280 TraceCheckUtils]: 17: Hoare triple {1557#(and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 4) 0) (= 0 dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 4)))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1558#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4))))} is VALID [2020-07-08 12:27:56,628 INFO L280 TraceCheckUtils]: 18: Hoare triple {1558#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4))))} assume !(~len > 0); {1558#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4))))} is VALID [2020-07-08 12:27:56,629 INFO L280 TraceCheckUtils]: 19: Hoare triple {1558#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4))))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1559#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) 4)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 0) (= 0 |dll_create_#res.offset|))} is VALID [2020-07-08 12:27:56,630 INFO L280 TraceCheckUtils]: 20: Hoare triple {1559#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) 4)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 0) (= 0 |dll_create_#res.offset|))} assume true; {1559#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) 4)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 0) (= 0 |dll_create_#res.offset|))} is VALID [2020-07-08 12:27:56,631 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1559#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) 4)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) 4)) 0) (= 0 |dll_create_#res.offset|))} {1517#(= (select |#valid| |main_~#s~0.base|) 1)} #92#return; {1533#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) 4)) 4)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) 4))) (= 0 |main_#t~ret8.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~ret8.base|) 4)))} is VALID [2020-07-08 12:27:56,632 INFO L280 TraceCheckUtils]: 22: Hoare triple {1533#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) 4)) 4)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) 4))) (= 0 |main_#t~ret8.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~ret8.base|) 4)))} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {1534#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) |main_~#s~0.base|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) 4)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} is VALID [2020-07-08 12:27:56,632 INFO L280 TraceCheckUtils]: 23: Hoare triple {1534#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) |main_~#s~0.base|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) 4)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} assume !!(~i~0 >= 0); {1534#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) |main_~#s~0.base|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) 4)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} is VALID [2020-07-08 12:27:56,633 INFO L263 TraceCheckUtils]: 24: Hoare triple {1534#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) |main_~#s~0.base|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) 4)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} call dll_remove_first(~#s~0.base, ~#s~0.offset); {1560#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:27:56,634 INFO L280 TraceCheckUtils]: 25: Hoare triple {1560#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset; {1561#(and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (or (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)) dll_remove_first_~temp~1.base) (= 0 (+ dll_remove_first_~temp~1.offset 4))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)) dll_remove_first_~temp~1.offset)) (not (= 0 (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset)))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|))} is VALID [2020-07-08 12:27:56,637 INFO L280 TraceCheckUtils]: 26: Hoare triple {1561#(and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (or (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)) dll_remove_first_~temp~1.base) (= 0 (+ dll_remove_first_~temp~1.offset 4))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)) dll_remove_first_~temp~1.offset)) (not (= 0 (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset)))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|))} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {1562#(or (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (not (= 0 (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset))) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)) (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (or (and (or (= dll_remove_first_~temp~1.base dll_remove_first_~head.base) (and (= dll_remove_first_~temp~1.base (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4)) (= (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~temp~1.base) 4) (select (select (store |#memory_$Pointer$.base| dll_remove_first_~head.base (store (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset dll_remove_first_~temp~1.base)) dll_remove_first_~temp~1.base) 4)) (= (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~temp~1.base) 4) (select (select (store |#memory_$Pointer$.offset| dll_remove_first_~head.base (store (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset dll_remove_first_~temp~1.offset)) dll_remove_first_~temp~1.base) 4)))) (or (not (= dll_remove_first_~temp~1.base dll_remove_first_~head.base)) (= |dll_remove_first_#in~head.base| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4)))) (= 0 (+ dll_remove_first_~temp~1.offset 4))) (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4) dll_remove_first_~temp~1.offset) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)))} is VALID [2020-07-08 12:27:56,640 INFO L280 TraceCheckUtils]: 27: Hoare triple {1562#(or (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (not (= 0 (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset))) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)) (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (or (and (or (= dll_remove_first_~temp~1.base dll_remove_first_~head.base) (and (= dll_remove_first_~temp~1.base (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4)) (= (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~temp~1.base) 4) (select (select (store |#memory_$Pointer$.base| dll_remove_first_~head.base (store (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset dll_remove_first_~temp~1.base)) dll_remove_first_~temp~1.base) 4)) (= (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~temp~1.base) 4) (select (select (store |#memory_$Pointer$.offset| dll_remove_first_~head.base (store (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset dll_remove_first_~temp~1.offset)) dll_remove_first_~temp~1.base) 4)))) (or (not (= dll_remove_first_~temp~1.base dll_remove_first_~head.base)) (= |dll_remove_first_#in~head.base| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4)))) (= 0 (+ dll_remove_first_~temp~1.offset 4))) (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4) dll_remove_first_~temp~1.offset) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)))} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {1563#(or (not (= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0)) (and (= (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (or (not (= 0 (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|))) (= |dll_remove_first_#in~head.base| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) 4))))))} is VALID [2020-07-08 12:27:56,640 INFO L280 TraceCheckUtils]: 28: Hoare triple {1563#(or (not (= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0)) (and (= (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (or (not (= 0 (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|))) (= |dll_remove_first_#in~head.base| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) 4))))))} assume true; {1563#(or (not (= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0)) (and (= (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (or (not (= 0 (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|))) (= |dll_remove_first_#in~head.base| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) 4))))))} is VALID [2020-07-08 12:27:56,642 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1563#(or (not (= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0)) (and (= (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (or (not (= 0 (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|))) (= |dll_remove_first_#in~head.base| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) 4))))))} {1534#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) |main_~#s~0.base|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) 4)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} #94#return; {1540#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} is VALID [2020-07-08 12:27:56,643 INFO L280 TraceCheckUtils]: 30: Hoare triple {1540#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {1540#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} is VALID [2020-07-08 12:27:56,643 INFO L280 TraceCheckUtils]: 31: Hoare triple {1540#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} assume !!(~i~0 >= 0); {1540#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} is VALID [2020-07-08 12:27:56,644 INFO L263 TraceCheckUtils]: 32: Hoare triple {1540#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} call dll_remove_first(~#s~0.base, ~#s~0.offset); {1560#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:27:56,645 INFO L280 TraceCheckUtils]: 33: Hoare triple {1560#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset; {1564#(and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (or (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)) dll_remove_first_~temp~1.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)) dll_remove_first_~temp~1.offset)) (not (= 0 (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset)))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|))} is VALID [2020-07-08 12:27:56,646 INFO L280 TraceCheckUtils]: 34: Hoare triple {1564#(and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (or (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)) dll_remove_first_~temp~1.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)) dll_remove_first_~temp~1.offset)) (not (= 0 (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset)))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|))} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {1565#(or (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (not (= 0 (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset))) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)) (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (= dll_remove_first_~temp~1.base (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4)) (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4) dll_remove_first_~temp~1.offset) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)))} is VALID [2020-07-08 12:27:56,651 INFO L280 TraceCheckUtils]: 35: Hoare triple {1565#(or (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (not (= 0 (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset))) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)) (and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (= dll_remove_first_~temp~1.base (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4)) (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) 4) dll_remove_first_~temp~1.offset) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|)))} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {1566#(or (and (= (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4))) (not (= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0)))} is VALID [2020-07-08 12:27:56,652 INFO L280 TraceCheckUtils]: 36: Hoare triple {1566#(or (and (= (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4))) (not (= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0)))} assume true; {1566#(or (and (= (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4))) (not (= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0)))} is VALID [2020-07-08 12:27:56,654 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {1566#(or (and (= (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) 4))) (not (= (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 0)))} {1540#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} #94#return; {1546#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} is VALID [2020-07-08 12:27:56,655 INFO L280 TraceCheckUtils]: 38: Hoare triple {1546#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {1546#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} is VALID [2020-07-08 12:27:56,656 INFO L280 TraceCheckUtils]: 39: Hoare triple {1546#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} assume !(~i~0 >= 0); {1546#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} is VALID [2020-07-08 12:27:56,656 INFO L280 TraceCheckUtils]: 40: Hoare triple {1546#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {1547#(and (= 0 |main_#t~mem10.base|) (= 0 |main_#t~mem10.offset|))} is VALID [2020-07-08 12:27:56,657 INFO L280 TraceCheckUtils]: 41: Hoare triple {1547#(and (= 0 |main_#t~mem10.base|) (= 0 |main_#t~mem10.offset|))} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1513#false} is VALID [2020-07-08 12:27:56,657 INFO L280 TraceCheckUtils]: 42: Hoare triple {1513#false} assume !false; {1513#false} is VALID [2020-07-08 12:27:56,673 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-08 12:27:56,673 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099795990] [2020-07-08 12:27:56,673 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083403672] [2020-07-08 12:27:56,674 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:27:56,791 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-08 12:27:56,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:27:56,794 INFO L264 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 84 conjunts are in the unsatisfiable core [2020-07-08 12:27:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:56,819 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:27:56,970 INFO L384 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 [2020-07-08 12:27:56,971 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:56,981 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:56,981 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:56,982 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2020-07-08 12:27:56,986 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:56,986 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_23|]. (and (= 0 dll_create_~new_head~0.offset) (= 0 dll_create_~head~0.offset) (< dll_create_~new_head~0.base |#StackHeapBarrier|) (= |#valid| (store |v_#valid_23| dll_create_~new_head~0.base 1)) (= 0 dll_create_~head~0.base)) [2020-07-08 12:27:56,986 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 dll_create_~new_head~0.offset) (= 0 dll_create_~head~0.offset) (< dll_create_~new_head~0.base |#StackHeapBarrier|) (= 0 dll_create_~head~0.base) (= 1 (select |#valid| dll_create_~new_head~0.base))) [2020-07-08 12:27:57,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-08 12:27:57,085 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 18 treesize of output 19 [2020-07-08 12:27:57,086 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:57,102 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:57,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-08 12:27:57,111 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 18 treesize of output 19 [2020-07-08 12:27:57,111 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:57,127 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:57,127 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:57,128 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:48 [2020-07-08 12:27:57,420 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:57,421 INFO L384 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 [2020-07-08 12:27:57,423 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:57,436 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:57,436 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:57,437 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:39 [2020-07-08 12:27:57,439 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:57,440 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_24|]. (let ((.cse0 (select |#memory_$Pointer$.base| dll_create_~head~0.base)) (.cse1 (select |#memory_$Pointer$.offset| dll_create_~head~0.base))) (and (= 1 (select |v_#valid_24| dll_create_~head~0.base)) (= (select .cse0 4) 0) (< dll_create_~head~0.base |#StackHeapBarrier|) (= 0 (select .cse1 4)) (= 0 dll_create_~head~0.offset) (= 0 (select .cse0 8)) (= 0 (select |v_#valid_24| dll_create_~new_head~0.base)) (= 0 (select .cse1 8)))) [2020-07-08 12:27:57,440 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select |#memory_$Pointer$.base| dll_create_~head~0.base)) (.cse1 (select |#memory_$Pointer$.offset| dll_create_~head~0.base))) (and (= (select .cse0 4) 0) (< dll_create_~head~0.base |#StackHeapBarrier|) (= 0 (select .cse1 4)) (= 0 dll_create_~head~0.offset) (= 0 (select .cse0 8)) (= 0 (select .cse1 8)) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))) [2020-07-08 12:27:57,588 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-08 12:27:57,623 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:57,628 INFO L544 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-08 12:27:57,655 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:57,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-08 12:27:57,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-08 12:27:57,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-08 12:27:57,685 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 46 [2020-07-08 12:27:57,687 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:57,719 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:57,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-08 12:27:57,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-08 12:27:57,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-08 12:27:57,745 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 46 [2020-07-08 12:27:57,750 INFO L544 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:57,779 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:57,780 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:57,781 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:105, output treesize:75 [2020-07-08 12:27:59,786 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:59,787 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.offset_26|, |v_#memory_$Pointer$.offset_27|, |v_#memory_$Pointer$.base_27|, |v_#memory_$Pointer$.base_26|]. (let ((.cse0 (select |v_#memory_$Pointer$.offset_27| dll_create_~head~0.base)) (.cse1 (select |v_#memory_$Pointer$.offset_26| dll_create_~new_head~0.base)) (.cse2 (select |v_#memory_$Pointer$.base_27| dll_create_~head~0.base)) (.cse5 (select |v_#memory_$Pointer$.base_26| dll_create_~new_head~0.base)) (.cse3 (+ dll_create_~new_head~0.offset 4)) (.cse4 (+ dll_create_~new_head~0.offset 8))) (and (= 0 (select .cse0 4)) (= (store |v_#memory_$Pointer$.offset_27| dll_create_~new_head~0.base (store (select |v_#memory_$Pointer$.offset_27| dll_create_~new_head~0.base) dll_create_~new_head~0.offset (select .cse1 dll_create_~new_head~0.offset))) |v_#memory_$Pointer$.offset_26|) (= 0 (select .cse2 8)) (= 0 (select .cse0 8)) (= (store |v_#memory_$Pointer$.offset_26| dll_create_~new_head~0.base (store (store .cse1 .cse3 dll_create_~head~0.offset) .cse4 0)) |#memory_$Pointer$.offset|) (< dll_create_~head~0.base |#StackHeapBarrier|) (= 0 dll_create_~head~0.offset) (= 0 (select .cse2 4)) (= |v_#memory_$Pointer$.base_26| (store |v_#memory_$Pointer$.base_27| dll_create_~new_head~0.base (store (select |v_#memory_$Pointer$.base_27| dll_create_~new_head~0.base) dll_create_~new_head~0.offset (select .cse5 dll_create_~new_head~0.offset)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_26| dll_create_~new_head~0.base (store (store .cse5 .cse3 dll_create_~head~0.base) .cse4 0))) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))) [2020-07-08 12:27:59,787 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select |#memory_$Pointer$.base| dll_create_~head~0.base)) (.cse3 (select |#memory_$Pointer$.offset| dll_create_~head~0.base)) (.cse4 (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base)) (.cse2 (+ dll_create_~new_head~0.offset 4)) (.cse1 (select |#memory_$Pointer$.base| dll_create_~new_head~0.base)) (.cse5 (+ dll_create_~new_head~0.offset 8))) (and (= (select .cse0 4) 0) (= 0 dll_create_~head~0.offset) (= (select .cse1 .cse2) dll_create_~head~0.base) (= 0 (select .cse3 4)) (< dll_create_~head~0.base |#StackHeapBarrier|) (= 0 (select .cse0 8)) (= 0 (select .cse4 .cse5)) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)) (= 0 (select .cse3 8)) (= (select .cse4 .cse2) dll_create_~head~0.offset) (= 0 (select .cse1 .cse5)))) [2020-07-08 12:27:59,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-08 12:28:00,017 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:28:00,018 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 127 treesize of output 193 [2020-07-08 12:28:00,039 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[14, 3, 2, 1] term [2020-07-08 12:28:00,040 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:00,046 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:28:00,115 INFO L624 ElimStorePlain]: treesize reduction 134, result has 47.7 percent of original size [2020-07-08 12:28:00,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-08 12:28:00,127 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 57 [2020-07-08 12:28:00,130 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:28:00,151 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:28:00,152 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:28:00,152 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:145, output treesize:99 [2020-07-08 12:28:02,257 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:28:02,258 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_28|, |v_#memory_$Pointer$.offset_28|]. (let ((.cse3 (select |v_#memory_$Pointer$.base_28| dll_create_~new_head~0.base)) (.cse6 (+ dll_create_~new_head~0.offset 4))) (let ((.cse1 (select .cse3 .cse6))) (let ((.cse0 (select |v_#memory_$Pointer$.offset_28| .cse1)) (.cse2 (select |v_#memory_$Pointer$.base_28| .cse1)) (.cse5 (select |v_#memory_$Pointer$.offset_28| dll_create_~new_head~0.base)) (.cse4 (+ dll_create_~new_head~0.offset 8))) (and (= 0 (select .cse0 8)) (< .cse1 |#StackHeapBarrier|) (= (store |v_#memory_$Pointer$.offset_28| .cse1 (store .cse0 8 dll_create_~new_head~0.offset)) |#memory_$Pointer$.offset|) (= (select .cse2 8) 0) (= (select .cse0 4) 0) (not (= .cse1 dll_create_~new_head~0.base)) (= 0 (select .cse2 4)) (= (store |v_#memory_$Pointer$.base_28| .cse1 (store .cse2 8 dll_create_~new_head~0.base)) |#memory_$Pointer$.base|) (= 0 (select .cse3 .cse4)) (= 0 (select .cse5 .cse6)) (= (select .cse5 .cse4) 0))))) [2020-07-08 12:28:02,258 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse6 (select |#memory_$Pointer$.base| dll_create_~new_head~0.base)) (.cse4 (+ dll_create_~new_head~0.offset 4))) (let ((.cse1 (select .cse6 .cse4))) (let ((.cse0 (select |#memory_$Pointer$.offset| .cse1)) (.cse2 (select |#memory_$Pointer$.base| .cse1)) (.cse3 (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base)) (.cse5 (+ dll_create_~new_head~0.offset 8))) (and (= (select .cse0 4) 0) (< .cse1 |#StackHeapBarrier|) (= dll_create_~new_head~0.base (select .cse2 8)) (= (select .cse0 8) dll_create_~new_head~0.offset) (= 0 (select .cse3 .cse4)) (not (= .cse1 dll_create_~new_head~0.base)) (= 0 (select .cse2 4)) (= 0 (select .cse3 .cse5)) (= 0 (select .cse6 .cse5)))))) [2020-07-08 12:28:04,101 WARN L193 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 95 [2020-07-08 12:28:04,102 INFO L350 Elim1Store]: treesize reduction 181, result has 64.4 percent of original size [2020-07-08 12:28:04,102 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 443 treesize of output 478 [2020-07-08 12:28:04,139 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-08 12:28:04,165 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-08 12:28:04,183 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-08 12:28:04,197 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-08 12:28:04,210 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-08 12:28:04,222 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:04,235 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:04,245 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:04,253 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:04,260 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:04,264 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:04,268 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:04,299 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:04,317 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:04,347 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:04,353 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:04,370 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:04,398 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:04,417 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:04,425 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:04,458 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:04,480 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:04,503 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:04,511 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:04,517 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:04,522 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:04,527 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:04,548 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:04,568 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:04,584 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:04,588 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:04,608 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:04,628 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:04,653 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:04,657 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:04,676 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:04,707 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:04,745 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-08 12:28:04,761 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-08 12:28:04,772 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:04,785 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:04,793 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:04,802 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:04,809 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:04,814 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:04,820 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:04,825 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:04,844 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:04,862 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:04,880 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:04,885 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:04,901 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:04,917 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:04,936 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:04,941 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:04,955 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:04,971 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:04,996 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:05,004 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:05,009 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:05,018 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:05,022 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:05,038 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:05,055 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:05,074 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:05,079 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:05,094 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:05,110 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:05,134 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:05,141 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:05,158 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:05,177 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:05,199 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:05,206 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:05,210 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:05,215 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:05,218 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:05,222 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:05,235 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:05,249 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:05,252 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:05,264 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:05,278 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:05,282 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:05,307 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:05,323 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:05,327 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:05,331 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:05,346 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:05,360 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:05,363 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:05,391 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:05,409 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:05,414 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:05,433 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:05,476 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-08 12:28:05,496 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:05,518 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:05,532 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:05,544 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:05,555 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:05,564 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:05,574 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:05,582 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:05,587 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:05,593 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:05,610 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:05,633 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:05,639 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:05,696 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:05,715 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:05,721 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:05,725 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:05,749 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:05,772 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:05,778 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:05,794 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:05,815 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:05,825 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-08 12:28:05,829 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-08 12:28:05,841 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-08 12:28:05,852 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:05,857 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:05,873 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:05,897 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:05,903 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:05,912 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:05,916 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:05,929 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:05,943 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:05,947 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:05,961 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:05,977 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:05,986 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:05,992 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:06,007 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:06,023 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:06,027 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:06,039 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:06,053 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:06,062 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:06,066 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:06,083 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:06,098 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:06,102 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:06,122 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:06,161 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-08 12:28:06,173 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-08 12:28:06,184 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:06,193 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:06,204 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:06,211 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:06,217 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:06,222 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:06,226 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:06,231 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:06,244 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:06,259 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:06,263 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:06,283 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:06,298 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:06,303 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:06,317 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:06,333 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:06,342 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:06,347 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:06,364 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:06,381 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:06,385 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:06,402 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:06,420 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:06,424 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:06,447 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:06,496 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-08 12:28:06,510 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-08 12:28:06,520 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-08 12:28:06,531 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:06,539 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:06,556 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:06,563 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:06,570 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:06,575 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:06,593 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:06,602 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:06,618 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:06,635 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:06,651 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:06,656 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:06,672 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:06,689 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:06,707 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:06,713 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:06,738 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:06,762 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:06,793 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:06,802 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:06,809 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:06,816 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:06,821 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:06,827 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:06,850 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:06,857 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:06,880 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:06,886 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:06,910 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:06,916 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:06,921 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:06,942 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:06,947 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:06,967 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:06,974 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:07,072 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-08 12:28:07,089 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-08 12:28:07,106 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-08 12:28:07,118 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:07,134 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:07,144 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:07,152 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:07,159 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:07,166 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:07,172 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:07,194 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:07,216 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:07,239 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:07,245 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:07,267 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:07,289 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:07,312 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:07,317 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:07,338 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:07,355 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:07,413 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-08 12:28:07,435 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-08 12:28:07,456 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-08 12:28:07,474 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-08 12:28:07,490 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-08 12:28:07,509 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:07,525 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:07,536 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:07,546 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:07,553 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:07,561 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:07,568 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:07,593 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:07,618 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:07,649 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:07,655 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:07,677 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:07,698 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:07,721 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:07,728 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:07,751 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:07,774 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:07,804 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:07,814 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:07,822 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:07,829 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:07,836 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:07,857 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:07,880 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:07,904 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:07,911 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:07,933 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:07,956 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:07,981 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:07,988 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:08,013 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:08,038 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:08,090 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-08 12:28:08,112 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-08 12:28:08,129 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:08,150 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:08,163 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:08,176 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:08,187 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:08,195 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:08,202 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:08,207 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:08,229 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:08,249 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:08,272 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:08,277 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:08,294 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:08,313 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:08,332 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:08,338 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:08,356 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:08,374 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:08,400 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:08,408 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:08,415 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:08,421 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:08,427 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:08,444 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:08,463 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:08,480 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:08,484 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:08,502 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:08,521 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:08,542 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:08,547 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:08,566 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:08,584 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:08,624 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:08,628 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:08,632 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:08,636 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:08,640 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:08,643 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:08,655 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:08,672 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:08,676 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:08,689 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:08,702 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:08,707 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:08,725 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:08,742 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:08,747 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:08,751 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:08,767 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:08,782 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:08,785 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:08,802 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:08,819 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:08,823 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:08,844 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:08,882 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-08 12:28:08,898 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:08,911 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:08,919 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:08,928 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:08,935 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:08,940 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:08,946 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:08,953 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:08,956 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:08,959 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:08,969 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:08,983 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:08,987 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:08,999 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:09,015 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:09,019 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:09,023 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:09,038 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:09,056 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:09,060 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:09,073 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:09,088 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:09,096 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-08 12:28:09,100 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-08 12:28:09,109 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-08 12:28:09,119 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:09,123 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:09,135 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:09,147 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:09,151 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:09,158 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:09,160 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:09,177 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:09,201 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:09,205 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:09,221 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:09,238 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:09,247 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:09,251 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:09,266 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:09,281 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:09,285 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:09,298 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:09,313 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:09,324 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:09,328 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:09,342 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:09,356 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:09,360 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:09,375 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:09,408 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-08 12:28:09,420 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-08 12:28:09,431 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:09,447 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:09,457 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:09,464 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:09,469 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:09,476 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:09,487 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:09,492 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:09,509 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:09,525 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:09,530 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:09,546 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:09,563 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:09,569 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:09,585 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:09,600 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:09,605 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:09,610 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:09,633 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:09,653 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:09,657 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:09,686 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:09,703 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:09,709 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:09,726 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:09,783 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-08 12:28:09,800 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-08 12:28:09,816 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-08 12:28:09,830 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:09,841 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:09,856 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:09,869 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:09,878 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:09,887 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:09,896 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:09,904 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:09,925 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:09,948 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:09,973 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:09,981 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:10,005 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:10,044 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:10,058 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:10,062 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:10,077 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:10,093 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:10,113 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:10,118 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:10,121 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:10,125 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:10,128 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:10,130 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:10,144 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:10,146 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:10,161 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:10,164 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:10,177 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:10,180 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:10,183 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:10,191 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:10,193 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:10,209 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:10,212 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:10,245 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-08 12:28:10,256 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-08 12:28:10,265 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-08 12:28:10,274 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:10,285 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:10,295 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:10,301 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:10,305 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:10,317 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:10,321 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:10,334 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:10,346 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:10,360 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:10,364 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:10,377 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:10,389 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:10,406 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:10,410 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:10,425 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:10,441 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:10,461 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-08 12:28:10,683 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 59 [2020-07-08 12:28:10,685 INFO L624 ElimStorePlain]: treesize reduction 359, result has 41.8 percent of original size [2020-07-08 12:28:10,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-08 12:28:10,830 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2020-07-08 12:28:10,831 INFO L350 Elim1Store]: treesize reduction 32, result has 79.6 percent of original size [2020-07-08 12:28:10,832 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 230 treesize of output 240 [2020-07-08 12:28:10,867 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-08 12:28:10,876 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-08 12:28:10,889 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:10,901 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:10,907 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:10,911 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:10,916 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:10,927 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:10,931 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:10,935 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:10,938 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:10,952 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:10,963 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:10,970 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:10,983 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:10,987 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:10,988 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:10,991 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:11,010 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:11,012 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:11,031 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:11,037 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:11,041 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:11,062 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:11,068 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:11,073 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:11,088 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:11,091 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:11,092 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:11,102 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:11,126 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:11,140 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:11,145 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:11,149 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:11,153 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:11,155 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:11,170 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:11,173 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:11,190 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:11,195 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:11,199 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:11,210 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:11,213 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:11,218 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:11,219 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:11,229 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:11,245 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:11,249 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:11,253 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:11,266 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:11,271 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:11,275 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:11,287 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:11,290 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:11,308 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:11,314 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:11,321 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:11,327 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:11,332 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:11,336 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:11,339 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:11,356 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:11,371 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:11,404 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:11,407 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:11,410 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:11,420 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:11,422 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:11,427 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:11,437 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:11,440 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:11,462 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:11,466 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:11,469 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:11,470 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:11,472 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:11,488 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:11,490 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:11,494 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:11,531 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:11,542 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:11,548 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:11,554 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:11,567 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:11,572 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:11,575 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:11,578 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:11,579 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:11,582 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:11,596 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:11,597 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:11,602 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:11,627 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:11,631 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:11,634 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:11,647 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:11,649 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:11,663 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:11,679 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:11,680 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:11,692 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:11,698 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:11,706 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:11,711 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:11,724 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:11,728 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:11,729 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:11,745 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:11,751 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:11,758 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:11,763 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:11,766 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:11,770 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:11,781 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:11,786 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:11,788 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:11,810 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:11,823 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:11,826 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:11,840 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:11,843 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:11,846 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:11,856 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:11,866 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:11,873 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:11,878 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:11,881 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:11,892 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:11,895 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:11,912 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:11,925 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:11,927 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:11,931 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:11,964 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:11,973 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:11,981 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:11,988 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:11,995 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:11,999 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:12,019 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:12,024 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:12,038 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:12,043 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:12,063 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:12,075 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:12,087 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:12,090 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:12,106 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:12,118 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:12,123 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:12,127 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:12,129 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:12,145 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:12,155 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:12,157 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:12,166 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:12,171 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:12,182 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:12,184 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:12,186 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:12,204 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:12,213 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:12,220 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:12,228 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:12,244 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:12,251 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:12,257 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:12,262 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:12,265 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:12,285 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:12,290 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:12,295 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:12,308 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:12,312 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:12,329 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:12,343 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:12,347 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:12,351 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:12,354 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:12,369 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:12,371 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:12,374 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:12,394 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:12,408 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:12,416 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:12,423 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:12,428 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:12,441 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:12,447 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:12,449 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:12,467 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:12,481 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:12,486 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:12,500 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:12,503 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:12,508 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:12,521 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:12,526 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:12,532 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:12,537 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:12,552 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:12,563 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:12,568 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:12,578 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:12,585 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:12,592 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:12,599 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:12,605 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:12,609 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:12,611 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:12,615 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:12,656 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:12,668 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:12,675 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:12,691 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:12,700 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:12,720 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:12,726 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:12,728 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:12,745 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:12,752 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:12,766 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:12,786 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:12,811 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-08 12:28:12,819 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:12,826 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:12,839 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:12,846 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:12,851 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:12,856 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:12,860 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:12,863 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:12,865 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:12,878 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:12,882 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:12,884 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:12,899 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:12,902 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:12,906 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:12,907 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:12,921 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:12,923 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:12,939 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:12,945 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:12,950 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:12,955 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:12,958 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:12,971 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:12,975 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:12,978 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:13,001 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:13,006 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:13,011 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:13,013 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:13,030 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:13,032 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:13,052 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:13,059 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:13,065 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:13,071 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:13,075 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:13,085 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:13,088 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:13,103 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:13,114 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:13,121 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:13,125 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:13,130 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:13,143 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:13,147 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:13,149 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:13,175 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2020-07-08 12:28:13,190 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2020-07-08 12:28:13,197 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2020-07-08 12:28:13,205 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:13,217 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-08 12:28:13,224 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:13,229 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:13,233 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:13,235 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:13,254 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:13,269 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:13,280 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:13,287 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:13,293 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:13,312 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:13,320 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-08 12:28:13,324 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:13,359 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:13,372 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:13,383 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:13,390 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:13,396 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:13,401 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:13,404 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:13,429 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:13,446 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:13,459 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:13,467 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:13,474 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:13,478 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:13,501 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:13,517 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:13,530 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:13,541 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-08 12:28:13,549 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:13,557 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:13,562 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:13,564 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:13,590 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:13,594 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:13,616 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:13,622 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:13,628 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:13,642 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:13,651 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-08 12:28:13,654 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:13,690 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2020-07-08 12:28:13,707 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2020-07-08 12:28:13,719 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2020-07-08 12:28:13,729 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:13,737 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-08 12:28:13,744 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:13,751 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:13,756 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:13,773 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:13,783 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:13,790 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:13,796 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:13,799 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:13,823 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:13,834 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:13,842 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:13,849 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:13,855 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:13,860 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:13,873 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:13,881 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:13,884 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:13,906 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:13,912 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:13,918 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:13,921 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:13,942 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:13,951 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-08 12:28:13,959 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:13,965 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:13,972 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:13,975 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:14,004 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:14,012 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:14,019 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:14,023 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:14,050 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-08 12:28:14,061 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-08 12:28:14,071 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:14,084 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:14,092 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:14,099 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:14,106 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:14,114 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:14,120 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:14,125 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:14,128 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:14,146 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:14,158 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:14,164 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:14,180 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:14,184 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:14,186 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:14,190 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:14,206 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:14,208 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:14,219 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:14,225 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:14,232 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:14,248 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:14,250 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:14,254 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:14,272 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:14,276 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:14,277 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:14,300 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:14,323 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:14,336 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:14,340 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:14,344 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:14,347 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:14,349 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:14,364 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:14,367 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:14,384 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:14,386 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:14,388 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:14,401 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:14,403 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:14,407 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:14,407 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:14,419 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:14,435 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:14,438 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:14,442 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:14,455 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:14,458 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:14,461 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:14,471 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:14,473 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:14,489 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:14,498 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:14,503 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:14,508 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:14,511 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:14,515 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:14,517 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:14,534 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:14,545 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:14,551 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:14,554 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:14,556 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:14,567 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:14,569 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:14,573 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:14,585 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:14,589 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:14,603 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:14,607 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:14,609 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:14,610 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:14,613 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:14,631 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:14,632 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:14,636 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:14,679 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:14,693 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:14,699 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:14,706 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:14,725 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:14,738 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:14,742 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:14,746 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:14,748 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:14,752 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:14,769 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:14,770 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:14,772 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:14,795 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:14,806 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:14,809 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:14,822 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:14,830 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:14,843 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:14,855 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:14,855 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:14,867 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:14,875 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:14,880 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:14,890 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:14,904 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:14,911 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:14,913 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:14,931 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:14,938 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:14,944 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:14,950 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:14,955 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:14,960 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:14,972 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:14,977 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:14,979 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:14,998 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:15,012 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:15,016 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:15,030 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:15,033 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:15,038 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:15,056 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:15,058 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:15,066 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:15,070 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:15,074 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:15,083 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:15,086 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:15,101 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:15,113 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:15,115 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:15,119 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:15,149 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:15,156 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:15,161 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:15,167 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:15,172 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:15,182 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:15,207 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:15,213 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:15,226 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:15,231 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:15,246 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:15,258 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:15,270 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:15,274 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:15,289 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:15,302 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:15,307 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:15,312 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:15,314 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:15,331 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:15,343 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-08 12:28:15,345 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:15,356 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:15,361 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:15,372 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:15,375 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:15,377 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:15,396 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:15,404 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:15,412 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:15,421 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:15,438 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:15,444 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:15,451 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:15,457 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:15,468 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:15,492 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:15,498 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:15,503 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:15,521 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:15,528 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:15,554 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:15,571 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:15,577 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:15,581 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:15,587 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:15,607 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:15,610 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:15,616 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:15,643 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:15,659 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:15,668 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:15,676 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:15,682 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:15,695 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:15,705 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:15,709 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:15,754 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:15,778 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:15,784 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:15,801 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:15,809 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:15,817 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:15,834 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:15,841 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:15,850 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:15,857 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:15,882 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:15,893 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:15,896 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:15,902 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:15,908 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:15,913 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:15,919 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:15,923 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:15,927 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:15,929 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:15,932 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:15,964 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:15,969 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:15,973 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:15,986 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:15,992 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:16,004 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:16,007 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:16,009 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:16,021 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:16,026 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:16,037 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:16,041 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:16,066 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-08 12:28:16,075 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:16,082 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:16,088 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:16,095 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:16,101 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:16,106 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:16,110 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:16,113 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-08 12:28:16,115 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:16,138 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:16,143 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:16,146 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:16,165 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:16,170 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:16,175 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:16,177 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:16,193 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:16,196 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:16,220 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:16,227 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:16,235 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:16,241 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:16,247 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:16,260 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:16,268 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:16,271 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:16,296 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:16,302 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:16,308 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:16,311 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:16,335 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:16,338 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:16,364 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:16,372 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:16,379 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:16,386 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:16,391 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:16,397 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:16,401 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:16,419 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:16,433 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:16,442 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:16,447 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:16,453 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:16,466 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:16,472 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:16,474 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:16,502 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2020-07-08 12:28:16,510 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2020-07-08 12:28:16,519 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2020-07-08 12:28:16,528 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:16,536 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-08 12:28:16,543 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:16,549 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:16,553 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:16,555 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:16,574 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:16,590 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:16,600 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:16,605 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:16,610 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:16,624 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:16,632 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-08 12:28:16,636 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:16,662 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:16,672 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:16,679 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:16,685 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:16,689 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:16,693 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:16,706 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:16,730 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:16,742 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:16,749 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:16,754 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:16,759 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:16,762 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:16,779 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:16,790 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:16,800 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:16,806 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-08 12:28:16,813 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:16,819 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:16,823 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:16,826 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:16,844 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:16,847 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:16,867 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:16,873 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:16,877 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:16,893 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:16,899 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-08 12:28:16,903 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:16,932 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2020-07-08 12:28:16,948 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2020-07-08 12:28:16,959 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2020-07-08 12:28:16,967 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:16,976 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-08 12:28:16,984 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:16,990 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:16,995 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:17,009 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:17,019 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:17,026 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:17,031 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:17,034 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:17,058 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:17,067 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:17,075 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:17,083 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:17,090 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:17,095 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:17,109 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:17,118 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-08 12:28:17,122 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:17,140 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:17,147 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:17,153 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:17,156 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:17,178 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:17,188 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-08 12:28:17,196 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:17,202 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-08 12:28:17,208 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-08 12:28:17,211 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-08 12:28:17,232 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:17,240 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-08 12:28:17,246 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-08 12:28:17,250 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-08 12:28:17,266 INFO L544 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-08 12:28:17,428 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2020-07-08 12:28:17,429 INFO L624 ElimStorePlain]: treesize reduction 135, result has 54.8 percent of original size [2020-07-08 12:28:17,437 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:17,444 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:17,450 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-08 12:28:17,454 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-08 12:28:17,479 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:17,499 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:17,510 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-08 12:28:17,513 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-08 12:28:17,520 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-08 12:28:17,531 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-08 12:28:17,534 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-08 12:28:17,542 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-08 12:28:17,542 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:443, output treesize:164 [2020-07-08 12:28:20,167 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:28:20,167 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_BEFORE_CALL_2|, |v_#memory_$Pointer$.offset_BEFORE_CALL_2|]. (let ((.cse11 (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_2| |main_~#s~0.base|) |main_~#s~0.offset|)) (.cse9 (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_2| |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse0 (select |v_#memory_$Pointer$.base_BEFORE_CALL_2| .cse9)) (.cse4 (select |v_#memory_$Pointer$.offset_BEFORE_CALL_2| .cse9)) (.cse12 (+ .cse11 4))) (let ((.cse5 (select .cse4 .cse12)) (.cse2 (select .cse0 .cse12))) (let ((.cse1 (+ .cse11 8)) (.cse3 (select |v_#memory_$Pointer$.base_BEFORE_CALL_2| .cse2)) (.cse8 (+ .cse5 8)) (.cse7 (select |v_#memory_$Pointer$.offset_BEFORE_CALL_2| .cse2))) (and (= 0 (select .cse0 .cse1)) (<= (+ .cse2 2) |main_~#s~0.base|) (= 0 (select .cse3 4)) (= 0 (select .cse4 .cse1)) (= 0 .cse5) (= (let ((.cse6 (store |v_#memory_$Pointer$.offset_BEFORE_CALL_2| .cse2 (store .cse7 .cse8 0)))) (store .cse6 |main_~#s~0.base| (store (select .cse6 |main_~#s~0.base|) |main_~#s~0.offset| .cse5))) |#memory_$Pointer$.offset|) (= .cse9 (select .cse3 8)) (not (= .cse9 .cse2)) (= 0 (select .cse7 4)) (= |#memory_$Pointer$.base| (let ((.cse10 (store |v_#memory_$Pointer$.base_BEFORE_CALL_2| .cse2 (store .cse3 .cse8 0)))) (store .cse10 |main_~#s~0.base| (store (select .cse10 |main_~#s~0.base|) |main_~#s~0.offset| .cse2)))) (= (select .cse7 8) .cse11)))))) [2020-07-08 12:28:20,167 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [v_arrayElimCell_18, v_arrayElimIndex_5]. (let ((.cse8 (+ v_arrayElimIndex_5 4))) (let ((.cse5 (= |main_~#s~0.base| v_arrayElimCell_18)) (.cse6 (= |main_~#s~0.offset| .cse8)) (.cse10 (select |#memory_$Pointer$.offset| v_arrayElimCell_18)) (.cse4 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse0 (select |#memory_$Pointer$.offset| .cse4)) (.cse9 (select |#memory_$Pointer$.base| .cse4)) (.cse1 (select .cse10 v_arrayElimIndex_5)) (.cse7 (select |#memory_$Pointer$.base| v_arrayElimCell_18)) (.cse2 (not .cse6)) (.cse3 (not .cse5))) (and (= 0 (select .cse0 4)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) .cse1) (= 0 .cse1) (or .cse2 .cse3 (= 0 v_arrayElimCell_18)) (<= (+ .cse4 2) |main_~#s~0.base|) (= 0 (select .cse0 8)) (or (and .cse5 .cse6) (= (select .cse7 .cse8) 0)) (= (select .cse9 4) 0) (or (not (= v_arrayElimIndex_5 |main_~#s~0.offset|)) .cse3) (= 0 (select .cse9 (+ .cse1 8))) (= .cse4 (select .cse7 v_arrayElimIndex_5)) (not (= .cse4 v_arrayElimCell_18)) (= 0 (select .cse10 .cse8)) (or (= 0 (+ v_arrayElimIndex_5 (- 4))) .cse2 .cse3))))) [2020-07-08 12:28:20,181 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:20,187 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:20,191 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-08 12:28:20,194 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-08 12:28:20,212 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:20,216 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:20,228 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-08 12:28:20,232 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-08 12:28:20,239 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-08 12:28:20,251 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-08 12:28:20,254 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-08 12:28:20,552 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:20,559 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:20,562 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-08 12:28:20,565 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-08 12:28:20,569 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:20,572 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-08 12:28:20,577 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-08 12:28:20,581 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-08 12:28:20,583 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-08 12:28:20,586 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-08 12:28:20,593 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-08 12:28:20,594 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-08 12:28:20,601 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-08 12:28:20,948 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:20,954 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:20,976 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-08 12:28:20,987 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-08 12:28:20,994 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:20,998 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-08 12:28:21,009 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-08 12:28:21,012 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-08 12:28:21,016 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-08 12:28:21,021 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-08 12:28:21,029 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-08 12:28:21,030 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-08 12:28:21,040 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-08 12:28:21,443 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:21,457 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:21,461 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:21,471 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:21,476 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-08 12:28:21,484 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-08 12:28:21,486 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-08 12:28:21,496 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-08 12:28:21,790 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:21,802 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:21,808 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-08 12:28:21,812 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-08 12:28:21,818 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:21,824 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:21,834 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-08 12:28:21,845 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-08 12:28:21,847 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-08 12:28:21,852 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-08 12:28:21,870 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:21,879 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:21,884 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-08 12:28:21,887 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-08 12:28:21,895 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:21,900 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:21,907 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-08 12:28:21,917 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-08 12:28:21,918 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-08 12:28:21,923 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-08 12:28:21,928 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-08 12:28:21,934 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:21,944 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:21,948 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-08 12:28:21,951 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-08 12:28:21,958 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:21,962 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:21,970 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-08 12:28:21,979 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-08 12:28:21,981 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-08 12:28:21,986 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-08 12:28:21,998 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:22,010 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:22,016 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-08 12:28:22,019 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-08 12:28:22,026 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:22,030 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:22,035 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-08 12:28:22,043 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-08 12:28:22,045 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-08 12:28:22,048 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-08 12:28:22,058 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:22,064 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:22,067 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-08 12:28:22,069 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-08 12:28:22,074 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:22,077 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:22,088 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-08 12:28:22,102 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-08 12:28:22,104 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-08 12:28:22,108 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-08 12:28:22,123 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:22,131 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:22,135 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-08 12:28:22,144 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-08 12:28:22,152 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:22,157 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:22,168 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-08 12:28:22,177 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-08 12:28:22,179 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-08 12:28:22,184 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-08 12:28:22,197 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:22,205 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:22,209 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-08 12:28:22,211 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-08 12:28:22,217 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:22,222 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:22,230 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-08 12:28:22,240 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-08 12:28:22,243 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-08 12:28:22,249 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-08 12:28:22,262 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:22,272 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:22,277 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-08 12:28:22,280 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-08 12:28:22,288 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:22,293 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-08 12:28:22,301 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-08 12:28:22,310 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-08 12:28:22,313 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-08 12:28:22,318 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-08 12:28:22,441 INFO L263 TraceCheckUtils]: 0: Hoare triple {1512#true} call ULTIMATE.init(); {1512#true} is VALID [2020-07-08 12:28:22,441 INFO L280 TraceCheckUtils]: 1: Hoare triple {1512#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1512#true} is VALID [2020-07-08 12:28:22,442 INFO L280 TraceCheckUtils]: 2: Hoare triple {1512#true} assume true; {1512#true} is VALID [2020-07-08 12:28:22,442 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1512#true} {1512#true} #98#return; {1512#true} is VALID [2020-07-08 12:28:22,442 INFO L263 TraceCheckUtils]: 4: Hoare triple {1512#true} call #t~ret11 := main(); {1512#true} is VALID [2020-07-08 12:28:22,443 INFO L280 TraceCheckUtils]: 5: Hoare triple {1512#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.allocOnStack(4); {1585#(< |#StackHeapBarrier| |main_~#s~0.base|)} is VALID [2020-07-08 12:28:22,443 INFO L263 TraceCheckUtils]: 6: Hoare triple {1585#(< |#StackHeapBarrier| |main_~#s~0.base|)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {1512#true} is VALID [2020-07-08 12:28:22,444 INFO L280 TraceCheckUtils]: 7: Hoare triple {1512#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1592#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-08 12:28:22,446 INFO L280 TraceCheckUtils]: 8: Hoare triple {1592#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1596#(and (= 0 dll_create_~new_head~0.offset) (= 0 dll_create_~head~0.offset) (< dll_create_~new_head~0.base |#StackHeapBarrier|) (= 0 dll_create_~head~0.base) (= 1 (select |#valid| dll_create_~new_head~0.base)))} is VALID [2020-07-08 12:28:22,447 INFO L280 TraceCheckUtils]: 9: Hoare triple {1596#(and (= 0 dll_create_~new_head~0.offset) (= 0 dll_create_~head~0.offset) (< dll_create_~new_head~0.base |#StackHeapBarrier|) (= 0 dll_create_~head~0.base) (= 1 (select |#valid| dll_create_~new_head~0.base)))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1596#(and (= 0 dll_create_~new_head~0.offset) (= 0 dll_create_~head~0.offset) (< dll_create_~new_head~0.base |#StackHeapBarrier|) (= 0 dll_create_~head~0.base) (= 1 (select |#valid| dll_create_~new_head~0.base)))} is VALID [2020-07-08 12:28:22,450 INFO L280 TraceCheckUtils]: 10: Hoare triple {1596#(and (= 0 dll_create_~new_head~0.offset) (= 0 dll_create_~head~0.offset) (< dll_create_~new_head~0.base |#StackHeapBarrier|) (= 0 dll_create_~head~0.base) (= 1 (select |#valid| dll_create_~new_head~0.base)))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1603#(and (= 0 dll_create_~new_head~0.offset) (< dll_create_~new_head~0.base |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) 0) (= 1 (select |#valid| dll_create_~new_head~0.base)) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))))} is VALID [2020-07-08 12:28:22,452 INFO L280 TraceCheckUtils]: 11: Hoare triple {1603#(and (= 0 dll_create_~new_head~0.offset) (< dll_create_~new_head~0.base |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) 0) (= 1 (select |#valid| dll_create_~new_head~0.base)) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))))} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1603#(and (= 0 dll_create_~new_head~0.offset) (< dll_create_~new_head~0.base |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) 0) (= 1 (select |#valid| dll_create_~new_head~0.base)) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))))} is VALID [2020-07-08 12:28:22,454 INFO L280 TraceCheckUtils]: 12: Hoare triple {1603#(and (= 0 dll_create_~new_head~0.offset) (< dll_create_~new_head~0.base |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) 0) (= 1 (select |#valid| dll_create_~new_head~0.base)) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1610#(and (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (< dll_create_~head~0.base |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 8)) (= (select |#valid| dll_create_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 8)))} is VALID [2020-07-08 12:28:22,455 INFO L280 TraceCheckUtils]: 13: Hoare triple {1610#(and (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (< dll_create_~head~0.base |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 8)) (= (select |#valid| dll_create_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 8)))} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1614#(and (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (< dll_create_~head~0.base |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 8)) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 8)))} is VALID [2020-07-08 12:28:22,456 INFO L280 TraceCheckUtils]: 14: Hoare triple {1614#(and (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (< dll_create_~head~0.base |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 8)) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 8)))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1614#(and (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (< dll_create_~head~0.base |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 8)) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 8)))} is VALID [2020-07-08 12:28:22,460 INFO L280 TraceCheckUtils]: 15: Hoare triple {1614#(and (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (< dll_create_~head~0.base |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 8)) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 8)))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1621#(and (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) dll_create_~head~0.base) (< dll_create_~head~0.base |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 8)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 8)) (= (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) dll_create_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))))} is VALID [2020-07-08 12:28:22,464 INFO L280 TraceCheckUtils]: 16: Hoare triple {1621#(and (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) 0) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) dll_create_~head~0.base) (< dll_create_~head~0.base |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 4)) (= 0 dll_create_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 8)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) 8)) (= (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) dll_create_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {1625#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 4) 0) (< (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) |#StackHeapBarrier|) (= dll_create_~new_head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 8)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 8) dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) dll_create_~new_head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 4)) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))))} is VALID [2020-07-08 12:28:22,466 INFO L280 TraceCheckUtils]: 17: Hoare triple {1625#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 4) 0) (< (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) |#StackHeapBarrier|) (= dll_create_~new_head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 8)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 8) dll_create_~new_head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) dll_create_~new_head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4))) 4)) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1629#(and (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8))) (< (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4)) |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) 4)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8))) (not (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4)) dll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) 8) dll_create_~head~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) 8) dll_create_~head~0.base))} is VALID [2020-07-08 12:28:22,468 INFO L280 TraceCheckUtils]: 18: Hoare triple {1629#(and (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8))) (< (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4)) |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) 4)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8))) (not (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4)) dll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) 8) dll_create_~head~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) 8) dll_create_~head~0.base))} assume !(~len > 0); {1629#(and (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8))) (< (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4)) |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) 4)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8))) (not (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4)) dll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) 8) dll_create_~head~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) 8) dll_create_~head~0.base))} is VALID [2020-07-08 12:28:22,492 INFO L280 TraceCheckUtils]: 19: Hoare triple {1629#(and (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8))) (< (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4)) |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) 4)) (= 0 (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8))) (not (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4)) dll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) 8) dll_create_~head~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ dll_create_~head~0.offset 4))) 8) dll_create_~head~0.base))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1636#(and (= 0 (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) (+ |dll_create_#res.offset| 8))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) 4)) (= |dll_create_#res.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) 8)) (< (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4)) |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) 4)) (not (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4)))) (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))))} is VALID [2020-07-08 12:28:22,494 INFO L280 TraceCheckUtils]: 20: Hoare triple {1636#(and (= 0 (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) (+ |dll_create_#res.offset| 8))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) 4)) (= |dll_create_#res.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) 8)) (< (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4)) |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) 4)) (not (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4)))) (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))))} assume true; {1636#(and (= 0 (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) (+ |dll_create_#res.offset| 8))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) 4)) (= |dll_create_#res.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) 8)) (< (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4)) |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) 4)) (not (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4)))) (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))))} is VALID [2020-07-08 12:28:22,497 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1636#(and (= 0 (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) (+ |dll_create_#res.offset| 8))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) 4)) (= |dll_create_#res.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) 8)) (< (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4)) |#StackHeapBarrier|) (= 0 (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) 4)) (not (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4)))) (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) (+ |dll_create_#res.offset| 4))))} {1585#(< |#StackHeapBarrier| |main_~#s~0.base|)} #92#return; {1643#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~ret8.base|) (+ |main_#t~ret8.offset| 8))) (= (select (select |#memory_$Pointer$.offset| |main_#t~ret8.base|) (+ |main_#t~ret8.offset| 4)) 0) (<= (+ (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (+ |main_#t~ret8.offset| 4)) 2) |main_~#s~0.base|) (= |main_#t~ret8.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (+ |main_#t~ret8.offset| 4))) 8)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (+ |main_#t~ret8.offset| 4))) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (+ |main_#t~ret8.offset| 4))) 4)) (= (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (+ |main_#t~ret8.offset| 8)) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (+ |main_#t~ret8.offset| 4))) 8) |main_#t~ret8.offset|) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (+ |main_#t~ret8.offset| 4)) |main_#t~ret8.base|)))} is VALID [2020-07-08 12:28:22,499 INFO L280 TraceCheckUtils]: 22: Hoare triple {1643#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~ret8.base|) (+ |main_#t~ret8.offset| 8))) (= (select (select |#memory_$Pointer$.offset| |main_#t~ret8.base|) (+ |main_#t~ret8.offset| 4)) 0) (<= (+ (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (+ |main_#t~ret8.offset| 4)) 2) |main_~#s~0.base|) (= |main_#t~ret8.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (+ |main_#t~ret8.offset| 4))) 8)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (+ |main_#t~ret8.offset| 4))) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (+ |main_#t~ret8.offset| 4))) 4)) (= (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (+ |main_#t~ret8.offset| 8)) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (+ |main_#t~ret8.offset| 4))) 8) |main_#t~ret8.offset|) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (+ |main_#t~ret8.offset| 4)) |main_#t~ret8.base|)))} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {1647#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 8))) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)) 2) |main_~#s~0.base|) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 8)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 4)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)) 0))} is VALID [2020-07-08 12:28:22,500 INFO L280 TraceCheckUtils]: 23: Hoare triple {1647#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 8))) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)) 2) |main_~#s~0.base|) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 8)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 4)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)) 0))} assume !!(~i~0 >= 0); {1647#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 8))) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)) 2) |main_~#s~0.base|) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 8)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 4)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)) 0))} is VALID [2020-07-08 12:28:22,502 INFO L263 TraceCheckUtils]: 24: Hoare triple {1647#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 8))) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)) 2) |main_~#s~0.base|) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 8)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 4)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)) 0))} call dll_remove_first(~#s~0.base, ~#s~0.offset); {1654#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:28:22,504 INFO L280 TraceCheckUtils]: 25: Hoare triple {1654#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset; {1658#(and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)) dll_remove_first_~temp~1.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)) dll_remove_first_~temp~1.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|))} is VALID [2020-07-08 12:28:22,506 INFO L280 TraceCheckUtils]: 26: Hoare triple {1658#(and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)) dll_remove_first_~temp~1.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)) dll_remove_first_~temp~1.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|))} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {1662#(and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)) dll_remove_first_~temp~1.base) (= (store |old(#memory_$Pointer$.offset)| dll_remove_first_~temp~1.base (store (select |old(#memory_$Pointer$.offset)| dll_remove_first_~temp~1.base) (+ dll_remove_first_~temp~1.offset 8) 0)) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_remove_first_~temp~1.base (store (select |old(#memory_$Pointer$.base)| dll_remove_first_~temp~1.base) (+ dll_remove_first_~temp~1.offset 8) 0))) (= dll_remove_first_~temp~1.offset (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4))) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|))} is VALID [2020-07-08 12:28:22,508 INFO L280 TraceCheckUtils]: 27: Hoare triple {1662#(and (= dll_remove_first_~head.base |dll_remove_first_#in~head.base|) (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4)) dll_remove_first_~temp~1.base) (= (store |old(#memory_$Pointer$.offset)| dll_remove_first_~temp~1.base (store (select |old(#memory_$Pointer$.offset)| dll_remove_first_~temp~1.base) (+ dll_remove_first_~temp~1.offset 8) 0)) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_remove_first_~temp~1.base (store (select |old(#memory_$Pointer$.base)| dll_remove_first_~temp~1.base) (+ dll_remove_first_~temp~1.offset 8) 0))) (= dll_remove_first_~temp~1.offset (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (+ (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset) 4))) (= dll_remove_first_~head.offset |dll_remove_first_#in~head.offset|))} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {1666#(and (= (store (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4))) (+ (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) 8) 0)) |dll_remove_first_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4))) (+ (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) 8) 0)) |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))) |#memory_$Pointer$.base|) (= (store (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4))) (+ (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) 8) 0)) |dll_remove_first_#in~head.base| (store (select (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4))) (+ (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) 8) 0)) |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))) |#memory_$Pointer$.offset|))} is VALID [2020-07-08 12:28:22,510 INFO L280 TraceCheckUtils]: 28: Hoare triple {1666#(and (= (store (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4))) (+ (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) 8) 0)) |dll_remove_first_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4))) (+ (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) 8) 0)) |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))) |#memory_$Pointer$.base|) (= (store (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4))) (+ (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) 8) 0)) |dll_remove_first_#in~head.base| (store (select (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4))) (+ (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) 8) 0)) |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))) |#memory_$Pointer$.offset|))} assume true; {1666#(and (= (store (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4))) (+ (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) 8) 0)) |dll_remove_first_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4))) (+ (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) 8) 0)) |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))) |#memory_$Pointer$.base|) (= (store (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4))) (+ (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) 8) 0)) |dll_remove_first_#in~head.base| (store (select (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4))) (+ (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) 8) 0)) |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))) |#memory_$Pointer$.offset|))} is VALID [2020-07-08 12:28:22,677 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1666#(and (= (store (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4))) (+ (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) 8) 0)) |dll_remove_first_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4))) (+ (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) 8) 0)) |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))) |#memory_$Pointer$.base|) (= (store (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4))) (+ (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) 8) 0)) |dll_remove_first_#in~head.base| (store (select (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4))) (+ (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) 8) 0)) |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))) |#memory_$Pointer$.offset|))} {1647#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 8))) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)) 2) |main_~#s~0.base|) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 8)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4))) 4)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 4)) 0))} #94#return; {1673#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 8)) (<= (+ (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 2) |main_~#s~0.base|) (exists ((v_arrayElimIndex_5 Int) (v_arrayElimCell_18 Int)) (and (or (= 4 v_arrayElimIndex_5) (not (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (not (= |main_~#s~0.base| v_arrayElimCell_18))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5)) (= 0 (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5)) (or (not (= v_arrayElimIndex_5 |main_~#s~0.offset|)) (not (= |main_~#s~0.base| v_arrayElimCell_18))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5) 8))) (or (not (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (not (= |main_~#s~0.base| v_arrayElimCell_18)) (= 0 v_arrayElimCell_18)) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| v_arrayElimCell_18) v_arrayElimIndex_5)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) v_arrayElimCell_18)) (= 0 (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) (+ v_arrayElimIndex_5 4))) (or (and (= |main_~#s~0.base| v_arrayElimCell_18) (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_18) (+ v_arrayElimIndex_5 4)) 0)))))} is VALID [2020-07-08 12:28:22,679 INFO L280 TraceCheckUtils]: 30: Hoare triple {1673#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 8)) (<= (+ (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 2) |main_~#s~0.base|) (exists ((v_arrayElimIndex_5 Int) (v_arrayElimCell_18 Int)) (and (or (= 4 v_arrayElimIndex_5) (not (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (not (= |main_~#s~0.base| v_arrayElimCell_18))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5)) (= 0 (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5)) (or (not (= v_arrayElimIndex_5 |main_~#s~0.offset|)) (not (= |main_~#s~0.base| v_arrayElimCell_18))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5) 8))) (or (not (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (not (= |main_~#s~0.base| v_arrayElimCell_18)) (= 0 v_arrayElimCell_18)) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| v_arrayElimCell_18) v_arrayElimIndex_5)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) v_arrayElimCell_18)) (= 0 (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) (+ v_arrayElimIndex_5 4))) (or (and (= |main_~#s~0.base| v_arrayElimCell_18) (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_18) (+ v_arrayElimIndex_5 4)) 0)))))} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {1673#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 8)) (<= (+ (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 2) |main_~#s~0.base|) (exists ((v_arrayElimIndex_5 Int) (v_arrayElimCell_18 Int)) (and (or (= 4 v_arrayElimIndex_5) (not (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (not (= |main_~#s~0.base| v_arrayElimCell_18))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5)) (= 0 (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5)) (or (not (= v_arrayElimIndex_5 |main_~#s~0.offset|)) (not (= |main_~#s~0.base| v_arrayElimCell_18))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5) 8))) (or (not (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (not (= |main_~#s~0.base| v_arrayElimCell_18)) (= 0 v_arrayElimCell_18)) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| v_arrayElimCell_18) v_arrayElimIndex_5)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) v_arrayElimCell_18)) (= 0 (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) (+ v_arrayElimIndex_5 4))) (or (and (= |main_~#s~0.base| v_arrayElimCell_18) (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_18) (+ v_arrayElimIndex_5 4)) 0)))))} is VALID [2020-07-08 12:28:22,682 INFO L280 TraceCheckUtils]: 31: Hoare triple {1673#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 8)) (<= (+ (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 2) |main_~#s~0.base|) (exists ((v_arrayElimIndex_5 Int) (v_arrayElimCell_18 Int)) (and (or (= 4 v_arrayElimIndex_5) (not (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (not (= |main_~#s~0.base| v_arrayElimCell_18))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5)) (= 0 (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5)) (or (not (= v_arrayElimIndex_5 |main_~#s~0.offset|)) (not (= |main_~#s~0.base| v_arrayElimCell_18))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5) 8))) (or (not (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (not (= |main_~#s~0.base| v_arrayElimCell_18)) (= 0 v_arrayElimCell_18)) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| v_arrayElimCell_18) v_arrayElimIndex_5)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) v_arrayElimCell_18)) (= 0 (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) (+ v_arrayElimIndex_5 4))) (or (and (= |main_~#s~0.base| v_arrayElimCell_18) (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_18) (+ v_arrayElimIndex_5 4)) 0)))))} assume !!(~i~0 >= 0); {1673#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 8)) (<= (+ (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 2) |main_~#s~0.base|) (exists ((v_arrayElimIndex_5 Int) (v_arrayElimCell_18 Int)) (and (or (= 4 v_arrayElimIndex_5) (not (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (not (= |main_~#s~0.base| v_arrayElimCell_18))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5)) (= 0 (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5)) (or (not (= v_arrayElimIndex_5 |main_~#s~0.offset|)) (not (= |main_~#s~0.base| v_arrayElimCell_18))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5) 8))) (or (not (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (not (= |main_~#s~0.base| v_arrayElimCell_18)) (= 0 v_arrayElimCell_18)) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| v_arrayElimCell_18) v_arrayElimIndex_5)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) v_arrayElimCell_18)) (= 0 (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) (+ v_arrayElimIndex_5 4))) (or (and (= |main_~#s~0.base| v_arrayElimCell_18) (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_18) (+ v_arrayElimIndex_5 4)) 0)))))} is VALID [2020-07-08 12:28:22,684 INFO L263 TraceCheckUtils]: 32: Hoare triple {1673#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 8)) (<= (+ (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 2) |main_~#s~0.base|) (exists ((v_arrayElimIndex_5 Int) (v_arrayElimCell_18 Int)) (and (or (= 4 v_arrayElimIndex_5) (not (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (not (= |main_~#s~0.base| v_arrayElimCell_18))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5)) (= 0 (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5)) (or (not (= v_arrayElimIndex_5 |main_~#s~0.offset|)) (not (= |main_~#s~0.base| v_arrayElimCell_18))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5) 8))) (or (not (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (not (= |main_~#s~0.base| v_arrayElimCell_18)) (= 0 v_arrayElimCell_18)) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| v_arrayElimCell_18) v_arrayElimIndex_5)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) v_arrayElimCell_18)) (= 0 (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) (+ v_arrayElimIndex_5 4))) (or (and (= |main_~#s~0.base| v_arrayElimCell_18) (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_18) (+ v_arrayElimIndex_5 4)) 0)))))} call dll_remove_first(~#s~0.base, ~#s~0.offset); {1654#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:28:22,689 INFO L280 TraceCheckUtils]: 33: Hoare triple {1654#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset; {1686#(and (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) dll_remove_first_~temp~1.base) (= dll_remove_first_~temp~1.offset (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4))))} is VALID [2020-07-08 12:28:22,690 INFO L280 TraceCheckUtils]: 34: Hoare triple {1686#(and (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)) dll_remove_first_~temp~1.base) (= dll_remove_first_~temp~1.offset (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4))))} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {1690#(or (not (= 0 (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))) (not (= 0 (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))))} is VALID [2020-07-08 12:28:22,690 INFO L280 TraceCheckUtils]: 35: Hoare triple {1690#(or (not (= 0 (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))) (not (= 0 (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))))} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {1690#(or (not (= 0 (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))) (not (= 0 (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))))} is VALID [2020-07-08 12:28:22,691 INFO L280 TraceCheckUtils]: 36: Hoare triple {1690#(or (not (= 0 (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))) (not (= 0 (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))))} assume true; {1690#(or (not (= 0 (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))) (not (= 0 (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))))} is VALID [2020-07-08 12:28:22,694 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {1690#(or (not (= 0 (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))) (not (= 0 (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (+ (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) 4)))))} {1673#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 8)) (<= (+ (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 2) |main_~#s~0.base|) (exists ((v_arrayElimIndex_5 Int) (v_arrayElimCell_18 Int)) (and (or (= 4 v_arrayElimIndex_5) (not (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (not (= |main_~#s~0.base| v_arrayElimCell_18))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5)) (= 0 (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5)) (or (not (= v_arrayElimIndex_5 |main_~#s~0.offset|)) (not (= |main_~#s~0.base| v_arrayElimCell_18))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) v_arrayElimIndex_5) 8))) (or (not (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (not (= |main_~#s~0.base| v_arrayElimCell_18)) (= 0 v_arrayElimCell_18)) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| v_arrayElimCell_18) v_arrayElimIndex_5)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) v_arrayElimCell_18)) (= 0 (select (select |#memory_$Pointer$.offset| v_arrayElimCell_18) (+ v_arrayElimIndex_5 4))) (or (and (= |main_~#s~0.base| v_arrayElimCell_18) (= |main_~#s~0.offset| (+ v_arrayElimIndex_5 4))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_18) (+ v_arrayElimIndex_5 4)) 0)))))} #94#return; {1513#false} is VALID [2020-07-08 12:28:22,694 INFO L280 TraceCheckUtils]: 38: Hoare triple {1513#false} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {1513#false} is VALID [2020-07-08 12:28:22,694 INFO L280 TraceCheckUtils]: 39: Hoare triple {1513#false} assume !(~i~0 >= 0); {1513#false} is VALID [2020-07-08 12:28:22,695 INFO L280 TraceCheckUtils]: 40: Hoare triple {1513#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {1513#false} is VALID [2020-07-08 12:28:22,695 INFO L280 TraceCheckUtils]: 41: Hoare triple {1513#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1513#false} is VALID [2020-07-08 12:28:22,695 INFO L280 TraceCheckUtils]: 42: Hoare triple {1513#false} assume !false; {1513#false} is VALID [2020-07-08 12:28:22,710 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-08 12:28:22,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:28:22,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21] total 46 [2020-07-08 12:28:22,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136637170] [2020-07-08 12:28:22,712 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 43 [2020-07-08 12:28:22,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:28:22,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states. [2020-07-08 12:28:23,032 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:28:23,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2020-07-08 12:28:23,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:28:23,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2020-07-08 12:28:23,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1955, Unknown=0, NotChecked=0, Total=2070 [2020-07-08 12:28:23,035 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 46 states. [2020-07-08 12:28:26,541 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2020-07-08 12:28:27,010 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2020-07-08 12:28:27,421 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2020-07-08 12:28:27,898 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2020-07-08 12:28:29,514 WARN L193 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 97 [2020-07-08 12:28:33,077 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 48 [2020-07-08 12:28:33,672 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 66 [2020-07-08 12:28:37,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:28:37,618 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2020-07-08 12:28:37,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-07-08 12:28:37,619 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 43 [2020-07-08 12:28:37,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:28:37,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-08 12:28:37,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 103 transitions. [2020-07-08 12:28:37,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-08 12:28:37,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 103 transitions. [2020-07-08 12:28:37,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 103 transitions. [2020-07-08 12:28:38,099 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:28:38,103 INFO L225 Difference]: With dead ends: 89 [2020-07-08 12:28:38,103 INFO L226 Difference]: Without dead ends: 75 [2020-07-08 12:28:38,106 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=304, Invalid=4952, Unknown=0, NotChecked=0, Total=5256 [2020-07-08 12:28:38,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-08 12:28:38,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 56. [2020-07-08 12:28:38,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:28:38,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 56 states. [2020-07-08 12:28:38,202 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 56 states. [2020-07-08 12:28:38,202 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 56 states. [2020-07-08 12:28:38,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:28:38,207 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2020-07-08 12:28:38,207 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2020-07-08 12:28:38,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:28:38,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:28:38,208 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 75 states. [2020-07-08 12:28:38,208 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 75 states. [2020-07-08 12:28:38,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:28:38,213 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2020-07-08 12:28:38,213 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2020-07-08 12:28:38,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:28:38,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:28:38,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:28:38,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:28:38,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-08 12:28:38,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2020-07-08 12:28:38,218 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 43 [2020-07-08 12:28:38,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:28:38,218 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2020-07-08 12:28:38,218 INFO L480 AbstractCegarLoop]: Interpolant automaton has 46 states. [2020-07-08 12:28:38,218 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2020-07-08 12:28:38,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-08 12:28:38,219 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:28:38,219 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:28:38,427 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:28:38,427 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:28:38,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:28:38,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1394437068, now seen corresponding path program 3 times [2020-07-08 12:28:38,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:28:38,429 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723708534] [2020-07-08 12:28:38,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:28:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:38,525 INFO L280 TraceCheckUtils]: 0: Hoare triple {2153#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2117#true} is VALID [2020-07-08 12:28:38,526 INFO L280 TraceCheckUtils]: 1: Hoare triple {2117#true} assume true; {2117#true} is VALID [2020-07-08 12:28:38,526 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2117#true} {2117#true} #98#return; {2117#true} is VALID [2020-07-08 12:28:38,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:38,647 INFO L280 TraceCheckUtils]: 0: Hoare triple {2154#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {2155#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-08 12:28:38,648 INFO L280 TraceCheckUtils]: 1: Hoare triple {2155#(= dll_create_~len |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2155#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-08 12:28:38,649 INFO L280 TraceCheckUtils]: 2: Hoare triple {2155#(= dll_create_~len |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2155#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-08 12:28:38,650 INFO L280 TraceCheckUtils]: 3: Hoare triple {2155#(= dll_create_~len |dll_create_#in~len|)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {2155#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-08 12:28:38,651 INFO L280 TraceCheckUtils]: 4: Hoare triple {2155#(= dll_create_~len |dll_create_#in~len|)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {2155#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-08 12:28:38,652 INFO L280 TraceCheckUtils]: 5: Hoare triple {2155#(= dll_create_~len |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {2156#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-08 12:28:38,655 INFO L280 TraceCheckUtils]: 6: Hoare triple {2156#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2156#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-08 12:28:38,656 INFO L280 TraceCheckUtils]: 7: Hoare triple {2156#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2156#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-08 12:28:38,659 INFO L280 TraceCheckUtils]: 8: Hoare triple {2156#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {2156#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-08 12:28:38,659 INFO L280 TraceCheckUtils]: 9: Hoare triple {2156#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {2156#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-08 12:28:38,662 INFO L280 TraceCheckUtils]: 10: Hoare triple {2156#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {2157#(<= (+ dll_create_~len 2) |dll_create_#in~len|)} is VALID [2020-07-08 12:28:38,663 INFO L280 TraceCheckUtils]: 11: Hoare triple {2157#(<= (+ dll_create_~len 2) |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2158#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-08 12:28:38,664 INFO L280 TraceCheckUtils]: 12: Hoare triple {2158#(<= 3 |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2158#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-08 12:28:38,665 INFO L280 TraceCheckUtils]: 13: Hoare triple {2158#(<= 3 |dll_create_#in~len|)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {2158#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-08 12:28:38,665 INFO L280 TraceCheckUtils]: 14: Hoare triple {2158#(<= 3 |dll_create_#in~len|)} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {2158#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-08 12:28:38,666 INFO L280 TraceCheckUtils]: 15: Hoare triple {2158#(<= 3 |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {2158#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-08 12:28:38,667 INFO L280 TraceCheckUtils]: 16: Hoare triple {2158#(<= 3 |dll_create_#in~len|)} assume !(~len > 0); {2158#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-08 12:28:38,668 INFO L280 TraceCheckUtils]: 17: Hoare triple {2158#(<= 3 |dll_create_#in~len|)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2158#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-08 12:28:38,668 INFO L280 TraceCheckUtils]: 18: Hoare triple {2158#(<= 3 |dll_create_#in~len|)} assume true; {2158#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-08 12:28:38,670 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {2158#(<= 3 |dll_create_#in~len|)} {2122#(<= main_~len~0 2)} #92#return; {2118#false} is VALID [2020-07-08 12:28:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:38,702 INFO L280 TraceCheckUtils]: 0: Hoare triple {2159#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset; {2117#true} is VALID [2020-07-08 12:28:38,702 INFO L280 TraceCheckUtils]: 1: Hoare triple {2117#true} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {2117#true} is VALID [2020-07-08 12:28:38,703 INFO L280 TraceCheckUtils]: 2: Hoare triple {2117#true} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {2117#true} is VALID [2020-07-08 12:28:38,703 INFO L280 TraceCheckUtils]: 3: Hoare triple {2117#true} assume true; {2117#true} is VALID [2020-07-08 12:28:38,703 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2117#true} {2118#false} #94#return; {2118#false} is VALID [2020-07-08 12:28:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:38,710 INFO L280 TraceCheckUtils]: 0: Hoare triple {2159#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset; {2117#true} is VALID [2020-07-08 12:28:38,711 INFO L280 TraceCheckUtils]: 1: Hoare triple {2117#true} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {2117#true} is VALID [2020-07-08 12:28:38,711 INFO L280 TraceCheckUtils]: 2: Hoare triple {2117#true} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {2117#true} is VALID [2020-07-08 12:28:38,711 INFO L280 TraceCheckUtils]: 3: Hoare triple {2117#true} assume true; {2117#true} is VALID [2020-07-08 12:28:38,712 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2117#true} {2118#false} #94#return; {2118#false} is VALID [2020-07-08 12:28:38,713 INFO L263 TraceCheckUtils]: 0: Hoare triple {2117#true} call ULTIMATE.init(); {2153#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:28:38,713 INFO L280 TraceCheckUtils]: 1: Hoare triple {2153#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2117#true} is VALID [2020-07-08 12:28:38,713 INFO L280 TraceCheckUtils]: 2: Hoare triple {2117#true} assume true; {2117#true} is VALID [2020-07-08 12:28:38,713 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2117#true} {2117#true} #98#return; {2117#true} is VALID [2020-07-08 12:28:38,714 INFO L263 TraceCheckUtils]: 4: Hoare triple {2117#true} call #t~ret11 := main(); {2117#true} is VALID [2020-07-08 12:28:38,715 INFO L280 TraceCheckUtils]: 5: Hoare triple {2117#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.allocOnStack(4); {2122#(<= main_~len~0 2)} is VALID [2020-07-08 12:28:38,716 INFO L263 TraceCheckUtils]: 6: Hoare triple {2122#(<= main_~len~0 2)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {2154#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:28:38,717 INFO L280 TraceCheckUtils]: 7: Hoare triple {2154#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {2155#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-08 12:28:38,718 INFO L280 TraceCheckUtils]: 8: Hoare triple {2155#(= dll_create_~len |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2155#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-08 12:28:38,719 INFO L280 TraceCheckUtils]: 9: Hoare triple {2155#(= dll_create_~len |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2155#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-08 12:28:38,719 INFO L280 TraceCheckUtils]: 10: Hoare triple {2155#(= dll_create_~len |dll_create_#in~len|)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {2155#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-08 12:28:38,720 INFO L280 TraceCheckUtils]: 11: Hoare triple {2155#(= dll_create_~len |dll_create_#in~len|)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {2155#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-08 12:28:38,721 INFO L280 TraceCheckUtils]: 12: Hoare triple {2155#(= dll_create_~len |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {2156#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-08 12:28:38,722 INFO L280 TraceCheckUtils]: 13: Hoare triple {2156#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2156#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-08 12:28:38,723 INFO L280 TraceCheckUtils]: 14: Hoare triple {2156#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2156#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-08 12:28:38,723 INFO L280 TraceCheckUtils]: 15: Hoare triple {2156#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {2156#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-08 12:28:38,724 INFO L280 TraceCheckUtils]: 16: Hoare triple {2156#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {2156#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-08 12:28:38,725 INFO L280 TraceCheckUtils]: 17: Hoare triple {2156#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {2157#(<= (+ dll_create_~len 2) |dll_create_#in~len|)} is VALID [2020-07-08 12:28:38,727 INFO L280 TraceCheckUtils]: 18: Hoare triple {2157#(<= (+ dll_create_~len 2) |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2158#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-08 12:28:38,728 INFO L280 TraceCheckUtils]: 19: Hoare triple {2158#(<= 3 |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2158#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-08 12:28:38,728 INFO L280 TraceCheckUtils]: 20: Hoare triple {2158#(<= 3 |dll_create_#in~len|)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {2158#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-08 12:28:38,729 INFO L280 TraceCheckUtils]: 21: Hoare triple {2158#(<= 3 |dll_create_#in~len|)} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {2158#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-08 12:28:38,729 INFO L280 TraceCheckUtils]: 22: Hoare triple {2158#(<= 3 |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {2158#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-08 12:28:38,730 INFO L280 TraceCheckUtils]: 23: Hoare triple {2158#(<= 3 |dll_create_#in~len|)} assume !(~len > 0); {2158#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-08 12:28:38,731 INFO L280 TraceCheckUtils]: 24: Hoare triple {2158#(<= 3 |dll_create_#in~len|)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2158#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-08 12:28:38,731 INFO L280 TraceCheckUtils]: 25: Hoare triple {2158#(<= 3 |dll_create_#in~len|)} assume true; {2158#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-08 12:28:38,733 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2158#(<= 3 |dll_create_#in~len|)} {2122#(<= main_~len~0 2)} #92#return; {2118#false} is VALID [2020-07-08 12:28:38,733 INFO L280 TraceCheckUtils]: 27: Hoare triple {2118#false} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {2118#false} is VALID [2020-07-08 12:28:38,733 INFO L280 TraceCheckUtils]: 28: Hoare triple {2118#false} assume !!(~i~0 >= 0); {2118#false} is VALID [2020-07-08 12:28:38,733 INFO L263 TraceCheckUtils]: 29: Hoare triple {2118#false} call dll_remove_first(~#s~0.base, ~#s~0.offset); {2159#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:28:38,733 INFO L280 TraceCheckUtils]: 30: Hoare triple {2159#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset; {2117#true} is VALID [2020-07-08 12:28:38,734 INFO L280 TraceCheckUtils]: 31: Hoare triple {2117#true} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {2117#true} is VALID [2020-07-08 12:28:38,734 INFO L280 TraceCheckUtils]: 32: Hoare triple {2117#true} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {2117#true} is VALID [2020-07-08 12:28:38,734 INFO L280 TraceCheckUtils]: 33: Hoare triple {2117#true} assume true; {2117#true} is VALID [2020-07-08 12:28:38,734 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2117#true} {2118#false} #94#return; {2118#false} is VALID [2020-07-08 12:28:38,734 INFO L280 TraceCheckUtils]: 35: Hoare triple {2118#false} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {2118#false} is VALID [2020-07-08 12:28:38,734 INFO L280 TraceCheckUtils]: 36: Hoare triple {2118#false} assume !!(~i~0 >= 0); {2118#false} is VALID [2020-07-08 12:28:38,735 INFO L263 TraceCheckUtils]: 37: Hoare triple {2118#false} call dll_remove_first(~#s~0.base, ~#s~0.offset); {2159#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:28:38,735 INFO L280 TraceCheckUtils]: 38: Hoare triple {2159#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset; {2117#true} is VALID [2020-07-08 12:28:38,735 INFO L280 TraceCheckUtils]: 39: Hoare triple {2117#true} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {2117#true} is VALID [2020-07-08 12:28:38,735 INFO L280 TraceCheckUtils]: 40: Hoare triple {2117#true} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {2117#true} is VALID [2020-07-08 12:28:38,735 INFO L280 TraceCheckUtils]: 41: Hoare triple {2117#true} assume true; {2117#true} is VALID [2020-07-08 12:28:38,736 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {2117#true} {2118#false} #94#return; {2118#false} is VALID [2020-07-08 12:28:38,736 INFO L280 TraceCheckUtils]: 43: Hoare triple {2118#false} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {2118#false} is VALID [2020-07-08 12:28:38,736 INFO L280 TraceCheckUtils]: 44: Hoare triple {2118#false} assume !(~i~0 >= 0); {2118#false} is VALID [2020-07-08 12:28:38,736 INFO L280 TraceCheckUtils]: 45: Hoare triple {2118#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {2118#false} is VALID [2020-07-08 12:28:38,736 INFO L280 TraceCheckUtils]: 46: Hoare triple {2118#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {2118#false} is VALID [2020-07-08 12:28:38,737 INFO L280 TraceCheckUtils]: 47: Hoare triple {2118#false} assume !false; {2118#false} is VALID [2020-07-08 12:28:38,739 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-08 12:28:38,740 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723708534] [2020-07-08 12:28:38,740 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269279631] [2020-07-08 12:28:38,740 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:28:39,625 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-08 12:28:39,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:28:39,628 INFO L264 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-08 12:28:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:39,655 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:28:39,774 INFO L263 TraceCheckUtils]: 0: Hoare triple {2117#true} call ULTIMATE.init(); {2117#true} is VALID [2020-07-08 12:28:39,774 INFO L280 TraceCheckUtils]: 1: Hoare triple {2117#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2117#true} is VALID [2020-07-08 12:28:39,774 INFO L280 TraceCheckUtils]: 2: Hoare triple {2117#true} assume true; {2117#true} is VALID [2020-07-08 12:28:39,775 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2117#true} {2117#true} #98#return; {2117#true} is VALID [2020-07-08 12:28:39,775 INFO L263 TraceCheckUtils]: 4: Hoare triple {2117#true} call #t~ret11 := main(); {2117#true} is VALID [2020-07-08 12:28:39,775 INFO L280 TraceCheckUtils]: 5: Hoare triple {2117#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.allocOnStack(4); {2122#(<= main_~len~0 2)} is VALID [2020-07-08 12:28:39,776 INFO L263 TraceCheckUtils]: 6: Hoare triple {2122#(<= main_~len~0 2)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {2117#true} is VALID [2020-07-08 12:28:39,776 INFO L280 TraceCheckUtils]: 7: Hoare triple {2117#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {2184#(<= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-08 12:28:39,783 INFO L280 TraceCheckUtils]: 8: Hoare triple {2184#(<= dll_create_~len |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2184#(<= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-08 12:28:39,784 INFO L280 TraceCheckUtils]: 9: Hoare triple {2184#(<= dll_create_~len |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2184#(<= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-08 12:28:39,784 INFO L280 TraceCheckUtils]: 10: Hoare triple {2184#(<= dll_create_~len |dll_create_#in~len|)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {2184#(<= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-08 12:28:39,785 INFO L280 TraceCheckUtils]: 11: Hoare triple {2184#(<= dll_create_~len |dll_create_#in~len|)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {2184#(<= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-08 12:28:39,785 INFO L280 TraceCheckUtils]: 12: Hoare triple {2184#(<= dll_create_~len |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {2156#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-08 12:28:39,786 INFO L280 TraceCheckUtils]: 13: Hoare triple {2156#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2156#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-08 12:28:39,786 INFO L280 TraceCheckUtils]: 14: Hoare triple {2156#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2156#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-08 12:28:39,787 INFO L280 TraceCheckUtils]: 15: Hoare triple {2156#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {2156#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-08 12:28:39,787 INFO L280 TraceCheckUtils]: 16: Hoare triple {2156#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {2156#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-08 12:28:39,789 INFO L280 TraceCheckUtils]: 17: Hoare triple {2156#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {2157#(<= (+ dll_create_~len 2) |dll_create_#in~len|)} is VALID [2020-07-08 12:28:39,791 INFO L280 TraceCheckUtils]: 18: Hoare triple {2157#(<= (+ dll_create_~len 2) |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2158#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-08 12:28:39,792 INFO L280 TraceCheckUtils]: 19: Hoare triple {2158#(<= 3 |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2158#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-08 12:28:39,792 INFO L280 TraceCheckUtils]: 20: Hoare triple {2158#(<= 3 |dll_create_#in~len|)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {2158#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-08 12:28:39,793 INFO L280 TraceCheckUtils]: 21: Hoare triple {2158#(<= 3 |dll_create_#in~len|)} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {2158#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-08 12:28:39,793 INFO L280 TraceCheckUtils]: 22: Hoare triple {2158#(<= 3 |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {2158#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-08 12:28:39,793 INFO L280 TraceCheckUtils]: 23: Hoare triple {2158#(<= 3 |dll_create_#in~len|)} assume !(~len > 0); {2158#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-08 12:28:39,794 INFO L280 TraceCheckUtils]: 24: Hoare triple {2158#(<= 3 |dll_create_#in~len|)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2158#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-08 12:28:39,795 INFO L280 TraceCheckUtils]: 25: Hoare triple {2158#(<= 3 |dll_create_#in~len|)} assume true; {2158#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-08 12:28:39,796 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2158#(<= 3 |dll_create_#in~len|)} {2122#(<= main_~len~0 2)} #92#return; {2118#false} is VALID [2020-07-08 12:28:39,796 INFO L280 TraceCheckUtils]: 27: Hoare triple {2118#false} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {2118#false} is VALID [2020-07-08 12:28:39,796 INFO L280 TraceCheckUtils]: 28: Hoare triple {2118#false} assume !!(~i~0 >= 0); {2118#false} is VALID [2020-07-08 12:28:39,796 INFO L263 TraceCheckUtils]: 29: Hoare triple {2118#false} call dll_remove_first(~#s~0.base, ~#s~0.offset); {2118#false} is VALID [2020-07-08 12:28:39,796 INFO L280 TraceCheckUtils]: 30: Hoare triple {2118#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset; {2118#false} is VALID [2020-07-08 12:28:39,797 INFO L280 TraceCheckUtils]: 31: Hoare triple {2118#false} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {2118#false} is VALID [2020-07-08 12:28:39,797 INFO L280 TraceCheckUtils]: 32: Hoare triple {2118#false} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {2118#false} is VALID [2020-07-08 12:28:39,797 INFO L280 TraceCheckUtils]: 33: Hoare triple {2118#false} assume true; {2118#false} is VALID [2020-07-08 12:28:39,797 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2118#false} {2118#false} #94#return; {2118#false} is VALID [2020-07-08 12:28:39,798 INFO L280 TraceCheckUtils]: 35: Hoare triple {2118#false} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {2118#false} is VALID [2020-07-08 12:28:39,798 INFO L280 TraceCheckUtils]: 36: Hoare triple {2118#false} assume !!(~i~0 >= 0); {2118#false} is VALID [2020-07-08 12:28:39,798 INFO L263 TraceCheckUtils]: 37: Hoare triple {2118#false} call dll_remove_first(~#s~0.base, ~#s~0.offset); {2118#false} is VALID [2020-07-08 12:28:39,798 INFO L280 TraceCheckUtils]: 38: Hoare triple {2118#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset; {2118#false} is VALID [2020-07-08 12:28:39,799 INFO L280 TraceCheckUtils]: 39: Hoare triple {2118#false} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {2118#false} is VALID [2020-07-08 12:28:39,799 INFO L280 TraceCheckUtils]: 40: Hoare triple {2118#false} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {2118#false} is VALID [2020-07-08 12:28:39,799 INFO L280 TraceCheckUtils]: 41: Hoare triple {2118#false} assume true; {2118#false} is VALID [2020-07-08 12:28:39,799 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {2118#false} {2118#false} #94#return; {2118#false} is VALID [2020-07-08 12:28:39,800 INFO L280 TraceCheckUtils]: 43: Hoare triple {2118#false} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {2118#false} is VALID [2020-07-08 12:28:39,800 INFO L280 TraceCheckUtils]: 44: Hoare triple {2118#false} assume !(~i~0 >= 0); {2118#false} is VALID [2020-07-08 12:28:39,800 INFO L280 TraceCheckUtils]: 45: Hoare triple {2118#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {2118#false} is VALID [2020-07-08 12:28:39,800 INFO L280 TraceCheckUtils]: 46: Hoare triple {2118#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {2118#false} is VALID [2020-07-08 12:28:39,800 INFO L280 TraceCheckUtils]: 47: Hoare triple {2118#false} assume !false; {2118#false} is VALID [2020-07-08 12:28:39,803 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-08 12:28:39,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:28:39,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 11 [2020-07-08 12:28:39,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630880499] [2020-07-08 12:28:39,805 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2020-07-08 12:28:39,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:28:39,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 12:28:39,895 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:28:39,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 12:28:39,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:28:39,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 12:28:39,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-07-08 12:28:39,896 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand 11 states. [2020-07-08 12:28:40,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:28:40,755 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2020-07-08 12:28:40,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 12:28:40,755 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2020-07-08 12:28:40,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:28:40,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:28:40,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 63 transitions. [2020-07-08 12:28:40,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:28:40,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 63 transitions. [2020-07-08 12:28:40,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 63 transitions. [2020-07-08 12:28:40,860 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:28:40,861 INFO L225 Difference]: With dead ends: 73 [2020-07-08 12:28:40,862 INFO L226 Difference]: Without dead ends: 45 [2020-07-08 12:28:40,862 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2020-07-08 12:28:40,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-08 12:28:40,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-07-08 12:28:40,942 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:28:40,942 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 45 states. [2020-07-08 12:28:40,942 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2020-07-08 12:28:40,942 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2020-07-08 12:28:40,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:28:40,945 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2020-07-08 12:28:40,945 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2020-07-08 12:28:40,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:28:40,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:28:40,946 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2020-07-08 12:28:40,946 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2020-07-08 12:28:40,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:28:40,948 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2020-07-08 12:28:40,948 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2020-07-08 12:28:40,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:28:40,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:28:40,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:28:40,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:28:40,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-08 12:28:40,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2020-07-08 12:28:40,952 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 48 [2020-07-08 12:28:40,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:28:40,952 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2020-07-08 12:28:40,953 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 12:28:40,953 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2020-07-08 12:28:40,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-08 12:28:40,954 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:28:40,954 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2020-07-08 12:28:41,168 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:28:41,169 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:28:41,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:28:41,170 INFO L82 PathProgramCache]: Analyzing trace with hash 2096610473, now seen corresponding path program 1 times [2020-07-08 12:28:41,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:28:41,170 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285485558] [2020-07-08 12:28:41,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:28:41,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:41,295 INFO L280 TraceCheckUtils]: 0: Hoare triple {2602#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2563#true} is VALID [2020-07-08 12:28:41,296 INFO L280 TraceCheckUtils]: 1: Hoare triple {2563#true} assume true; {2563#true} is VALID [2020-07-08 12:28:41,296 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2563#true} {2563#true} #98#return; {2563#true} is VALID [2020-07-08 12:28:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:41,331 INFO L280 TraceCheckUtils]: 0: Hoare triple {2603#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {2563#true} is VALID [2020-07-08 12:28:41,332 INFO L280 TraceCheckUtils]: 1: Hoare triple {2563#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2563#true} is VALID [2020-07-08 12:28:41,332 INFO L280 TraceCheckUtils]: 2: Hoare triple {2563#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2563#true} is VALID [2020-07-08 12:28:41,332 INFO L280 TraceCheckUtils]: 3: Hoare triple {2563#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {2563#true} is VALID [2020-07-08 12:28:41,332 INFO L280 TraceCheckUtils]: 4: Hoare triple {2563#true} assume !(~head~0.base != 0 || ~head~0.offset != 0); {2563#true} is VALID [2020-07-08 12:28:41,333 INFO L280 TraceCheckUtils]: 5: Hoare triple {2563#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {2563#true} is VALID [2020-07-08 12:28:41,333 INFO L280 TraceCheckUtils]: 6: Hoare triple {2563#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2563#true} is VALID [2020-07-08 12:28:41,333 INFO L280 TraceCheckUtils]: 7: Hoare triple {2563#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2563#true} is VALID [2020-07-08 12:28:41,333 INFO L280 TraceCheckUtils]: 8: Hoare triple {2563#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {2563#true} is VALID [2020-07-08 12:28:41,333 INFO L280 TraceCheckUtils]: 9: Hoare triple {2563#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {2563#true} is VALID [2020-07-08 12:28:41,334 INFO L280 TraceCheckUtils]: 10: Hoare triple {2563#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {2563#true} is VALID [2020-07-08 12:28:41,334 INFO L280 TraceCheckUtils]: 11: Hoare triple {2563#true} assume !(~len > 0); {2563#true} is VALID [2020-07-08 12:28:41,334 INFO L280 TraceCheckUtils]: 12: Hoare triple {2563#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2563#true} is VALID [2020-07-08 12:28:41,334 INFO L280 TraceCheckUtils]: 13: Hoare triple {2563#true} assume true; {2563#true} is VALID [2020-07-08 12:28:41,339 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {2563#true} {2568#(<= main_~len~0 2)} #92#return; {2568#(<= main_~len~0 2)} is VALID [2020-07-08 12:28:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:41,367 INFO L280 TraceCheckUtils]: 0: Hoare triple {2604#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset; {2563#true} is VALID [2020-07-08 12:28:41,367 INFO L280 TraceCheckUtils]: 1: Hoare triple {2563#true} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {2563#true} is VALID [2020-07-08 12:28:41,367 INFO L280 TraceCheckUtils]: 2: Hoare triple {2563#true} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {2563#true} is VALID [2020-07-08 12:28:41,368 INFO L280 TraceCheckUtils]: 3: Hoare triple {2563#true} assume true; {2563#true} is VALID [2020-07-08 12:28:41,369 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2563#true} {2584#(<= main_~i~0 1)} #94#return; {2584#(<= main_~i~0 1)} is VALID [2020-07-08 12:28:41,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:41,375 INFO L280 TraceCheckUtils]: 0: Hoare triple {2604#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset; {2563#true} is VALID [2020-07-08 12:28:41,375 INFO L280 TraceCheckUtils]: 1: Hoare triple {2563#true} assume !(~temp~1.base != 0 || ~temp~1.offset != 0); {2563#true} is VALID [2020-07-08 12:28:41,376 INFO L280 TraceCheckUtils]: 2: Hoare triple {2563#true} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {2563#true} is VALID [2020-07-08 12:28:41,376 INFO L280 TraceCheckUtils]: 3: Hoare triple {2563#true} assume true; {2563#true} is VALID [2020-07-08 12:28:41,377 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2563#true} {2590#(<= main_~i~0 0)} #94#return; {2590#(<= main_~i~0 0)} is VALID [2020-07-08 12:28:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:41,384 INFO L280 TraceCheckUtils]: 0: Hoare triple {2604#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset; {2563#true} is VALID [2020-07-08 12:28:41,385 INFO L280 TraceCheckUtils]: 1: Hoare triple {2563#true} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {2563#true} is VALID [2020-07-08 12:28:41,385 INFO L280 TraceCheckUtils]: 2: Hoare triple {2563#true} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {2563#true} is VALID [2020-07-08 12:28:41,385 INFO L280 TraceCheckUtils]: 3: Hoare triple {2563#true} assume true; {2563#true} is VALID [2020-07-08 12:28:41,385 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2563#true} {2564#false} #94#return; {2564#false} is VALID [2020-07-08 12:28:41,386 INFO L263 TraceCheckUtils]: 0: Hoare triple {2563#true} call ULTIMATE.init(); {2602#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:28:41,387 INFO L280 TraceCheckUtils]: 1: Hoare triple {2602#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2563#true} is VALID [2020-07-08 12:28:41,387 INFO L280 TraceCheckUtils]: 2: Hoare triple {2563#true} assume true; {2563#true} is VALID [2020-07-08 12:28:41,387 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2563#true} {2563#true} #98#return; {2563#true} is VALID [2020-07-08 12:28:41,387 INFO L263 TraceCheckUtils]: 4: Hoare triple {2563#true} call #t~ret11 := main(); {2563#true} is VALID [2020-07-08 12:28:41,388 INFO L280 TraceCheckUtils]: 5: Hoare triple {2563#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.allocOnStack(4); {2568#(<= main_~len~0 2)} is VALID [2020-07-08 12:28:41,389 INFO L263 TraceCheckUtils]: 6: Hoare triple {2568#(<= main_~len~0 2)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {2603#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:28:41,390 INFO L280 TraceCheckUtils]: 7: Hoare triple {2603#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {2563#true} is VALID [2020-07-08 12:28:41,390 INFO L280 TraceCheckUtils]: 8: Hoare triple {2563#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2563#true} is VALID [2020-07-08 12:28:41,390 INFO L280 TraceCheckUtils]: 9: Hoare triple {2563#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2563#true} is VALID [2020-07-08 12:28:41,390 INFO L280 TraceCheckUtils]: 10: Hoare triple {2563#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {2563#true} is VALID [2020-07-08 12:28:41,390 INFO L280 TraceCheckUtils]: 11: Hoare triple {2563#true} assume !(~head~0.base != 0 || ~head~0.offset != 0); {2563#true} is VALID [2020-07-08 12:28:41,391 INFO L280 TraceCheckUtils]: 12: Hoare triple {2563#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {2563#true} is VALID [2020-07-08 12:28:41,391 INFO L280 TraceCheckUtils]: 13: Hoare triple {2563#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2563#true} is VALID [2020-07-08 12:28:41,391 INFO L280 TraceCheckUtils]: 14: Hoare triple {2563#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2563#true} is VALID [2020-07-08 12:28:41,391 INFO L280 TraceCheckUtils]: 15: Hoare triple {2563#true} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {2563#true} is VALID [2020-07-08 12:28:41,391 INFO L280 TraceCheckUtils]: 16: Hoare triple {2563#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {2563#true} is VALID [2020-07-08 12:28:41,391 INFO L280 TraceCheckUtils]: 17: Hoare triple {2563#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {2563#true} is VALID [2020-07-08 12:28:41,392 INFO L280 TraceCheckUtils]: 18: Hoare triple {2563#true} assume !(~len > 0); {2563#true} is VALID [2020-07-08 12:28:41,392 INFO L280 TraceCheckUtils]: 19: Hoare triple {2563#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2563#true} is VALID [2020-07-08 12:28:41,392 INFO L280 TraceCheckUtils]: 20: Hoare triple {2563#true} assume true; {2563#true} is VALID [2020-07-08 12:28:41,393 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2563#true} {2568#(<= main_~len~0 2)} #92#return; {2568#(<= main_~len~0 2)} is VALID [2020-07-08 12:28:41,394 INFO L280 TraceCheckUtils]: 22: Hoare triple {2568#(<= main_~len~0 2)} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {2584#(<= main_~i~0 1)} is VALID [2020-07-08 12:28:41,395 INFO L280 TraceCheckUtils]: 23: Hoare triple {2584#(<= main_~i~0 1)} assume !!(~i~0 >= 0); {2584#(<= main_~i~0 1)} is VALID [2020-07-08 12:28:41,396 INFO L263 TraceCheckUtils]: 24: Hoare triple {2584#(<= main_~i~0 1)} call dll_remove_first(~#s~0.base, ~#s~0.offset); {2604#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:28:41,396 INFO L280 TraceCheckUtils]: 25: Hoare triple {2604#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset; {2563#true} is VALID [2020-07-08 12:28:41,396 INFO L280 TraceCheckUtils]: 26: Hoare triple {2563#true} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {2563#true} is VALID [2020-07-08 12:28:41,397 INFO L280 TraceCheckUtils]: 27: Hoare triple {2563#true} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {2563#true} is VALID [2020-07-08 12:28:41,397 INFO L280 TraceCheckUtils]: 28: Hoare triple {2563#true} assume true; {2563#true} is VALID [2020-07-08 12:28:41,398 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {2563#true} {2584#(<= main_~i~0 1)} #94#return; {2584#(<= main_~i~0 1)} is VALID [2020-07-08 12:28:41,399 INFO L280 TraceCheckUtils]: 30: Hoare triple {2584#(<= main_~i~0 1)} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {2590#(<= main_~i~0 0)} is VALID [2020-07-08 12:28:41,399 INFO L280 TraceCheckUtils]: 31: Hoare triple {2590#(<= main_~i~0 0)} assume !!(~i~0 >= 0); {2590#(<= main_~i~0 0)} is VALID [2020-07-08 12:28:41,401 INFO L263 TraceCheckUtils]: 32: Hoare triple {2590#(<= main_~i~0 0)} call dll_remove_first(~#s~0.base, ~#s~0.offset); {2604#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:28:41,401 INFO L280 TraceCheckUtils]: 33: Hoare triple {2604#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset; {2563#true} is VALID [2020-07-08 12:28:41,401 INFO L280 TraceCheckUtils]: 34: Hoare triple {2563#true} assume !(~temp~1.base != 0 || ~temp~1.offset != 0); {2563#true} is VALID [2020-07-08 12:28:41,401 INFO L280 TraceCheckUtils]: 35: Hoare triple {2563#true} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {2563#true} is VALID [2020-07-08 12:28:41,402 INFO L280 TraceCheckUtils]: 36: Hoare triple {2563#true} assume true; {2563#true} is VALID [2020-07-08 12:28:41,403 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {2563#true} {2590#(<= main_~i~0 0)} #94#return; {2590#(<= main_~i~0 0)} is VALID [2020-07-08 12:28:41,404 INFO L280 TraceCheckUtils]: 38: Hoare triple {2590#(<= main_~i~0 0)} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {2596#(<= (+ main_~i~0 1) 0)} is VALID [2020-07-08 12:28:41,405 INFO L280 TraceCheckUtils]: 39: Hoare triple {2596#(<= (+ main_~i~0 1) 0)} assume !!(~i~0 >= 0); {2564#false} is VALID [2020-07-08 12:28:41,405 INFO L263 TraceCheckUtils]: 40: Hoare triple {2564#false} call dll_remove_first(~#s~0.base, ~#s~0.offset); {2604#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:28:41,405 INFO L280 TraceCheckUtils]: 41: Hoare triple {2604#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset; {2563#true} is VALID [2020-07-08 12:28:41,405 INFO L280 TraceCheckUtils]: 42: Hoare triple {2563#true} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {2563#true} is VALID [2020-07-08 12:28:41,405 INFO L280 TraceCheckUtils]: 43: Hoare triple {2563#true} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {2563#true} is VALID [2020-07-08 12:28:41,406 INFO L280 TraceCheckUtils]: 44: Hoare triple {2563#true} assume true; {2563#true} is VALID [2020-07-08 12:28:41,406 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {2563#true} {2564#false} #94#return; {2564#false} is VALID [2020-07-08 12:28:41,406 INFO L280 TraceCheckUtils]: 46: Hoare triple {2564#false} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {2564#false} is VALID [2020-07-08 12:28:41,406 INFO L280 TraceCheckUtils]: 47: Hoare triple {2564#false} assume !(~i~0 >= 0); {2564#false} is VALID [2020-07-08 12:28:41,406 INFO L280 TraceCheckUtils]: 48: Hoare triple {2564#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {2564#false} is VALID [2020-07-08 12:28:41,407 INFO L280 TraceCheckUtils]: 49: Hoare triple {2564#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {2564#false} is VALID [2020-07-08 12:28:41,407 INFO L280 TraceCheckUtils]: 50: Hoare triple {2564#false} assume !false; {2564#false} is VALID [2020-07-08 12:28:41,410 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-07-08 12:28:41,410 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285485558] [2020-07-08 12:28:41,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:28:41,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-08 12:28:41,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889751836] [2020-07-08 12:28:41,411 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2020-07-08 12:28:41,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:28:41,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 12:28:41,466 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:28:41,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 12:28:41,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:28:41,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 12:28:41,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-08 12:28:41,467 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 9 states. [2020-07-08 12:28:42,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:28:42,058 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2020-07-08 12:28:42,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 12:28:42,058 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2020-07-08 12:28:42,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:28:42,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 12:28:42,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2020-07-08 12:28:42,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 12:28:42,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2020-07-08 12:28:42,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 48 transitions. [2020-07-08 12:28:42,149 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:28:42,150 INFO L225 Difference]: With dead ends: 53 [2020-07-08 12:28:42,150 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 12:28:42,151 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-07-08 12:28:42,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 12:28:42,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 12:28:42,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:28:42,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 12:28:42,152 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:28:42,152 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:28:42,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:28:42,153 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:28:42,153 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:28:42,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:28:42,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:28:42,153 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:28:42,153 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:28:42,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:28:42,153 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:28:42,153 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:28:42,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:28:42,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:28:42,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:28:42,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:28:42,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 12:28:42,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 12:28:42,154 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2020-07-08 12:28:42,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:28:42,154 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 12:28:42,154 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 12:28:42,155 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:28:42,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:28:42,155 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-08 12:28:42,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 12:28:42,471 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 42 [2020-07-08 12:28:42,810 WARN L193 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 92 [2020-07-08 12:28:43,012 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 47 [2020-07-08 12:28:43,095 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-08 12:28:43,096 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-07-08 12:28:43,096 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:28:43,096 INFO L271 CegarLoopResult]: At program point myexitENTRY(lines 561 563) the Hoare annotation is: true [2020-07-08 12:28:43,096 INFO L268 CegarLoopResult]: For program point myexitEXIT(lines 561 563) no Hoare annotation was computed. [2020-07-08 12:28:43,096 INFO L271 CegarLoopResult]: At program point L562(line 562) the Hoare annotation is: true [2020-07-08 12:28:43,096 INFO L268 CegarLoopResult]: For program point L578-1(lines 578 580) no Hoare annotation was computed. [2020-07-08 12:28:43,096 INFO L264 CegarLoopResult]: At program point dll_createENTRY(lines 574 591) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-08 12:28:43,097 INFO L264 CegarLoopResult]: At program point L576-2(lines 576 589) the Hoare annotation is: (let ((.cse10 (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base)) (.cse12 (select |#memory_$Pointer$.base| dll_create_~new_head~0.base)) (.cse13 (+ dll_create_~new_head~0.offset 4)) (.cse9 (select |#memory_$Pointer$.offset| dll_create_~head~0.base)) (.cse7 (select |#memory_$Pointer$.base| dll_create_~head~0.base))) (let ((.cse0 (<= (+ dll_create_~len 2) |dll_create_#in~len|)) (.cse3 (select .cse7 4)) (.cse5 (= 0 (select .cse9 4))) (.cse1 (= 0 dll_create_~head~0.offset)) (.cse2 (select .cse12 .cse13)) (.cse4 (= 0 dll_create_~new_head~0.offset)) (.cse6 (= 0 (select .cse10 .cse13)))) (or (and .cse0 (<= 3 |dll_create_#in~len|)) (and (= |#valid| |old(#valid)|) (= dll_create_~len |dll_create_#in~len|) .cse1 (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 dll_create_~head~0.base) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (= 0 (select |old(#valid)| .cse2)) (= (select (select |#memory_$Pointer$.offset| .cse2) 4) 0) (= 0 (select (select |#memory_$Pointer$.base| .cse3) 4)) (= 0 (select (select |#memory_$Pointer$.offset| .cse3) 4)) .cse4 .cse5 .cse1 .cse0 .cse6 (= 0 (select (select |#memory_$Pointer$.base| .cse2) 4)) (= 0 (select |old(#valid)| .cse3))) (let ((.cse8 (+ dll_create_~len 1)) (.cse11 (+ dll_create_~new_head~0.offset 8))) (and (= 0 (select |old(#valid)| dll_create_~head~0.base)) (= .cse3 0) (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) .cse5 .cse1 (= 0 (select .cse7 8)) (<= .cse8 |dll_create_#in~len|) (= .cse2 0) (= 0 (select .cse9 8)) .cse4 (< dll_create_~head~0.base |#StackHeapBarrier|) (< dll_create_~new_head~0.base |#StackHeapBarrier|) .cse6 (= (select |#valid| dll_create_~head~0.base) 1) (= 0 (select .cse10 .cse11)) (= 1 (select |#valid| dll_create_~new_head~0.base)) (<= |dll_create_#in~len| .cse8) (= 0 (select .cse12 .cse11))))))) [2020-07-08 12:28:43,097 INFO L268 CegarLoopResult]: For program point L576-3(lines 576 589) no Hoare annotation was computed. [2020-07-08 12:28:43,097 INFO L268 CegarLoopResult]: For program point dll_createFINAL(lines 574 591) no Hoare annotation was computed. [2020-07-08 12:28:43,097 INFO L271 CegarLoopResult]: At program point L579(line 579) the Hoare annotation is: true [2020-07-08 12:28:43,097 INFO L268 CegarLoopResult]: For program point dll_createEXIT(lines 574 591) no Hoare annotation was computed. [2020-07-08 12:28:43,097 INFO L268 CegarLoopResult]: For program point L584(lines 584 586) no Hoare annotation was computed. [2020-07-08 12:28:43,097 INFO L268 CegarLoopResult]: For program point L584-2(lines 584 586) no Hoare annotation was computed. [2020-07-08 12:28:43,097 INFO L268 CegarLoopResult]: For program point L578(lines 578 580) no Hoare annotation was computed. [2020-07-08 12:28:43,097 INFO L268 CegarLoopResult]: For program point __bswap_32ENTRY(lines 63 67) no Hoare annotation was computed. [2020-07-08 12:28:43,098 INFO L268 CegarLoopResult]: For program point __bswap_32FINAL(lines 63 67) no Hoare annotation was computed. [2020-07-08 12:28:43,098 INFO L268 CegarLoopResult]: For program point __bswap_32EXIT(lines 63 67) no Hoare annotation was computed. [2020-07-08 12:28:43,098 INFO L268 CegarLoopResult]: For program point __bswap_64ENTRY(lines 68 72) no Hoare annotation was computed. [2020-07-08 12:28:43,098 INFO L268 CegarLoopResult]: For program point __bswap_64FINAL(lines 68 72) no Hoare annotation was computed. [2020-07-08 12:28:43,098 INFO L268 CegarLoopResult]: For program point __bswap_64EXIT(lines 68 72) no Hoare annotation was computed. [2020-07-08 12:28:43,098 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:28:43,098 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 12:28:43,098 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 12:28:43,098 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-08 12:28:43,098 INFO L264 CegarLoopResult]: At program point L609(lines 600 614) the Hoare annotation is: false [2020-07-08 12:28:43,098 INFO L268 CegarLoopResult]: For program point L608(lines 608 610) no Hoare annotation was computed. [2020-07-08 12:28:43,098 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 612) no Hoare annotation was computed. [2020-07-08 12:28:43,099 INFO L264 CegarLoopResult]: At program point L606(line 606) the Hoare annotation is: (let ((.cse6 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse0 (= 0 (select (select |#memory_$Pointer$.offset| .cse6) 4))) (.cse1 (<= main_~len~0 2)) (.cse2 (< |#StackHeapBarrier| |main_~#s~0.base|)) (.cse3 (select (select |#memory_$Pointer$.base| .cse6) 4)) (.cse4 (<= 2 main_~len~0)) (.cse5 (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))) (or (and (<= main_~i~0 0) .cse0 .cse1 (<= 0 main_~i~0) .cse2 (= .cse3 0) .cse4 .cse5) (and (not (= .cse3 |main_~#s~0.base|)) .cse0 .cse1 .cse2 (= 0 (select (select |#memory_$Pointer$.offset| .cse3) 4)) (= 0 (select (select |#memory_$Pointer$.base| .cse3) 4)) .cse4 (<= main_~i~0 1) .cse5 (<= 1 main_~i~0))))) [2020-07-08 12:28:43,099 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 600 614) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-08 12:28:43,099 INFO L268 CegarLoopResult]: For program point L606-1(lines 605 607) no Hoare annotation was computed. [2020-07-08 12:28:43,099 INFO L264 CegarLoopResult]: At program point L603(line 603) the Hoare annotation is: (and (<= main_~len~0 2) (< |#StackHeapBarrier| |main_~#s~0.base|) (<= 2 main_~len~0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select |#valid| |main_~#s~0.base|) 1) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-08 12:28:43,099 INFO L264 CegarLoopResult]: At program point L605-2(lines 605 607) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse5 (= 0 (select (select |#memory_$Pointer$.offset| .cse0) 4))) (.cse1 (<= main_~len~0 2)) (.cse2 (< |#StackHeapBarrier| |main_~#s~0.base|)) (.cse6 (select (select |#memory_$Pointer$.base| .cse0) 4)) (.cse3 (<= 2 main_~len~0)) (.cse4 (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0))) (or (and (= 0 .cse0) .cse1 .cse2 .cse3 (<= (+ main_~i~0 1) 0) .cse4) (and (<= main_~i~0 0) .cse5 .cse1 (<= 0 main_~i~0) .cse2 (= .cse6 0) .cse3 .cse4) (and (not (= .cse6 |main_~#s~0.base|)) .cse5 .cse1 .cse2 (= 0 (select (select |#memory_$Pointer$.offset| .cse6) 4)) (= 0 (select (select |#memory_$Pointer$.base| .cse6) 4)) .cse3 (<= main_~i~0 1) .cse4 (<= 1 main_~i~0))))) [2020-07-08 12:28:43,099 INFO L268 CegarLoopResult]: For program point L603-1(line 603) no Hoare annotation was computed. [2020-07-08 12:28:43,099 INFO L268 CegarLoopResult]: For program point L605-3(lines 605 607) no Hoare annotation was computed. [2020-07-08 12:28:43,099 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 600 614) no Hoare annotation was computed. [2020-07-08 12:28:43,100 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 600 614) no Hoare annotation was computed. [2020-07-08 12:28:43,100 INFO L268 CegarLoopResult]: For program point node_createENTRY(lines 564 573) no Hoare annotation was computed. [2020-07-08 12:28:43,100 INFO L268 CegarLoopResult]: For program point node_createFINAL(lines 564 573) no Hoare annotation was computed. [2020-07-08 12:28:43,100 INFO L268 CegarLoopResult]: For program point L567(line 567) no Hoare annotation was computed. [2020-07-08 12:28:43,100 INFO L268 CegarLoopResult]: For program point L566(lines 566 568) no Hoare annotation was computed. [2020-07-08 12:28:43,100 INFO L268 CegarLoopResult]: For program point node_createEXIT(lines 564 573) no Hoare annotation was computed. [2020-07-08 12:28:43,100 INFO L268 CegarLoopResult]: For program point L566-1(lines 566 568) no Hoare annotation was computed. [2020-07-08 12:28:43,100 INFO L268 CegarLoopResult]: For program point L594-2(lines 594 596) no Hoare annotation was computed. [2020-07-08 12:28:43,101 INFO L268 CegarLoopResult]: For program point dll_remove_firstFINAL(lines 592 599) no Hoare annotation was computed. [2020-07-08 12:28:43,101 INFO L268 CegarLoopResult]: For program point dll_remove_firstEXIT(lines 592 599) no Hoare annotation was computed. [2020-07-08 12:28:43,101 INFO L264 CegarLoopResult]: At program point dll_remove_firstENTRY(lines 592 599) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-08 12:28:43,101 INFO L268 CegarLoopResult]: For program point L594(lines 594 596) no Hoare annotation was computed. [2020-07-08 12:28:43,105 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:28:43,113 WARN L170 areAnnotationChecker]: __bswap_32ENTRY has no Hoare annotation [2020-07-08 12:28:43,116 WARN L170 areAnnotationChecker]: __bswap_64ENTRY has no Hoare annotation [2020-07-08 12:28:43,117 WARN L170 areAnnotationChecker]: node_createENTRY has no Hoare annotation [2020-07-08 12:28:43,117 WARN L170 areAnnotationChecker]: L594 has no Hoare annotation [2020-07-08 12:28:43,118 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:28:43,118 WARN L170 areAnnotationChecker]: L576-3 has no Hoare annotation [2020-07-08 12:28:43,118 WARN L170 areAnnotationChecker]: L576-3 has no Hoare annotation [2020-07-08 12:28:43,118 WARN L170 areAnnotationChecker]: L578 has no Hoare annotation [2020-07-08 12:28:43,118 WARN L170 areAnnotationChecker]: __bswap_32FINAL has no Hoare annotation [2020-07-08 12:28:43,118 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:28:43,119 WARN L170 areAnnotationChecker]: __bswap_64FINAL has no Hoare annotation [2020-07-08 12:28:43,119 WARN L170 areAnnotationChecker]: L603-1 has no Hoare annotation [2020-07-08 12:28:43,121 WARN L170 areAnnotationChecker]: L566 has no Hoare annotation [2020-07-08 12:28:43,121 WARN L170 areAnnotationChecker]: L566 has no Hoare annotation [2020-07-08 12:28:43,121 WARN L170 areAnnotationChecker]: L594 has no Hoare annotation [2020-07-08 12:28:43,121 WARN L170 areAnnotationChecker]: L594 has no Hoare annotation [2020-07-08 12:28:43,121 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:28:43,122 WARN L170 areAnnotationChecker]: L576-3 has no Hoare annotation [2020-07-08 12:28:43,122 WARN L170 areAnnotationChecker]: L578 has no Hoare annotation [2020-07-08 12:28:43,122 WARN L170 areAnnotationChecker]: L578 has no Hoare annotation [2020-07-08 12:28:43,122 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:28:43,122 WARN L170 areAnnotationChecker]: L603-1 has no Hoare annotation [2020-07-08 12:28:43,122 WARN L170 areAnnotationChecker]: L567 has no Hoare annotation [2020-07-08 12:28:43,122 WARN L170 areAnnotationChecker]: L567 has no Hoare annotation [2020-07-08 12:28:43,122 WARN L170 areAnnotationChecker]: L566-1 has no Hoare annotation [2020-07-08 12:28:43,123 WARN L170 areAnnotationChecker]: L594-2 has no Hoare annotation [2020-07-08 12:28:43,123 WARN L170 areAnnotationChecker]: dll_createFINAL has no Hoare annotation [2020-07-08 12:28:43,123 WARN L170 areAnnotationChecker]: L578-1 has no Hoare annotation [2020-07-08 12:28:43,123 WARN L170 areAnnotationChecker]: L578-1 has no Hoare annotation [2020-07-08 12:28:43,123 WARN L170 areAnnotationChecker]: L605-3 has no Hoare annotation [2020-07-08 12:28:43,123 WARN L170 areAnnotationChecker]: L605-3 has no Hoare annotation [2020-07-08 12:28:43,125 WARN L170 areAnnotationChecker]: node_createFINAL has no Hoare annotation [2020-07-08 12:28:43,125 WARN L170 areAnnotationChecker]: dll_remove_firstFINAL has no Hoare annotation [2020-07-08 12:28:43,125 WARN L170 areAnnotationChecker]: dll_createEXIT has no Hoare annotation [2020-07-08 12:28:43,125 WARN L170 areAnnotationChecker]: L584 has no Hoare annotation [2020-07-08 12:28:43,125 WARN L170 areAnnotationChecker]: L584 has no Hoare annotation [2020-07-08 12:28:43,126 WARN L170 areAnnotationChecker]: L605-3 has no Hoare annotation [2020-07-08 12:28:43,126 WARN L170 areAnnotationChecker]: L606-1 has no Hoare annotation [2020-07-08 12:28:43,127 WARN L170 areAnnotationChecker]: dll_remove_firstEXIT has no Hoare annotation [2020-07-08 12:28:43,128 WARN L170 areAnnotationChecker]: L584-2 has no Hoare annotation [2020-07-08 12:28:43,128 WARN L170 areAnnotationChecker]: L608 has no Hoare annotation [2020-07-08 12:28:43,128 WARN L170 areAnnotationChecker]: L608 has no Hoare annotation [2020-07-08 12:28:43,128 WARN L170 areAnnotationChecker]: L606-1 has no Hoare annotation [2020-07-08 12:28:43,128 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2020-07-08 12:28:43,128 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:28:43,128 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:28:43,128 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:28:43,128 INFO L163 areAnnotationChecker]: CFG has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 12:28:43,138 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,139 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,140 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,140 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,140 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,141 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,141 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,141 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,142 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,142 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,142 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,143 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,143 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,143 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,144 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,144 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,144 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,145 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,145 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,146 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,146 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,146 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,147 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,147 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,149 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-08 12:28:43,150 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-08 12:28:43,150 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,165 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,166 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-08 12:28:43,166 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-08 12:28:43,166 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,166 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,167 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,167 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,167 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,167 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,168 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,168 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,168 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,168 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,169 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,169 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,169 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,169 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,169 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,170 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,170 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,170 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,171 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,171 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-08 12:28:43,171 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-08 12:28:43,171 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,172 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,172 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,175 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,175 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,175 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,175 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,176 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,176 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,176 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,177 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,177 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,177 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,177 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,178 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,178 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,178 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,178 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,179 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,179 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,179 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,179 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,180 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,180 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,180 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,181 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,181 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,181 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-08 12:28:43,182 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-08 12:28:43,182 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,182 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,182 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-08 12:28:43,182 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-08 12:28:43,183 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,183 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,183 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,183 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,184 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,184 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,184 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,184 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,185 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,185 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,185 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,185 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,186 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,186 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,186 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,186 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,187 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,187 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,187 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,187 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-08 12:28:43,188 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-08 12:28:43,188 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,188 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,188 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,191 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,191 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,191 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,192 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,192 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,192 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,193 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,193 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,193 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,193 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,194 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,194 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,194 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,194 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,195 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,195 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,195 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,196 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,196 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,196 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-08 12:28:43,196 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,196 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,197 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,197 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-08 12:28:43,197 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,197 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,198 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,198 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,198 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,198 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,199 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,199 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-08 12:28:43,199 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,199 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,200 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,200 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,200 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,200 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,201 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,201 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,202 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,202 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,202 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,202 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,203 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,203 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,203 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,203 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,204 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,204 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,204 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,204 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,205 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,205 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,205 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,205 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,206 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,206 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,206 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-08 12:28:43,206 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,206 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,207 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,207 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-08 12:28:43,207 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,207 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,208 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,208 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,208 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,208 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,209 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,209 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-08 12:28:43,209 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,209 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,210 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,210 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,210 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,210 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,210 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:28:43 BoogieIcfgContainer [2020-07-08 12:28:43,213 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:28:43,215 INFO L168 Benchmark]: Toolchain (without parser) took 56290.83 ms. Allocated memory was 140.5 MB in the beginning and 530.6 MB in the end (delta: 390.1 MB). Free memory was 103.7 MB in the beginning and 472.4 MB in the end (delta: -368.7 MB). Peak memory consumption was 409.1 MB. Max. memory is 7.1 GB. [2020-07-08 12:28:43,216 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 140.5 MB. Free memory was 123.6 MB in the beginning and 123.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-08 12:28:43,216 INFO L168 Benchmark]: CACSL2BoogieTranslator took 754.75 ms. Allocated memory was 140.5 MB in the beginning and 201.9 MB in the end (delta: 61.3 MB). Free memory was 103.5 MB in the beginning and 166.3 MB in the end (delta: -62.8 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2020-07-08 12:28:43,217 INFO L168 Benchmark]: Boogie Preprocessor took 88.07 ms. Allocated memory is still 201.9 MB. Free memory was 166.3 MB in the beginning and 163.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2020-07-08 12:28:43,217 INFO L168 Benchmark]: RCFGBuilder took 759.50 ms. Allocated memory is still 201.9 MB. Free memory was 162.5 MB in the beginning and 104.1 MB in the end (delta: 58.4 MB). Peak memory consumption was 58.4 MB. Max. memory is 7.1 GB. [2020-07-08 12:28:43,218 INFO L168 Benchmark]: TraceAbstraction took 54683.01 ms. Allocated memory was 201.9 MB in the beginning and 530.6 MB in the end (delta: 328.7 MB). Free memory was 104.1 MB in the beginning and 472.4 MB in the end (delta: -368.2 MB). Peak memory consumption was 348.2 MB. Max. memory is 7.1 GB. [2020-07-08 12:28:43,220 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 140.5 MB. Free memory was 123.6 MB in the beginning and 123.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 754.75 ms. Allocated memory was 140.5 MB in the beginning and 201.9 MB in the end (delta: 61.3 MB). Free memory was 103.5 MB in the beginning and 166.3 MB in the end (delta: -62.8 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 88.07 ms. Allocated memory is still 201.9 MB. Free memory was 166.3 MB in the beginning and 163.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 759.50 ms. Allocated memory is still 201.9 MB. Free memory was 162.5 MB in the beginning and 104.1 MB in the end (delta: 58.4 MB). Peak memory consumption was 58.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 54683.01 ms. Allocated memory was 201.9 MB in the beginning and 530.6 MB in the end (delta: 328.7 MB). Free memory was 104.1 MB in the beginning and 472.4 MB in the end (delta: -368.2 MB). Peak memory consumption was 348.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 612]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 562]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 576]: Loop Invariant [2020-07-08 12:28:43,234 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,235 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,235 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,235 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,235 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,236 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,236 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,236 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,236 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,237 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,237 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,237 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,237 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,238 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,238 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,238 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,238 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,239 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,239 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,239 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,239 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,240 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,240 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,240 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,241 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-08 12:28:43,241 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-08 12:28:43,241 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,241 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,241 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-08 12:28:43,241 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-08 12:28:43,242 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,242 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,242 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,242 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,242 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,243 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,243 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,243 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,243 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,243 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,244 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,244 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,244 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,244 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,244 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,244 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,245 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,245 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,245 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,245 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-08 12:28:43,245 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-08 12:28:43,246 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,246 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,246 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,247 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,247 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,247 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,248 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,248 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,248 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,248 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,249 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,249 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,249 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,249 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,249 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,250 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,250 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,250 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,250 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,251 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,251 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,254 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,255 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,255 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,255 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,256 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,256 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,257 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-08 12:28:43,257 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-08 12:28:43,257 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,257 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,258 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-08 12:28:43,258 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-08 12:28:43,258 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,258 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,258 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,258 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,258 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,259 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,259 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,259 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,259 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,260 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,260 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,261 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,261 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,261 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,261 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,261 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,262 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,262 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,262 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,262 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-08 12:28:43,262 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-08 12:28:43,263 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,263 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,263 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((len + 2 <= \old(len) && 3 <= \old(len)) || (((((((\valid == \old(\valid) && len == \old(len)) && 0 == head) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0 == head) && \old(unknown-#length-unknown) == unknown-#length-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || ((((((((((0 == \old(\valid)[#memory_$Pointer$[new_head][new_head + 4]] && #memory_$Pointer$[#memory_$Pointer$[new_head][new_head + 4]][4] == 0) && 0 == #memory_$Pointer$[#memory_$Pointer$[head][4]][4]) && 0 == #memory_$Pointer$[#memory_$Pointer$[head][4]][4]) && 0 == new_head) && 0 == #memory_$Pointer$[head][4]) && 0 == head) && len + 2 <= \old(len)) && 0 == #memory_$Pointer$[new_head][new_head + 4]) && 0 == #memory_$Pointer$[#memory_$Pointer$[new_head][new_head + 4]][4]) && 0 == \old(\valid)[#memory_$Pointer$[head][4]])) || (((((((((((((((((0 == \old(\valid)[head] && #memory_$Pointer$[head][4] == 0) && 0 == \old(\valid)[new_head]) && 0 == #memory_$Pointer$[head][4]) && 0 == head) && 0 == #memory_$Pointer$[head][8]) && len + 1 <= \old(len)) && #memory_$Pointer$[new_head][new_head + 4] == 0) && 0 == #memory_$Pointer$[head][8]) && 0 == new_head) && head < unknown-#StackHeapBarrier-unknown) && new_head < unknown-#StackHeapBarrier-unknown) && 0 == #memory_$Pointer$[new_head][new_head + 4]) && \valid[head] == 1) && 0 == #memory_$Pointer$[new_head][new_head + 8]) && 1 == \valid[new_head]) && \old(len) <= len + 1) && 0 == #memory_$Pointer$[new_head][new_head + 8]) - InvariantResult [Line: 605]: Loop Invariant [2020-07-08 12:28:43,264 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,264 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,264 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,265 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,265 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,265 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,265 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,266 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,266 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,266 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,266 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,267 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,267 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,267 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,267 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,267 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,268 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,268 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,268 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,268 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-08 12:28:43,269 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,269 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,269 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,269 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-08 12:28:43,269 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,269 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,270 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,270 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,270 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,270 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,270 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,271 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-08 12:28:43,271 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,271 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,271 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,271 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,271 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,272 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,272 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,272 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,273 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,273 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,273 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,273 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,274 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,274 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,274 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,274 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,275 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,275 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,275 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,275 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,275 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,276 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,276 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,276 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-08 12:28:43,276 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-08 12:28:43,277 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,277 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-08 12:28:43,277 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,277 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,277 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,277 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-08 12:28:43,278 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,278 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,278 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,278 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,278 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,279 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,279 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,279 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-08 12:28:43,279 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,279 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,279 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,280 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,280 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,280 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-08 12:28:43,280 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((0 == #memory_$Pointer$[s][s] && len <= 2) && unknown-#StackHeapBarrier-unknown < s) && 2 <= len) && i + 1 <= 0) && #memory_$Pointer$[s][s] == 0) || (((((((i <= 0 && 0 == #memory_$Pointer$[#memory_$Pointer$[s][s]][4]) && len <= 2) && 0 <= i) && unknown-#StackHeapBarrier-unknown < s) && #memory_$Pointer$[#memory_$Pointer$[s][s]][4] == 0) && 2 <= len) && #memory_$Pointer$[s][s] == 0)) || (((((((((!(#memory_$Pointer$[#memory_$Pointer$[s][s]][4] == s) && 0 == #memory_$Pointer$[#memory_$Pointer$[s][s]][4]) && len <= 2) && unknown-#StackHeapBarrier-unknown < s) && 0 == #memory_$Pointer$[#memory_$Pointer$[#memory_$Pointer$[s][s]][4]][4]) && 0 == #memory_$Pointer$[#memory_$Pointer$[#memory_$Pointer$[s][s]][4]][4]) && 2 <= len) && i <= 1) && #memory_$Pointer$[s][s] == 0) && 1 <= i) - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 53.5s, OverallIterations: 9, TraceHistogramMax: 3, AutomataDifference: 20.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 224 SDtfs, 214 SDslu, 1001 SDs, 0 SdLazy, 2041 SolverSat, 148 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 313 GetRequests, 175 SyntacticMatches, 2 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 40 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 23 PreInvPairs, 32 NumberOfFragments, 593 HoareAnnotationTreeSize, 23 FomulaSimplifications, 44 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 14 FomulaSimplificationsInter, 1074 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 29.7s InterpolantComputationTime, 430 NumberOfCodeBlocks, 430 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 417 ConstructedInterpolants, 3 QuantifiedInterpolants, 197951 SizeOfPredicates, 33 NumberOfNonLiveVariables, 761 ConjunctsInSsa, 99 ConjunctsInUnsatCore, 13 InterpolantComputations, 5 PerfectInterpolantSequences, 90/150 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...